YOU-CHENG CHOU
0.1. nKdV-hierarchy. We consider the operator
L = ∂
nx+1+ a
1( x ) ∂
nx−1+ · · · + a
n( x ) , For any pair
( α, p ) , α = 1, . . . , n, p = 0, 1, . . .
we consider the following system of PDEs for functions a
1( x, t ) , . . . , a
n( x, t ) :
∂
tα,pL = [ L, ( L
nα+1+p)
+] ,
where ( L
n+α1+p)
+denotes the differential part of the pseudodifferential op- erator L
n+α1+p.
To construct pseudodifferential operator L
n+α1+p, it suffice to construct L
n+11= ∂
x+ l
1( x ) ∂
−x1+ l
2( x ) ∂
−x2+ · · · ,
where ∂
−1is the inverse operator to ∂ and its commutator with function f ( x ) is as follows:
[ ∂
−x1, f ( x )] = − f
x∂
−x1+ f
xx∂
−x2− . . . .
The last rule and equation ( L
n+11)
n+1= L allow us to solve l
i( x ) recursively.
0.2. Constructing Solutions to the KdV Hierarchy from the Sato Grass- manian.
Definition 0.1. A Sato space is an infinite dimensional vector subspace W ⊂ C (( z )) such that
W =< f
1, f
2, · · · >
for some f
j( z ) = z
−j+ αz
−j+1+ · · · = z
−j( 1 + ◦( 1 )) .
Let T
1, T
2, . . . be an infinite sequence of formal variables, and denote by M ( z; T
1, T
2, . . . ) the function
M ( z; T
1, T
2, . . . ) = e
T1z−1+T2z−2+....
For a Sato space W =< f
1, f
2, · · · > , we define the τ-function associated it as the fraction
τ
W( T
1, T
2, . . . ) = ( · · · ∧ M f
3∧ M f
2∧ M f
1) ∧ z
0∧ z
1∧ z
2. . .
· · · ∧ z
−3∧ z
−2∧ z
−1∧ z
0∧ z
1∧ z
2∧ . . . .
It depends on the space W itself, and not on the specific choice of the basis f
1, f
2, . . . .
1
Proposition 0.2. Let W be a Sato space such that z
−2W ⊂ W. Then we have (1) τ
W( T
1, T
2, . . . ) does not depend on T
2ifor i > 0;
(2) the second order differential operators
L = ∂
2x+ 2∂
2T1logτ
W( − x + T
1, T
3, T
5, . . . ) satisfyies the KdV hierarchy
∂
T2k+1L = [ L, ( L
2k2+1)
+] .
Proposition 0.3. Let W be a Sato space generated by f
i= z
−i( 1 + ◦( 1 )) . Then for any N ≥ 0,
det ( f
i( z
j))
detz
−j i= τ
W( T
1( z
∗) , T
2( z
∗) , . . . ) , where T
k( z
∗) : =
1k∑
iN=1z
ki.
0.3. Witten’s Conjecture.
Let M
g,n( M
g,n) be the moduli space of smooth (nodal) genus g, n-pointed stable curves, L
ibe line bundle on M
g,nwhose fiber at the moduli point ( C; x
1, . . . , c
n) is T
x∗iC and let ψ
i: = c
1( L
i) .
The intersection number is defined by
< τ
d1· · · τ
dn> : =
∫
Mg,nψ
d11· · · ψ
dnn,
where g =
∑ di+33−n. We consider the formal power series of intersection number
F ( t
0, t
1, . . . ) = ∑
n≥0
∑
d1≥0,...,dn≥0
1
n! < τ
d1· · · τ
dn> t
d1· · · t
dn.
Theorem 0.4 (Witten’s Conjecture). e
Fis the τ-function for KdV with respect to variables T
2i+1=
(2i+ti1)!!Remark 0.5. F ( t
0, t
1, . . . ) is completely determined by F ( t
0, 0, 0, . . . ) =
16t
30, KdV-hierarchy, string equation and dilaton equation.
0.4. Combinatorial Model. Let X be a compact Riemann surface and ρ be a meromorphic quadratic differential on X. Locally, ρ = ϕ ( z )( dz )
2, where ϕ ( z ) is a meromorphic function. In our case, we assume ϕ has only simple or double poles.
We define the horizontal line field as
{ ν ∈ TX | ϕ ( z )( dz ( ν ))
2> 0 } . Its integral curve is called horizontal trajectory.
Remark 0.6. For a generic quadratic differential, a generic horizontal trajec- tory is nonclosed.
Here we define a special kind of quadratic differential:
Definition 0.7. A Jenkins-Strebel differential is a quadratic differential with only finite nonclosed horizontal trajectory.
By a local analysis, we can see that if z
0zero of order d of ρ, then there are d + 2 horizontal trajectories issuing from z
0. If z
0is a simple pole, then there is a unique horizontal trajectory issuing from z
0. Finally, if z
0is a dou- ble pole with negative residue, then z
0is surrounded by closed horizontal trajectories. We further list some properties of Jenkins-Strebel differential that we will need later.
Proposition 0.8. Let X be a Riemann surface of finite type and ρ ( z ) = ϕ ( z ) dz
2be a Jenkin-Strebel differential on X. Then
• the connected component of X \ {graph of nonclosed horizontal trajectory}
is either open annulus or open disk;
• all closed horizontal trajectory in the same connected component have the same length. (We use the metric dl
2= | ϕ ( z ) || dz |
2.)
Theorem 0.9. (Strebel) For any 2n + 1-tuples ( X; x
1, . . . , x
n; p
1, . . . , p
n) , where X is a Riemann surface of finite type, x
iare distinct points of X, p
i> 0, and n > χ ( X ) , there exists a unique Jenkins-Strebel differential such that
• it has double pole at x
iand no other poles;
• connected components of X \ { graph of nonclosed horizontal trajectory } are open disks;
• the length of horizontal trajectory associated to x
iis p
i.
We call the unique Jenkins-Strebel differential defined above the canoni- cal Jenkins-Strebel differential.
Conversely, given an embedded graph (a graph in oriented topological surface X) with
• each valencies of vertex ≥ 3,
• face marked by x
1, . . . , x
n• fixed lengths of its edges,
• complement of embedded graph is a disjoint, union of open disks, there exists unique complex structure such that its corresponding canonical Jenkins-Strebel differential determines the given embedded graph.
Now, we define M
combg,n: = {the moduli space of genus g connected em- bedded graphs with each valencies of vertex ≥ 3, n-marked faces, fixed lengths of its edges, and complement being a disjoint union of open disks }.
Theorem 0.10. M
g,n× R
n+∼ = M
combg,nas real orbifolds.
We can further generalize the above discussion to stable curve.
Definition 0.11. For a stable curve C with given perimeter on its marked points,
the canonical Jenkins-Strebel differential on C is a quadratic differential ρ such
that:
• ρ ≡ 0 on the unmarked components;
• ρ is the canonical Jenkins-Strebel differential on the puntured marked com- ponents.
M
combg,n: = { the space of stable genus g embedded graphs with vertices of valencies ≥ 3 on smooth point, at most one valency on nodal points, n- marked faces, complement being disjoint union of open disks, and fixed length of edges on marked component and no graph on unmarked compo- nents.}
To determine the relation between M
g,nand M
combg,n, we introduce the equivalence relation as follows: Let C be a stable curve with genus g and n marked points. We can canonically decompose C as the union of two curves C = C
+∪ C
0, where C
+is the union of all the components of C containing marked points, and C
0is the union of those containing no marked points. Let ξ
1, . . . , ξ
ube the points that C
+has in common with C
0. We say that [( C; x
1, . . . , x
n)] is equivalent to [( C
′, x
1′, . . . , x
n′)] if there is a family of nodal curves { C
0s}
s∈Sover a connected base S, together with sections of smooth points τ
1, . . . , τ
u, with the property that ( C; x
1, . . . , x
n) (resp., ( C
′, x
′1, . . . , x
′n) ) can be obtained from C
+and C
s0(resp.,C
0s′) by identi- fying ξ
iwith τ
i( s ) (resp.,τ
i( s
′) ) for i = 1, . . . , u.
It is easy to check that what we just defined is an equivalence relation.
We let
Q : M
g,n→ M
′g,ndenote the projection via the equivalence relation. Now we can state the similar identifications for stable curves:
Theorem 0.12. H : M
′g,n× R
n+→ M
combg,nis a homeomorphism.
0.5. Matrix Integral Model. We recall some facts about matrix integral.
Let B be a n × n positive definite symmetric matrix. We consider the integral
c
∫
Rn
e
−12(Bx,x)∏
n i=1dx
i,
where c is chosen such that the integral equals 1. With this normalization we have
< x
ix
j> : = c
∫
Rn
x
ix
je
−12(Bx,x)∏
n i=1dx
i= ( B
−1)
ij. We can further generalized this computation.
Theorem 0.13 (Wick’s formula). Let f
1, . . . , f
2kbe linear functions of x
1, . . . , x
n. Then
< f
1f
2· · · f
2k>= ∑
p1<···<pk
q1<···<qk
< f
p1f
q1> · · · < f
pkf
qk> .
Let Λ = ( Λ
i)
1≤i≤Nbe a diagonal matrix with Re ( Λ
i) > 0 and H = ( h
ij) = ( x
ij+ √
− 1y
ij) be a Hermitian matrix. We consider the following measure on the space of Hermitian matrices
dµ
Λ( H ) = C
Λ,Ne
−12trH2Λ∏
N i=1dx
ii∏
i<j
dx
ijdy
ij, where C
Λ,Nis chosen such that
∫
HNdµ
Λ( H ) = 1.
By direct computation, we have C
Λ,N= ( 2π )
−N22∏
iN=1Λ
i12∏
i<j( Λ
i+ Λ
j) . In coordinated x
ii, x
ij, y
ij, we can write tr ( H
2Λ ) = ( Bx, x ) , where
B =
Λ
1. ..
Λ
NΛ
1+ Λ
2. ..
Λ
N−1+ Λ
NΛ
1+ Λ
2. ..
Λ
N−1+ Λ
N
.
Hence we have
< x
2ii>
Λ,N: =
∫
HNx
2iidµ
Λ( H ) = 1 Λ
1, < x
2ij>
Λ,N=< y
2ij>
Λ,N= 1 Λ
i+ Λ
j, and similarly
< h
ijh
ji>
Λ,N= 2
Λ
i+ Λ
j, < h
ijh
kl>
Λ,N= 0 if ( i, j ) ̸= ( l, k ) . Now we compute
< e
√−1
6 tr(H3)
>
Λ,N=< ( 1 − 1 2!
1
6
2( tr ( H
3))
2+ 1 4!
1
6
4( tr ( H
3))
4) − · · · >
Λ,N. By Wick’s formula, the right hand side can be presented as the monomial of < h
injnh
imkm> . Notice that each term can correspond to the gluing of 3-stars.
i
1k
1j
1j
1i
1k
1i
2k
2j
2j
2i
2k
2i
2nk
2nj
2nj
2ni
2nk
2n. . . t t
t t t t t t t JJJJ JJJJ J
t t t t t t t t t JJJJ JJJJ J
t t
t t
t t
t t
t
JJJJ JJJJ J
In this case an edge of the gluing corresponds to a pair < h
injnh
imkm> . We define the weight of an gluing the product
∏ Λi+ 2 Λ
j
taken over all edges of the gluing.
Now we can rewrite the Kontsevich’s model into graph sum:
< e
√−1
6 tr(H3)
>
Λ,N∼ ∑
G∈G3,N
(
√−1 2
)
|V(G)|| AutG | ∏
e∈E(G)
2 Λ
e+ Λ
′e,
where G
3,Nis set of equivalent class with 3-valent graphs and with N pos- sible colors Λ
1, · · · , Λ
Ndrawing on the face.
It can be observed by the following proposition:
Proposition 0.14.
< ( trH )
α1· · · ( tr ( H
k))
αk>
Λ,N= α
1! · · · α
k!2
α2· · · k
αk∑
G∈GN
1
| AutG | ∏
e∈E(G)
2 Λ
e+ Λ
′e. 0.6. Proof of Witten conjecture. The first step of the proof is to give a com- binatorial formula for ψ
i. Let π
i: S
1( L
combi) → M
combg,n. We want to find a closed 2-form w
ion M
combg,nsuch that π
∗i( w
i) = dϕ and ∫
S1
ϕ |
fiber= 1.
Fix p = ( p
1, . . . , p
n) ∈ R
n+, we have the commutative diagram:
M
g,n Q||yyy yyy yy
fI $$I I I I I I I I
M
′g,n ∼h// M
combg,n( p )
By the way Q was constructed, the line bundle L
irestricts to a trivial line bundle on the fibers of Q and therefore drops to a well-defined line bundle L
′ion M
′g,nwith Q
∗( L
′i) = L
i. Let L
combibe the pullback of L
′ivia h
−1, so that
h
∗( L
combi) = L
′i, f
∗( L
combi) = L
i.
Now our goal becomes giving the combinatorial expression for its first Chern class.
Let | a | /Γ
abe an orbisimplex of M
combg,n( p ) , where a corresponds to an embedded graph ( G
a; x
1, . . . , x
n) whose i-th perimeter is equal to p
iand Γ
a= Aut (( G
a; x
1, . . . , x
n)) . The coordinates relative to the simplex | a | are the lengths
{ l
e}
e∈E(Ga)of the edges of G
a. At each point x
i, we consider a cyclically ordered set of oriented edges of G
a( e
1, . . . , e
ν)
with possible repetitions. A repetition happens when the edge bounds the same component of G
a. We set
( w
i)
|a|= ∑
1≤s<t≤ν−1
d ( l
esp
i) ∧ d ( l
etp
i)
Lemma 0.15. For each x
iand p ∈ R
n+,
[ w
i] = c
1( L
combi) ∈ H
2( M
combg,n( p )) . In particular,
[ f
∗( w
i)] = c
1( L
i) ∈ H
2( M
g,n) . Now we can rewrite the intersection number
< τ
d1, . . . , τ
dn>=
∫
Mg,nψ
1d1· · · ψ
ndn=
∫
Mcombg,n (p)
w
d11· · · w
dnn=
∫
Mcombg,n (p)
w
d11· · · w
dnnThe last equality is true since the boundary is measure zero.
Let Ω = ∑
ni=1p
2iw
i.
∫
Rn≥0
e
−∑ λipi( ∫
Mcombg,n (p)
Ω
dd!
)
dp
1· · · dp
n= ∑
d1+···dn=d
< τ
d1· · · τ
dn>
∏
n i=12d
i!
d
i! λ
−i 2(di+1)= ( 1 ) , where Re( λ
i) > 0 and d = 3g − 3 + n.
We use the combinatorial theorem due to Kontsevich.
Theorem 0.16.
Ωd!ddp
1∧ · · · ∧ dp
n= 2
2n+5g−5dl
e1∧ · · · ∧ dl
e6g−6+3n. We have
( 1 ) =
∫
Rn≥0
e
−∑ λipi( ∫
Mcombg,n (p)
2
2n+5g−5dl
e1∧ · · · ∧ dl
e6g−6+3n)
= ∑
G∈G3,cg,n
2
2n+5g−5| AutG |
∫
|a(G)|
e
−∑ λipidl
e1∧ · · · ∧ dl
e6g−6+3n,
where G
g,n3,cis the isomorphism class of connected 3-valent embedded graph with genus g and n-marked points. We further do some change of vari- ables.
∑
n i=1λ
ip
i= ∑
e∈E(G)
( λ
e+ λ
′e) l
e,
where λ
eand λ
′eare the perimeter of the two faces adjacent to the edge e.
Now we have the relation ( ∗)
G
∑
3,cg,n2
−|V(G)|| Aut ( G ) | ∏
e∈E(G)
2
λ
e+ λ
′e= ∑
d1+···+dn=d
< τ
d1· · · τ
dn>
∏
n i=1( 2d
i− 1 ) !!
λ
2di i+1.
Theorem 0.17. Let F ( t
0, t
1, · · · ) = ∑
n≥0
∑
d1,...,dn≥0
1
n! < τ
d1· · · τ
dn> t
d1· · · t
dn. Set Λ = diag ( Λ
1, . . . Λ
N) with Re ( Λ
i) > 0 and t
i( Λ ) = −( 2i − 1 ) !!Tr ( Λ
−2i−1) . Then
F ( t
0( Λ ) , t
1( Λ ) , . . . ) = ∑
G∈G3,c,N
(
√−1 2
)
|V(G)|| Aut ( G ) | ∏
e∈E(G)
2 Λ
e+ Λ
′e,
where G
3,c,Nis the isomorphism class of connected 3-valent embedded graph with N-possible colors Λ
1, · · · , Λ
Ndrawing on the face.
Corollary 0.18. F ( t
0( Λ ) , t
1( Λ ) , · · · ) is the asymptotic expansion of log < e
√−1
6 trH3
>
Λ,Nas Λ
−1→ 0.
Here we recall some properties of Airy function. We first study its as- ymptotic behaviour by stationary phase method.
a ( y ) =
∫
∞−∞
e
√−1(x3/3−xy)
dx
∼ ∫
U(y1/2)
e
√−1(x3/3−xy)dx +
∫
U(−y1/2)
e
√−1(x3/3−xy)dx
∼ const · ∑
±y1/2
y
−43e
−2√−1
3 y32
f
1( y
−12) , and similarly we have
a
j−1( y ) =
∫
∞−∞
( − √
− 1x )
j−1e
√−1(x3/3−xy)
dx
∼ const · ∑
±y1/2
y
−43e
−2√−1
3 y32
f
j( y
−12) , where f
j( y ) = y
−j( 1 + ◦( 1 )) .
We have similar expression for matrix Airy function:
A ( Y ) =
∫
HNe
√−1tr(X3/3−XY)
dX
∼ ∑
Y1/2
∫
U(Y12)
e
√−1tr(X3/3−XY)dX
= ∑
Y1/2
∫
U(0)
e
√−1tr((X+Y1/2)3/3−(X+Y1/2)Y)
dX
= ∑
Y1/2
e
−2√−1 3 trY3/2
∫
U(0)
e
√−1tr(X3/3−X2Y1/2)dX
∼ const · ∑
Y1/2
e
−2√−1
3 trY3/2
Y
i−1/4∏
i<j
( Y
i1/2+ Y
j1/2)
−1/2e
F(t˜0(Y1/2),··· )− ( 1 ) ,
where ˜t
i( Y
1/2) = 2
−(2i+1)/3( 2i − 1 ) !!tr ( Y
−i−1/2) . We can express matrix
Airy function in another form.
Lemma 0.19. If Φ is a conjugacy invariant function on H
N, then for any diagonal real matrix Y,
∫
HNΦ ( X ) e
−√−1trXY
dX
= ( − 2 π √
− 1 )
N(N−1)/2detY
ij−1∫
∞−∞
· · · ∫
∞−∞
Φ ( D ) e
−√−1trDYdetD
ij−1dD
1· · · dD
NNow we have A ( Y ) = ( − 2π √
− 1 )
N(N−1)/2detY
ij−1∫
∞−∞
· · · ∫
∞−∞
∏
i
e
√−1tr(D3i/3−DiYi)
detD
ij−1dD
1· · · dD
N∼ const · ∑
Y1/2
e
−2√−1
3 trY3/2 N