Spectra of Random Hermitian Matrices with a Small-Rank External Source: The critical and near-critical regimes
Marco Bertola, Robert Buckingham, Seung-Yeop Lee, Virgil U. Pierce
Introduction
Fix a Hermitian matrix . Equip the space of Hermitian matrices with the probability measure
where is the entry-wise Lebesgue measure and the integration is over all Hermitian matrices. The eigenvalues of represent the energy levels of a system without time-reversal invariance . When the external field is nonzero and , this measure arises in the study of Hamiltonians that can be written as the sum of a random matrix and a deterministic source matrix .
When (no external source) and , (1-1) describes the Gaussian Unitary Ensemble, or GUE. For reasonable choices of the spectrum tends to accumulate on fixed bands on the real axis. Introducing an external field can have the effect of perturbing the expected position of the spectrum. For example, Aptekarev, Bleher, and Kuijlaars studied the Gaussian case when the matrix has two eigenvalues , each of multiplicity . When is sufficiently small (the subcritical case), the eigenvalues of accumulate with probability one on a single interval, just as when . As increases the interval splits into two (the supercritical case). There is a transitional value of between these two cases (the critical case) where the local eigenvalue density near where the bands are about to split is described by the Pearcey process. See and for further studies of large-rank external field models, and for recent results on the universality of the Pearcey process.
We are interested instead in small-rank sources of the form
assuming that , . The ratio of to , which is asymptotically small, will be denoted as
The limiting distribution of the largest eigenvalue for such a small-rank external source in the Gaussian case, , was studied by Péché . Again three distinct behaviors were observed. For sufficiently close to zero, i.e. the subcritical case, the largest eigenvalue is expected to lie at the right band endpoint and behave as the largest eigenvalue of an GUE matrix. For large enough, i.e. the supercritical case, eigenvalues are expected to exit the bulk and be distributed as the eigenvalues of an GUE matrix. In the transitional critical case, when the outliers lie very near the band endpoint, the distribution for the largest eigenvalue is an extension of the standard GUE Tracy-Widom function when (see also ). These functions, denoted by , were first discovered by Baik, Ben-Arous, and Péché in the context of sample covariance, or Wishart, matrices and were shown to be probability distributions by Baik . Adler, Delépine, and van Moerbeke showed that these distributions also appear when non-intersecting Brownian motions start from when with conditioned to end at when and conditioned to end at when . The walkers all start out in a single group, but at a critical time depending on , a group of walkers separates from the main bulk. At this critical time the walkers on the edge where separation is about to occur follow the -Airy process, which is connected with . See for other processes in which the functions arise.
In this paper we extend Péché’s result in the critical case to more general functions . Our specific assumptions are listed in Section 1.3, but we essentially assume is a generic analytic potential with sufficient growth at infinity. This establishes a new universality class of matrix ensembles with the local eigenvalue density near the critical point described by the -Airy process. The universality of the supercritical and subcritical cases has been considered separately .
In the case of rank one perturbation (i.e. ), the recent paper by Baik and Wang has described the limiting distribution of the largest eigenvalue for all the possible cases including the critical case that we consider here.
Let be the probability density that the matrix chosen using (1-1) has eigenvalues (here ). Then, when the are distinct, the -point correlation function is . Brézin and Hikami showed that in the Gaussian case, the -point correlation functions can all be expressed in terms of a single kernel :
Zinn-Justin extended this result to the case of more general . We will find the leading term in the large- asymptotic expansion of the kernel in the critical regime near the critical endpoint.
Bleher and Kuijlaars showed that the kernel can be written in terms of multiple orthogonal polynomials. Furthermore, these multiple orthogonal polynomials can be written in terms of the solution to a certain Riemann-Hilbert problem. Specifically, suppose is a matrix-valued function of the complex variable satisfying
Here denote the non-tangential limits of as approaches the real axis from the upper and lower half-planes. Whenever posing a Riemann-Hilbert problem we assume (unless otherwise stated) that the solution has uniformly Hölder continuous boundary values with any exponent along the jump contour when approached from either side. Under our assumption (iv) in Section 1.3, the unique solution can be written explicitly in terms of multiple orthogonal polynomials of the second kind (see , Section 2). In the case of two distinct eigenvalues and , which is our case, the kernel may be written in terms of the function as
To analyze the asymptotic behavior of we will use the standard nonlinear steepest descent method for Riemann-Hilbert problems, as well as certain ideas introduced by Bertola and Lee to study the first finitely many eigenvalues in the birth of a new spectral band for the random Hermitian matrix model without source.
A potential alternate method for establishing universality for finite would be to use Baik’s result writing the kernel in terms of the standard (not multiple) orthogonal polynomials. The rank of the matrices in this alternate expression grows with , whereas the size of the Riemann-Hilbert problem (1-5) grows with the number of distinct eigenvalues. As such, for growing it is more convenient to analyze the Riemann-Hilbert problem for multiple orthogonal polynomials.
2 Definition of the critical regime
We recall the setting of our work . Let be the -function associated with the orthogonal polynomials with potential (see, for instance, or ). It may be written as
where is the unique measure minimizing the functional
The unperturbed () variational problem is regular in the sense of which means that the inequalities in (1-9) are strict and the behavior of at any boundary point of the support of is asymptotic to (approaching from the complement of the support).
It has been shown in at Theorem 1.3In the theorem, the changing parameter is essentially after rescaling. that, for real-analytic ,
If is regular for then is still regular for small enough, and
The locations of the spectral edges (the ’s and ’s) are real-analytic functions of such that the bands of the support of the equilibrium measure stay separated as ranges in a small open set around .
In addition it is also known that the support (under the real–analyticity assumption) consists of a finite union of bounded intervals; we will denote the support of the density by (see Figure 2)
We will consider the unperturbed density to be the solution of the above variational problem with ; in this case the reference to will be tacitly suppressed, and so \alpha_{j}=\alpha_{j}(\kappa)\big{|}_{\kappa=0}, etc. Define for the unperturbed () problem the following quantities:
Note that and hence ; we choose such that .
Define to be the (unique) value of so that (here ).
The uniqueness is promptly seen because ; in fact the effective potential is known to satisfy
In particular, and hence . Thus the critical value of is given by
We also recall that for regular potentials the behavior of (a suitable branch of) the function near any of the endpoints of the interval of support is
for some constant . For the point one can also prove that ; this allows us to introduce the scaling coordinate near via the definition
We now define the critical and near-crtical regimes. A more extensive context for these definition can be found in . For completeness we also define the supercritical, subcritical, and jumping outlier regimes. The supercritical and subcritical regimes are dealt with separately in ; we plan to consider the (non-generic) jumping outlier regime in a future work.
The matrix model specified by (1-1) is in the critical regime if and for . The scaling regime of will be called near-critical. We define the exploration parameter by
where is the positive constant defined at (1-18).
We define, for , to be the unique point on the real axis greater than such that . For we can choose .
and for some .
and for some .
Note that is always greater than and . If the global maximum on is attained at several distinct points then we will say that we are in the jumping outlier regime.
The matrix model specified by (1-1) is in the subcritical regime if and for all .
3 Assumptions and results
We will make the following assumptions on , , and :
is a small-rank external source of the form (1-2) with , .
is real analytic and regular in the sense of .
Regarding assumption (i), the case when is equivalent by sending and . As for assumption (ii), in the general case when has distinct eigenvalues the kernel can be written in terms of multiple orthogonal polynomials associated to an Riemann-Hilbert problem, which is beyond the scope of this paper. The assumption of analyticity in (iii) allows us to use the nonlinear steepest-descent method for Riemann-Hilbert problems. The assumption of regularity ensures that the equilibrium measure of has square-root decay at each band endpoint (so that we can use Airy parametrices) and that these endpoints are analytic functions of near .
Next, (iv) guarantees the existence of the multiple orthogonal polynomials needed to ensure the Riemann-Hilbert problem has a solution. We note that the allowed include any convex (see the introduction of ).
We compute the large- behavior of the kernel function (1-6) in the critical regime. We explicitly compute the kernel in a neighborhood of . In the remaining portions of the complex plane, our result is that the kernel function converges to the kernel for the classical orthogonal polynomial problem with respect to . That is, away from the standard universality classes apply (i.e. the sine kernel in the bulk of the spectrum and Airy kernels at the other edges). Our main result is:
Suppose and satisfy conditions (i)–(iv). Let be fixed in some bounded set. Also let be the constant appearing in (1-18). Then for large , and for a positive integer such that with ,
where the oriented contours and are given in Figure 1 and is a quantity independent of and of the form
By dropping the drift term in (1-20) we would simply deteriorate the error estimate to which is however still vanishing since .
The constant admits an explicit integral representation for an arbitrary real-analytic potential but it is a bit complicated when the equilibrium measure is supported on multiple intervals. In the simplest case where the support of the equilibrium measure consists of a single interval then we have
where the contour of integration is a simple closed contour surrounding the support in the complex plane. We will not be using in any way the explicit form of , except the fact that it is a well–defined quantity due to the smoothness of guaranteed by the already cited Kuijlaars’ Theorem 1.3 in .
We show in Section 6.3 that our kernel is the same as the one found for nonintersecting Brownian walkers in .
Acknowledgments. The authors would like to thank Jinho Baik, Ken McLaughlin, and Dong Wang for several illuminating discussions. M. Bertola was supported by NSERC. R. Buckingham was supported by the Charles Phelps Taft Research Foundation. V. Pierce was supported by NSF grant DMS-0806219.
The perturbed equilibrium measure and the local coordinate 𝜻𝜻\boldsymbol{\zeta}
To describe a growing number of outliers, we define a perturbed equilibrium measure problem with parameter of perturbation for . Using the -function (1-7) we define
Since is regular for , it will still remain regular for small values of . Hence there exists a holomorphic function in a finite disk around such that
Previously, we have defined at . To describe the effect of growing we introduce a more exact definition . Note that
is a locally holomorphic function at because is real analytic.
For , is such that at , i.e.
where is Euler’s Gamma function and
We observe that if grows with then for sufficiently large , which will be used in the proof of Proposition 5.5. One can verify that converges to (see Definition (1.1)) when at the rate
Since for we have , for sufficiently small we still have .
From Definition 2.1, we have at (because ). For other values of , since only the term in depends on , we get .
For the subsequent exposition, we redefine in a way that is compatible with the earlier Definition 1.2.
From (2-4) and the above definition, we get
Initial analysis of the Riemann-Hilbert problem: the global parametrix
We define the contour as the positively-oriented circle centered at (the leftmost edge of the spectrum) and passing through (the rightmost edge of the spectrum). We choose the circle large enough so that is negative on the real axis to the left of . Until further notice the dependence of the various quantities on (i.e. , , , etc.) will be understood throughout. We have:
For sufficiently small and , the function {\rm Re}\!\left({\color[rgb]{0,0,1}-}{\cal P}_{3}(z)+\frac{3\kappa}{2}\log(z-\beta)\right) increases as one follows in either direction starting from (i.e. through the upper half-plane or the lower half-plane).
We now open up lenses around each of the bands in the standard way (as in the analysis of the orthogonal polynomials associated to ). We introduce the following open regions (see Figure 2):
, : The area in the upper half-plane () or lower half-plane () between the band and its appropriate adjacent lens.
: The area in the upper half-plane () or lower half-plane () between the band and the appropriate adjacent lens.
: The area in the upper half-plane () or lower half-plane () inside the contour but outside the lenses.
: The part of the upper half-plane () or lower half-plane () outside the contour .
With these definitions of regions and contours, we define in each region by
Then satisfies the following jump conditions (see Figure 2 for the orientation of the contours):
Here we have defined by which is some constant on each gap.
We will show below that the above Riemann-Hilbert problem is exponentially close to a simpler one away from the turning points such as . To be more precise, let us define a shrinking disk centered at by
In the critical case, the outer parametrix is defined as the solution of the Riemann-Hilbert problem
The function is defined below the equation (3-6).
This Riemann-Hilbert problem is essentially . The unique solution is given in Lemma 4.3, or in Lemma 4.6 in a slightly more generalized setup. We refer the interested reader to those papers since this is not essential here. In the subsequent analysis we will only need the following information.
as . In addition, has a limit as and
The local parametrix near 𝒛=𝜷𝒛𝜷\boldsymbol{z=\beta}
We construct below a local parametrix that solves a Riemann-Hilbert problem similar to the above.
The th derivative of the standard Airy function admits the contour integral representation
where the contour is shown in Figure 4. Extending the standard Airy function, we will need the following generalized Airy functions.
Let us define the following generalized Airy functions corresponding to each contour in Figure 4.
where indicates the contour depicted at Figure 4, and is a non-negative integer.
Using the generalized Airy functions, we shall construct a matrix satisfying the jump condition (see Figure 4) below.
For a positive integer , the following definition satisfies the jump condition in (4-6).
By applying the Sokhotskyi-Plemelj formula, one can satisfy the jump condition (4-6) by defining
Here we note that is holomorphic (therefore having no jump). The next step is to verify that the definitions in (4-9) are equivalent to the advocated form in (4-7) and (4-8).
First let us consider .
Using this result, becomes
It can be noticed that, in all three terms in the last expression, one can close the contours , and by adding the corresponding arcs of infinite radius. For instance, can be made a closed contour by adding the arc . Such addition is allowed because the term in
is suppressed over the infinite arc when is integrated over . The other terms work the same. Then each integration on the closed contour becomes a residue calculation that leads to the definitions in the theorem. ∎
Let stand for the (i,j) entry of . We will show in Section 6 that the leading-order asymptotics of the kernel are smooth near . Therefore it is sufficient to restrict ourselves to in region . The proofs of the following two propositions are given in Appendix A.
As with and for , , the entries of the first and second columns of behave as follows:
where the are polynomial functions of and .
The entries of the third column of behave as follows as and for , :
The asymptotic expansion of is given in the same form but with different coefficients:
The asymptotic expansion of is given by using (4-21).
As a side remark, by applying the rotational symmetry of the Airy function, we get (2-8) repeated here:
Evaluating the integral, is at .
The first few terms in the leading-order expansion of the entries of are given in Section A.3.
For and , Propositions 4.2 and 4.3 yield immediately the following expression for :
where is given by (3-11),
We will show in detail how such a transform is used to define a new matrix with the same entry-wise growth as except that the highest-order term in the third column (the explicit term in the entry) is removed.
A note is in order concerning the -independent term in the entry. There is a nilpotent matrix such that is the same as except this term is removed. We then redefine and as our starting point.
We then apply a finite sequence of Schlesinger transforms to the improved matrix to yield a final matrix of the form . In fact it is possible to use such procedure to change into a matrix arbitrarily close to the identity. However, other factors in the calculation (see (6-19)) will introduce an error into the kernel computation, so there is no point in removing smaller terms.
We start with two observations. First off, has no jump discontinuities, and the expansion of has only negative integer powers of . This is important since the Schlesinger transform will remove pole terms. Secondly, has an asymptotic expansion for large . More exactly, once the pole of the lowest order is removed from a given entry, the remaining terms are asymptotically smaller as than what was removed. Furthermore, each entry can be made to decay at an arbitrarily fast rate by removing a finite number of terms from the Laurent expansion of that entry. This follows from the behavior of the entries of ; see Propositions 4.2 and 4.3. The leading-order entries of can be read off from the formulas in Section A.3, and in principle any term can be computed as described in the proofs.
Now is an appropriate time to explain where the limitation arises (recall for ). Note in Proposition 4.2 the terms . To explicitly compute the entries of , it is necessary to use the expansions
The error analysis
where is defined by Lemma 3.3, is defined by (4-25), is defined by (3-11), and
We now define the error matrix by
The first step will be carried out explicitly to explain the procedure and will remove one representative term. The second step will remove the remaining error terms up to . There is no need to carry out these transforms explicitly as we will show they only affect the subdominant terms in the kernel. We will then use to define a refined global parametrix . The new error matrix defined using will be shown to be close to .
Our first transform removes the term in the (13) entry of : define a new matrix
Now there is a unique matrix , independent of , such that
Fix a function so . Assume that we are given a constant two-nilpotent matrix (i.e. ) , a series of numbers \{d_{j}(n)\big{|}-\infty<j\leq k\} so that and , and a matrix that is locally holomorphic at and . We also assume that uniformly on a fixed, finite disk around . Then one can uniquely determine constant (in ) matrices by requiring that defined below is locally holomorphic at :
uniformly in the same disk around , and .
Denote as follows the expansion at :
Let us collect all the terms of the order from (5-10).
This must be zero for for to be holomorphic at the origin. Since we have only unknown matrices: , the number of equations must be reduced to equations. We will show that the equations for are contained in the equations for . For the first and the last (summation) terms are absent and we have only the middle term (with double summations). The middle term is a linear combination of \left\{\left(\sum_{l=0}^{k-\widetilde{m}}{\bf F}_{l+\widetilde{m}}{\bf H}_{l}\right){\bf N}\big{|}\widetilde{m}=1,...,k\right\} (which gives an invertible linear system of equations because ) and, therefore, the set of equations are equivalent to
These are also obtained by right multiplication of (5-14) for by because the second and the last terms vanish given that . Therefore the vanishing of (5-14) for is a sufficient condition to solve for ’s. To solve these equations consider a big (block) matrix of size (where is the size of the matrices that appear in (5-14); in our case) obtained by adjoining the ’s side by side as . Then we can write the equations into a single matrix equation as follows.
where the middle term of (5-14) is hidden in . Because , the big matrix of size multiplied on the right of is invertible and, therefore, the solution can be uniquely obtained. Also it follows immediately that . From this, it also follows that is uniformly bounded by .
Lastly, to show that , we take the determinant of (5-10).
The left hand side is holomorphic (at the origin) and therefore it must be 1 to match the right hand side. ∎
Recall from Lemma 3.3 that the determinant of is one and that . Therefore, Proposition 5.1 shows that the matrices exist and
Furthermore, any series expansion of a unimodular matrix can be decomposed into products of the form , where is nilpotent as we show below in Lemma 5.2 These products can then be dealt with as explained in Proposition 5.1.
Consider a unimodular matrix with expansion
Then, for arbitrary we can find a finite number of nilpotent matrices and integers such that
The matrix can be expressed as a linear combination of the following nilpotent matrices:
We label these basis elements as with so that
for some constants . Now we may decompose as
The factor does not have a term in its expansion:
The matrix is still unimodular and hence is traceless and can be decomposed similarly as before
One can iterate this procedure to obtain the decomposition to any arbitrary order. ∎
We can thus apply Proposition 5.1 to each entry in in (5-8) to remove all error terms up to . Let be the appropriate transform from to :
Let be the order of the highest-order pole in which will need to be removed. Then Proposition 5.1 shows there are unique matrices , independent of , such that
where this error comes from removing terms in the (12) entry of . Now we can define
2 Global Error Computation
Explicitly the jumps on these contours are:
The next result follows from the definition of in (1-7).
For sufficiently small we have the estimate below, uniformly in over compact sets bounded away from the turning points , , , and :
In the critical regime, the inner and outer lenses have been chosen so that
increases along , as is increasing along this contour for each . See Lemma 3.1. ∎
We will use the following data about the functions , , and to control the jumps of the error matrices on the contours outside of the disks.
To conclude the proof of (a) we note that there is a such that provided that the segments of lie in the sector .
To prove (d) and (e) we divide the contour into two parts: one is the interval the other is . That and are negative and bounded away from zero on the first interval follows from Lemmas 5.3 and 5.4(c)–(d). Within the interval , (5-58) gives the result for (d), and for (e) we have
Again, for sufficiently large so this term improves the bound. For , we will show that for large enough the term dominates the other two. We have
for some constant . To conclude the proof of (e) we note that there is a such that ∎
We can now give bounds on the jumps of the error problem.
In the near-critical regime, for large ,
Part (a) follows from equation (5-39), Lemma 5.5, and the boundedness of .
For part (c), first recall from the Schlesinger calculations that and (as follows from (5-11), (5-22), and (5-34)). Recalling the definition of in (5-36), we see that
Then for sufficiently large there exists a constant such that
From Lemma 5.6(a), for sufficiently large there is a constant such that
The lemma then follows by a standard technique that consists of writing the solution to the Riemann-Hilbert problem in terms of a Neumann series involving ( see, for instance, Section 7.2 or Section 3.5). ∎
The kernel near the critical region
Our main goal now is to obtain the asymptotic form of the kernel (see (1-6)) uniformly for in compact subsets. The first observation is that is smooth in and because i) the first column of has no jump and ii) the second and the third rows of have no jump. However, it is still possible for the leading-order asymptotics of the kernel to exhibit a Stokes–like phenomenon, namely, a discontinuous change with respect to parameters. We now show that the leading asymptotics of are also smooth.
We note that and are the same up to a holomorphic prefactor. Therefore they have the same jump, which is
This means that the first column of and the second and third rows of have no jump. Since the leading term in the asymptotic expansion of the kernel is written in terms of those column and rows, our asymptotic expression of the kernel is smooth. Therefore, it is enough to consider, say, in region I (see Figure 4).
To arrive at our final expression for the kernel we will need to express in a simple form involving contour integrals. To do so we take advantage of the machinery of the bilinear concomitant. This requires writing as a constant multiple of a Wronskian matrix. Specifically, in region I,
We will now express in a simple form using the bilinear concomitant.
This proposition is a specific example of the more general results on the bilinear concomitant given in .
Recall the contours , , and are defined in Figure 4. Let the dual contours , , and be defined as in Figure 5. Then the entries of for are given by
In the proof we will use the same notation as Section 3, and the technical details whose proofs we leave out are given there.
The main observation is that, for fixed , each satisfies the same ordinary differential equation of third order which we now derive using integration by parts:
Associated to each of these equations is an adjoint equation obtained by replacing and interchanging the order of multiplications and differentiation operators. Its solutions have the form
where the dual contours , , and are defined in Figure 5. The bilinear concomitant for this differential equation is a bilinear pairing between the solution space of an equation and its adjoint. For the case at hand it admits the following double–integral representation :
Although appears in (6-11) it can be seen by direct differentiation that the expression (6-11) is independent of . We may follow the steps in the proof of Lemma 3.3 in to show that The paper contains a wrong sign in front of the intersection pairing. In fact formulas (3.38) and (3.39) should have the opposite sign in front of the second term in the respective integrands. Moreover, the wrong overall sign was obtained in using Lemma 3.3 to derive the final formula since formula (3.37) was to be the difference of (3.39) minus (3.38) but apparently it was miscomputed later as (3.38) minus (3.39).
where is the intersection number of the contours and . Introduce the Wronskian of solutions to the adjoint equations with entries
Then, by the definition of the bilinear concomitant in (6-11) and the pairing (6-12),
Therefore is the inverse of . Expanding out the entries of and in
We are interested only in the case and hence the contours of integration in (6-17) have no intersection; this allows us to integrate by parts and obtain in the integrand a harmless denominator . Then we have the straightforward chain of equalities, where only integration by parts is used:
2 Proof of Theorem 1
Recalling (see Lemma 5.7), we see
Using this and (6-6), the kernel is given by
where, in the last equality, we have used Proposition 6.1. We now use
as long as , i.e. as long as stays finite for . This implies that we can replace and in the kernel by the leading approximation in (6-23) without changing the error in the kernel. The mismatch from this approximation produces an error of smaller order than the one already indicated in (6-21) and yields the overall error term advocated in Theorem 1.
By dropping the in (6-23) and using in Theorem 1,
We conclude the proof noting that may be deformed to and that may be deformed to . ∎
3 Connection to the kernel in [1] for nonintersecting Brownian motions
In conclusion we observe that our expression for the kernel near the critical point is the same that was found previously in the literature for nonintersecting Brownian motions: Theorem 0.1 of gives the formula
where is a contour proceeding from to and such that is above . To see that our formula matches (6-26) we first compute the -integral to find
One makes the changes of variables and .
We conclude by observing that (i.e. rotated counter-clockwise by 90 degrees) and (i.e. rotated clockwise by 90 degrees) (with depicted in Figure 1). Note that the contour can be deformed (in the finite complex plane) as the integrand lacks a pole in -space.
Here we prove the existence of general asymptotic expansions for the first and second columns of with arbitrarily small errors (i.e. (4-15)–(4-20)). First, observe that (4-16) and (4-17) follow from (4-15), while (4-19) and (4-20) follow from (4-18). We then perform a steepest-descent analysis on the original integral representation of the generalized Airy function
Let us define , , and to be scaled versions of , , and , respectively:
Using these new variables, the exponent in (A-1) becomes
We define the saddle points for , as the solutions of . As solutions to a cubic equation, the ’s can be written explicitly. Let us, however, only write their asymptotic expressions at large :
Given a saddle point , one can expand by
The standard steepest descent method gives the leading behavior (in large ) by
where the overall sign must be determined from the direction of the contour .
Based on Lemma A.1, we may obtain the higher order expansion using the general formula
where the overall sign is related to the contour involved, and the are the polynomials defined by
Note that only the even powered terms contribute after the Gaussian integrals, which all come form the formula
We require a lemma to control the growth of the for large and :
Using Proposition A.1 we see that the leading terms in are those with the highest powers of possible, therefore we have
The terms left off are lower order in and higher order in . An application of the , , and entries of Proposition A.1 gives the result. ∎
The series in (A-11) does not converge in most cases, and one must use the original quantity (not the series expansion) to estimate the error. We can use that is analytic at and therefore
on a finite disk around of order (the radius of convergence is determined by that of ). The right-hand side of this expression follows from Lemma A.2. Note also that only the even terms will contribute to the Gaussian integration. Then the error is given by
where in the last step we used Proposition A.1. Note that
We will give here a general argument for the existence of the expansion to arbitrary order of . A similar argument will give the existence of the expansion to arbitrary order of .
Each of the terms in (A-19) have a truncated expansion whose error is dominated by .
and we have used Proposition A.1. One checks that indeed .
We control each of the remaining terms in the exponent of (A-22) separately:
is largest when . Suppose , then we have the error arising from the expansion (A-23) is
we conclude that the dominant error contribution to (A-22) from the expansions (A-23) for is
The remaining terms in (A-19) may be analyzed in a similar way, the error term (A-27) remains the dominant one, and our conclusion is that may be written as a finite collection of terms of decreasing order plus an error term of the form
This is small (in large ) for . A similar analysis may be carried out for to derive an identical error bound. The entries of the second row are then computed directly by taking a derivative in of these expressions; the entries of the third row are also computed directly by substituting for in the formulas for the first row. This completes the proof that the expansions in (4-15)–(4-20) in Proposition 4.2 are asymptotic.
A.2 Proof of Proposition 4.3
Here we prove the existence of general asymptotic expansions for the third column of (see (4-21)). To obtain the expansion of we use the definition (4-9) in terms of Cauchy transforms.
The above equality is simply the recombination of contours. Then, from Definition 4.1, we can see that the numerator is a total derivative, i.e. . Performing integration by parts, we get
The first three terms are evaluated at the endpoints of the contours, , and . Each contour starts from the same point and goes to infinity. By and the decay property of each integrand at the corresponding infinity, the first three terms vanish.
We can perform the integration by parts on the remaining three integrals recursively to finally get
We intend to obtain the asymptotic expansion of the above in large . We define such that
We divide the above -integral (on ) into two parts: one for and the other for where is set by
There exists such that, for ,
For , , and , there exists such that the following crude estimate holds for all :
This is true since each term in the left hand side is bounded by for large enough.
Using the above two estimates, we conclude that, for (where satisfies the above two characterizations), the contribution of to is bounded by
The second inequality holds if we choose large enough. The third inequality is obtained by for large enough. The last estimate is for .
An error bound of a finite Taylor expansion for a general analytic function is given by
Let us apply this to our case, and . We get, for ,
The last factor is bounded by 2 for large enough because
as . Here we have used that for .
The contribution of to is then bounded by
where the constant factor depends only on and , not on .
We include here the explicit form of the first few terms of the asymptotic expansions of the entries of to give an idea of their form. Note that more terms would be needed to carry out the Schlesinger calculations explicitly, but we do not need the exact formulas for our results. We find:
where is given by (4-22).