• Ingen resultater fundet

Afhandling

N/A
N/A
Info
Hent
Protected

Academic year: 2022

Del "Afhandling"

Copied!
106
0
0

Indlæser.... (se fuldtekst nu)

Hele teksten

(1)

T he M oduli S pace of F lat C onnections on a S urface P oisson S tructures and Q uantization

A nders R eiter S kovborg

(2)
(3)

T he M oduli S pace of F lat C onnections on a S urface P oisson S tructures and Q uantization

AndersReiterSkovborg

PhD Dissertation July2006

Supervisor: JørgenEllegaardAndersen

Department ofMathematicalSciences Faculty ofScience, University ofAarhus

(4)
(5)

Contents

1 Introduction 1

2 The Moduli Space and the Algebra of Chord Diagrams 3

2.1 Lattice Gauge Field Theory . . . 3

2.2 Poisson Structures for Fat Graphs . . . 7

2.3 Poisson Structures on the Moduli Space . . . 13

2.4 The Poisson Algebra of Chord Diagrams . . . 17

2.5 Chord Diagrams as Functions on the Moduli Space . . . 19

3 Quantization of Poisson Algebras 24 3.1 Filtered and Graded Objects . . . 24

3.2 Deformation Quantization and-Products . . . 27

4 Quantization of the Algebra of Chord Diagrams 34 4.1 Chord Tangles . . . 34

4.2 Links and Non-Associative Tangles . . . 36

4.3 Universal Vassiliev Invariants . . . 38

4.4 -Products and Standard Situations . . . 41

5 Quantization of the Moduli Space 44 5.1 The General Linear Case . . . 44

5.2 The Special Linear Case . . . 62

5.3 Miscellaneous Results . . . 66

6 Quantization of the Loop Algebras 69 6.1 The Turaev-Vassiliev Quantization . . . 69

6.2 The AMR-Products and the Turaev-Vassiliev Quantization . . . 71

7 The CaseSL2pCqRevisited 78 7.1 A Good Model for the Moduli Space . . . 78

7.2 The BFK-Product . . . 85

7.3 The AMR-Products and the BFK-Product . . . 87

7.4 Differentiability of the BFK-Product . . . 93

Bibliography 99

iii

(6)
(7)

Chapter 1

Introduction

Throughout this dissertation we work in the following set-up: We denote byΣan oriented, compact and connected surface, possibly with boundary. A basepointx0PΣis fixed, and we let π1pΣq π1pΣ,x0qdenote the fundamental group. Furthermore, G is a linearly reductive, affine algebraic group over the complex numbers (e.g. GLnpCq, SLnpCq, OnpCq and Sp2npCqq. By a standard result (cf. [Hu]),Gis a closed subgroup of GLnpCqso that, in particular,Gis a Lie group; we writegfor its Lie algebra. The moduli space of flatG- connections onΣis denoted byMpΣ;Gq. It is well-known that there is a canonical bijection Hol : MpΣ;GqÑHompπ1pΣq,GqLG (1.1) where the G-action on Hompπ1pΣq,Gqis by conjugation and Hol is given by taking the holonomy with respect to a flat connection along loops onΣbased atx0. LetΓ pΣqdenote the group of orientation preserving diffeomorphisms ofΣ. This group acts onMpΣ;Gqvia pullback of connections:

grAsrpg1qAs, rAsPMpΣ;Gq, gPΓ pΣq

so that the induced action on FunpMpΣ;GqqMappMpΣ;Gq,Cqis given by

pgfqprAsq fpg1rAsqfprgAsq, f PFunpMpΣ;Gqq, gPΓ pΣq.

For a synopsis of the dissertation, the reader may consult the table of contents and the introductory paragraphs of the individual chapters.

It is presupposed that the reader is familiar with a few basic concepts and results from algebraic geometry and invariant theory (cf. [Fog]). For his convenience we recall the relevant material here. An affine algebraic setXVpSq„CNis the solution of a setSof polynomial equations inNvariables; associated to it is the ideal IpXq „ Crx1, . . . ,xNsof polynomials vanishing onX. The Hilbert Nullstellensatz states that

IVpaq

?

a, aan ideal inCrx1, . . . ,xNs.

Occasionally the radical ideal?a is denoted by Radpaq. The ringOpXqof regular func- tions onXis isomorphic toCrx1, . . . ,xNs{IpXq. Algebraic morphisms between affine sets preserve regular functions; the action onOpXqinduced by an algebraicG-action onXis ra- tional. By the linear reductivity ofG, rational actions have well-behaved invariants. To be specific, ifGacts rationally on a complex vector spaceV, then the subspaceVG „Vof fixed points has a uniqueG-invariant complementVG. The linear projection∇V:VÑVG

1

(8)

2 Chapter 1Introduction

with kernelVG is called the Reynolds operator onV. The uniqueness ofVG implies that Reynolds operators are natural with respect toG-equivariant, linear mapsϕ:V ÑW, i.e., the diagram

V ϕ

W

VG ϕ| WG is commutative.

Remark 1.1. A simple, but important consequence of this is thatϕ|is surjective ifϕis.

IfVis an algebra (andGacts by algebra isomorphisms), then Reynolds’ identity

pxyqpxqy, xPV,yPVG (1.2) holds.

(9)

Chapter 2

The Moduli Space and the Algebra of Chord Diagrams

A Poisson structure on the algebra of functions onMpΣ;Gqhas been studied by a number of people, e.g., Atiyah and Bott [AB], Goldman [G1, G2], Biswas and Guruprasad [BG], and Fock and Rosly [FR]. The authors approach the subject differently but common to all is that the Poisson brackett,uBis defined in terms of anorthogonal structureonG, that is, a non-degenerate, symmetric, bilinear mapB:ggÑCinvariant under the adjoint action.

In this chapter we first construct the algebraOpMpΣ;Gqqof regular functions on the moduli space and then adapt the presentation in [FR] to define a Poisson brackett,uton OpMpΣ;Gqqfor any symmetric Ad-invariant tensor t P gbg; this generalizes the afore- mentioned Poisson structure sincet, uB t,utB wheretB P gbgis the symmetric Ad- invariant tensor corresponding toBPpgbgq under the isomorphismgginduced by Bitself. Afterwards we present the Poisson algebra of chord diagramsCpΣ;Gqintroduced by Andersen, Mattes and Reshetikhin [AMR1]. One of the main results of this paper is that there exists a Poisson homomorphismΨB:CpΣ;GqÑpOpMpΣ;Gqq,t,uBq; we generalize this to all Poisson bracketst,ut.

2.1 Lattice Gauge Field Theory

Agraph Kis a finite, 1-dimensional CW-complex with an orientation on each 1-cell. Its set of vertices is denoted byVpKqand its set of edges byEpKq. We also consider the setEBpKq of all endpoints of edges ofK. It is important to notice the distinction between vertices and endpoints; the two concepts are related by the obvious ‘incidence’ map

r s:EBpKqÑVpKq.

In the sequel we identify a vertex with its pre-image under this map. The endpoints of an edge are given by the maps

B ,B:EpKqÑEBpKq.

An edgeαPEpKqmay be traversed according to or counter to its orientation, yielding two curves,αandα1, inK. ApathinKis a curve inKwhich is a composition of edge traversals, i.e., they have the formαǫ11αǫnn with the compatibility condition thatB αǫii :Bǫiαiand

B

αǫii 11 :Bǫi 1αi 1fori 1, . . . ,n1 are incident to the same vertex. Forloops(cyclic paths) we always work with indices modn.

3

(10)

4 Chapter 2The Moduli Space and the Algebra of Chord Diagrams

Acombinatorial complex K is a 2-dimensional CW-complex obtained from a graph by attaching a finite number of 2-cells along loops in the graph. The set ofgraph connections on K(more precisely, on its underlying graph) is simply the productGEpKq; for a connection ApAαqPGEpKqthe element HolApαq Aα PGis called theholonomywith respect toA alongα. We extend the concept of holonomy to paths in the obvious way:

HolApαǫ11αǫnnqAǫα11Aǫαnn, APGEpKq.

Notice that for a loop without a specified initial point the holonomy is still a well-defined conjugacy class. Therefore the equations

HolApBFq1, APGEpKq (2.1)

withFrunning over all faces inKmake sense and define a subsetApKqApK;Gq„GEpKq called theG-connections on K. Thegauge groupofKis by definitionGpKqGVpKq; it acts on the graph connections:

pgvqpAαqpg

rBαsAαg1

rB αsq, pAαqPGEpKq, pgvqPGpKq.

Since this action conjugates the holonomy along a loop, ApKqis an invariant subset; the orbit space

MpK;GqApKqLGpKq

of the restricted action is called themoduli space of G-connections on K. The natural projection π:ApKqÑMpK;Gqsets up a bijection

π: FunpMpK;GqqÑpFunpApKqqqGpKq.

AsApKqis cut out ofGEpKqby the algebraic equations (2.1), it is an affine algebraic set. The gauge group action on ApKqis clearly algebraic whence the induced action on functions preserves the property of being regular. Set

OpMpK;Gqqpπq1 OpApKqqGpKq„FunpMpK;Gqq. (2.2) The notationOpMpK;Gqqis merely suggestive; we do not claim thatMpK;Gqadmits the the structure of an algebraic variety.

Now supposeι:KÑ Σis an embedding such thatK „Σis a deformation retract; we callKpK,ιqamodelforΣ. There is a canonical bijection

Holι:MpΣ;GqÑMpK;Gq

with the following description (cf. (1.1)): LetAbe a flat connection in a principalG-bundle P Ñ Σ. Choose for eachv PVpKqa basepoint in the fibre ofPoverv(a trivialization of P|v). This allows the holonomy with respect toAalong an edgeαP EpKqto be expressed as an elementAαPG, and we have

HolιprAsqrpAαqsPMpK;Gq, rAsPMpΣ;Gq. We define thealgebra of regular functions on the moduli spaceby

OpMpΣ;GqqHolιpOpMpK;Gqqq„FunpMpΣ;Gqq.

(11)

2.1 Lattice Gauge Field Theory 5

Proposition 2.1. The subsetOpMpΣ;Gqq„FunpMpΣ;Gqqis independent of the model used to define it.

Proof. Suppose we have two modelsιj: Kj ÑΣ, j 1, 2. Pick a mapρ:VpK2qÑVpK1q

and for eachvPVpK2qa curveγvonΣfromρpvqtov. Consider an edgeαofK2. SinceK1is a retract ofΣand by cellular approximation, the curveγ

rB

αspι2q|αγ1

rB αsonΣis homotopic rel endpoints to a pathPαinK1. Define a mapϕ:GEpK1qÑGEpK2qby

ϕpAqαHolApPαq, APGEpK1q.

Assume thatAPApK1qand letPÑΣbe a principalG-bundle. Upon trivializingP|VpK1q, Adefines a flat connection ˜AonΣrepresenting Holι11prAsq. Now trivialize the fibre over v P VpK2qby parallel transporting the basepoint over ρpvqwith respect to ˜A along γv; this choice implies that Holι2prA˜sqis represented by the graph connectionϕpAq. In conse- quence, not only doesϕmapApK1qintoApK2q, it also fits into the commutative diagram

GEpK1q ϕ GEpK2q

ApK1q ϕ|

π1

ApK2q π2

MpK1;Gq T21 MpK2;Gq

(2.3)

where the bottom map is the bijection Holι2Holι11:MpK1;GqÑMpK2;Gq.

It is immediate from the construction thatϕis an algebraic morphism intertwining the gauge group actions:

ϕppgvqAqρppgvqqϕpAq, APGEpK1q, pgvqPGpK1q.

Hereρ: GpK1q Ñ GpK2qis the pullback via ρ. The induced map ϕ: FunpGEpK2qq Ñ FunpGEpK1qqtherefore preserves regular functions and also intertwines the actions:

pgvqϕf ϕpρppgvqq fq, f PFunpGEpK2qq, pgvqPGpK1q.

The same statements hold true for the restrictionϕ|:ApK1qÑApK2q. In particular,ϕand

pϕ| q

preserve fixed points (invariant functions). It thus follows that T21 pπ1q1pϕ|

q

π2: FunpMpK2;GqqÑFunpMpK1;Gqq

mapsOpMpK2;GqqtoOpMpK1;Gqq; this proves the result sinceT21 pHolι1q1Holι2.l

(12)

6 Chapter 2The Moduli Space and the Algebra of Chord Diagrams

Remark 2.2. During the course of the above proof we established the diagram OpMpΣ;Gqq

OpMpK2;Gqq

Holι2

T21

π2

OpMpK1;Gqq

Holι

1

π1

OpApK2qqGpK2q pϕ| q

OpApK1qqGpK1q

OpGEpK2qqGpK2q ϕ

OpGEpK1qqGpK1q

(2.4)

We infer, in particular, that although the construction of ϕ: GEpK1q Ñ GEpK2qdepends on various choices, the induced mappϕ|

q

is entirely canonical; namely it is equal to the com- position

τ12 :π1T21 pπ2q1:OpApK2qqGpK2q

ÑOpApK1qqGpK1q. (2.5) This will be useful later.

Corollary 2.3. The map Holι:MpΣ;Gq Ñ MpK;Gq depends only on the homotopy class of ι:KÑΣ.

Proof. Letιt:KÑΣbe a homotopy. Consider the construction of the transferϕ:GEpKqÑ GEpKq from the modelι0:K Ñ Σto the model ι1: K Ñ Σ. We may takeρ IdVpKqand γvptqιtpvq. Restricting the homotopyιtto an edgeαofK, we conclude that

γ

rBαspι1q|αγ1

rB αspι0q|αrel endpoints.

Therefore, by definition,ϕIdGEpKq, whence the result follows from diagram (2.3). l We finish this section with an important class of models forΣ. Letxgλ,λPΛ|rµ,µP My be a finite presentationPofπ1pΣq. There is an associated complexKP; its 1-skeletonKpP1q consists of a single 0-cell v and an edge (loop) for each generator gλ. The relations rµ

determine glueing maps used to attach the 2-cells ofKP; it follows thatApKPq„GEpKPq GΛis simply defined by the relations ofP. Hence the map EvP: Hompπ1pΣq,GqÑApKPq

given by evaluating aG-representation ofπ1pΣqon the generators fromPis a bijection. As GpKPqGacts by simultaneous conjugation onApKPq, there is an induced bijection

EvP: Hompπ1pΣq,GqLGÑMpKP;Gq.

Pre-composing this map with Hol : MpΣ;GqÑHompπ1pΣq,Gq{G, we obtain a bijection EvPHol : MpΣ;GqÑMpKP;Gq.

A choice of representatives for the generators gλ P π1pΣqgives rise to a mapι:KpP1q ÑΣ (sendingvtox0). The face boundaries ofKPare mapped to trivial loops onΣby construc- tion, soιextends to all ofKP. It is now a triviality that Holι EvPHol. Thus we have an induced bijection

HolEvPHolι :OpMpKP;GqqÑOpMpΣ;Gqq (2.6) depending solely onP.

(13)

2.2 Poisson Structures for Fat Graphs 7

2.2 Poisson Structures for Fat Graphs

In this sectionKdenotes afat graph, i.e., a graph equipped with a cyclic order on each of its vertices. In drawings of fat graphs the cyclic order will always agree with the coun- terclockwise order. Our goal is to define a Poisson brackett ,ut onOpGEpKqqGpKqwhere tPgbgis an Ad-invariant, symmetric element; we achieve this by giving a bivector field onGEpKq. Writing down this tensor requires, however, a linearization¤of the cyclic order at the vertices ofK; such a choice is termed aciliationsince the linear order at a vertex is indicated by a small cilium between the first and the last endpoint.

LetΓpGEpKqqdenote the set of smooth vector fields onGEpKq, and define linear operators Xκ:gÑΓpGEpKqq, κPEBpKq

as follows: Forα P EpKqandb P g,XB αpbqis the left-invariant vector field correspond- ing tobassigned to the factorGα ofGEpKq, andXBαpbqis the right-invariant vector field corresponding tobassigned to the factorGαofGEpKq. Define bivector fields onGEpKqby

Btpv,¤q

¸

κ,λPv

ǫpκ,λqpXκbXλqptq, vPVpKq where

ǫpκ,λq

$

'

&

'

%

1 ifκ λ 0 ifκλ

1 ifκ¡λ We setBtp¤q

°

vPVpKqBtpv,¤q, and define

tf,gutxBtp¤q;d fbdgy, f,gPOpGEpKqqGpKq. (2.7) Remark 2.4. Unlike Fock and Rosly, we employ no classicalr-matrix in the definition of Btp¤q; this approach is feasible because the corresponding bracket is defined for invariant functions only. In the case wheretcorresponds to an orthogonal structure onG, the next two results are covered in [FR].

Proposition 2.5. The formula (2.7) defines a map

t,ut:OpGEpKqqGpKqOpGEpKqqGpKqÑOpGEpKqqGpKq which is independent of the ciliation on K.

Theorem 2.6. The brackett,utdefines a poisson structure onOpGEpKqqGpKq.

We shall need various basic results concerningtand the mapsXκ for the proofs of these statements. Often we work with abasisfor t; this is a sette1, . . . ,enu „ gsuch thatt

°

ieibei. Bases exist sincetis symmetric but are by no means unique. In fact, by the Ad- invariance oftthe settAdgpe1q, . . . , Adgpenquis another basis for anygPG; we will use this observation without further mention in the sequel. Applying the shorthandXiκ XκpeiqP

ΓpGEpKqq, we may write

tf,gut

¸

vPVpKq

¸

κ,λPv

ǫpκ,λq

¸

i

Xiκf Xiλg, f,gPOpGEpKqqGpKq. (2.8)

(14)

8 Chapter 2The Moduli Space and the Algebra of Chord Diagrams

Consider the composite map

ϕ:gÝadÑEndpgqÝbÝÝIdÑEndpgbgqÝEvÝÑt gbg

and defineTpϕbIdqptqPgb3. It is significant thatTis invariantly defined; its expression in a basis is

T

¸

i,j

rej,eisbeibej. (2.9) Lemma 2.7. T is an anti-invariant tensor.

Proof. Transposing the second and third factors ofgb3obviously mapsTtoT. For any bPgwe differentiate the curve

sÞÝÑpAdexppsbqbAdexppsbqqptqt, sPR ats0 to obtain

padbbId Idbadbqptq0.

Letting the 3-cycleσp1, 2, 3qPS3act ongb3and applying this fact tobei, we get σpTq

¸

i,j

ejbrej,eisbei

¸

i

¸

j

ejbrei,ejs bei

¸

i

¸

j

rei,ejsbej beiT

as desired. l

Remark 2.8. Iftcomes from an orthogonal structure, then any orthogonal basis ofgis a basis fort, andTis the structure tensor ofg.

Lemma 2.9. The linear maps Xκ: g Ñ ΓpGEpKqqare independent Lie algebra homomorphisms, i.e.,

rXκpb1q,Xλpb2qs

#

Xκprb1,b2sq ifκλ

0 otherwise

for b1,b2Pg.

Proof. Whenκ λthis is simply by definition of the Lie bracket of a Lie group. Ifκand λare endpoints of distinct edges, the claim is trivial. In caseκandλare the two endpoints of a single edge, the associativity ofG(left and right multiplication commute) implies the

result. l

The next two lemmas are easy consequences of the compatibility of the exponential map and the adjoint action:

gexppsbqexppsAdgpbqqg; bPg,gPG,sPR.

Lemma 2.10. LetαPE and bPg. Then

pXB αpbqqApXBαpAdAαpbqqqA

for APGEpKq.

(15)

2.2 Poisson Structures for Fat Graphs 9

Lemma 2.11. LetκPEBpKqand bPg. Then

pgvqXκpbqXκpAdgrκspbqq wherepgvqPGpKqandpgvqis the derivative ofpgvq:GEpKqÑGEpKq. Finally, introduce the diagonal operators

Xpvq

¸

κPv

Xκ:gÑΓpGEpKqq, vPV

whose importance is due to the next lemma.

Lemma 2.12. Let vPV and bPg. Then

Xpvqpbqf 0 for any f POpGEpKqqGpKq.

Proof. Letγvbbe the curvesÞÑexppsbqassigned to the factorGvofGpKq. Then, trivially, d

ds|s0 γvbpsqAXpvqpbqA, APGEpKq.

HenceXpvqpbqis tangential to theGpKq-orbits ofGEpKqalong which f is constant. l Proof (Proposition 2.5). Let f,g P OpGEpKqqGpKq. From Lemma 2.11 it is immediate that Btpv,¤q,v P V and hence alsoBtp¤q are invariant under the gauge group action. Thus

tf,gut is an invariant function since both f and g enjoy this property. As OpGEpKqq is closed under left-invariant and right-invariant derivations (cf. [Hu]), the first statement of the proposition holds true.

For the second claim we must compare any two ciliations¤and¤1 ofK. It suffices to consider the case in which¤1differs from¤only at a single vertexvwhereκ1  κn

andκ2 1  1κn 1κ1. Then Btpv,¤qBtpv,¤1vq2

¸

λPvtκ1u

pXκ1bXλqptqpXλbXκ1qptq

2

¸

λPv

pXκ1bXλqptqpXλbXκ1qptq

2rpXκ1bXpvqqptqpXpvqbXκ1qptqs. An application of Lemma 2.12 then yields

xBtpv,¤q;d fbdgyxBtpv,¤1q;d fbdgy

as desired. l

Of course, computations with the formula (2.8) still involves a ciliation, but we are free to choose a preferred one.

Referencer

RELATEREDE DOKUMENTER

If Internet technology is to become a counterpart to the VANS-based health- care data network, it is primarily neces- sary for it to be possible to pass on the structured EDI

• Internal heat loss q int between the supply and return flow of the service pipe might be quantified by approximate calculations of heat losses q (for PTPS and single pipe

‣ the validity property of the communication channels: if a correct process p sends a message m to a correct process q, then q eventually delivers m.. Validity [B-multicast]: if a

(14) A solution σ that supports constrained welfare egalitarianism exhibits a dynamic be- haviour in the sense that, on a sequence of games with increasing worth of the grand

Consequently, since rematch is static, specializing this program with respect to a pattern p (and an alphabet Σ) yields a (2 p + Σ)-sized program that performs identically to the

It is shown here that for each signature Σ, injective simulation equivalence classes of regular trees, equipped with the simulation order, form the free algebras in the variety

Now assume p is not the zero polynomial. We will prove by induction on the number of variables that p is not identically zero. If b is nonzero, then we.. Then since p is not the

By using the set Heavy(Q) we can in a time no greater than updating the search structure calculate to which part Q i of the path Q the node v belongs and updating the bit for Q i in