Abstract. We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed ...

0 downloads 15 Views 514KB Size

arXiv:math-ph/0211022v1 13 Nov 2002

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN Abstract. We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal polynomials. We obtain the first proof of a complete large N expansion for the partition function, for a general class of probability measures on matrices, originally conjectured by Bessis, Itzykson, and Zuber. We prove that the coefficients in the asymptotic expansion are analytic functions of parameters in the original probability measure, and that they are generating functions for the enumeration of labelled maps according to genus and valence. Central to the analysis is a large N expansion for the mean density of eigenvalues, uniformly valid on the entire real axis.

Contents 1. Motivation and Background 1.1. Motivation: statistical mechanics of a log-gas. 1.2. Motivation: random matrix theory 1.3. Motivation: Graphical Enumeration 1.4. Motivation: The Connection to Orthogonal Polynomials 1.5. Brief discussion of history 1.6. A statistical mechanical formula, and orthogonal polynomials. 2. Enumeration of g-maps 2.1. Gaussian matrix integrals and enumeration of diagrams 2.2. Asymptotics of the partition function and enumeration of g-maps. 3. Asymptotics for orthogonal polynomials via Riemann–Hilbert methods 3.1. Equilibrium measure and first transformation Y→ M 3.2. Second Transformation M→M1 3.3. The construction of a global approximation to M1 3.4. The Riemann–Hilbert problem for the error. 3.5. The solution S of the Riemann–Hilbert problem 3.30 and its asymptotic expansion 4. The mean density of eigenvalues: exact formula and asymptotics 5. Proof of the Main Theorem 6. Appendix 7. Conclusions References

2 2 3 3 6 7 8 9 10 12 15 16 18 19 20 22 25 30 42 43 43

K. D. T-R McLaughlin was supported in part by NSF grant no. 9970328 and no. 0200749, and N. M. Ercolani was supported in part by NSF grant no. 0073087. The authors gratefully acknowledge the faculty and staff of the Ecole Normale Superieur, Paris, France, for their kind hospitality. 1

2

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

1. Motivation and Background In this paper we will consider asymptotics for the following family of integrals: (1.1)

ZN (t1 , t2 , . . . , tν ) = Z Z N X X 1 1 V (λj ; t1 , . . . , tν ) − 2 log |λj − λℓ | dN λ, · · · exp −N 2 N j=1 N R R j6=ℓ

(1.2)

V (λ; t1 , . . . , tν ) = Vt (λ) = V (λ) =

1 2 λ + 2

ν X

tk λk .

k=1

where the parameters {t1 , . . . , tν } are assumed to be such that the integral converges. For example, one may suppose that ν is even, and tν > 0. We will use the following set for allowable t = (t1 , . . . , tν ). For any given T > 0 and γ > 0, define T(T, γ) = {t ∈ Rν : |t| ≤ T, tν > γ

ν−1 X j=1

|tj |}.

There are three main results in this paper, Theorems 1.1, 1.2, and 1.3. The first of these is the following theorem. Theorem 1.1. There is T > 0 and γ > 0 so that for t ∈ T(T, γ), one has the N → ∞ asymptotic expansion 1 ZN (t) = N 2 e0 (t) + e1 (t) + 2 e2 (t) + · · · . (1.3) log ZN (0) N The meaning of this expansion is: if you keep terms up to order N −2k , the error term is bounded by CN −2k−2 , where the constant C is independent of t for all t ∈ T(T, γ). For each j, the function ej (t) is an analytic function of the (complex) vector t, in a neighborhood of 0. Moreover, the asymptotic expansion of derivatives of log (ZN ) may be calculated via term-by-term differentiation of the above series. Remark: In the statement of the Theorem, t ∈ T(T, γ). This is not the largest domain where the asymptotic expansion holds true. What is really required is the existence of a path Γ in Rν connecting t to 0 such that for all t ∈ Γ, the associated equilibrium measure (see Section 3) is supported on a single interval, with strict variational inequality off the support, strict positivity on the interval of the support, and square-root vanishing at the endpoints. A global characterization of a maximal domain where the expansion holds true would lead us too far from the main focus of this paper, and we will not pursue this here. The integral ZN (t1 , . . . , tν ) = ZN (t) appears in a number of areas of mathematics and mathematical physics. We will explain some of the motivations for studying the asymptotics of ZN (t) in the following subsections. In what follows it will be useful to define the ratio: (1.4)

ZˆN (t) = ZN (t)/ZN (0).

1.1. Motivation: statistical mechanics of a log-gas. The integral (1.1) has the natural interpretation as the partition of function for a statistical mechanical system of particles on the line, with logarithmic interaction potential, in the presence of an external field whose potential is Vt (λ). The asymptotic behavior for N → ∞ may then be interpreted as the limiting behavior of the statistical mechanical system in the low temperature and many particle asymptotic limit. With N fixed, the integral ZN (t1 , . . . , tν ), and indeed all relevant statistical observables, may be expressed in terms of families (parameterized by {t1 , . . . , tν }, and N ) of associated orthogonal polynomials (see Section 1.4 below). By itself, this observation is not terribly useful. However, it turns out that these families of orthogonal polynomials are in a certain sense completely integrable. Indeed, all limiting asymptotic questions about the orthogonal polynomials (and hence concerning the statistical mechanical system) are in principle explicitly computable (see Section 3 below).

ASYMPTOTICS OF RMT PARTITION FUNCTION

3

1.2. Motivation: random matrix theory. The integral (1.1) is also of fundamental importance in the theory of random matrices. As is well known (see, for example, the review text [21]), in the theory of random Hermitian matrices from the so-called ”Unitary ensemble”, one considers the measure on N × N Hermitian matrices given by dµt =

(1.5)

1 exp {−N Tr [Vt (M )]}dM, ZN

where dM is Lebesgue measure on the matrix entries, i.e. dM =

Y

R dM I dMjk jk

j

N Y

dMjj ,

j=1

R denotes the real part of the matrix entry M , and M I denotes the imaginary component of the where Mjk jk jk matrix entry Mjk . It is a basic fact that the measure (1.5) induces a probability measure on the eigenvalues, with density N X X 1 1 1 Vt (λj ) + 2 exp −N 2 log |λj − λℓ | dN λ, (1.6) ZN N N j=1

j6=ℓ

where ZN = ZN (t) appearing in (1.6) is precisely the partition function defined in (1.1). Thus asymptotics such as those contained in (1.3) yield asymptotic information concerning the statistics of the eigenvalues of these random matrices. For example, by differentiating log ZN , one obtains ∂ (1.7) log ZN = −N E Tr M ℓ , ∂tℓ

where E denotes the expectation with respect to the probability measure dµt . Now if one has established (1.3), then in conjunction with (1.7), one learns the following: ∂ 1 lim E (1.8) e0 (t1 , . . . , tν ). Tr M ℓ = N →∞ N ∂tℓ Similar calculations show that (1.3) implies (1.9)

lim {E ( Tr (M n ) · Tr (M m )) − E ( Tr M m ) · E ( Tr M n )}

N →∞

=

∂2 e0 (t1 , . . . , tν ). ∂tm ∂tn

Observe that (1.8) and (1.9) together imply that the fundamental random variables asymptotically uncorrelated.

1

N Tr

Mℓ

∞

ℓ=1

are

1.3. Motivation: Graphical Enumeration. ˆ 1.3.1. The Viewpoint of Gaussian Expectations. One way to try tothink about the partition function ZN 1 2 . This is the in (1.5) is as a Gaussian expectation of the interaction term: exp −N Tr Vt (M ) − 2 M viewpoint taken in much of the physical literature on random matrix theory, for example [3]. To better explain this we briefly review some facts about Gaussian measures: R A measure µ on Rn is called Gaussian if its characteristic function, φ(k) := Rn ei(k,x) dµ, has the form 1 φ(k) = exp{i(ρ, k) − (Qk, k)}, 2 where ρ is the mean and Q is called the covariance of µ. For mean zero and nonsingular covariance, (1.10)

1 dµ = exp{− (Ax, x)}dx 2 where A = Q−1 . We consider dµ of the form (1.11). The salient feature of Gaussian measures, and the one which is fundamental for applications to graphical enumeration, is that expectations of general polynomial functions can be reduced to quadratic expectations. (1.11)

4

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

The explicit recipe for this, generally referred to as the Wick formula, states that for linear functions ℓi on Rn , (1.12)

hℓ1 ℓ2 . . . ℓ2k i =

X

hℓr1 ℓs1 ihℓr2 ℓs2 i . . . hℓrk ℓsk i

where h·i denotes expectation with respect to dµ and the sum is taken over the (2k − 1)!! (= (2k − 1)(2k − 3) . . . 1) Wick couplings of 1, 2, . . . , 2k. A Wick coupling is a partition of 1, 2, . . . , 2k into couples (ri , si ) such that r1 < r2 · · · < rk and si > ri . The quadratic expectations are completely determined by hxi yj i = qij where qij is the ij th entry of the covariance matrix Q. Expectations of odd polynomials vanish. The proof of the Wick formula follows from a comparison of the Taylor coefficients of the characteristic function φ(k) and its logarithm. We refer the reader to [23, P. 9] for details. The random matrix measure defining the Gaussian Unitary Ensemble (GUE) and given by (1.13)

N

dµ = 2− 2 π −

N2 2

1 exp − TrM 2 dM 2

is manifestly a Gaussian measure. It is straightforward to work out the covariance matrix from which one may conclude that (1.14)

hmij mji i = 1, and hmij mkl i = 0 for (i, j) 6= (k, l).

1.3.2. Enumerating Maps. There are by now a number of striking examples which illustrate the power of random matrix methods for calculating explicit solutions of combinatorial problems related to graphical enumeration. One of these is the problem of enumerating maps. A map is a graph which is embedded into a Riemann surface so that (1) the (images of the) edges do not intersect; (2) dissecting the surface along the edges decomposes it into a union of open cells; these cells are called the faces of the map. Given this definition, one can give a precise combinatorial description of a class of maps in terms of edge identifications between a collection of faces. For instance one can pose the question of how many maps can be constructed from a single face, having 2k edges around its boundary, by identifying its edges in pairs. It is straightforward to see that this number is (2k − 1)!!. A more subtle question is to ask how many of these maps lie on a surface of genus g. It turns out that this counting problem has a direct and natural reinterpretation in terms of the combinatorics of Wick couplings. Let εg (k) denote the number of one face maps with 2k edges on a Riemann surface of genus g. A generating function for these numbers can be directly expressed in terms of a random matrix moment [18]: [k/2]

(1.15)

hTrM

2k

i=N

k+1

X g=0

εg (k)

1 N2

g

There are extensions of these kinds of calculations to more general classes of maps along with remarkable applications to the calculation of geometric invariants of moduli spaces of Riemann surfaces. We refer the reader to [17] for a good general description of these results. 1.3.3. Diagrammatic Expansions. We return now to considering the evaluation of the partition function for the deformed unitary ensemble ZˆN (t). Here we will summarize some beautiful work relating the asymptotic expansion (1.3) to some problems in enumerative geometry. As mentioned above, in [3] the authors asserted the existence of the expansion (1.3), and presented a very elegant consistency argument, which is described in subsection 1.5. The components of t are viewed as deformation parameters; when t = 0 one has the partition function of the original Gaussian Unitary Ensemble. To fix ideas, will will restrict our attention to the case considered in [3]. So in this subsection, we will set all parameters tj = 0, except for t = t4 . (While in [3] the authors considered more general deformations, the authors gave a more detailed discussion for this case.)

ASYMPTOTICS OF RMT PARTITION FUNCTION

5

Consider the Taylor series expansion corresponding to all parameters tj = 0 except for t = t4 , X n n t 1 −t (1.16) exp − TrM 4 = T rM 4 . N n! N n≥0

This is clearly globally convergent for all t. The difficulty arises when one considers the Gaussian expectation (using (1.13)) of this exponential function. Commuting the expectation integrals with the sum on the right hand side, [3] produced the formal Taylor series expansion of the partition function around t = 0:

(1.17)

ZˆN (t)

= “=”

1 t = exp − TrM 4 ZN (0, 0, 0, t4 = t, 0, . . . , 0) N ZN (0) X 1 −t n h(T rM 4 )n i. n! N n≥0

The quotation marks indicate where one has proceeded formally. Indeed it is manifest that this is not a convergent series expansion since the integral corresponding to hexp{−(t/N )TrM 4 }i converges only for t with positive real part. Properly speaking, this is really shorthand for a series of identities relating derivatives of ZˆN evaluated at t = 0 to expectations of powers of Tr M 4 . Again, use of the Wick calculus allows one to replace the matrix moments appearing in the above formal series by a generating function for enumerating a certain class of labelled 4-valent maps (or disjoint unions of maps) which we will refer to as diagrams. A four valent diagram consists of (1) n 4-valent vertices; (2) a labelling of the vertices by the numbers 1,2,...,n; (3) a labelling of the edges incident to vertex σ (for σ = 1, . . . , n) by letters iσ , jσ , kσ , ℓσ (This alphabetic order corresponds to the cyclic order of the edges around the vertex); (4) a partitioning of the labelled edges into pairs. (Once the number n is specified, the set of all n-vertex, four valent diagrams is in one-to-one correspondence with the set of all pairings.) Connecting the edges according to the pairing yields a graph, together with a cyclic ordering of the edges around each vertex. For definiteness, we will adhere to the rule that this cyclic ordering corresponds to a clockwise orientation of the edges around a vertex. If the underlying graph is connected, the cyclic ordering determines a map associated to the diagram. In that case we will call the diagram a g-map if the map is on a Riemann surface of genus g. (Note that a g-map as defined here has more structure than a map as defined in the previous subsection since a g-map carries a labelling of its vertices and edges.) If the graph is not connected, then the edge labelling associates a map to each connected component, and the conglomerate of maps will be called a g-diagram. The use of the Wick calculus yields the following different representation of (1.17), which clearly demonstrates that the partition function is a generating function for the enumeration of diagrams: X 1 −t n X ˆ #{4-valent, n-vertex, g-diagrams}N 2−2g+n . (1.18) ZN (t)“ = ” n! N g n≥0

Exploiting the relationship between the terms of a Taylor series and those of its logarithm one can write down an equally formal representation for the the logarithm of the partition function which can be regarded as a generating function for connected n-vertex diagrams: (1.19)

log ZˆN (t)“ = ”

X 1 −t n X #{4-valent, n-vertex g-maps}N 2−2g+n . n! N

n≥0

g≥0

Finally one can make another leap beyond rigor and resum the terms of the previous formal series, as was done in [3], to formally order the series by the genus of the surface to which the diagram maps. This yields what is referred to in the physics literature as the genus expansion, (1.20)

log ZˆN (t)“ = ”

X g

Eg (t)N 2−2g ,

6

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

P 1 where Eg (t) = n≥1 n! (−t)n κg (n) is a formal series (possibly convergent) in which each of the coefficients κg (n) is the number of connected maps of genus g with n vertices (all 4-valent). The authors of [3] fully appreciated that this intuitive “deduction” was completely formal and in fact suggested an approach for providing a rigorous derivation. This approach was never fully pursued (we briefly review its history in Section 1.5). We have taken a different approach and our proof of Theorem 1.1 provides a rigorous validation of the form of the representation (1.20). When restricted to the four-valent case, our result may be summarized as follows. A. There is a positive number T4 such that for 0 ≤ t ≤ T4 , the partition function ZˆN (t) possesses the following asymptotic expansion. (1.21) N −2 log ZˆN (t) = e0 (t) + N −2 e1 (t) + N −4 e2 (t) + · · · . The meaning of this expansion is: if you keep terms up to order N −2k , the error term is bounded by CN −2k−2 . The coefficients eg (t) possess analytic continuations to a neighborhood of t = 0. B. The coefficients eg (t) are related to the counting of 4-valent g-maps via the following formula:

∂n eg (0) = #{4-valent, n-vertex, g-maps}. ∂tn For the case of more general deformations, and the full asymptotic expansion (1.3), we have the following theorem concerning the coefficients eg (t1 . . . tν ). (−1)n

Theorem 1.2. The coefficients in the asymptotic expansion (1.3) satisfy the following relations. Let g be a nonnegative integer. Then X 1 (1.22) eg (t1 . . . tν ) = (−t1 )n1 . . . (−tν )nν κg (n1 , . . . , nν ) n1 ! . . . nν ! nj ≥1

in which each of the coefficients κg (n1 , . . . , nν ) is the number of g-maps with nj j-valent vertices for j = 1, . . . , ν. 1.4. Motivation: The Connection to Orthogonal Polynomials. As mentioned above, the integral (1.1) is intimately connected to the theory of orthogonal polynomials. Consider the measure (1.23)

wN (x)dx := exp [−N Vt (x)]dx.

Let us define {pj (x; N, t)}∞ j=0 to be the sequence of polynomials orthogonal with respect to the measure wN (x)dx. That is, {pj (x; N, t)}∞ j=0 satisfies Z ∞ 0 j 6= k pj pk wN dx = (1.24) , 1 j=k −∞ (N )

(N )

(n)

and pj (x; N, t) = γj xj + · · · , γk > 0. (The leading coefficient γk is of course dependent on the parameters t1 , . . . , tν ; however, we suppress this dependence for notational convenience.) The fact of the matter is that ZN (t) may also be defined via (1.25)

ZN (t) = N !

N −1 Y

(N )

γℓ

ℓ=0

−2

.

ZN is also defined via

(1.26)

c0 c1 . ZN (t1 , . . . , tν ) = N ! .. .. . cN −1

c1 c2 .. . .. . cN

··· ··· .. . ..

. ···

cN −1 cN .. . .. . c2N −2

,

ASYMPTOTICS OF RMT PARTITION FUNCTION

7

R where cj = R xj wN (x)dx are the moments of the measure wN (x)dx, and the determinant above is called a Hankel determinant (see, for example, Szeg¨ o’s classic text [24]). The asymptotic expansion (1.3) constitutes a version of the strong Szeg¨ o limit theorem for Hankel determinants. The strong Szeg¨ o limit theorem concerns the asymptotic behavior of Toeplitz determinants associated to a given measure on the interval (0, 2π). We refer the interested reader to [24] for more information. It is well known in both the approximation theory literature and the random matrix theory literature (see, for example, [21],[22] and the references therein, or [5] and references) that ZN (t) satisfies the following leading order asymptotic behavior: 1 log ZN (t1 , . . . tν ) lim N →∞ N 2 Z Z Z = sup − Vt (λ)dµ(λ) + log |λ − η|dµ(λ)dµ(η) , µ∈A

where A is the set of all positive Borel measures on the real axis, with unit mass. The variational problem posed above is referred to in the approximation theory literature as the problem of determining the equilibrium measure for logarithmic potentials in the presence of an external field (see [22]). It is well known that the supremum is achieved at a unique measure µ∗ (see, for example, [22]), and that for real analytic external fields, the equilibrium measure µ∗ is supported on finitely many disjoint intervals, and on the interior of each interval, the equilibrium measure has analytic density [5]. 1.5. Brief discussion of history. In [3], Bessis, Itzykson and Zuber considered asymptotics for the integral (1.1), but for the special case in which tj ≡ 0 for j 6= 4. That is, they considered the integral (BIZ)

(1.27)

ZN (t) = Z Z N X X 1 1 1 λ2j + tλ4j − 2 log |λj − λℓ | dN λ. · · · exp −N 2 N j=1 2 N j6=ℓ

They computed asymptotics for this integral by using (1.25), together with some reasonable assumptions on (n) the asymptotics of ratios of the leading coefficients γj . The basic idea is to re-write (1.25) in yet another form, namely 1 (BIZ) (1.28) log ZN (t) = N2 −1 NX 2 1 2(N − j) (N ) (N ) + , log (N !) − log b log γ 0 j−1 N2 N N2 j=1 (N )

where bj denotes the recurrence coefficient associated to the orthogonal polynomial sequence, xpj (x) = bj pj+1 (x) + aj pj (x) + bj−1 pj−1 (x). It easy easy to see that the recurrence coefficients are related directly to (N ) (N ) (N ) the leading coefficients γj , via bj = γj /γj+1 . (N )

The authors then made the following asymptotic assumptions concerning the recurrence coefficients bj 2 j j j 1 1 (N ) = r0 bj (1.29) , t + 2 r2 , t + · · · + 2k r2k ,t + ··· , N N N N N

:

where the functions r2ℓ (x, t) are assumed to be infinitely differentiable functions of the variable x. With these assumptions in hand, Bessis, Itzykson, and Zuber then substitute (1.29) into (1.28), and apply the Euler-Maclaurin summation formula to replace each summation by a series of integrals. Following that, there is an argument that if an asymptotic description such as (1.29) holds, then one may deduce the form of the functions r2ℓ . This is achieved by studying a nonlinear recursion relation satisfied (BIZ) (N ) by the recurrence coefficients bj . This in turn leads to a prediction for the asymptotics of ZN . The authors compute explicitly the first three terms, and present a conjecture for all terms. Their conjecture is (BIZ) (t) is a rational function of t, with one pole in the finite plane, of order 5(j − 1), located that for j ≥ 2, ej at t = −1/48.

8

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

Quite separately, a rigorous analysis of the recurrence coefficients for polynomials orthogonal with respect 2m to weights of the form e−x dx [20] was carried out by analyzing the very same nonlinear recursion relation. This yielded a proof of the leading order information contained in (1.29), but valid only if j → ∞. On the other hand, in [3], the authors use (1.29) as a uniform expansion, valid even for j = 1, as N → ∞. It would seem plausible that such an expansion would hold for j → ∞, N → ∞, such that j/N → x > 0. However, it is entirely possible that for j such that j/N approaches 0, there is some correction to (1.29) (BIZ) which may affect the asymptotic computation of log (ZN ) at some finite algebraic order in N . For this reason, it is of great interest to find some independent way to compute the asymptotics for log (ZN (t1 , . . . , tν )). In a different direction, in [4], techniques from the theory of isomonodromic deformations, as well as techniques for the asymptotic analysis of Riemann-Hilbert problems were applied to the problem of determining asymptotics for the polynomials pn (z; N, t) orthogonal with respect to the 1-parameter family of measures exp [−N (x2 /2 + tx4 )]. The results were used to prove that the associated random matrix model obeys the universality conjecture. That is, it was proved that the local statistics of the eigenvalues of random matrices with the probability measure exp [−N Tr (M 2 /2 + tM 4 )]dM converge as N → ∞ to a universal random point process, whose correlation functions are given in terms of the so-called sine kernel. In addition, in [6]-[8], recent techniques for the asymptotic analysis of Riemann-Hilbert problems were applied to the problem of determining asymptotics for a wide class of orthogonal polynomials, which contain the orthogonal polynomials pn (z; N, t) as a subset. The results were used to establish this universality conjecture of random matrix theory, for a family of real analytic probability measures. As a by-product of (N ) the analysis in [8], asymptotics for the recurrence coefficients bN −1 were obtained. The upshot of this is that there is emerging a new way to compute asymptotics of log (ZN (t)). In both [4] and [6]-[8], an important asymptotic technique is the Deift-Zhou steepest descent / stationary phase method for the asymptotic analysis of Riemann-Hilbert problems. This method was introduced in [11], and further developed in [12] and [10]. One way to proceed is to compute the asymptotics for the orthogonal polynomials, and then deduce the (N ) asymptotics for the recurrence coefficients bj . However, this still requires an analysis of the recurrence coefficients which is uniform in j, i.e. for j = 0 through j = N − 1. This appears to be an onerous task, and so we shall not adopt this approach here. Instead, we will proceed, starting in the next subsection, by the direct analysis of yet another representation of log (ZN ) (formula (1.34)). 1.6. A statistical mechanical formula, and orthogonal polynomials. In this paper we will analyze the large N behavior of ZN (t) by direct analysis of the formula (1.33) for the logarithmic derivative of ZN . The derivation of this formula proceeds as follows. One begins by computing the logarithmic derivative of ZN : Z Z N X ∂ 1 (1.30) λℓj log (ZN ) = · · · −N ∂tℓ ZN j=1 N X X 1 1 × exp −N 2 Vt (λj ) − 2 log |λj − λℓ | dN λ. N N j=1

j6=ℓ

Of course, this has the immediate interpretation as an expectation value, with respect to the probability measure (1.5): N X ∂ (1.31) λℓj . log (ZN ) = EN −N ∂tℓ j=1

Now it is well known (see, for example, [21]) that expectation values of functions of the λj s can be expressed in terms of the associated orthogonal polynomials. In particular, the mean density of the λj ’s is given by the so-called ”one-point function”, (1.32)

(1)

ρN (λ) =

N −1 X 1 pj (λ; N, t)2 . exp [−N Vt (λ)] N j=0

ASYMPTOTICS OF RMT PARTITION FUNCTION

9

Using this connection, one has the following remarkable formula for the partial derivatives of log (ZN ): Z ∞ 1 ∂ (1) 2 2 ℓ = −N (1.33) log (ZN ) = −N E λℓ ρN (λ)dλ Tr M ∂tℓ N −∞

in which the first equality follows from (1.7). The fundamental theorem of calculus readily implies Z tZ −→ (N ) 2 ~ ZN (t ) = ZN (0) exp −N (1.34) ρ1 (λ) ∇t V dλ · dℓ . 0

R

Since ZN (t = 0) is explicitly known (ZN (0) = · · · ), the formula (1.34) shows that if we have global (N ) asymptotics for ρ1 , we can deduce an asymptotic expansion for ZN (t ). We will analyze the one-point function, globally on the real axis, and determine a uniform asymptotic representation for it. Then we will evaluate the integral appearing in the right hand side of (1.33), and from this obtain a uniform asymptotic expansion for (1.34). This is the procedure by which we shall compute the asymptotic expansion of log ZN . The following theorem is a fundamental result which, following the above prescription, yields Theorem 1.1. Theorem 1.3. There is T > 0 and γ > 0 so that for all t ∈ T(T, γ), the following expansion holds true: Z ∞ (1) (1.35) f (λ)ρN (λ)dλ = f0 + N −2 f1 + N −4 f2 + · · · , −∞

provided the function f (λ) is C ∞ smooth, and grows no faster than a polynomial for λ → ∞. The coefficients fj depend analytically on t for t ∈ T(T, γ), and the asymptotic expansion may be differentiated term by term. In the statement of the above Theorem, the meaning of the asymptotic expansion is this: if you stop after the term N −2j fj , the error term is O(N −(2j+2) ).

Remark 1.4. We note that in some very special instances results of the above form may be deduced from known results in the literature. For instance, taking the Gaussian limit of (1.33) one has Z ∞ 1 ∂ (1) log (ZN )|t=0 = −N 2 λ2k ρN (λ, t = 0)dλ = −N 2 h N −k Tr M 2k i. ∂t2k N −∞ g P[k/2] The last term, −N −k+1 h Tr M 2k i, which by formula (1.15) is equal to a finite series, −N 2 g=0 εg (k) N12 , is a generating function for counting one-face maps with k edges. This series is manifestly even in N. In the setting of (1.33) this series is actually a generating function for counting 2k-valent one-vertex maps (see also (2.24)-(2.26)). There is no inconsistency in this since by duality these two countings are equivalent. Remark 1.5. Additionally, in [2], Albeverio et al have recently considered asymptotic expansions of the form (1.35), for the special function fz (λ) = (z − λ)−1 , under the assumption that the external field is even, but they allow for the equilibrium measure to be supported on one or two intervals. They assert an asymptotic expansion for such integrals which is in inverse powers of N ; our analysis shows that there is a complete expansion, in inverse powers of N 2 . The paper is organized as follows. In Section 2 we present a self-contained description of the connection between random matrix integrals and the enumeration of maps on Riemann surfaces, according to genus and valence; we also prove Theorem 1.2, using Theorem 1.1. In Section 3 we summarize the procedure developed in [6]-[8] to establish rigorous uniform global asymptotics for the associated orthogonal polynomials. In (1) Section 4 we use the results of Section 3 to derive exact formulae for ρN (λ), the mean density of eigenvalues at finite N , in terms of the Riemann–Hilbert procedure. Explicit in the formulae derived is a complete (1) asymptotic expansion for ρN . In Section 5, we use the formulae derived in Section 4, to establish Theorem 1.3. 2. Enumeration of g-maps Qν In this section we will explain the connection between the evaluation of the Gaussian moments h j=1 (T rM j )nj i, and g-diagrams and g-maps (as defined in subsection 1.3.3). Following that we will prove Theorem 1.2 which states that the asymptotic expansion (1.3) is a generating function for g-maps, enumerating them according to the number of vertices with different valences and the genus.

10

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

2.1. Gaussian matrix integrals and enumeration of diagrams. For simplicity we first discuss in detail the case of the pure moment (T rM 4 )n ; afterward we will indicate how this extends to general mixed moments. The expression (T rM 4 )n has the form X (2.1) mi1 ,j1 mj1 ,k1 mk1 ,ℓ1 mℓ1 ,i1 mi2 ,j2 mj2 ,k2 . . . min ,jn mjn ,kn mkn ,ℓn mℓn ,in

where the sum is taken over all configurations, where by a configuration one means an assignment to each of the 4n labels appearing in the list {iν , jν , kν , ℓν }nν=1 a value from {1, . . . , N }. There are thus N 4n configurations. Each configuration corresponds to a selection of 4n matrix entries. We compute the expectation of this quantity with respect to the original probability measure (1.13), interchanging integration with summation: D n E (2.2) Tr M 4 X = hmi1 ,j1 mj1 ,k1 mk1 ,ℓ1 mℓ1 ,i1 mi2 ,j2 mj2 ,k2 . . . min ,jn mjn ,kn mkn ,ℓn mℓn ,in i configs By the Wick calculus, the expectation of each term in the above sum can itself be evaluated as a sum over Wick couplings as they were described in Section 1.3.1. To appreciate this one should first observe that each of the matrix entries appearing in the expectation on the right hand side of (2.2) is a linear function. Next, we introduce the following notation: (2.3)

hmi1 ,j1 mj1 ,k1 mk1 ,ℓ1 mℓ1 ,i1 mi2 ,j2 mj2 ,k2 . . . min ,jn mjn ,kn mkn ,ℓn mℓn ,i1 i = hf1 f2 · · · f4n i ,

where (2.4)

f1 = mi1 ,j1 , f2 = mj1 ,k1 , f3 = mk1 ,ℓ1 , f4 = mℓ1 ,i1 ,

and for ν = 2, . . . , n, (2.5)

f4(ν−1)+1 = miν ,jν ,

(2.6)

f4(ν−1)+2 = mjν ,kν ,

(2.7)

f4(ν−1)+3 = mkν ,ℓν ,

(2.8)

f4(ν−1)+4 = mℓν ,iν .

The definitions (2.4)-(2.8) implicitly define an invertible mapping (r, s)(·) = (r(·), s(·)) between the integers {1, . . . 4n} and the matrix indices {(iν , jν ), (jν , kν ), (kν , ℓν ), (ℓν , iν )} which we will describe as follows: (2.9)

(r, s)(·) = (r(·), s(·)) : {1, . . . , 4n} → {(iν , jν ), (jν , kν ), (kν , ℓν ), (ℓν , iν )}nν=1 , k 7→ (r(k), s(k)), so that fk = mr(k),s(k) (using (2.4)-(2.8)).

We now apply the Wick calculus: X (2.10) hf1 · · · f4n i configs X X

= fω1,1 fω1,2 fω2,1 fω2,2 · · · fω2n,1 fω2n,2 configs ω∈W4n In this setting a Wick coupling, ω = ωi,j , i = 1, . . . , 2n, j = 1, 2, is a partition of 1, 2, . . . , 4n into 2n couples (ωi,1 , ωi,2 ) so that ω1,1 < ω2,1 < · · · < ω2n,1 , and ωi,2 > ωi,1 for i = 1, . . . , 2n. We denote the set of all such Wick couplings of the integers 1, . . . , 4n by W4n . Now the outer summation over configurations appearing on the right hand side of (2.10) is over the different realizations of the variables f1 , . . . , f4n determined by the configuration. We may interchange orders of summation:

ASYMPTOTICS OF RMT PARTITION FUNCTION

(2.11)

D

Tr M 4

n E

=

11

X

hf1 · · · f4n i configs X X

= fω1,1 fω1,2 fω2,1 fω2,2 · · · fω2n,1 fω2n,2 . ω∈W4n configs

The individual terms

fω1,1 fω1,2 fω2,1 fω2,2 · · · fω2n,1 fω2n,2

(2.12)

are either 0 or 1. For each Wick coupling ω, certain configurations contribute a 1 to the inner

summation, n and other configurations do not contribute. The question of evaluating the original integral Tr M 4 has been reduced to computing, for each Wick ordering ω ∈ W4n , the number of configurations providing unit contribution to the inner sum appearing in (2.11). For each different Wick coupling ω, it turns out that this number is of the form N F (ω) , and accepting this for the moment, we have the formula X

fω1,1 fω1,2 fω2,1 fω2,2 · · · fω2n,1 fω2n,2 = N F (ω) . (2.13) configs To determine the contribution N F (ω) for each Wick coupling, and to explain the quantity F (ω), let us first recall the direct relationship (2.4)-(2.8) between {fj } and the original variables of integration {miν ,jν , mjν ,kν , mkν ,ℓν , mℓν ,iν }nν=1 , and the identities (1.14). Using the mapping (r, s)(·) defined in (2.9) , the inner sum in (2.11), over all configurations, is of the form X

mr(ω1,1 ),s(ω1,1 ) mr(ω1,2 ),s(ω1,2 ) mr(ω2,1 ),s(ω2,1 ) mr(ω2,2 ),s(ω2,2 ) · · · (2.14) configs

· · · mr(ω2n,1 ),s(ω2n,1 ) mr(ω2n,2 ),s(ω2n,2 ) .

Each different configuration appearing in (2.14) is a different choice of the matrix indices {(iν , jν ), (jν , kν ), (kν , ℓν ), (ℓν , iν )}, and for each one we then ask if the contribution is 0 or 1. Using (1.14), the contribution will be 1 if and only if for each µ = 1, . . . , 2n,

(2.15) mr(ωµ,1 ),s(ωµ,1 ) mr(ωµ,2 ),s(ωµ,2 ) = 1, and this is true if and only if

(2.16)

r(ωµ,1 ) = s(ωµ,2 ) and s(ωµ,1 ) = r(ωµ,2 ) for each µ = 1, . . . , 2n.

The sum (2.14) is precisely the number of configurations for which the 4n equalities (2.16) hold true, and since r(ωµ,1 ) is, for each µ, one of {iν , jν , kν , ℓν }nν=1 (and similarly for s(ωµ,2 ), s(ωµ,1 ), and r(ωµ,2 ) ), it follows that the sum over configurations, is now over iν , jν , kν , ℓν = 1, . . . N, so that (2.16) holds. The calculation of (2.14) now proceeds as follows. For each Wick coupling ω we write out equalities amongst the 4n indices of summation {iν , jν , kν , ℓν }nν=1 enforced by (2.16) and group them in “chains” (for example, one might

have i3n= j5 = ℓ7 · · · ). Each index of summation appears in two equalities (because we are computing Tr M 4 , see (2.2)) and so each distinct chain is, fact, a closed cycle. For each closed cycle, the original summation is reduced to a summation over a single free parameter, ranging from 1 to N . Finally then, the summation (2.14) is N F (ω) where F (ω) is precisely the number of closed cycles determined by the Wick coupling ω, and we have explained (2.13). Summarizing, we have shown that D X n E = Tr M 4 (2.17) N F (ω) , ω∈W4n

where F (ω) is the number of closed cycles determined by ω via the equalities (2.16). Note that the right hand side of (2.17) is a finite sum, as W4n is a finite set.

12

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

A key insight of the classic paper of [3] was to realize that counting the Wick couplings could be reduced to listing all possible diagrams (as defined in between (1.17) and (1.18) above). To see this one begins with a collection of n 4-valent vertex configurations labelled as in Figure 2.18. A given coupling determines a unique way of connecting the outgoing and incoming rays of each of the n 4-valent vertices, to form “roads”. The result of such a glueing will be a diagram. Indeed, if we interpret each road in Figure 2.18 as an edge, and each edge is labelled by the “outgoing” side of the road, we clearly have a diagram. (The “faces” of the diagram correspond 1-1 to the closed index cycles of that coupling.) Conversely, given a diagram as defined, which includes the labellings, we can read off directly, from the way the incident edges are paired, what the couplings must be. This gives a bijection between diagrams and Wick couplings. ...

... ... ... 1 ... ... ... ... . . . . . . . . . . . . . . ........... ................ ... ... .... . ... .. ... .. . ...... .................................... .... ... ... ... .. .. . ........ ... 1 1...

ℓ1.............

ℓ1

1

.........

k1

k

... ... ... 2 ... ... ... ... .. . . . . . . . . . . . . . . ................. ............. ... .... . ... .. ... .. . ..... ...................................... ... ... ... ... .. .. ........ 2 2 .... .. ...

i

ℓ2

i.1........ .

.........

k2

j1

j

ℓ2..............

...

i

..

2

k

j

ℓn

i.2...... j2

···

.........

kn

... ... ... n ... ... ... ... . . . . . . . . . . . . . . ............. ................ ... .. .... ... .. ... .. ...... ....................................... ... ... ... ... .. .. ........ n n .... .

ℓn.............

i

i..n... ......

n

k

j

jn

Figure 2.18. The full count of non-vanishing contributions is then given by summing over diagrams with a weighting, N F (ω) , that counts the number of configurations that give rise to a nonvanishing contribution in the coupling, ω, associated to this diagram. Also the exponent of the weighting, F (ω), which was defined to be the number of closed index cycles in the coupling is now also seen to be the number of faces, F , in the associated diagram. The weighting factor is N F . If the diagram is connected (i.e., if it is a map), this can be expressed in terms of the genus of the Riemann surface that the diagram maps to by using Euler’s formula. Since the number of vertices of a diagram is n and the number of edges is 2n (= the number of couples in a Wick coupling), we have 2 − 2g = n − 2n + F from which we deduce that the weighting factor for a 4-valent, n-vertex, g-map is N 2−2g+n . We can directly extend this to the case of disconnected diagrams since the Euler characteristic is additive with respect to disjoint unions. This generalization results in the possibility that g can become negative. Thus, to each diagram we can associate a unique integer g and then we will refer to that diagram as a g-diagram.

The beautiful connection between the quantity (Tr M 4 )n and the combinatorics of g-diagrams described in [3] (and discussed above) is summarized with the following formula: D

(2.19)

Tr M 4

n E

=

X

#{4-valent, n-vertex, g-diagrams}N 2−2g+n .

g

We remark that this is a finite sum, and the reader may easily verify that the nonzero contributions to this sum come from 1 − n ≤ g ≤ [(n + 1)/2], where [ℓ] is the closest integer to ℓ less than or equal to ℓ. A straightforward extension of the above analysis to the case of mixed moments shows that

(2.20)

*

ν Y

j=1

Tr M

j nj

+

=

X

#{g-diagrams with nj j-valent vertices; j = 1, . . . , ν}N 2−2g+

g

j j=1 ( 2 −1)nj

Pν

.

(Again we observe that this is a finite sum.)

2.2. Asymptotics of the partition function and enumeration of g-maps. We turn now to the proof of Theorem 1.2. The starting point is the asymptotic expansion in Theorem 1.1, rewritten in the form 2g−2 ∞ X 1 eg (t) log ZˆN − N 2 e0 (t) − e1 (t) = . N g=2

ASYMPTOTICS OF RMT PARTITION FUNCTION

13

This is, as usual, shorthand: the right hand side is an asymptotic expansion in inverse powers of N 2 . 2 Exponentiating both sides of this equation we deduce that ZN e−N e0 −e1 has an asymptotic expansion in 2 inverse powers of N . Some algebraic manipulation shows that ZˆN = exp N e0 + e1 2

(2.21) where

h X 1 ρh = k! k=1

(

1+

X

∞ X

ρh

h=1 k Y

1 N2

h )

eℓj +1 .

ℓ1 +...+ℓk =h,ℓj >0 j=1

Formula (2.21) may appear to be nothing more than a simple calculational re-representation of ZˆN . However (2.21) explains concretely in what sense ZˆN itself possesses an asymptotic representation. It follows from Theorem 1.1 that the asymptotic series on the right hand side of (2.21) can be differentiated term-by-term for t ∈ T(T, γ), and the ensuing derivatives may be evaluated at t = 0. Having established this we now rewrite (2.21) as (2.22)

1 1 2 ˆ ZN (t) = exp N e0 (t) + e1 (t) + 2 e2 (t) + · · · + 2h−2 eh (t) + . . . . N N

In light of the above discussion, it is clear what is meant by this asymptotic expansion, which is valid for t satisfying the regularity conditions of Theorem 1.1. Differentiating (2.22) nj times in each tj and taking the limit t → 0, we may now conclude, by comparison with (2.20), that

(2.23)

+ * ν Pν Y j ∂n n j N − j=1 ( 2 −1)nj = Tr M j n1 nν ZN (t) ∂t1 . . . ∂tν t=0 j=1 X = #{g-diagrams with nj j-valent vertices; j = 1, . . . , ν}N 2−2g g

" !# ∞ X ∂n 2−2g exp N eg (t) = (−1) ∂tn1 1 . . . ∂tnν ν g=0 n

,

t=0

where n = n1 + · · · + nν . The string of equalities in (2.23) states that the finite sum over g in the second line possesses an asymptotic expansion in inverse powers of N 2 . We learn that all of the coefficients in this final asymptotic expansion must vanish from some point on. Much more information can be obtained in this manner from (2.23). For example, by examining (2.23) for the case of a single derivative, one may verify that for ℓ even, (2.24) (2.25) (2.26)

∂ e0 (0) = −# { genus ∂tℓ ∂ e1 (0) = −# { genus ∂tℓ ∂ eg (0) = 0 for g > ∂tℓ

0 diagrams with 1 ℓ-valent vertex} 1 diagrams with 1 ℓ-valent vertex} 1 ℓ/2 if ℓ/2 is even . ℓ/2 − 1 if ℓ/2 is odd 2

We observe that in (2.24) and (2.25), the diagrams have a single vertex, and so we may say that (2.24) and (2.25) enumerate 1-vertex g-maps. Proceeding further, one may examine (2.23) for the case of higher order derivatives. Tedious calculations may be carried out which show that the eg ’s are generating functions for g-maps (they enumerate those diagrams that are connected). However, this approach is quite complicated, and we adopt a different approach, which is to use (2.23) to discuss the relation between the logarithm of the partition function and connected diagrams, or g-maps, that was alluded to in (1.19). For the sake of clarity we will present this just in the

14

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

case of t = (0, 0, 0, t4 = t, 0, . . . , 0); it will be evident from the discussion that the extension to more general valences is straightforward. We observe that, from our earlier discussion of the relation between diagrams and Wick orderings, that: (2.27)

X g

# {4-valent, n-vertex, g-diagrams}N 2−2g =

X

N χ(ω) := Qn (N ).

ω∈W4n

Qn (N ) is a Laurent polynomial which we will refer to as the diagram polynomial for 4-valent, n-vertex diagrams. We introduce an exponential generating function [16] for diagram polynomials: (2.28)

G(t) :=

∞ k X t

k=1

k!

Qk (N ).

This is a formal generating function in the same sense as was discussed for (1.18). It is by no means a convergent series, but rather is interpreted in the sense that one is allowed to evaluate finitely many derivatives of both sides at t = 0. (Below we will indicate how to remove the formality of these arguments by truncating the series.) We also introduce an exponential generating function for connected 4-valent, diagrams (i.e. maps): ∞ k X t C(t) := Pk (N ), k! k=1

where

Pn (N ) =

(2.29)

X

N χ(ω)

conn ω∈W4n

conn and W4n is defined to be the subset of W4n consisting of Wick couplings that correspond to connected diagrams. We observe that

C(t)C(t)

∞ X X

tn Pk (N )Pℓ (N ) k!ℓ! n=2 k+ℓ=n ∞ n n−1 X t X n = Pk (N )Pn−k (N ). k n!

=

n=2

k=1

This series is a generating function for diagram polynomials of ordered pairs (ω1 , ω2 ) of connected Wick n couplings. There is a geometrical explanation for the appearance of the combinatorial coefficient in k this expression. Itis a consequence of the fact that the labels 1, . . . n get distributed over ω1 ∪ ω2 and if n |ω1 | = k there are different ways of doing this. k Next, one may prove that C(t)C(t)/2 is the exponential generating function for 4-valent diagrams which consist of exactly two connected components. In other words, one may define an exponential generating function for 4-valent diagrams consisting of exactly two connected components, and prove that this generating function coincides, term-by-term, with C(t)C(t)/2. Subsequently, and in the same way, one may prove that C d (t)/d! is the exponential generating function for 4-valent, n-vertex diagrams with exactly d connected components. One may finally conclude that, in the sense of formal generating functions, (2.30)

G(t)

=

∞ X 1 d C (t) d! d=1

= exp (C(t)) − 1.

To get around the formality of these generating functions, we repeat most of the argument from (2.28) to (2.30), truncating the infinite series involved. So we define (2.31)

Gm (t) =

m k X t k=1

k!

Qk (N ),

Cm (t) =

m k X t k=1

k!

Pk (N ),

ASYMPTOTICS OF RMT PARTITION FUNCTION

15

with Qk and Pk defined in (2.27) and (2.29), respectively. Next we have that m

X tk (2) 1 Cm (t)2 = Pk (N ) + O tm+1 , 2 k!

(2.32)

k=2

where the sum on the right hand side is the truncated exponential generating function for 4-valent diagrams (2) consisting of exactly two connected components (i.e. Pk (N ) is the diagram polynomial for 4-valent, k-vertex diagrams with two connected components). Similarly, the reader may verify that m

X tk (d) 1 Cm (t)d = Pk (N ) + O tm+1 , d! k!

(2.33)

k=d

(d) Pk (N )

where on the right hand side, is the diagram polynomial for 4-valent, k-vertex diagrams with d connected components. Putting this all together, we have shown that (2.34) Gm (t) = eCm (t) + O tm+1 . And since m was arbitrary, this is the proper sense in which one may interpret (2.30). We have established the following set of relations: (2.35) 1 + Gm (−t) = ZN (t) + O tm+1 , (2.36) exp Cm (−t) = 1 + Gm (−t) + O tm+1 . We therefore have

Cm (−t) = log ZN + O tm+1 .

(2.37)

We may now differentiate this n times (for n ≤ m) to obtain ∂n ∂n (2.38) Cm (−t) = Pn (N ) = n log ZN (t) n ∂t ∂t t=0

.

t=0

So we have proven that log ZN is the generating function for connected diagrams. Now using our asymptotic expansion for log ZN , we have ∞ n X 2−2g n ∂ N e (t) (2.39) (−1) = Pn (N ) g ∂tn g=0 t=0 X X N χ(ω) = = N 2−2g #{4-valent, n-vertex, g-maps}. conn ω∈W4n

g

We have now shown that eg (t) = Eg (t) in the sense that ∂n eg (0) = #{4-valent, n-vertex, g-maps}. ∂tn By similar reasoning one can fully establish Theorem 1.2, and we will not present these details here. We refer the reader to [16] for a fuller discussion of the general cumulant relations as they pertain to graphical enumeration. (−1)n

3. Asymptotics for orthogonal polynomials via Riemann–Hilbert methods (1)

The amazing fact, due to Gaudin and Mehta [14], is that the mean density ρN can be expressed in closed form in terms of the orthogonal polynomials {pj (·; N, t )}. (3.1)

(1) ρN (λ)

N −1 1 −N V (λ) X = e pk (λ)2 N k=0

(3.2)

h i γ (N ) 1 = e−N V p′N (λ) pN −1 (λ) − pN (λ) p′N −1 (λ) N(N−1) . N γN

The second equality above follows from the first because of the Christoffel-Darboux formula. (See, for example, formula (3.2.3) in [24].)

16

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN (1)

We obtain global asymptotics for ρN by carrying out to higher order the results of [6]-[8]. Deift, Kriecherbauer, McLaughlin, Venakides, and Zhou established very detailed Plancherel-Rotach type asymptotics for polynomials orthogonal with respect to e−N V (x) dx, under some very general assumptions on the function V , including the functions V considered here. In [7], the authors demonstrated that their method can be used to obtain a complete asymptotic expansion for the polynomials. We have carried this procedure out to higher order. (1) Using the global asymptotic expansion of ρN , together with (1.34), we deduce an asymptotic expansion for log ZN (t ). In this section we review the Riemann–Hilbert approach for computing and establishing a global, uniform asymptotic expansion for the orthogonal polynomials. In [6]-[8], the authors began with a matrix valued function Y (z), defined by R pN (s)e−N V (s) 1 1 ds (N ) pN (N ) s−z γN 2πi γN , z ∈ C\R. Y = (N ) R pN −1 (s) e−N V (s) (N ) ds −2πiγN −1 pN −1 −γN −1 s−z The matrix Y solves the following Riemann–Hilbert problem: • • • •

Y analytic in C\R, Y = I + O( 1z ) z N σ3 , Y has H¨ older continuous boundary values Y± for z ∈ R, −N V 1 e , for z ∈ R . Y+ = Y− 0 1

The authors then make two explicit transformations: Y → M → M1 . Here we will explain these two transformations. 3.1. Equilibrium measure and first transformation Y→ M. . A fundamental object in the theory of random matrices, as well as approximation theory, is the equilibrium measure, defined as follows: Z Z Z − V (λ)dµ(λ) + log |λ − µ| dµ(λ) dµ(η) . sup R Borel measures µ,µ≥0, dµ=1

There is a vast literature on this variational problem, originating in the work of Gauss (see [22]). Under general assumptions on V , the supremum is achieved at a unique measure µV , called the equilibrium measure. For the external field V , considered here, it is a well-known fact (see [5], or [13]) that the equilibrium measure is supported on finitely many intervals, with density that is analytic on the interior of each interval, behaving at worst like a square root at each endpoint. We remind the reader of the definition of the set T(T, γ): (3.3)

T(T, γ) = {t ∈ Rν : |t| ≤ T, tν > γ

ν−1 X j=1

|tj |}

The following theorem is perhaps well understood. A proof can be constructed by combining the results of [5] and [19]. Theorem 3.1. There is T0 > 0 and γ0 > 0 such that for all 0 < T < T0 and γ > γ0 , the following holds true: If t ∈ T(T, γ), then dµV = ψ dλ, p 1 ψ(λ) = χ(α,β) (λ) (λ − α)(β − λ) h(λ), 2π where h(λ) is a polynomial of degree ν − 2, which is strictly positive on the interval [α, β] (recall that the external field V is a polynomials of degree ν). The polynomial h is defined by I 1 ds V ′ (s) p p h(z) = 2πi (s − α) (s − β) s − z

where the integral is taken on a circle containing (α, β) and z in the interior, oriented counter-clockwise.

ASYMPTOTICS OF RMT PARTITION FUNCTION

17

The endpoints α and β are determined by the equations Z β V ′ (s) p ds = 0 (s − α)(β − s) α Z β sV ′ (s) p ds = 2π. (s − α)(β − s) α

The endpoints α(t ) and β(t ) are analytic functions of t which possess smooth extensions to the closure of T(T, γ), and satisfy −α(0) = β(0) = 2. In addition, the coefficients of the polynomial h(λ) are also analytic functions of t with smooth extensions to T(T, γ), with h(λ, t = 0) = 1. In this paper we will assume that t ∈ T(T, γ), for T small enough, and γ large enough, so that Theorem 3.1 holds true. In Section 4 we define Tβ and γβ (as well as Tα and γα ) so that if T < min{Tβ , Tα } and γ > max{γα , γβ } then t ∈ T(T, γ) implies more: the neighborhoods of z = β and z = α defined in this section can be taken so large that their intersection contains a subinterval of the real axis. We will not present a proof of Theorem 3.1 here, √ but the basic idea is as follows: for t = 0, the equilibrium measure is explicitly known, ψ(λ) = χ(−2,2) (λ) 4 − λ2 /(2π). Taking T small implies that the endpoints of the support Pν−1 cannot stray too far from ±2; taking tν larger than γ j=1 |tj | implies that h should be strictly positive on R. It will prove useful to adapt the following alternative representation for the function ψ: 1 R+ (λ)h(λ), λ ∈ (α, β), 2πi where the function R(λ) is defined via R(λ)2 = (λ−α)(λ−β), with R(λ) analytic in C\[α, β], and normalized so that R(λ) ∼ λ as λ → ∞. The subscript ± in R± (λ) denotes the boundary value obtained from the upper (lower) half plane. ψ(λ) =

(3.4)

Following [6], we define a function g(z) as follows, Z β g(z) = (3.5) log(z − s) ψ(s)ds,

z ∈ C\(−∞, β],

α

where for each s, log(z − s) is chosen to be branched along (−∞, s), log(z − s) > 0 if z > s. We now list several important properties of the function g(z): • 1 g is analytic for z ∈ C\(−∞, β], with continuous boundary values g± (z) on (−∞, β] . • 2 There is a constant ℓ such that for z ∈ [α, β], g+ + g− − V (z) = ℓ, and for z ∈ R\[α, β], Indeed, for z > β, (3.6)

g+ + g− − V < ℓ. g+ + g− − V − ℓ = 2g − V − ℓ = −

and for z < α, g+ + g− − V − ℓ = − • 3 For z ∈ [α, β], g+ − g− = 2πi

Z

Z

Z

z

Rhds,

β

z

Rhds.

α

β

ψ(s) ds,

z

and this function possesses an analytic continuation to a neighborhood of (α, β).

18

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

• 4 For z > β,

g+ − g− = 0,

and for z < α, g+ − g− = 2πi. Using the function g(z), and the constant ℓ, we define (cf. Theorem 5.57 in [7]) M (z) via ℓ

ℓ

Y (z) = eN 2 σ3 M (z) eN (g− 2 )σ3 ,

z ∈ C\R.

3.2. Second Transformation M→M1 . Next, we define (cf. Section 6 of [7]) a lens-shaped region around (α, β) (see Figure 3.7) .... ............................................................................. .............. ...........1 ........... ......... ......... ........ . . . . . . . ....... ..... . . ....... . . . . ...... .... . . . . . ...... ..... . ...... . . . ...... ... . . . . . ..... ..... ..... . . . 2 . ..... ....... ......... ..... ..... ..... ..... ..... . . . . ...... .... . ...... . . . . ...... ...... ...... ...... ....... ...... ....... ....... ........ 3 ........ . ......... . . . . . . . ........... ... ............... ........... ........................................................................... .....

Σ

Σ4 ....... ......

Σ

α

β

...... ......

Σ5

Σ

Figure 3.7. The contour ΣS . and define M1 as follows: • For z outside the upper and lower lenses, (3.8)

M1 = M. • For z within the upper lens,

(3.9)

M1 = M

1

−e−N (g+ −g− )

0 . 1

• For z in the lower lens, (3.10)

M1 = M

1

eN (g+ −g− )

0 . 1

(Recall that g+ − g− possesses an analytic continuation to such a lens-shaped region around (α, β).)

With these two transformations, we arrive at a matrix-valued function M1 , satisfying the following Riemann–Hilbert problem. The problem is to determine a 2 × 2 matrix valued function M1 satisfying (1.) (2.) (3.) (4.)

M1 analytic in C\ΣM1 . M1 = I + O( z1 ), z → ∞. M1 possesses continuous boundary values (M1 )± for z ∈ ΣM1 . (Jump relation) (M1 )+ = (M1 )− VM ,

where 1 eN (g+ +g− −V −ℓ) , for z ∈ Σ4 ∪ Σ5 , 0 1 1 0 , for z ∈ Σ1 , = e−N (g+ −g− ) 1 1 0 = , for z ∈ Σ3 , eN (g+ −g− ) 1 0 1 = , for z ∈ Σ2 , −1 0

(3.11)

VM =

(3.12)

VM

(3.13)

VM

(3.14)

VM

ASYMPTOTICS OF RMT PARTITION FUNCTION

19

3.3. The construction of a global approximation to M1 . The next step in the Riemann Hilbert ap(A) (A) proach is to construct an explicit approximation to M1 , which we will denote M1 . The definition of M1 β also is adapted directly from [6]-[8]. Let Bδα denote a disc of radius δ centered at α, and let Bδ denote a (A) disc of radius δ centered at β. We will define M1 outside Bδα ∪ Bδβ as follows: ! −1 −1 M1 (z) =

(3.16)

γ(z) =

γ−γ 2i γ+γ −1 2

γ+γ 2 γ−γ −1 −2i

(A)

(3.15)

,

1

(z − β) 4

1

(z − α) 4

.

(A)

To define M1 (z) for z within Bδβ , we require the following auxiliary function (3.17)

Φβ (z) ≡

3N 4

2/3

2/3

(−2g(z) + V (z) + ℓ)

z ∈ Bδβ .

,

As h(β) 6= 0, − (2g(z) − V (z) − ℓ) behaves like (z − β)3/2 for z near β (cf. relations (3.6)), and we may choose the branch so that Φβ (z) is analytic in a neighborhood of β, and (3.18) 2 Φβ (z) = c(z − β) + O (z − β) , c > 0, z → β.

Let the radius δ of the disc Bδβ be chosen sufficiently small so that Φβ maps Bδβ injectively onto a neighborhood D′ of 0. The decomposition of Dǫ,β into four regions is as in [8]: Dǫ,β = I ∪ II ∪ III ∪ IV, as shown in Figure 3.19 below. ................................. ........... ... ........ .......... ....... ...... ............. ...... ........... ..... ................ . .... . . ...... .... ... . . . ..... ... .. . . ... . . .... ... ... ... . ... ... .. . ... ... .. . ... ... .. .... .. .. ... ... ... .. ... .. .. ... ... ... ... .. . .... ... . .. .. ... . ... .. .. . . ... . .. . . . ... ... ... ... .. ... ... .. .. ... ... ... ... . . . . . . ... .. ... ... ..... .... ..... .... .... .......... .... ........... ..... . . . . . . . . . . .. .. .. ...... .............. ....... ....... .......... ..............................................

.... .............................. .... ....... ...... ... ..... .... .... .... .... ... ..... ... .... ... β ... ..... ... . . . . . . . . . . . . . . . ......... ... . .... ..... . . . . . . . . . . . . . ...... ... ... . ..... . ′ . .... ... .... ... ... .... .. ... ′ ..... .. ... .. ... .. .. ... ... ... . . .. ... . . .. ... .. . . . . .. ′ ...... .... ... ... .. .... ... .... ... ... ... .. .. ... ...... . ′ . ...... ... ... ... .... ... ... ... ..... ... .... ... . . . . . . . ..... . . ....... ..... .... ............................... ....

ζ = Φ (z)

I

II

β

III

IV

I

II

III

0

IV

D′

Dǫ,β Figure 3.19. Decompositions of Dǫ,β and D′ . 2π The four rays on the right of Figure 3.19 divide the ζ–plane into four sectors, 0 < arg(ζ) < 2π 3 , 3 < −2π −2π ′ arg(ζ) < π, −π < arg(ζ) < 3 and 3 < arg(ζ) < 0. The intersection of these sectors with D defines the regions I′ , II′ , III′ and IV′ . (The precise angles separating the sectors are not important: we could, for example, replace 2π 3 by any angle strictly between 0 and π, etc.) Finally, the regions I, II, III and IV are defined to be the pre–images under Φ(z) of I′ , II′ , III′ and IV′ . We define the contour γσ in the ζ-plane to be the four rays shown in Figure 3.19, with orientation inherited from the original contour ΣS and the mapping Φβ . We will need the following auxiliary functions in order to define the global approximation. Denote

(3.20)

ω := e

2πi 3

,

and define (3.21)

Ψσ : C \ γσ → C2×2 ,

20

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

πi Ai(ζ) Ai(ω 2 ζ) e− 6 σ3 , for ζ ∈ I, ′ 2 ′ 2 Ai (ζ) ω Ai (ω ζ) πi Ai(ζ) Ai(ω 2 ζ) 1 0 e− 6 σ3 , for ζ ∈ II, ′ 2 ′ 2 Ai (ζ) ω Ai (ω ζ) −1 1 σ (3.22) Ψ (ζ) = πi 1 0 Ai(ζ) −ω 2 Ai(ωζ) , for ζ ∈ III, e− 6 σ3 ′ ′ 1 1 Ai (ζ) −Ai (ωζ) πi Ai(ζ) −ω 2 Ai(ωζ) , for ζ ∈ IV. e− 6 σ3 ′ ′ Ai (ζ) −Ai (ωζ) 1 0 Here σ3 is the Pauli matrix . 0 −1 The next auxiliary quantity which we define is the analytic matrix valued function Eβ (z), defined as follows. √ iπ/6 γ −1 −γ σ /4 Eβ (z) = πe (3.23) Φβ 3 . −iγ −1 −iγ (At first blush, this matrix valued function is analytic on a domain which consists of a disc centered at z = β, with the real axis deleted. However, a straightforward argument (as in [7, Section 7]) shows that E extends to an analytic function on the disc Bδβ .) (A) We are now ready to define M1 within Bδβ :

(3.24)

3/2

(A)

M1 (z) = Eβ (z) Ψσ (Φβ (z)) e2σ3 Φβ

/3

,

for z ∈ Bδβ .

(A)

We now proceed to the definition of the approximation M1 (z) within Bδα . As the construction is (A) entirely analogous to the construction of M1 in Bδβ , we will only present the formulae. More details on this construction can be found in [7, Section 7] , or [8, Subsection 4.4]. We define the transformation Φα (z), analogous to Φβ defined in (3.17) above, 2/3 3N 2/3 Φα (z) ≡ (3.25) (2g(α) − V (α) − ℓ − (2g(z) − V (z) − ℓ)) , z ∈ Bδα . 4 As h(α) 6= 0, 2g(α) − V (α) − ℓ − (2g(z) − V (z) − ℓ) behaves like (z − α)3/2 for z near α (cf. relations (3.6)), and we may choose the branch so that Φα (z) is analytic in a neighborhood of α, and (3.26) 2 Φα (z) = −c(z − α) + O (z − α) , c > 0, z → α.

Next we define Eα (z) as follows:

√ Eα (z) = πeiπ/6

(3.27)

(A)

We now define the approximation M1 (3.28)

(A)

−γ −1 iγ −1

γ iγ

Φσα3 /4 .

within Bδα : 3/2

M1 (z) = Eα (z) Ψσ (Φα (z)) e2σ3 Φα

/3

σ3 ,

for z ∈ Bδα .

3.4. The Riemann–Hilbert problem for the error. The next step in the Riemann–Hilbert approach is (A) to define the ratio of M1 to M1 : −1 (A) S = M1 (z) M1 (z) (3.29) , z ∈ C\ΣM1 . It then follows that R(z) satisfies the following Riemann–Hilbert problem:

Problem 3.30. The problem is to determine a 2 × 2 matrix S(z) satisfying (a) S(z) analytic in C\ΣS , (b) S(z) possesses continuous boundary values S± (z) for z ∈ ΣS ,

ASYMPTOTICS OF RMT PARTITION FUNCTION

21

(c) S = I + O(1/z), z → ∞, (d) S+ = S− VS , z ∈ ΣS ,

where ΣS is defined in Figure 3.31. ΣS,5..................................

ΣS,1....... ......

........ . . ...... ........ . ..... ...... .... ..... ... .... ... ... . ... .. . ... ... .... .. ... .. ... ..... ... ... . ... ... ... .. α . ... . . . ... . ... ... ... ... .... ... ..... .... . . . ...... . ........ ..... ......................................

...... ......

...... .....

Σ

.............. . .. ................ .................. S,6 ...... ....... ..... ...... ..... .... . . . ... ... ... .. . ... ... .... .. ... .. ... ... ... ...... ... ... ... .. β . ... . . . ... . ... ... ... S,3 ......... ... .... ...... . . . . . ....... ....... .......... .............................

ΣS,2

Σ

..... .......

ΣS,4

ˆ S. Figure 3.31. The contour Σ The jump matrix VS is defined as follows: −1 1 eN (g+ +g− −V −ℓ) (A) (A) (3.32) , z ∈ ΣS,1 , M1 VS,1 = M1 0 1 −1 1 0 (A) (A) (3.33) , z ∈ ΣS,2 , M1 VS,2 = M1 −N (g+ −g− ) e 1 −1 1 0 (A) (A) (3.34) M1 , z ∈ ΣS,3 , VS,3 = M1 N (g+ −g− ) e 1 −1 1 eN (g+ +g− −V −ℓ) (A) (A) (3.35) , z ∈ ΣS,4 , M1 VS,4 = M1 0 1 −1 (A) (A) VS,5 = M1 M1 (3.36) , z ∈ ΣS,5 , − + −1 (A) (A) M1 (3.37) , z ∈ ΣS,6 . VS,6 = M1 −

+

The fact of the matter is that

1. On the upper lens, lower lens, and the real axis component of ΣS (3.38)

kVS − IkL∞ , kVS − IkL2 ≤ Ce−dN , C, d > 0. (A)

This can be deduced from (3.32)-(3.36), because (1) the global approximation M1 , as well as its inverse, is uniformly bounded on these portions of the contour, (2) the off-diagonal entries of the middle matrices on the right hand side of (3.32)-(3.36) are uniformly exponentially decaying in N on these portions of the contour, and (3) for z → ∞, z ∈ ΣS,1 ∪ ΣS,4 , one has eN (g+ +g− −V −ℓ) ≤ Ce−dN (|z|+1) (for the complete argument, see the proof of [7, Proposition 7.64]). 2. On the circle ΣS,6 , we have the following complete asymptotic expansion: (3.39)

1 β 1 V1 + 2 V2β + · · · N N 5(z − α)1/2 −1 i R = z i 1 72(z − β)1/2 β R(s)h(s)ds 7(z − β)1/2 1 i R + , z i −1 72(z − α)1/2 β R(s)h(s)ds Z z −2 35 −1 12i R(s)h(s)ds . = −12i −1 2592 β

VS,6 = I +

(3.40)

V1β

(3.41)

V2β

More generally, we have for k even, k ≥ 2: Z z −k 1 β Vk = (3.42) R(s)h(s)ds 2 β

tk +sk 2 −i(sk −tk ) 2

i(sk −tk ) 2 tk +sk 2

!

,

22

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

and for k odd, k ≥ 1: Vkβ =

(3.43)

2k−1 tk (z − α)1/2 R k z (z − β)1/2 β R(s)h(s)ds

+ where (3.44)

s0

=

(3.45)

sk

=

2k−1 sk (z − β)1/2 R k z (z − α)1/2 β R(s)h(s)ds

−1 i i 1

1 i

i −1

,

t0 = 1, Γ(3k + 12 ) 6k + 1 1 , tk = − 6k − 1 sk for k ≥ 1, k 54 k!Γ(k + 2 )

3. On the circle ∂Bδα , we have the following complete asymptotic expansion: (3.46)

1 1 α V + 2 V2α + · · · N 1 N 5(z − β)1/2 −1 −i Rz = + −i 1 72(z − α)1/2 α R(s)h(s)ds 7(z − α)1/2 1 −i Rz , + −i −1 72(z − β)1/2 α R(s)h(s)ds Z z −2 35 −1 −12i = R(s)h(s)ds . 12i −1 2592 α

VS,5 = I +

(3.47)

V1α

(3.48)

V2α

More generally, we have for k even, k ≥ 2, (3.49)

Vkα = R z α

2k−1 R(s)h(s)ds

and for k odd, k ≥ 1, we have (3.50)

Vkα =

k

s k + tk i(tk − sk ) i(sk − tk ) s k + tk

2k−1 sk (z − β)1/2 Rz k (z − α)1/2 α R(s)h(s)ds

+

2k−1 tk (z − α)1/2 k Rz (z − β)1/2 α R(s)h(s)ds

−1 −i −i 1

−1 i i 1

,

,

The reader may verify these asymptotic expansions using the definitions (3.36)-(3.37) of VS , the definitions (A) (3.24) and (3.28) of M1 , together with the well-known asymptotic expansions for the Airy function and its derivative. In [7], the authors present a complete proof of this fact (see, Lemma 7.34 and its proof), and we leave the reader to carry out the analogous arguments in the present case. 3.5. The solution S of the Riemann–Hilbert problem 3.30 and its asymptotic expansion. In this subsection we will present a formula for the solution S of the Riemann–Hilbert problem 3.30, as well as an asymptotic expansion for S in powers of N −1 . To do so, we will require the integral operators C± , defined as follows: (3.51)

C± : L2 (ΣS ) → L2 (ΣS ),

(3.52)

C± (f )(z) = z ′ →z, z∈

lim ± side of

ΣS

1 2πi

Z

ΣS

f (s) ds, z ∈ ΣS . s − z′

The relevant integral operator CVS : L2 (ΣS ) → L2 (ΣS ) is defined via (3.53)

CVS (f ) = C− [f (VS − I)] .

ASYMPTOTICS OF RMT PARTITION FUNCTION

23

The asymptotic expansions described in (3.39)-(3.48), together with the estimates (3.38), and the well known boundedness of the integral operators C± imply that the integral operator CVS is bounded, with operator norm satisfying (3.54)

kCVS kL2 (ΣS )→L2 (ΣS ) ≤

C . N

This implies that I − CVS can be inverted by Neumann series for N sufficiently large. Therefore, we may define (3.55)

µS = (I − CVS )−1 CVS (I).

Then, as in [7, Theorem 7.70], the explicit formula for the solution S to the Riemann–Hilbert problem (3.30) is Z 1 (I + µS ) (VS − I) S(z) = I + (3.56) ds, z ∈ C \ ΣS . 2πi ΣS s−z Furthermore, as shown in Corollary 7.77 and Theorem 7.81 in [7], S is uniformly bounded in C \ ΣS , and possesses a complete asymptotic expansion in powers of N −1 (in Section 7 of [7], the error matrix is called R(z), whereas here the error matrix is called S). The terms in the asymptotic expansion may be obtained in a number of ways. For example, one may just compute the Neumann expansion of µS , and keep only those terms which arise due to integrations around the circles ∂Bδα and ∂Bδβ . Alternatively, one may posit an asymptotic expansion for S in powers of N −1 , plug this expansion into the Riemann–Hilbert problem 3.30, and obtain a sequence of Riemann–Hilbert problems for the coefficients in the expansion, which may be solved iteratively. The proof of Theorem 7.81 (l) in [7] involves (1) defining an integral operator CVS associated only to the circles ∂Bδα and ∂Bδβ , using only the first l terms in the expansion of VS on these circles, (2) building an explicit approximation Sl (z) by −1 (l) , and (3) comparing this approximation to the using the first l terms in a Neumann series for I − CVS true solution S(z). The ensuing Riemann–Hilbert problem for the error is shown to have a solution which is uniformly bounded by the first neglected term in the asymptotic expansion, etc. The result of these calculations is the following asymptotic expansion for the solution S:

(3.57)

S(z) ∼ I +

∞ X

N −j Sj (z),

j=1

where Sj (z) is piecewise analytic, and can be defined iteratively via the following sequence of additive Riemann–Hilbert problems. Problem 3.58. The first problem is to determine a 2 × 2 matrix S1 (z) satisfying (a) (b) (c) (d)

S1 (z) analytic in C\(∂Bδα ∪ ∂Bδβ ), S1 (z) possesses continuous boundary values (S1 )± (z) for z ∈ ∂Bδα ∪ ∂Bδβ , S1 = O(1/z), z → ∞, (S1 )+ − (S1 )− = V1 , z ∈ ∂Bδα ∪ ∂Bδβ ,

Problem 3.59. Having determined S1 , we now determine Sk , k ≥ 2 satisfying (a) (b) (c) (d)

Sk (z) analytic in C\(∂Bδα ∪ ∂Bδβ ), Sk (z) possesses continuous boundary values (Sk )± (z) for z ∈ ∂Bδα ∪ ∂Bδβ , Sk = O(1/z), z → ∞, Pk−1 (Sk )+ − (Sk )− = Vk + j=1 (Sj )− Vk−j , z ∈ ∂Bδα ∪ ∂Bδβ .

Each of these Riemann–Hilbert problems possesses a unique solution, explicitly representable by contour integration. It is interesting and useful to note that in fact each of these contour integral representations can be evaluated explicitly. Thus, for example, we include an explicit representation for S1 (z) in Appendix A.

24

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

Some very important properties of the sequence {Sk }k≥0 are established in the following Lemma. We will need the Pauli matrices 1 0 0 −i 0 1 σ3 = , σ2 = , σ1 = (3.60) . 0 −1 i 0 1 0 Lemma 3.2. For each k ∈ Z≥0 , there are complex valued functions sk (z) so that the following holds.

1. For k even, the function Sk (z), defined to be the unique solution to the Riemann-Hilbert problem 3.59 satisfies the symmetry conditions (1)

(3.61)

(2)

Sk (z) = sk (z)I + sk (z)σ2 .

2. For k odd, the function Sk satisfies the symmetry conditions (1)

(3.62)

(2)

Sk (z) = sk (z)σ3 + sk (z)σ1 . (j)

The functions sk (z), j = 1, 2, are piecewise analytic functions of z, explicitly computable in terms of the parameters t. In words: for k odd, Sk (z), is a symmetric, trace 0 matrix. For k even, Sk is the sum of a multiple of the identity matrix, and a skew-symmetric matrix. Proof. For k = 1, the Lemma is seen to be true by studying the solution to the Riemann-Hilbert problem 3.58: Z V1 (s) 1 (3.63) ds, S1 (z) = 2πi s−z

where the integral is taken along the boundaries of the discs Bδα and Bδβ , oriented clockwise. Since V1 , as defined in (3.40) and (3.47) is clearly symmetric trace zero, S1 inherits the same property. We now argue inductively. Suppose that k is even, and the Lemma holds true up to k − 1. The reader may verify that the right hand side of the jump condition (d) in the Riemann–Hilbert problem 3.59 is of the form (1)

(3.64)

(2)

νk (z)I + νk (z)σ2 , (j)

where νk (z), j = 1, 2, are scalar complex valued functions of z. Indeed, for k even, Vk (z), as defined in (3.42) and (3.49) are of this form. Moreover, each term appearing in the sum on the right hand side of the jump condition (d) in the Riemann–Hilbert problem 3.59 is also of the same form (this can be deduced from the form of Sj and Vk−j for each value of j ∈ {1, . . . , k − 1}, given that k is even). There is an explicit formula for the solution to this additive Riemann–Hilbert problem, which is given by the Cauchy transform of the right hand side of jump condition (d). Since every term is of the form (3.64), the Cauchy transform is also of this form, and so (3.61) holds true for k even. The argument for k odd follows the same line of reasoning, and we leave the details to the reader. At this point we have established the following formula for the solution Y to the original Riemann–Hilbert problem stated just before Subsection 2.1: (3.65)

(A)

Y (z) = eN ℓσ3 /2 S(z)M1 (z)T (z)eN (g(z)−ℓ/2)σ3 ,

where ℓ is the Lagrange multiplier associated to the variational problem, S(z) is the solution to the Riemann– (A) Hilbert problem 3.30 for the error, M1 (z) is the explicit approximation defined in (3.15), (3.24), and (3.28), T (z) is either the identity matrix I for z outside the lens shaped regions, or one of two explicit triangular factors appearing in (3.9) and (3.10), and g(z) is the function defined in (3.5). It is straightforward to verify that with the exception of S(z), all terms appearing in (3.65) depend analytically on the times t for t in any open subset of T(T, γ), and in fact extend as infinitely differentiable functions to all of T(T, γ). It is also true that the function S(z) enjoys the same analyticity properties. This is made precise in the following Theorem.

ASYMPTOTICS OF RMT PARTITION FUNCTION

25

Theorem 3.3. The matrix valued function S is infinitely differentiable in the times t for t ∈ T(T, γ), and derivatives of S again possess an asymptotic expansion in N , obtained by differentiating the original asymptotic expansion for S. The coefficients in this asymptotic expansion depend analytically on t for t ∈ T(T, γ) (with smooth extension to the closure), for T sufficiently small. Proof. The proof hinges on the following fundamental facts: the jump matrix VS is analytic in a vicinity of every point z on the contour ΣS , it possesses an asymptotic expansion in powers of N −1 in which each term is a piecewise analytic function of z and depends analytically on t for t ∈ T(T, γ); this asymptotic expansion may be differentiated term by term with respect to the times t ∈ T(T, γ), yielding asymptotic expansions for arbitrary derivatives of VS . From this information, it is straightforward to prove that µS defined in (3.55) is an analytic function of t for t ∈ T(T, γ), has an analytic continuation to a neighborhood of the contour ΣS in the z-variable, and possesses an asymptotic expansion (which can be differentiated term by term) obtained directly from a Neumann series representation. An outline of the argument is as follows. First, observe that the terms in the Neumann series representation of µS are individually analytic functions of z in a vicinity of every point of the contour ΣS , and they are analytic function of t for t ∈ T(T, γ). Second, the series is uniformly convergent. This follows because (1) each Neumann iterate can be expressed as an integral on a deformed contour which is bounded away from the contour ΣS and (2) the j-th iterate may then be bounded by C(D/N )j , where the constants C and D are independent of j. For derivatives of µS , similar calculations, using the fact that derivatives of VS possess asymptotic expansions, show that an Lth ˜ L (D/N ˜ )j , where C˜ and D ˜ are independent of j, order derivative of the jth iterate may be bounded by Cj but may depend on L. This shows that the Neumann series for µS may be differentiated term by term. The proof that derivatives of S possess expansions which may be obtained by differentiating the original expansion for S term by term now follows from the uniform convergence of the Neumann series for µS and its derivatives.

4. The mean density of eigenvalues: exact formula and asymptotics The previous section explains (and extends to higher orders) the work in [6]-[8], in which techniques for the asymptotic analysis of Riemann-Hilbert problems, originally developed for the analysis of singular limits of integrable partial differential equations by Deift and Zhou (and further developed by many researchers), are used to establish an asymptotic description for the polynomials pN (z) and pN −1 (z) orthogonal with respect to the N -dependent measure (1.23). There are many consequences of the complete asymptotic description for the orthogonal polynomials. For a number of such applications, we refer the reader to [6]-[8], where detailed asymptotic expansions for (1) the leading coefficients of of the polynomials, (2) the recurrence coefficients, (3) the zeros of the polynomials were obtained, along with a proof of universality of spacings of eigenvalues of random matrices for a wide class of unitarily invariant probability measures on Hermitian matrices. In this section our goal is to establish formula (4.4), and prove that this formula for the mean density of eigenvalues holds true for z in a fixed sized neighborhood of [z ∗ , β] for N sufficiently large. The parameter z ∗ will be chosen below. The formula (4.4) holds true in a large neighborhood containing the point β, and there is an analogous formula, (4.15) which holds true in a fixed size neighborhood of the interval [α, z ∗ ], and the two formulae hold simultaneously on an overlap region. In order to achieve this overlap region, we will need to introduce Tβ , γβ , Tα , and γα , which are values of T and γ from Theorem 3.1 so that if T < min{Tβ , Tα } and γ > max{γβ , γα }, then the neighborhoods Dǫ,β and Dǫ,α may be taken large enough to have nontrivial overlap. Using formula (4.4) we will obtain a complete asymptotic expansion for the mean density of eigenvalues, and then in the following section we will evaluate an asymptotic expansion of integrals of the form (4.1)

Z

R

(1)

f (λ)ρN (λ)dλ,

for general C ∞ functions that grow no worse than polynomial at ∞. We begin with two important observations.

26

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

Observation 1: It is possible to use the results of the previous section to compute an asymptotic (1) expansion for the mean density ρN which is valid for all λ ∈ (α, β). That expansion is as follows, ( Z ) β 1 1 1 (1) cos N (4.2) ψ(s)ds − ρN (λ) = ψ(λ) + 4πN λ − β λ−α λ " ( Z )# β 1 + 2 H(λ) + G(λ) sin N ψ(s)ds + ··· N λ in which H(λ) and G(λ) are locally analytic functions which are explicitly computable in terms of the original external field V (λ). However, for the computation of integrals of the form (4.1), this expansion provides a piece of the puzzle, but clearly cannot be used in a vicinity of the endpoints α and β. Indeed, the asymptotic expansion fails in a vicinity of these endpoints, because the second term in (4.2) possesses poles, whereas (1) the mean density ρN does not. From this observation we see that to compute asymptotic expansions of (1) integrals of the form (4.1), we will need to to have an asymptotic expansion for ρN which is valid for λ near these endpoints. It is a piece of good fortune that the representations which we obtain are actually valid on regions which cover the entire interval [α, β], and we will not need to evaluate integrals “in the bulk”. (1) Observation 2: It is straightforward to use the results of the preceding section to prove that ρN (λ) is exponentially small (in N ), and exponentially decaying (in λ) for λ ∈ R \ (α − δ, β + δ), for any fixed δ > 0. We will not present the details of those calculations, but leave them to the avid reader. The implication of this is that the contribution to an integral of the form (4.1) from the set R\(α−δ, β +δ) is exponentially small in N , and hence negligible to all orders in N . Therefore we must only compute an asymptotic expansion for integrals of the form Z β+δ (1) (4.3) f (λ)ρN (λ)dλ, α−δ

∞

in which the allowable functions f are C smooth, and compactly supported within (α − δ, β + δ). (1) We now turn to the formula (3.1) for ρN , and re-express this fundamental quantity using the Riemann– (1) (1,α) (1,β) Hilbert analysis of the previous section. We present two functions, ρN and ρN representing ρN ; the first (1) one is a valid representation for ρN in an interval containing z = β, and the other, in an interval containing z = α. The first such formula is the following explicit, exact expression: ′ Φβ (z) γ ′ (z) (1,β) (4.4) [2 Ai (Φβ (z)) Ai′ (Φβ (z))] − N ρN (z) = 4Φβ (z) γ(z) 2 2 ′ ′ +Φβ (z) Ai (Φβ (z)) − Φβ (z) Ai (Φβ (z)) +

i h ′ S B Ψ (Φβ (z)) S B Ψ (Φβ (z)) 2 11 21 i ′ − S B Ψ (Φβ (z)) S B Ψ (Φβ (z)) , 11

where (4.5)

Ai(ζ) ′ Ai (ζ) Ψ(ζ) = Ai(ζ) Ai′ (ζ)

Ai(ω 2 ζ) ω 2 Ai′ (ω 2 ζ) −ω 2 Ai(ωζ) −Ai′ (ωζ)

21

, for ζ ∈ C+ , , for ζ ∈ C− .

The transformation Φβ (z) was defined in (3.17), γ(z) was defined in (3.16), and the matrix B is defined by γ −1 (z) −γ(z) B(z) = (4.6) Φβ (z)σ3 /4 , −iγ −1 (z) −iγ(z) and S(z), defined in (3.29), is the solution to the Riemann–Hilbert problem 3.30 for the error, which possesses a complete asymptotic expansion (3.57), with coefficients Sk solving the Riemann–Hilbert problems 3.58 and 3.59, and satisfying the symmetry conditions described in Lemma 3.2.

ASYMPTOTICS OF RMT PARTITION FUNCTION

27

(1)

Shortly we will present an analogous representation of ρN near the left endpoint α. The following lemma will be instrumental in describing the relation between these two representations as well as their respective domains of validity. Lemma 4.1. There is a unique point z ∗ in the interval (α, β) at which (Φβ (z ∗ )) = (Φα (z ∗ )) Proof. It follows from formulas (3.17), (3.25) and (3.6) that for z < β, Z β 3N R+ (4.7) (−Φβ (z))3/2 = hds; 4 i z and for z > α,

(−Φα (z))3/2 =

(4.8)

Z

3N 4

z

α

R+ hds. i

It then follows from comparison to (3.4) that the integrals in (4.8) and (4.7) are both positive. By construction (see (3.18) and (3.26)) we know that Φβ (z) and Φα (z) are negative real for α < z < β. The z ∗ we seek must satisfy Z

z∗

α

We already know that Z

z

Rhds +

α

Rhds ± Z

Z

β

Rhds = 0.

z∗

β

Rhds = z

Z

β

Rhds = 2πi.

α

It follows that z ∗ is uniquely determined, equivalently, by either of the two equations: Z z∗ Z β Rhds = πi = Rhds α

z∗

Lemma 4.2. There is a Tβ > 0 sufficiently small and γβ sufficiently large (both independent of N ) so that for t ∈ T(Tβ , γβ ), there exists a complex neighborhood Bβ of the interval [z ∗ , 2], independent of N , so that formula (4.4) holds true for all z ∈ Bβ . Proof. The proof is a straightforward, though lengthy algebraic manipulation of the explicit relationships between the original quantity Y (z), and the error matrix S(z). The only analytical issue is this: is the transformation Φβ (z) an invertible analytic transformation from some fixed size neighborhood of the interval [z ∗ , 2] into its range, for t sufficiently small? But this is clear, because for t = 0, the function Φβ is quite simple, 2/3 Z √ 3N z √ . s − 2 s + 2 ds Φβ (z)|t=0 = 4 2 The reader may easily verify that there exists a branch of this function which is analytic on a fixed open neighborhood of the interval (−2, 2]. Now since Φβ (z) depends analytically on t, it is clear that Φβ (z) is certainly an invertible analytic transformation from some fixed size neighborhood of [0, 2] into its range. (N ) The reader may verify that formula (4.4) is true, by starting with the formula (3.1) for ρ1 , and reexpressing this formula in terms of the solution Y of the original Riemann–Hilbert problem

e−N V (z) ′ ′ [Y (z)Y21 (z) − Y11 (z)Y21 (z)] . −2πiN 11 Next, observe that for z ∈ C± ∩ {lens shaped region in Figure 3.7} , we have the following representation for the solution Y of the original Riemann–Hilbert problem: (N )

(4.9)

ρ1 (z) =

Y (z) = e (4.10)

Nℓ 2 σ3

σ

S(z) Eβ (z) Ψ (Φβ (z))e =e

nℓ 2 σ3

3/2 2 3 σ3 Φβ (z)

1 ±e∓N (g+ −g− )

N S(z) Eβ (z) Ψ(Φβ (z)) e( 2 V (z)−πi/6)σ3 .

0 1

ℓ

eN (g− 2 )σ3

28

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

Here Eβ (z) was defined in (3.23), and is related to the matrix valued function B(z) defined in (4.6) via Eβ (z) =

(4.11)

√

πeiπ/6 B(z).

The simplification in (4.10) follows from the identity (4.12)

1 0 ∓1 1

2

e 3 σ3 Φβ (z)

3/2

1

0 1

±e∓N (g+ −g− )

ℓ

N

eN (g− 2 )σ3 = e 2 V (z)σ3 ,

which can be deduced from the properties of g(z) and Φβ (z). Next, from the definition (4.6), one easily obtains the identity ′

B (z) =

(4.13)

Φ′β (z) γ ′ (z) − 4Φβ (z) γ(z)

B(z)σ3 .

The following identity for Ψ is also equally easy to prove, using the definition (4.5) and the differential equation satisfied by the Airy function: 0 1 Ψ′ (ζ) = (4.14) Ψ(ζ). ζ 0 Formula (4.4) may now be verified by differentiating (4.10), substituting into (4.9) and using the differential relations (4.13) and (4.14). Formula (4.4) may seem unwieldy due to its length. However, this is not quite the case. Indeed, the first two lines of this formula do not contain S(z) at all, and are explicit combinations of Airy functions (composed with Φβ (z)) together with other functions defined explicitly in Section 3. Moreover, we will show that the third and fourth line of (4.4) possess asymptotic expansions in powers of N −1 in which each term is of the same explicit form as the first two lines. This is the content of Lemma 4.4 below. There is, of course, an analogous formula which is valid on a fixed size complex neighborhood of the interval [−2, z ∗ ]. We summarize the analogous result in the following Lemma. Lemma 4.3. There is Tα > 0 sufficiently small and γα sufficiently large (both independent of N ) so that for t ∈ T(Tα , γα ), there exists a complex neighborhood of Bα of the interval [−2, z ∗ ], independent of N , so that the formula (4.15) holds true for all z ∈ Bα . (4.15)

(1,α)

N ρN

γ ′ (z) Φ′α (z) [2 Ai (Φα (z)) Ai′ (Φα (z))] + 4Φα (z) γ(z) 2 2 −Φ′α (z) Ai′ (Φα (z)) − Φα (z) Ai (Φα (z))

(z) = −

+

i h ′ S B Ψ (Φα (z)) S B Ψ (Φα (z)) 2 11 21 i ′ − S B Ψ (Φα (z)) S B Ψ (Φα (z)) , 11

where in this case (4.16)

B(z) =

γ(z) −γ −1 (z) iγ(z) iγ −1 (z) (1)

21

Φα (z)σ3 /4 .

Next, we will compute an asymptotic expansion for ρN , by using formulae (4.4), (4.15), and the asymptotic expansion for S(z) described in Section 3.

ASYMPTOTICS OF RMT PARTITION FUNCTION

29

Lemma 4.4. If t ∈ T(Tβ , γβ ), then there is a fixed size neighborhood of the interval [z ∗ , β], the following asymptotic expansion holds true: i h ′ S B Ψ (Φβ (z)) S B Ψ (Φβ (z)) (4.17) 2N 11 21 i − S B Ψ (Φβ (z)) S ′ B Ψ (Φβ (z)) 11 21 p X Φ β = N −j a ˜j (z)Ψ211 (Φβ ) γ(z)2 j even, j≥2 X Ψ2 (Φβ (z))γ(z)2 + N −j ˜bj (z) 21 p Φβ (z) j even, j≥2 ∞ X + N −j c˜j (z)Ψ11 (Φβ (z))Ψ21 (Φβ (z)), j odd, j≥3 where for each j, the coefficient functions a ˜j (z), ˜bj (z), and c˜j (z) are jointly analytic in z and t, for z in a fixed sized complex neighborhood of the interval [z ∗ , β], and for t ∈ T(Tβ , γβ ). Proof. From Lemma 3.2, we have an asymptotic expansion for the function S(z): X (1) (2) S(z) = I + sk (z)σ3 + sk (z)σ1 N −k (4.18) k odd, k≥1 X (1) (2) + sk (z)I + sk (z)σ2 N −k , k even, k≥2 (j)

in which sk (z) are functions of z that are piecewise analytic functions of z, which are, in particular, analytic on a fixed size neighborhood of the interval [0, β], and depend analytically on t for t ∈ T(Tβ , γβ ). An asymptotic expansion for S ′ (z) is obtained by differentiating (4.18) term by term. This, together with the explicit formula (4.6) for B(z), may be substituted into the left hand side of (4.17). Now straightforward algebraic manipulation yields an asymptotic expansion of the form displayed in the right hand side of (4.17). The quantities a ˜j and ˜bj may be computed via these calculations, but all that we will require is that these functions are analytic in a neighborhood of [0, β], and depend analytically on t for t ∈ T(Tβ , γβ ), which is manifestly true. There is, of course, an analogous result which holds for the interval [α − δ, z ∗ ], which we will only state, as the proof follows by the same arguments as the proof of Lemma 4.4 Lemma 4.5. If t ∈ T(Tα , γα ), then there is a fixed size neighborhood of the interval [α, z ∗ ], on which the following asymptotic expansion holds true: i h ′ S B Ψ (Φα (z)) S B Ψ (Φα (z)) (4.19) 2N 11 21 i − S B Ψ (Φα (z)) S ′ B Ψ (Φα (z)) 11 21 X p = N −j a ˜j (z)Ψ211 (Φα )γ(z)2 Φα j even, j≥2 X Ψ2 (Φα (z)) + N −j ˜bj (z) 21 p γ(z)2 Φα (z) j even, j≥2 ∞ X + N −j c˜j (z)Ψ11 (Φα (z))Ψ21 (Φα (z)), j odd, j≥3 where for each j, the coefficient functions a ˜j (z), ˜bj (z), and c˜j (z) are jointly analytic in z and t, for z in a fixed size complex neighborhood of the interval [α, z ∗ ], and for t ∈ T(Tα , γα ).

30

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

Remark: Observe that if we take T < min{Tβ , Tα } and γ > max{γβ , γα } then the conclusions of Lemmas 4.2, 4.3, 4.4, and 4.5 hold true simultaneously. From now on we will take t ∈ T(T, γ) for such values of T and γ.

5. Proof of the Main Theorem We are now in a position to analyze the structure of the fundamental moments (1.33) which will enable us to establish the 1/N 2 expansion of log ZN . To do this we will be using the representations of the one-point function developed in the previous section. Precisely, we use (1,α)

(1)

ρN (z) = χα (z)ρN

(5.1)

(1,β)

+ χβ (z)ρN

where {χα , χβ } is a partition of unity for R defined by (5.2)

χβ (z) 0 ≤ χβ (z)

is ≤

C ∞ with 1

suppχβ ⊂ (z ∗ − ǫ, ∞) for z ∈ (z ∗ + ǫ, ∞). χβ (z) ≡ 1

We then define χα by χα (z) = 1 − χβ (z) which has similar properties to χβ but with support in (−∞, z ∗ + ǫ) (1) The expression (5.1) is merely a different representation of the one-point function ρN , and the partition of (1,α) (1,β) unity allows us to carry out our asymptotic analysis separately on χα (z)ρN (z) in Bα and on χβ (z)ρN (z) in Bβ , and then, at the end, to add the two contributions together. This partition of unity will prove especially useful in avoiding the evaluation of boundary terms during repeated integrations by parts. Because of the complete similarity of the analysis for each of these separate pieces it will suffice to demonstrate our claims (1,β) for χβ (z)ρN (z). We now begin the analysis of integrals of the form (5.3)

Z

β+δ

α−δ

(1)

f (λ)ρN (λ)dλ =

Z

z ∗ +ǫ

α−δ

(1)

χα (λ)ρN (λ)dλ +

Z

β+δ

z ∗ −ǫ

(1)

χβ (λ)ρN (λ)dλ.

(Recall from Observation 2 and formula (4.3) that we need only consider integrals over the bounded set (α − δ, β + δ) for some sufficiently small (but independent of N ) δ > 0.) We will prove that if the function f is C ∞ smooth and compactly supported within (α − δ, β + δ), the second integral in (5.3) above possesses an asymptotic expansion in even powers of N : Z β+δ (1) (5.4) χβ (λ)ρN (λ)dλ = f0 + N −2 f1 + N −4 f2 + · · · . z ∗ −ǫ

As we have explained, this will complete the proof that (5.5)

1 ∂ 1 log ZN (t) = e˜0 (t) + 2 e˜1 (t) + · · · 2 ∂tℓ N N

i.e. that ∂tℓ log ZN possesses a complete asymptotic expansion in even powers of N . Since this asymptotic expansion is uniformly valid for all t ∈ T(T, γ), we may integrate (5.5) from t = 0, and thus we will complete the proof of Theorem 1.1. From the analysis of the previous section, in particular lemma 4.4, one observes that the terms appearing R β+δ (1,β) in an expression of the form z∗ −ǫ λℓ χβ (λ)ρN (λ) are of one of the following four types of integrals:

ASYMPTOTICS OF RMT PARTITION FUNCTION

1 N

′

(0 ) (1′ )

Z

N −j

β+δ

31

g(z)F0 (Φβ )Φ′β dz,

z ∗ −ǫ Z β+δ

g(z)Ai(Φβ )Ai′ (Φβ )dz (j odd), p Z β+δ Φβ 2 ′ −j 1/3−j (2 ) N g(z) Ai (Φβ )dz = N g˜(z)Ai2 (Φβ )dz ( j even), γ(z)2 z ∗ −ǫ z ∗ −ǫ Z β+δ Z β+δ γ(z)2 (3′ ) N −j g(z) p [Ai′ ]2 (Φβ )dz = N −1/3−j g˜(z)[Ai′ ]2 (Φβ )dz, (j even), Φβ z ∗ −ǫ z ∗ −ǫ z ∗ −ǫ Z β+δ

where g(z) and g˜(z) are general infinitely differentiable functions of z, and are compactly supported within (z ∗ − ǫ, β + δ). The function F0 appearing in (0’) above is defined by F0 (ζ) := [Ai′ ]2 (ζ) − ζAi2 (ζ).

(5.6)

The main result would be established if we could show that all of these quantities possess asymptotic expansions in even powers of N . We therefore must analyze the following four quantities: 1 N

(0) (2)

N

Z

β+δ

g(z)F0 (Φβ )Φ′β dz,

(1)

g˜(z)Ai2 (Φβ )dz,

(3)

z ∗ −ǫ Z β+δ 1/3

Z

β+δ

g(z)Ai(Φβ )Ai′ (Φβ )dz,

z ∗ −ǫ

N −1/3

z ∗ −ǫ

Z

β+δ

g˜(z)[Ai′ ]2 (Φβ )dz,

z ∗ −ǫ

and prove the following statements true: (0), (2), and (3) have asymptotic expansions in even powers of N. (1) has an asymptotic expansion in odd powers of N. In fact, once we show that integrals of the form (0) have asymptotic expansions in even powers of N , the following three basic observations take care of the remaining types of integrals. Observation 1: (1) has an asymptotic expansion in odd powers of N if and only if (2) has an asymptotic expansion in even powers of N:

2

Z

β+δ

z ∗ −ǫ

′

gAi(Φβ )Ai (Φβ )dz

= −

Z

β+δ

z ∗ −ǫ

1 = − N

Z

"

g Φ′β

#′

Ai2 (Φβ )dz

β+δ

N 1/3 z ∗ −ǫ

"

g φ′β

#′

Ai2 (Φβ )dz

where in the first equality we’ve integrated by parts. (No boundary terms are present as the integrand is compactly supported within (z ∗ − ǫ, β + δ).) We now observe that Φ′β (z) is analytic and nonvanishing throughout the region of integration so that the integral is well-defined. Lastly, the notation φ′β (z) := i′ h N −2/3 Φ′β (z) defines an analytic, nonvanishing function which is independent of N . The quantity g/φ′β is

a new infinitely differentiable function of z, compactly supported within (z ∗ − ǫ, β + δ), and we have shown that integrals of the form (2) possess asymptotic expansions in even powers of N if and only if integrals of the form (1) possess expansions in odd powers of N . Observation 2: Integrals of the form (2) have asymptotic expansions in even powers of N if and only if integrals of the form (0) have asymptotic expansions in even powers of N:

32

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

N 1/3

Z

β+δ

gAi2 (Φβ )dz

β+δ

g 2 ′ Ai (Φβ )dΦβ z ∗ −ǫ Φβ " #′ Z 1 β+δ g 1 F0 (Φβ )Φ′β dz N z∗ −ǫ φ′β φ′β

N 1/3

=

z ∗ −ǫ

=

Z

where once again we have integrated by hparts iin′ the second equality. Now we have arrived at an integral of ′ the form (0), since the quantity 1/φβ g/φ′β is infinitely differentiable on [z ∗ − ǫ, β + δ]. Observation 3: Finally, if integrals of the forms (0) and (1) respectively have even and odd asymptotic expansions, then integrals of the form (3) have even asymptotic expansions:

N

−1/3

Z

β+δ

g[Ai′ ]2 (Φβ )dz

=

z ∗ −ǫ

#′ g 2 1 −N { Ai(Φβ )Ai′ (Φβ ) + Φβ F0 (Φβ )}dz ′ φβ 3 3 z ∗ −ǫ Z β+δ " #′ g 2 Ai(Φβ )Ai′ (Φβ )dz = − N −1 3 φ′β z ∗ −ǫ " #′ Z φβ 1 −1 β+δ g F0 (Φβ )Φ′β dz. − N ′ 3 φ φ′β ∗ z −ǫ β −1

Z

β+δ

"

There is an integration by parts in the first equation. The two terms in the last equation are integrals of the form (1) and (0), respectively, and this establishes our third observation. We turn now to the heart of the matter. We will give an inductive proof that (5.7)

1 N

Z

β+δ

z ∗ −ǫ

g(z)F0 (Φβ )Φ′β dz

has an asymptotic expansion in even powers of N . We will integrate by parts repeatedly, peeling off contributing factors as we go along. The proof proceeds in four steps. The first three steps involve setting up an integration by parts inductive argument. Step 1: Show that the function F0 , which is analytic in ζ, possesses the following asymptotic expansion for ζ → −∞: p (5.8) F0 (ζ) = −ζ c0 + c1 (−ζ)−3 + c2 (−ζ)−6 · · · p 4 3/2 −3 −6 −9 (−ζ) + −ζ d0 (−ζ) + d1 (−ζ) + d2 (−ζ) + · · · sin 3 4 −1 −4 −7 3/2 + f0 (−ζ) + f1 (−ζ) + f2 (−ζ) + · · · cos . (−ζ) 3 Step 2: Show that Step 1 implies that there are functions G1 (ζ), G2 (ζ), and G3 (ζ) which are analytic in ζ, satisfy (5.9) G′1 (ζ) = F0 (ζ) − c(−ζ)1/2 ,

(5.10)

G′2 (ζ) = G1 (ζ),

(5.11)

G′3 (ζ) = G2 (ζ),

ASYMPTOTICS OF RMT PARTITION FUNCTION

33

and possesses the following asymptotic expansion for ζ → −∞: (1) (1) (5.12) G1 (ζ) = c0 (−ζ)−3/2 + c1 (−ζ)−9/2 + · · · 4 (1) (1) (−ζ)3/2 + d0 (−ζ)−3/2 + d1 (−ζ)−9/2 + · · · sin 3 4 (1) (1) + f0 (−ζ)−3 + f1 (−ζ)−6 + · · · cos (−ζ)3/2 3 (2) (2) −1/2 −7/2 (5.13) G2 (ζ) = c0 (−ζ) + c1 (−ζ) + ··· 4 (2) (2) + d0 (−ζ)−7/2 + d1 (−ζ)−13/2 + · · · sin (−ζ)3/2 3 4 (2) (2) (−ζ)3/2 + f0 (−ζ)−2 + f1 (−ζ)−5 + · · · cos 3 (5.14)

G3 (ζ)

(3)

(3)

= c0 (−ζ)1/2 + c1 (−ζ)−5/2 + · · · 4 (3) (3) −5/2 −11/2 3/2 + d0 (−ζ) + d1 (−ζ) + · · · sin (−ζ) 3 4 (3) (3) 3/2 −4 −7 . (−ζ) + f0 (−ζ) + f1 (−ζ) + · · · cos 3

This defines antiderivatives of F0 which we will also need in what follows: 2c0 F1 = G1 − (5.15) (−ζ)3/2 , ( F1′ = F0 ) , 3 4c0 (5.16) F2 = G2 + (−ζ)5/2 , ( F2′ = F1 ) , 15 8c0 (5.17) (−ζ)7/2 , ( F3′ = F2 ) , F3 = G3 − 105 and we will show that these three anti-derivatives are all exponentially decaying for ζ → +∞: (5.18)

4

|Fℓ | ≤ Cℓ e− 3 ζ

3/2

Step 3: We express the integral (5.7) as follows Z 1 β+δ (5.19) g(z)F0 (Φβ )Φ′β dz = eˆ0 + A, N z∗ −ǫ Z 1 β 1/2 (5.20) g(z)c0 (−Φβ (z)) Φ′β dz eˆ0 = N z∗ −ǫ Z Z 1 β+δ 1 β 1/2 (5.21) g(z) F0 (Φβ ) − c0 (−Φβ (z)) g(z)F0 (Φβ )Φ′β dz Φ′β dz + A= N z∗ −ǫ N β Now eˆ0 is in fact independent of N : Z Z −c0 β −ic0 β d 2 3/2 eˆ0 = dz = (−Φβ (z)) (5.22) g(z) g(z)R+ (z)h(z)dz N z∗ −ǫ dz 3 2 z ∗ −ǫ

and so we must show that A possesses an asymptotic expansion in even powers of N . Integrating both terms in (5.21) by parts, we obtain Z Z 1 β+δ ′ 1 β ′ (5.23) g (z)G1 (Φβ (z)) dz − g (z)F1 (Φβ (z)) dz. A=− N z∗ −ǫ N β

Observe that in (5.23), the boundary terms from z ∗ − ǫ and β + δ do not contribute because g is compactly supported within (z ∗ − ǫ, β + δ). Furthermore, the boundary terms from the integrals at z = β cancel, because F1 (Φβ (z)) and G1 (Φβ (z)) coincide at z = β. Since G1 and F1 are both uniformly bounded, it follows immediately that |A| ≤ CN −1 . However, it is not yet straightforward to deduce the asymptotic behavior for A as N → ∞, and that is our next task.

34

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

Two more integrations by parts yield (5.24)

A

1 = − N

Z

β

z ∗ −ǫ

"

1 Φ′β

!′ #′ 1 ′ g (z) G3 (Φβ (z)) dz Φ′β " !′ # ′ Z 1 ′ 1 β+δ 1 − g (z) F3 (Φβ (z)) dz. N β Φ′β Φ′β

Recalling the asymptotic expansion (5.14) for G3 valid for ζ → −∞, we may rewrite (5.24) as follows: (5.25) (5.26)

(5.27)

A = eˆ1 N −2 + A2 , !′ #′ Z β " 1 1 ′ (3) 1/2 eˆ1 = −N c0 (−Φβ (z)) dz, ′ ′ g (z) Φ Φ ∗ z −ǫ β β !′ #′ Z β " 1 ′ 1 1 (3) 1/2 dz g (z) G (Φ (z)) − c (−Φ (z)) A2 = − 3 β β 0 N z∗ −ǫ Φ′β Φ′β !′ # ′ " Z 1 β+δ 1 1 ′ − g (z) F3 (Φβ (z)) dz. N β Φ′β Φ′β

As with eˆ0 , eˆ1 is independent of N . Indeed, using (4.7), we have (5.28)

(5.29)

eˆ1 = −

β

Z

z ∗ −ǫ

"

1 φ′β ∗

!′ #′ 1 ′ 1/2 g (z) c˜0 (−φβ (z)) dz, φ′β

where for z ∈ (z − ǫ, β), φβ (z) = −

−3i 4

Z

β

R+ (s)h(s)ds

z

!2/3

.

Observe that once we have established Steps 1 and 2, then Step 3, carried out above, shows that Z 1 β+δ 1 (5.30) g(z)F0 (Φβ )Φ′β dz = eˆ0 + 2 eˆ1 + A2 , N z∗ −ǫ N with eˆ0 and eˆ1 independent of N (see (5.22) and (5.28), respectively), and with A2 defined in (5.27). Furthermore, it is straightforward to prove that |A2 | ≤ CN −7/3 , and hence (5.30) shows that the first two terms in the asymptotic expansion of (5.7) are in even powers of N , as desired. The above calculations must now be automated to establish the existence of a complete asymptotic expansion in even powers of N . Step 4: The procedure should now be clear to establish the induction. We must prove that we can integrate by parts thrice, peel off the next term in the asymptotic expansion, and repeat. We must prove that there exists Gm , Fm , m = 4, 5, . . ., satisfying a number of relations, all appearing in triples. First the differential relations: (5.31) (5.32)

(3j)

G′3j+1 = G3j − c0

(−ζ)1/2 , G′3j+2 = G3j+1 , G′3j+3 = G3j+2 ,

′ ′ ′ F3j+1 = F3j , F3j+2 = F3j+1 , F3j+3 = F3j+2 ,

then the asymptotic prescription (5.33)

G3j+3

(3j+3) (3j+3) + c1 (−ζ)−3 + · · · = (−ζ)1/2 c0 4 4 (3j+3) (3j+3) cos (−ζ)3/2 + GC (−ζ)3/2 , +GS sin 3 3

ASYMPTOTICS OF RMT PARTITION FUNCTION (3j+3)

where GS (5.34)

(5.35)

35

(3j+3)

are asymptotic series which behave as follows: G(3j+3) = (−ζ)−(3j+5)/2 d(3j+3) + d(3j+3) (−ζ)−3 + · · · 1 0 S For j even: G(3j+3) = (−ζ)−(3j+8)/2 f (3j+3) + f (3j+3) (−ζ)−3 + · · · 0 1 C (3j+3) (3j+3) (3j+3) −(3j+8)/2 G d0 + d1 (−ζ)−3 + · · · = (−ζ) S For j odd: G(3j+3) = (−ζ)−(3j+5)/2 f (3j+3) + f (3j+3) (−ζ)−3 · · · 0 1 C

and GC

(note that this implies a similar asymptotic behavior for G3j+1 and G3j+2 ). The quantities Fℓ must satisfy the following estimates for ζ → +∞: 4

|F3j+1 | , |F3j+2 | , |F3j+3 | ≤ C3j e− 3 ζ

(5.36)

3/2

,

and finally we require the following relation between Fℓ and Gℓ : (5.37)

Gm (0) = Fm (0), m = 3j + 1, 3j + 2, 3j + 3.

Once we have the existence of the functions Fℓ and Gℓ out of the way, then we may proceed with the inductive integration by parts. Suppose we have arrived at the situation Z 1 β+δ (5.38) g(z)F0 (Φβ )Φ′β dz = eˆ0 + N −2 eˆ1 + · · · + N −2ℓ eˆℓ + Aℓ+1 , N z∗ −ǫ where eˆj are all independent of N , and Z d (−1)ℓ β+δ d ′ −1 d ′ −1 ′ −1 ′ (Φβ ) (Φβ ) ··· Aℓ+1 = (5.39) (Φβ ) g (z) · · · × N dz dz z ∗ −ǫ dz (3ℓ) × G3ℓ (Φβ (z)) − c0 (−Φβ )1/2 dz Z d (−1)ℓ β+δ d ′ −1 d ′ −1 ′ −1 ′ (Φβ ) (Φβ ) ··· (Φβ ) g (z) · · · × + N dz dz z ∗ −ǫ dz ×F3ℓ (Φβ )dz, and in each nested set of derivatives appearing in the integrals in (5.39), the differential operator d ′ −1 (5.40) · Φβ dz

appears 3ℓ − 1 times. We further assume that in (5.39), G3ℓ satisfies (5.33), F3ℓ satisfies (5.36), (both with j = ℓ − 1) and (5.37) holds with m = 3ℓ. In order to integrate by parts, we note that from (5.31) and (5.32), 1 d (3ℓ) G3ℓ (Φβ (z)) − c0 (−Φβ )1/2 = ′ (5.41) G3ℓ+1 (Φβ (z)), Φβ dz (5.42)

F3ℓ (Φβ (z)) =

d 1 F3ℓ+1 (Φβ (z)). Φ′β (z) dz

Using (5.37) and integrating by parts, we find (5.43)

Aℓ+1 = (−1)ℓ N

β+δ

d d (Φ′β )−1 (Φ′β )−1 · · · (Φ′β )−1 g ′ (z) · · · × dz dz × (G3ℓ+1 ) dz ℓ Z β+δ (−1) d d d − (Φ′β )−1 (Φ′β )−1 · · · (Φ′β )−1 g ′ (z) · · · × N dz dz z ∗ −ǫ dz ×F3ℓ+1 (Φβ )dz, −

d dz ∗ z −ǫ

Z

36

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

where now the differential operator (d/dz(Φ′β )−1 ·) appears 3ℓ times. At this point, using (4.7), it is straightforward to prove that |Aℓ+1 | ≤ CN −2ℓ−2/3 . However, we may integrate by parts two more times, and we then arrive at (5.44)

Aℓ+1 = (−1)ℓ N

β+δ

d d (Φ′β )−1 (Φ′β )−1 · · · (Φ′β )−1 g ′ (z) · · · × dz dz × (G3ℓ+3 ) dz ℓ Z β+δ d d (−1) d (Φ′β )−1 (Φ′β )−1 · · · − (Φ′β )−1 g ′ (z) · · · × N dz dz z ∗ −ǫ dz ×F3ℓ+3 (Φβ )dz,

−

d z ∗ −ǫ dz

Z

where now the differential operator (d/dz(Φ′β )−1 ·) appears 3ℓ + 2 times in each integral. Expression (5.44) may now be rewritten as follows: (5.45) (5.46)

(5.47)

Aℓ+1 = N −2ℓ−2 eˆℓ+1 + Aℓ+2 , eˆℓ+1 = Z β+δ d d ℓ+1 2ℓ+1 ′ −1 d ′ −1 ′ −1 ′ (−1) N (Φβ ) (Φβ ) ··· (Φβ ) g (z) · · · × dz dz z ∗ −ǫ dz (3ℓ+3) × c0 (−Φβ )1/2 dz, Aℓ+2 = Z (−1)ℓ+1 β+δ d d d (Φ′β )−1 g ′ (z) · · · × (Φ′β )−1 (Φ′β )−1 · · · N dz dz z ∗ −ǫ dz (3ℓ+3) 1/2 dz × G3ℓ+3 − c0 (−Φβ ) Z β+δ d d d (−1)ℓ+1 (Φ′β )−1 (Φ′β )−1 · · · (Φ′β )−1 g ′ (z) · · · × N dz dz z ∗ −ǫ dz ×F3ℓ+3 (Φβ )dz,

where the differential operator (d/dz(Φ′β )−1 ·) appears 3ℓ + 2 times in each integral. The quantity eˆℓ+1 is easily seen to be independent of N using the representation (4.7) of Φβ : (5.48)

eˆℓ+1 = Z β+δ d d d (−1)ℓ+1 (φ′β )−1 (φ′β )−1 · · · (φ′β )−1 g ′ (z) · · · × dz dz z ∗ −ǫ dz (3ℓ+3) (−φβ )1/2 dz. × c0

Therefore we have deduced that (5.49)

1 N

Z

β+δ

z ∗ −ǫ

g(z)F0 (Φβ )Φ′β dz = eˆ0 + N −2 eˆ1 + · · · + N −2ℓ−2 eˆℓ+1 + Aℓ+2 ,

with eˆℓ+1 defined in (5.48), and Aℓ+2 defined in (5.47). Summarizing, once we establish the existence of the functions Fℓ and Gℓ , we have established by induction that (5.7) has an asymptotic expansion in even powers of N . Proof of Step 1: We establish Step 1 using well-known [1] asymptotic representations of the Airy functions for large negative values of the argument:

ASYMPTOTICS OF RMT PARTITION FUNCTION

(5.50)

Ai(−z) =

(5.51)

Ai′ (−z) =

where

37

1 π 2 π )w (ζ) − cos(ζ + )w (ζ) , |arg z| < π sin(ζ + 1 2 1/4 4 4 3 πz z 1/4 π 2 π √ − cos(ζ + )w3 (ζ) − sin(ζ + )w4 (ζ) , |arg z| < π, 4 4 3 π √

2 3/2 (z) 3 and the wi (ζ) are asymptotic series in large ζ defined recursively in terms of the coefficients (5.52)

ζ=

us

=

vs

=

(2s + 1)(2s + 3)(2s + 5) . . . (6s − 1) (216)s s! 6s + 1 − us 6s − 1 u0 = 1, v0 = 1.

with

Explicitly the asymptotic series are given by ∞ X u2s (5.53) w1 = (−1)s 2s , ζ s=0

w2 =

(5.54)

w4 =

∞ X

v2s w3 = (−1)s 2s , ζ s=0

∞ X

(−1)s

u2s+1 , ζ 2s+1

(−1)s

v2s+1 . ζ 2s+1

s=0

∞ X s=0

We caution the reader that in formulae (5.50)-(5.54) the variable z > 0 is a dummy variable, as is ζ appearing in (5.52) above. We will replace z appearing in (5.50)-(5.54) with −ζ (where ζ < 0). Consequently, the parameter ζ appearing in (5.50)-(5.54) becomes (2/3)(−ζ)3/2 . One can now substitute the expansions of the Airy functions (5.50) into the expression (5.6) for F0 (ζ) and collect separately the coefficients of cos(4(−ζ)3/2 /3), sin(4(−ζ)3/2 /3) and the “non-oscillatory” terms. One finds that the expansion is of the form (0)

F0 (ζ) = (−ζ)1/2 S0 +

(5.55)

1/2

+(−ζ) (0)

(0)

where S0 , S1

(0)

and S2

(0) S1

sin

4 (−ζ)3/2 3

+

(ℓ) S2

cos

4 3/2 , (−ζ) 3

are asymptotic series valid for ζ → −∞:

1 (w2 + w22 + w32 + w42 ), 2π 1 1 (0) (5.57) w12 − w22 − w32 + w42 , S1 = 2π 1/2 (−ζ) (0) S2 = (5.58) (w3 w4 − w1 w2 ) . π Now using the definitions (5.53)-(5.54) of the asymptotic series {wj }4j=1 (with ζ replaced by (−ζ)3/2 ), we see (0)

(5.56)

S0

=

(0)

(0)

that S0 is an asymptotic expansion in powers of (−ζ)−3 , starting with the constant term. Similarly, S1 (0) is an asymptotic expansion in powers of (−ζ)−3 starting with (−ζ)−3 , and S2 is an asymptotic expansion −3p−1 in powers of the form (−ζ) , p = 0, 1, . . .. This establishes the form of the expansion specified in Step 1, formula (5.8) Proof of Steps 2 and 4: Now we must establish the existence of Fℓ and Gℓ , ℓ ≥ 1, satisfying (5.9)-(5.18) (for ℓ = 1, 2, 3), and (5.31)-(5.37) (for ℓ ≥ 4). We observe that if {Fℓ }ℓ≥1 satisfies (5.15)-(5.17) and (5.32), then clearly Fℓ is the ℓ-th antiderivative of the 2 function F0 . Now F0 (ζ) = (Ai′ (ζ)) − ζ (Ai(ζ))2 , and it straightforward to prove that the ℓ-th antiderivative of F0 is given by (5.59)

(ℓ)

2

(ℓ)

2

(ℓ)

Fℓ (ζ) = q0 (ζ) (Ai′ (ζ)) + q1 (ζ) (Ai(ζ)) + q3 (ζ)Ai(ζ)Ai′ (ζ)

38

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN (ℓ)

where {qµ } are polynomials in ζ. Now (5.59), together with the asymptotics for ζ → ∞ of the Airy function Ai(ζ) imply that for each ℓ, Fℓ satisfies (5.18) and (5.36). Furthermore, using the asymptotics (5.50) and (5.51) (again replacing z with −ζ, and ζ with (2/3)(−ζ)3/2 ), and letting ζ → −∞, we find that for each ℓ, Fℓ possesses an expansion of the following form (ℓ)

Fℓ (ζ) = (−ζ)1/2 S0 +

(5.60)

1/2

+(−ζ)

(ℓ) S1

sin

4 (−ζ)3/2 3

+

(ℓ) S2 cos

4 3/2 , (−ζ) 3

where S0 , S1 , and S2 are asymptotic series valid for ζ → −∞. We will refine our knowledge of these series in what follows, but for now we observe the following important basic property of these asymptotic series: (ℓ) (ℓ) (ℓ) Property 5.61: The asymptotic series S0 , S1 and S2 are all in integer powers of (−ζ). (ℓ)

(ℓ)

(ℓ)

In order to obtain more detailed information about the asymptotic series S0 , S1 and S2 , we will make use of the following Lemma. Lemma 5.1. If a function G(ζ) is C ∞ on (−∞, a) for some a > 0, and possesses the following asymptotic expansion (which may be differentiated repeatedly to obtain asymptotic expansions for derivatives), −(j+3) −j 4 (5.62) (−ζ)3/2 , G(ζ) = a(−ζ) 2 + b(−ζ) 2 + . . . trig 3

in which the asymptotic expansion in parentheses descends in powers of (−ζ)3/2 , j ≥ 1, and trig(·) denotes Rs either sin (·) or cos (·), then the function −∞ G(ζ)dζ possesses the following asymptotic expansion for s → −∞: Z s −(j+1) −(j+4) 4 G(ζ)dζ = a ˜(−s) 2 + ˜b(−s) 2 + . . . trig (−s)3/2 3 −∞

where the expression in parentheses descends in powers of (−s)3/2 . Proof. s

4 3/2 a(−ζ) + b(−ζ) + . . . trig dζ (−ζ) 3 −∞ Z s −(j+3) −j 4 d −1 3/2 2 2 dζ trig (−ζ) a(−ζ) + b(−ζ) = + ... 3 2(−ζ)1/2 dζ −∞ −(j+3) −j 4 1 = − a(−s) 2 + b(−s) 2 + . . . (−s)3/2 trig 1/2 3 2(−s) Z ′ −(j+4) −(j+1) 1 s 4 3/2 2 2 + + b(−ζ) + . . . trig a(−ζ) dζ (−ζ) 2 −∞ 3 −(j+4) −(j+1) 1 4 = − a(−s) 2 + b(−s) 2 + . . . trig (−s)3/2 2 3 Z −(j+3) −(j+6) j+4 j+1 1 s 2 2 +b + ... × a (−ζ) (−ζ) + 2 −∞ 2 2 −1 4 d 3/2 × dζ, trig (−ζ) 3 2(−ζ)1/2 dζ Z

−j 2

−(j+3) 2

and continuing in this way establishes the lemma.

Let us write F1 in the following convoluted way: Z ζ 2 (5.63) F1 (ζ) = F0 (s) − c0 (−s)1/2 ds − c0 (−ζ)3/2 . 3 −∞

One sees that F1 so defined is an antiderivative of F0 immediately. To verify that F1 so defined is exponentially decaying for ζ → +∞, one uses the asymptotic expansion of F0 obtained in Step 1 together with Lemma 5.1 to compute the asymptotic expansion of the integral in (5.63), and compares to the asymptotic expansion

ASYMPTOTICS OF RMT PARTITION FUNCTION

39

(5.60). Since there is no constant term in (5.60), neither in the asymptotic expansion of (5.63), F1 defined by (5.63) must be expressible in the form (5.59), and hence it is exponentially decaying for ζ → +∞. So we have learned that (1) F1 exists satisfying F1′ = F0 , (2) F1 satisfies (5.18) for ζ → +∞, and (3) F1 possesses an asymptotic expansion of the form (5.60) for ζ → −∞. Furthermore, we learn that the (1) asymptotic series (−ζ)1/2 S0 appearing in (5.60) with ℓ = 1 is obtained by computing the term-by-term (0) anti-derivative of the asymptotic series (−ζ)1/2 S0 appearing in (5.55). This provides us with more detailed (1) information about the asymptotic series S0 : (5.64)

(1)

(−ζ)1/2 S0

2 2 2 = − c0 (−ζ)3/2 + c1 (−ζ)−3/2 + c2 (−ζ)−9/2 + · · · . 3 3 9

If, rather than using Lemma 5.1, one is more careful integrating by parts repeatedly, it is straightforward to prove the following two properties: (1)

Property 5.65: The expansion S1

starts at (−ζ)−2 and descends in powers of (−ζ)3 .

(1)

Property 5.66: The expansion S2 starts at (−ζ)−3 and descends in powers of (−ζ)3 . Setting G1 = F1 + (2c0 /3)(−ζ)3/2 , we have proven the existence of G1 satisfying (5.9) and (5.12), with (1) c0 = −2c1 /3 (the constant c1 appears in (5.8)). We may now define Z ζ G2 = (5.67) G1 (s)ds, −∞

The function G2 clearly satisfies (5.10), and using the asymptotic expansion (5.12) satisfied by G1 together with careful integration by parts shows that G2 satisfies the asymptotic expansion (5.13) for ζ → −∞. We next define F2 via 4c0 (−ζ)5/2 15 Rζ which, it turns out, is equivalent to the definition F2 = ∞ F1 (s)ds. The function F2 then clearly satisfies (5.16) and (5.18). The functions G3 and F3 are defined in similar fashion. First we define Z ζ (2) (2) (5.69) G2 (s) − c0 (−s)−1/2 ds − 2c0 (−ζ)1/2 . G3 = (5.68)

F2 = G2 +

−∞

Second, using the asymptotic expansion (5.13) satisfied by G2 and careful integration by parts in the manner used to prove Lemma 5.1, we deduce that G3 possesses the asymptotic expansion (5.14). Third, we define F3 in the obvious way:

8c0 (−ζ)7/2 . 105 Rζ Uniqueness of asymptotic expansions then implies that F3 = ∞ F2 (s)ds, and hence F3 satisfies (5.17) and (5.18). (5.70)

F3 = G3 −

The inductive argument goes as follows: suppose we have the existence of Fℓ and Gℓ for ℓ = 1, . . . , 3k, satisfying (5.9)-(5.18), and possibly (5.31) - (5.37) with j = k − 1 (if k ≥ 2). We define G3k+1 and G3k+2 as follows: Z ζ (3k) G3k+1 (ζ) = G3k (s) − c0 (−s)1/2 ds (5.71) −∞

(5.72)

G3j+2 =

Z

ζ

G3k+1 (s)ds.

−∞

The asymptotic expansion satisfied by G3k (either (5.14) if k = 1, or (5.33) with j = k − 1 if k ≥ 2), together with a careful integration by parts argument as outlined in the proof of Lemma 5.1 shows that G3k+1 satisfies

40

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

the following asymptotic expansion: (3k+1) (3k+1) (−ζ)−2 + c1 (−ζ)−5 + · · · G3k+1 = (−ζ)1/2 c0 4 4 (3k+1) (3k+1) 3/2 3/2 sin +GS cos + GC , (−ζ) (−ζ) 3 3

(5.73)

(3k+1)

where GS

(3k+1)

and GC

(5.74)

are asymptotic expansions:

For 3k + 1 even: G(3k+1) = (−ζ)−(3k+6)/2 d(3k+1) + d(3k+1) (−ζ)−3 + · · · 0 1 S G(3k+1) = (−ζ)−(3k+3)/2 f (3k+1) + f (3k+1) (−ζ)−3 + · · · 0 1 C

(5.75)

For 3k + 1 odd: G(3k+1) = (−ζ)−(3k+3)/2 d(3k+1) + d(3k+1) (−ζ)−3 + · · · 1 S 0 . G(3k+1) = (−ζ)−(3k+6)/2 f (3k+1) + f (3k+1) (−ζ)−3 · · · 1 0 C

Similarly, G3k+2 satisfies the following asymptotic description for ζ → −∞:

(3k+2) (3k+2) −4 (−ζ)−1 + c1 (−ζ) + · · · G3k+2 = (−ζ)1/2 c0 4 4 (3k+2) (3k+2) 3/2 3/2 sin +GS cos + GC , (−ζ) (−ζ) 3 3

(5.76)

(3k+2)

where GS (5.77)

(5.78)

(3k+2)

and GC

are asymptotic expansions:

For 3k + 2 even: G(3k+2) = (−ζ)−(3k+7)/2 d(3k+2) + d(3k+2) (−ζ)−3 + · · · 1 0 S G(3k+2) = (−ζ)−(3k+4)/2 f (3k+4) + f (3k+4) (−ζ)−3 + · · · 0 1 C

For 3k + 2 odd: G(3k+2) = (−ζ)−(3k+4)/2 d(3k+2) + d(3k+2) (−ζ)−3 + · · · 1 S 0 . G(3k+2) = (−ζ)−(3k+7)/2 f (3k+2) + f (3k+2) (−ζ)−3 · · · 0 1 C

We may now define G3k+3 : (5.79)

G3k+3 (ζ) =

Z

ζ

−∞

(3k+2)

G3k+2 (s) − c0

(3k+2) (−ζ)1/2 . (−s)−1/2 ds − 2c0

It is by now a straightforward exercise to establish that G3k+3 so defined satisfies (5.31) as well as the asymptotic description (5.33) for ζ → −∞. Turning now to the existence of F3k+1 , F3k+2 and F3k+3 , we define them through (5.80)

F3k+1 =

Z

ζ

∞

F3k (s)ds,

F3k+2 =

Z

ζ

∞

F3k+1 (s)ds,

F3k+3 =

Z

ζ

F3k+2 (s)ds.

∞

It is immediately clear from these definitions that {F3k+µ }3µ=1 satisfy (5.18) for ζ → ∞.

ASYMPTOTICS OF RMT PARTITION FUNCTION

41

Because of the recursive definitions of Fℓ and Gℓ , it follows that (3k)

F3k+1 = G3k+1 −

(5.81)

2c0 3

(3k−3)

+

2 4 c0 945

(3k)

F3k+2 = G3k+2 +

(5.82)

4c0 15

3/2

(−ζ)

(−1)3k+1 23k+1 c0 (−ζ)(6k+3)/2 , (−ζ)9/2 + · · · + Q3k+1 (2j + 1) j=1 5/2

(−ζ)

(3k−3)

+

(−1)3k+2 23k+2 c0 2 5 c0 11/2 (6k+5)/2 (−ζ) + · · · + Q3k+2 (−ζ) , 10395 j=1 (2j + 1) (3k)

(5.83)

F3k+3 = G3k+3 −

8c0 7/2 (−ζ) 105

(3k−3)

+

2 6 c0 (−1)3k+3 23k+3 c0 (6k+7)/2 13/2 (−ζ) . (−ζ) + · · · + Q3k+3 135135 (2j + 1) j=1

we observe that there are no constant terms in the relations (5.81)-(5.83). Indeed, this is so because (1) for (ℓ) each ℓ, Fℓ has the representation (5.59) for some polynomials {qµ }2µ=0 , and consequently the asymptotic expansion for Fℓ valid for ζ → −∞ is of the form (5.60) with no constant term and (2) Gℓ as defined possesses an asymptotic expansion with no constant term for ζ → −∞. Therefore the arbitrary constants of integration which may appear in (5.81)-(5.83) are all 0. Finally, (5.81)-(5.83) imply that {F3k+µ }3µ=1 and {G2k+µ }3µ=1 satisfy (5.37) with j = k. This completes the proof of Step 2 and Step 4, and we have established the first claim of Theorem 1.3, that asymptotic expansions of the form (1.35) hold true. The explanation for why the coefficients in such an asymptotic expansion are analytic is as follows. We return to the integral (5.4), and show that each term in its asymptotic expansion depends analytically on t. Since the same is true of the other integral appearing in (5.3), this will complete the proof of Theorem 1.3. We begin by observing that each term in the asymptotic expansion of (5.4) is of the form Z β (j) 1/2 χβ (λ)Q(λ, t) (−φβ ) dλ, z ∗ −ǫ

where (j) • χβ (λ) represents some finite number of derivatives of χβ (λ); • Q(λ, t) represents terms obtained from the integration by parts procedure but do not depend on the partition of unity χβ (these terms depend analytically on λ and on t); • (−φβ (λ))1/2 may be taken to be analytic with branch cut emanating from λ = β, down the real axis, and passing in particular through z ∗ + ǫ. For λ away from the cut, this function also depends analytically on t. We now decompose the integral into a sum: Z β Z β Z z∗ +ǫ (j) (j) 1/2 1/2 (5.84) Q(λ, t) (−φβ )1/2 dλ. χβ (λ)Q(λ, t) (−φβ ) dλ + χβ (λ)Q(λ, t) (−φβ ) dλ = z ∗ −ǫ

z ∗ −ǫ

z ∗ +ǫ

The first integral on the right hand side of (5.84) is clearly analytic in t, because the integrand is analytic in t. For the second integral, note that χβ does not appear. This is because the partition of unity is such that χβ ≡ 1 on (z ∗ + ǫ, β). Now this second integral is seen to be analytic by expressing it as 1/2 the value of a contour integral encircling the interval (z ∗ + ǫ, β), passing through z ∗ + ǫ. This can be done because the integrand is analytic, with a square-root branch point at λ = β. This completes the proof of Theorem 1.3.

42

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

6. Appendix Here we present a set of explicit formulae for S1 (z), the solution of Riemann–Hilbert problem 3.58. (6.1)

(6.2)

1. for z ∈ C \ (Bδα ∪ Bδβ )

2. For z ∈ Bδβ ,

S1 (z) = 3 1 h′ (α) 5 −1 −i −2 −1 3(z − α) + (z − α) −3 −i 1 144h(α) 5 α−β h(α) 7 −1 i + (z − α)−1 i 1 48(α − β)h(α) 5 1 h′ (β) 3 −1 i −2 −1 + −3 3(z − β) + (z − β) i 1 144h(β) 5 β−α h(β) 7 −1 i . (z − β)−1 + i 1 48(β − α)h(β)

S1 (z) = 3 1 h′ (α) 5 −1 −2 −1 3(z − α) + (z − α) −3 −i 144h(α) 5 α−β h(α) 7 −1 i + (z − α)−1 i 1 48(α − β)h(α) 3 1 3 3h′ (β) 5 −2 (z − β) + − (z − β)−1 + 72 2h(β) 10h(β) β − α h(β) ) (z − α)1/2 −1 Rz − 1/2 i R(s)h(s)ds (z − β) β ( ) 3 (z − β)1/2 7 1 Rz (z − β)−1 − + 1/2 i 72 2(β − α)h(β) (z − α) R(s)h(s)ds β

(6.3)

−i 1

i 1

i −1

.

3. For z ∈ Bδα ,

S1 (z) = 5 3 1 h′ (β) −1 i −2 −1 3(z − β) + (z − β) −3 i 1 144h(β) 5 β−α h(β) 7 1 i + (z − β)−1 i −1 48(β − α)h(β) 3 1 3 3h′ (α) 5 −2 (z − α)−1 (z − α) + − + 72 2h(α) 10h(α) α − β h(α) ) (z − β)1/2 −1 −i Rz − −i 1 (z − α)1/2 α R(s)h(s)ds ) ( 3 (z − α)1/2 7 1 −i −1 Rz . (z − α) − + −i −1 72 2(α − β)h(α) (z − β)1/2 α R(s)h(s)ds

For comparative purposes, if tj = 0, j 6= 4, and if we set t4 = t, then we have (6.4) (6.5) (6.6)

1. for z ∈ C \ (Bδα ∪ Bδβ ) S1 (z) =

−7β β(−56z − 136β + 15β 2 z + 25β 3 ) 1 i + i −1 96(8 − β 2 )(β − z) 96(8 − β 2 )2 (z + β)2 3 2 β(−136β + 56z + 25β − 15β z) 7β −1 i − + i 1 96(8 − β 2 )(z + β) 96(8 − β 2 )2 (β − z)2

ASYMPTOTICS OF RMT PARTITION FUNCTION

43

2. For z ∈ Bδβ , (6.7)

S1 (z) =

−7β + 96(8 − β 2 )(z − β)

β(−56z − 136β + 15β 2 z + 25β 3 ) 7γ 2 R − z 96(8 − β 2 )2 (z + β)2 72 β R(s)h(s)ds 7β + + 96(8 − β 2 )(z + β)

(6.8) (6.9) (6.10)

!

1 i

β(−136β + 56βz + 25β 3 − 15β 2 z) 5 Rz − − 96(8 − β 2 )2 (β − z)2 72γ 2 β R(s)h(s)ds

i −1

!

+

−1 i i 1

(−β)

3. For z ∈ Bδ (6.11)

, we have −β(−136β + 56z + 25β 3 − 15β 2 z) S1 (z) = 96(8 − β 2 )2 (β − z)2 " #! 7 4γ −2 β(z + β)−1 −1 Rz − + i 96 3 −β (8 − β 2 ) R(s)h(s)ds β 25 β 3 − 136 β + 15 β 2 z − 56 z γ2 R + + z 2 2 72 −β R(s)h(s)ds 96 (β 2 − 8) (z + β) 7β (z − β)−1 − 96 8 − β2

i 1

−1 −i −i 1

7. Conclusions This paper provides the first mathematical derivation of the form of the asymptotic expansion of the Hermitian random matrix partition function, conjectured in [3]. This uses the connection to non-classical orthogonal polynomials, together with the Deift-Zhou steepest descent and stationary phase method for the asymptotic analysis of Riemann-Hilbert problems. In particular, the asymptotic analysis of (1.1) presented here demonstrates that • log ZˆN has an asymptotic expansion of the form of (1.5);

• For arbitrary integers g ≥ 0, eg (t1 , . . . , tν ) is an analytic function of the (complex) vector t := (t1 , . . . , tν ), in a neighborhood of (0, . . . , 0); (1) • For times, t, within the domains of holomorphy for the eg , the limiting mean density ρN of eigenvalues for the Hermitian random matrix ensemble is supported on a single interval (α, β). The computed asymptotic (1) expansion of ρN is valid for all λ ∈ (α, β) and in fact depends only on the equilibrium measure; • the coefficients of the eg are generating functions for graphical enumeration in the sense that (−1)n

∂n eg (0) = #{k-valent, n-vertex, g-maps}. ∂tnk

As a consequence of these results one is now situated to be able to combine asymptotic analytical techniques with the results of many ingenious ideas, contributions, and calculations which have arisen over the past 20 years from the theory of 2D quantum gravity [13], to investigate the connection between the asymptotic expansion of the partition function and solutions of integrable systems such as the KdV hierarchy, the Toda lattice, and singular limits of these equations described by modulation equations [25, 15, 9]. References 1. M. Abramowitz and I. Stegun. Handbook of Mathematical Functions, U.S. Govt. Printing Office, Washington, D.C., 1972. 2. S. Albeverio, L. Pastur, and M. Shcherbina. On the 1/n expansion for some unitary invariant ensembles of random matrices. Comm. Math. Phys. 224 (2001), 271-305. 3. D. Bessis, X. Itzykson, and J.B. Zuber. Quantum Field Theory Techniques in Graphical Enumeration. Adv. Appl. Math. 1 (1980) 109-157.

44

N. M. ERCOLANI AND K. D. T-R MCLAUGHLIN

4. P. Bleher and A. Its. Semiclassical asymptotics of orthogonal polynomials, Riemann–Hilbert problem, and the universality in the matrix model. Ann. Math. 50 (1) (1999) 185-266. 5. P. Deift, T. Kriecherbauer and K. T-R McLaughlin. New results on the equilibrium measure for logarithmic potentials in the presence of an external field. J. Approx. Thry., —bf 95 (1998), 388-475. 6. P. Deift, T. Kriecherbauer, K.T.-R. McLaughlin, S. Venakides, and X. Zhou. Asymptotics for polynomials orthogonal with respect to varying exponential weights. Int. Math. Res. Notices 16 (1997) 759-782. 7. P. Deift, T. Kriecherbauer, K.T.-R. McLaughlin, S. Venakides, and X. Zhou. Strong asymptotics of orthogonal polynomials with respect to exponential weights via Riemann–Hilbert techniques. Commun. Pure Appl. Math. 52 (12) (1999) 1491–1552. 8. P. Deift, T. Kriecherbauer, K.T.-R. McLaughlin, S. Venakides, and X. Zhou. Uniform asymptotics for polynomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory. Commun. Pure Appl. Math. 52 (11) (1999) 1335–1425. 9. P. Deift and K. T-R McLaughlin. A Continuum Limit of the Toda Lattice. Memoirs of the AMS, 131, no. 624, January 1998. 10. P. Deift, S. Venakides, and X. Zhou. New results in small dispersion KdV by an extension of the steepest descent method for Riemann–Hilbert problems. Internat. Math. Research Notices 6, 286–299 (1997). 11. P. Deift and X. Zhou. A Steepest descent method for oscillatory Riemann-Hilbert problems, asymptotics for the mKDV equation, Ann. Math. 137 (1993), 295-368. 12. P. Deift and X. Zhou. Asymptotics for the Painleve II equation. Comm. Pure Appl. Math. 48 (1995), no. 3, 277–337. 13. P. Di Francesco, P. Ginsparg and J. Zinn-Justin. 2D gravity and random matrices. Physics Reports 254 (1995) 1-133. 14. Gaudin and M. L. Mehta. M. L. Mehta and M. Gaudin. On the density of eigenvalues of a random matrix. Nuclear Phys. 18 (1960) 420–427. 15. T. Grava and F. R. Tian. The generation, propagation, and extinction of multiphases in the KdV zero dispersion limit. Preprint (2002). 16. F. Harary and E.M. Palmer. Graphical Enumeration, Academic Press, New York, (1973). 17. J. Harris and I. Morrison. Moduli of Curves, Springer Graduate Texts in Mathematics, New York, vol. 187, (1998). 18. J. Harer and D. Zagier. The Euler characteristic of the moduli space of curves. Invent. Math. 85 (1986), no. 3, 457–485. 19. A. Kuijlaars and K. T-R McLaughlin. Generic behavior of the density of states in random matrix theory and equilibrium problems in the presence of real analytic external fields. Comm. Pure and Appl. Math. Vol. LIII (2000), 736-785. 20. A. Magnus. On Freud’s equations for exponential weights. J. Approx. Theory, 46, 65-99, (1986). 21. M.L. Mehta. Random Matrices, 2nd Edition, Academic Press, San Diego, CA, 1991. 22. E. B. Saff and V. Totik. Logarithmic Potentials with External Fields. New York: Springer-Verlag, 1997. 23. B. Simon, The P (φ)2 Euclidean (Quantum) Field Theory, Princeton Series in Physics, Princeton University Press (1974). 24. G. Szeg˝ o, Orthogonal Polynomials, AMS Colloquium Publications, Vol. 23, 1939. 25. E. Witten. Two-Dimensional Gravity and Intersection Theory on Moduli Space. Surveys in Differential Geometry, vol 1, (1991), 243-310. Dept. of Math, Univ. of Arizona E-mail address: [email protected] Dept. of Math., Univ. of Arizona and Dept. of Math., Univ. of North Carolina E-mail address: [email protected]