Edge Universality of Beta Ensembles
Paul Bourgade, Laszlo Erdos, Horng-Tzer Yau
Introduction
Eigenvalues of random matrices were envisioned by Wigner as universal models for highly correlated systems. A manifestation of this general principle is the universality of random matrix statistics, i.e., that the eigenvalue distributions of large matrices are universal in the sense that they depend only on the symmetry class of the matrix ensemble, but not on the distributions of the matrix elements. These universal eigenvalue distributions are different for eigenvalues in the interior of the spectrum and for the extreme eigenvalues near the spectral edges. In this paper, we will focus on the edge universality.
Let be the largest eigenvalue of an random Wigner matrix with normalization chosen such that the bulk spectrum is $\lambda_{N}$ for the classical Gaussian ensembles are identified by Tracy and Widom to be
where can be computed in terms of Painlevé equations and corresponds respectively to the classical orthogonal, unitary or symplectic ensemble. The edge universality means that the distributions of are given by for non Gaussian ensembles as well. In fact, this holds not only for the largest eigenvalue, but the joint distributions of any finitely many “edge eigenvalues” are universal as well.
The edge universality for a large class of Wigner matrices was first proved via the moment method by Soshnikov for unitary and orthogonal ensembles. This method requires that the distribution of the matrix elements be symmetric. The symmetry assumption was partially removed in and it was completely removed in . In addition to the symmetry assumption, the moment method also requires that sufficient high moments of the matrix elements be finite. This assumption was greatly relaxed in and it was finally proved by Lee and Yin that essentially the finiteness of the fourth moment is the sufficient and necessary condition for the Tracy-Widom edge universality to hold (an almost optimal necessary condition was established earlier in ).
We now turn to the edge universality for invariant ensembles. These are matrix models with probability density on the space of matrices given by where is a real valued potential and is the normalization. The parameter is determined by the symmetry class of . The probability distribution of the ordered eigenvalues of on the simplex determined by is given by
For classical invariant ensembles, i.e., , it is well-known that the correlation functions can be expressed in terms of orthogonal polynomials. Historically, they have been first analyzed in the bulk. The analysis at the edges is not a straightforward generalization of that in the bulk and serious technical hurdles had to be overcome. Nevertheless, the edge universality was proved by Deift-Gioev for general polynomial potentials, by Pastur-Shcherbina and Shcherbina for real analytic, even potentials.
We now compare the notions of edge and bulk universality. The edge universality refers to the distributions of individual eigenvalues. However, according to Wigner’s original vision, the bulk universality concerns differences of neighboring eigenvalues, i.e., gap distributions. The bulk universality is often formulated in terms of local correlation functions. These two notions are equivalent only after a certain averaging in the energy parameter. Strictly speaking, there are three notions of bulk universality: (i) in a weak sense which allows for energy averaging; (ii) correlation function universality at a fix energy; (iii) gap universality at a fixed label . Clearly, universality in the sense (ii) or (iii) implies (i).
The bulk universality in the sense of (ii) for classical invariant ensembles was proved in using methods related to orthogonal polynomials. For Wigner ensembles, universality for Hermitian matrices in the sense (ii) was proved in and for all symmetry classes in the sense (i) in . The gap universality, i.e., (iii), is in fact much harder to obtain; it was proved only recently in both for invariant and Wigner ensembles using new ideas from parabolic regularity theory (the special case of hermitian matrices with the first four moments of the matrix elements matching those of GUE was proved earlier in ). The bulk universality for log-gases for general was proved in the sense (i) and (iii) in . The bulk universality in the sense (ii) for Wigner ensembles with and for log-gases with remains open problems.
Returning to the edge universality, we will establish the following two results in this paper: (1) edge universality for potentials and for all ; (2) edge universality for generalized Wigner matrices (these are matrices with independent but not necessarily identically distributed entries, see Definition 2.6). An important ingredient of the proof will be an optimal location estimate for the particles up to the edge, for external potentials of class . This rigidity will also allow us to remove the analyticity assumption from previous results about bulk universality .
We now outline the technique used in this paper. For the edge universality of invariant ensembles, the basic idea is to consider a local version of the log-gas (1.1). This is the measure on consecutive particles that is obtained by fixing all other particles which act as boundary conditions. Following the standard language in statistical physics, we will refer to these local measures as local log-gases. Our core result is the “uniqueness” of this local measure in the limit assuming that the boundary conditions are “good”. By uniqueness, we mean that the distributions of the particles far away from the boundaries are independent of choice of the “good” boundary conditions. This idea first appeared in for proving the bulk universality of log-gases. However, the uniqueness of the local Gibbs state in the bulk was defined slightly differently in ; only the gap distributions were required to be independent of the boundary conditions.
It is well-known that the uniqueness of local Gibbs measures in the thermodynamical limit is closely related to the decay of correlation functions. The work of Gustavsson for the special and Gaussian case (i.e., the GUE case) indicates that in general the point-point correlation function decays only logarithmically in the bulk, i.e., . Gibbs measures with such a slow decay are typically not unique in the usual sense. The key reason why we were able to prove the uniqueness of the gap distributions of local log-gases in the bulk is the observation that the point-gap correlation, is expected to decay much faster due to the simple reason that . In real statistical physics system, however, it is very difficult to compute derivatives of correlation functions unless they are expressed almost explicitly by some expansion method. The Dirichlet form inequality , a main tool in , allows us to take advantage of the fact that the observables are functions of the gaps.
In the subsequent work , the correlation functions were expressed in terms of off-diagonal matrix elements of heat kernels describing random walks in random environments. This representation in a lattice setting was given in . In a slightly different formulation it already appeared in the earlier paper of Naddaf and Spencer , which was a probabilistic formulation of the idea of Helffer and Sjöstrand . Using this representation, the decay of the point-gap correlation amounts to the Hölder continuity of the heat kernel for the random walk dynamics . We note that the jump rates in this random walk dynamics are long ranged and contain short distance singularities depending on the stochastically driven environment. The proof of the Hölder continuity in requires extending the De Giorgi-Nash-Moser type method of Caffarelli, Chan and Vasseur to the singular coefficient case and providing a priori estimates such as rigidity and level repulsion.
It should be stressed that, despite these efforts, only gap distributions but not those of individual eigenvalues were identified in . Edge universality, however, is exactly about individual eigenvalues and not about gaps. The surprising fact is that correlation functions of log-gases decay as a power law near the edges! Thus we do not need the Hölder regularity argument from to analyze the edges. Instead, in this paper we rely on the energy method from parabolic PDE’s and on certain new Sobolev type inequalities for nonlocal operators to prove the decay of off-diagonal elements of the heat kernel. For this purpose, we will need rigidity and level repulsion estimates near the edges. We will extend the multi-scale analysis of the loop equation, first appeared in , in two directions. First, this analysis will be performed along the whole spectrum, including the edge, where the change of scaling poses a major difficulty; second, analyticity of the external potential is not required, thanks to a new analysis of the loop equation.
For the edge universality of Wigner ensembles, we will use the idea of the local relaxation flow initiated in and the Green function comparison theorem from . This theorem can be used for both the bulk or the edge universality. In particular, the eigenvalue distributions of two Wigner ensembles near the edges are the same provided that the variances of the matrix elements of the two ensembles are identical. This implied the edge universality for Wigner matrices .
On the other hand, if the variances of the matrix elements are allowed to vary, then the matrix cannot be matched to a Gaussian Wigner matrix. Thus the edge universality for generalized Wigner matrices cannot be proved directly with the Green function comparison theorem. Using the uniqueness of local log-gases, we can identify the distributions of the edge particles in the Dyson Brownian Motion (DBM). This implies the edge universality for general classes of Gaussian divisible ensembles with varying variance. Finally, we will use the Green function comparison theorem to bridge the gap between generalized Wigner matrices and their Gaussian divisible counterparts.
We emphasize that the uniqueness of local log-gases plays a central role both in the edge universality of log-gases and in our analysis of edge points in DBM. For log-gases, it is natural to localize the problem so that the external potential can be replaced by its first order approximation and thus it becomes universal after scaling. However, localization of the measure in general introduces very large errors in strongly correlated systems. The key observation is that there are strong cancellations in the effective potential for “good” boundary conditions. The significance of the local log-gases in the proof of proof of universality for Wigner matrices is subtler, and will be explained in details in Section 5.
Main results
We will have two related results, one concerns the generalized Wigner ensembles, the other one the general beta ensembles.
Consider the probability distribution on given by
for some , if is large enough. It is known that under these (in fact, even weaker) conditions the measure is normalizable, . Moreover, the averaged density of the empirical spectral measure, defined as
converges weakly to a continuous function , the equilibrium density, with compact support. We assume that is supported on a single interval , and that is regular in the sense of . We recall that is regular if its equilibrium density is positive on and vanishes like a square root at each of the endpoints of , that is
for some constants . We remark that this regularity assumption is not a strong constraint; regular potentials form a dense and open subset in the space of the potentials with a natural topology .
Let the limiting classical location of the -th particle, , be defined by
We will be interested in the usual -point correlation functions, generalizing , and defined by
where \mbox{\boldmath\lambda}^{(\sigma)}=(\lambda_{\sigma(1)},\dots,\lambda_{\sigma(N)}), with . Our main result is the following.
In the following theorem, we consider two regular potentials, and , such that their equilibrium densities and are supported on a single interval. Without loss of generality (by applying a simple scaling and shift), we may also assume that the singularities at the left edge match and both occur at , with the same constant :
Let and , be , regular and satisfy (2.3), (2.4). Assume that the equilibrium density and are supported on a single interval and satisfy (2.8).
Remark. Note that one may define in (2.6) with respect to the measure or , it does not make any difference in the above theorem when : from (2.8) one obtains , which is of smaller order than the scale detected in (2.9). We also remark that Theorem 2.1 is formulated for points near the lower spectral edge , but a similar statement holds near the upper spectral edge .
The first results on edge universality for invariant ensembles concerned the classical values of . The case and real analytic was solved in . The cases are considerably harder than . For universality was first solved for polynomial potentials in , then the real analytic case for in , which also give an alternative proof for . Finally, independently of our work with a completely different method, edge universality for any and convex polynomial was recently proved in .
Choosing and in the previous theorem allows us to identify the universal distribution from Theorem 2.1 with the Tracy-Widom distribution with parameter . This distribution can be represented via the stochastic Airy operator. We refer to for its proper definition, the Hilbert space it acts on, and the proof that its smallest eigenvalues describe the asymptotic edge fluctuations of the Gaussian beta ensembles.
Theorem 2.1 can be used to show Gaussian fluctuations for the points in an intermediate distance from the edge. Indeed, such fluctuations were proved by Gustavsson in in the Gaussian case (GUE) for all eigenvalues, and this was extended and in . Combining these results with Theorem 2.1 immediately gives the following statement (here means ).
Let or and the potential be , regular such that the equilibrium density is supported on a single interval and satisfies (2.8). Consider the measure . We define
where . Fix . Then for any sequence , with , we have in distribution.
Moreover, for some fixed and , let satisfy , and , . Then converges to a Gaussian vector with covariance matrix if , .
We note that if Gustavsson’s result on Gaussian fluctuations were known for the general Gaussian beta ensembles, then this corollary would prove a central limit theorem for general beta ensembles near the edge.
An important element in the proof of Theorem 2.1 consists in proving the following rigidity estimate asserting that any particle is very close to its limiting classical location. For any we define
where means . More precisely, by the square-root singularity of near the left edge,
and similar asymptotics hold near the right edge. The following theorem states that all particles will be close to their classical locations on this scale, up to a factor with an arbitrary small exponent . Following , we will call such a precise bound on the locations of particles a rigidity estimate. The rigidity estimate in some weaker forms has already been used as a fundamental input to prove the universality for Wigner matrices. It also played a key role in the proof of the bulk universality for the log-gases in . The following result extends the rigidity estimate from the bulk to the edges, and removes the analyticity assumption.
Let , be , regular with equilibrium density supported on a single interval , and satisfy (2.3), (2.4). For any , there are constants and such that for any and we have
Related bounds on the concentration of the empirical density on a scale far from the optimal one (2.11) were established previously , see also references in .
Thanks to Theorem 2.4, bulk universality holds for beta ensembles, as stated in , without the analyticity assumption.
Let be , regular with equilibrium density supported on a single interval , and satisfy (2.3), (2.4). Then the following two results hold.
Here is the Wigner semicircle law and are the correlation functions of the Gaussian -ensemble, i.e. with .
where and with being the -th quantile of the semicircle law defined by .
Part was proved in under the assumption that is analytic, a hypothesis that was only required for proving rigidity in the bulk of the spectrum. Theorem 2.4 proves that of class is sufficient for rigidity, and the proof of the uniqueness of the Gibbs measure is identical to . The result in these papers were stated in a limiting form, as , and for smooth observables , but the proofs hold for any continuously differentiable and with an effective error bound of order with some as well. The statement holds for the same reason, being previously proved for analytic in . ∎
We finally remark that while the rigidity estimate (2.11) holds for any , the edge universality in Theorem 2.1 was stated only for . This restriction is mainly due to that the DBM dynamics (8.1) is known to be well-posed only for . We believe that this restriction can be removed, but we will not pursue this issue in this paper.
2 Edge universality of the generalized Wigner matrices
We now define the generalized Wigner ensembles. Let be an complex Hermitian or real symmetric matrix where the matrix elements , , are independent random variables given by a probability measure with mean zero and variance ;
The distribution and its variance may depend on , but we omit this fact in the notation. We also assume that the normalized matrix elements satisfy a uniform subexponential decay,
with some fixed constant , uniformly in .
The matrix ensemble defined above is called generalized Wigner matrix if the following assumptions hold on the variances of the matrix elements (2.12)
There exist two positive constants, and , independent of such that
For Hermitian ensembles, we additionally assume that for each the covariance matrix
where is the standard Gaussian GOE or GUE ensemble, depending on the symmetry class of (It is well-known that is also given by (2.2) with potential and with the choice , respectively).
This theorem immediately implies analogues of Corollaries 2.2 and 2.3 in the case of symmetric or Hermitian generalized Wigner ensembles.
Edge universality for Wigner matrices was first proved in assuming symmetry of the distribution of the matrix elements and finiteness of all their moments. In the consequent works, after partial results in , the symmetry condition was completely eliminated . The moment condition was improved in and the optimal result was obtained in . All these works heavily rely on the fact that the variances of the matrix elements are identical. The main point of Theorem 2.7 is to consider generalized Wigner matrices, i.e., matrices with non-constant variances. In fact, it was shown in that the edge statistics for any generalized Wigner matrix are universal in the sense that they coincide with those of a generalized Gaussian Wigner matrix with the same variances, but it was not shown that the statistics are independent of the variances themselves. Theorem 2.7 provides this missing step and thus it proves the edge universality in the broadest sense.
Local equilibrium measures
Recall that the support of the equilibrium density was denoted by . Without loss of generality, by a shift we set and we will study the particles near the lower edge of the support. Fix a small exponent and a parameter satisfying
Denote by the set of the first indices. We will distinguish the first particles from the rest by renaming them as
Note that the particles keep their original indices. We recall the notation for the simplex (2.1). In short we will write
These points are always listed in increasing order and we will refer to the ’s as the external points and to the ’s as internal points. We will fix the external points (often called boundary conditions) and study the conditional measures on the internal points. Note that for any fixed , all ’s lie in the open configuration interval, denoted by
Define the local equilibrium measure (or local measure in short) on with boundary condition by
Here can be viewed as the external potential of a log-gas of the points . Although this is the natural local measure, it does not have good uniform convexity in the regime . It is more convenient to consider the following modified measure and its local version . For the proof of the universality of the original measure it will actually be sufficient to consider only the local measure .
We will fix a small parameter whose actual value is immaterial; it will be used to provide an multiplicative error bar of size in various estimates on the location of the particles. We will not carry in the notation and at the end of the proof it can be chosen sufficiently small, depending on all other exponents along the argument.
We introduce a confined measure by adding an extra quadratic potential to prevent the ’s from deviating far in the left direction:
The local version of the measure is defined in the obvious way,
For technical reasons we will also need the following variants of and where we added slightly less convexity through :
The measures , and their local versions depend on the parameters and but we do not carry this dependence in the notation.
Rigidity estimates proved for the global measure (Theorem 2.4) also hold for the local measures provided lies in the set of “good” boundary conditions that is defined as follows:
The rigidity exponent will always be chosen much smaller than the exponent in (3.1). This guarantees that the typical length of the configuration interval, , be bigger than the largest rigidity precision, .
We will need the following two modifications of . The first one requires that be good in an expectation sense w.r.t. , and that is not too negative. Thus we define the set
Notice that for technical reasons to be clear later on the constraint on is w.r.t. the measure . This condition will be important in Sect. 6.5.
Another modification adds the condition of a level repulsion near the boundary, i.e., we define
In the following theorems we establish rigidity and level repulsion estimates for the local log-gas with good boundary conditions up to the spectral edges. These theorems extend similar estimates for the local measure in the bulk of the spectrum established in to the edges for the measure .
Fix and, using the above notations, assume that . Then there exists constants (independent of ) such that for large enough we have, for any , and ,
As a side comment we remark that the Gaussian decay in (3.7) is an artifact of the additional confinement in the local measure . For the measures or , the tail probability of has a slower decay in the regime in accordance with the tail behaviour of the Tracy-Widom law (for the Gaussian beta ensemble, see for a detailed analysis of the edge tail behavior). However, Theorem 3.3 below asserts that has the correct distribution when .
We also have the following level repulsion estimates. Similar bounds for the measure in the bulk were proved in .
Let , let be an arbitrary fixed positive constant and assume that satisfies (3.1). Then there are constants such that for and for any we have
Note that these two bounds are complementary. The first one gives optimal level repulsion for arbitrary small , but the constant is not optimal. The second bound improves this constant but at the expenses of an exponentially small additive error.
We remark that statements similar to (3.9) hold for any gap , not only for the last one with . The proofs are very similar, after conditioning on the points being close to their classical locations.
We will prove the rigidity and level repulsion results only for since these bounds are needed in the proof of the main theorems. The proof of the level repulsion bounds for , however, verbatim applies to . For the rigidity bound, from Theorem 3.1 there exists a set of almost full -measure such that for any we have
The role of the confinement in the definition of is to prevent the first particle to be very negative, since it would destroy the good convexity bound on the Hessian. The reason we have to introduce and is that in a technical step (establishing rigidity for the interpolation between local equilibrium measures with two different boundary conditions, see Section 8) we need a superexponential decaying tail probability of the rigidity estimate. We establish such bound only for the confined measure and not for .
Our main technical result, Theorem 3.3 below, asserts that, for in a restricted range, the local gap statistics is essentially independent of and for good boundary conditions (see (3.4)). For a fixed , we define the classical locations of by the formula
i.e., ’s are the -th -quantiles of the density in . Recall that the support of starts from even though the configuration interval starts from minus infinity.
The core universality result on the local measures is the following theorem. It compares two local measures with potentials and and external configurations and . For notational simplicity, we will use tilde to refer to objects related to the measure .
Let and , be be regular and satisfy (2.3) and (2.4). Assume that the equilibrium density and are supported on a single interval and satisfy (2.8). Fix small positive parameters and a parameter that satisfy
with a sufficiently large universal constant , and assume that
We remark that, thanks to the conditions (2.8) and (3.12), the points and (defined by (3.10) with and ) in (3.13) can both be replaced by . To see this, we claim that for any we have
and these estimates are more accurate than the precision detected by the smooth observable in (3.13) for any . To prove (3.14), we recall and for , we have . Since the density has a square root singularity near (2.5), by assumption we have for that
Therefore, for we obtain that
As a consequence of the proof of Theorem 3.3, we also have the following correlation decay estimate.
Let , be , regular, and satisfy (2.3), (2.4). Assume that satisfies (2.8). Fix small positive parameters and assume (3.11), (3.12). Consider the local measure with . Then there is a constant , independent of , such that for any two differentiable functions on and large enough , we have
We remark that the rigidity estimate (3.7) shows that with a very high probability. Therefore, as long as , (3.16) is stronger than the trivial bound
obtained from the rigidity estimate. We believe that the optimal estimate on the correlation decay is of the following form:
and the same decay rate holds for the global measures and . A heuristic argument that this is the optimal decay rate, at least w.r.t. the GUE measure, will be given in Appendix E. It is based on an extension of the argument in . We note that this decay is quite different from the logarithmic correlation decay in the bulk
which is proven for the GUE measure in and conjectured to hold for other ensembles as well.
Theorem 3.3 is our key result. In Sections 4 and 5 we will show how to use Theorem 3.3 to prove the main Theorems 2.7 and 2.1. The proofs of these two theorems follow the arguments used in . The proofs of the auxiliary Theorem 3.1 will be given in Subsection 6.5, and Theorem 3.2 in Appendix D. The proof of Theorem 3.3 will start from Section 7 and will continue until the end of the paper.
Edge universality of beta ensembles: proof of Theorem 2.1
In this section, we shall use the edge universality Theorem 3.3 to prove global edge universality Theorem 2.1. Recall the definition of the measure with normalization factor . We start with he following lemma on properties of , defined by (3.2).
In particular, this implies that and have the same local statistics and also satisfies the following rigidity estimate: for any there exists and such that for all , , we have
with some positive constant .
Clearly, by , we have the relation among the normalization constants for and . For a lower bound, from the rigidity estimate (2.11) for we have
For any bounded nonnegative observable , we have from the rigidity estimate on that
Using this separately for the positive and negative parts of an arbitrary bounded observable, this proves (4.1). From the rigidity estimate (4.2) we have
(notice that the index of is instead of and we use instead of for later convenience). Furthermore, for any , the level repulsion estimate w.r.t. in the form proved in (3.9) implies
for . Using (4.4), we see that (4.5) also holds with replaced by . Applying this with , we have
The estimates (4.1)–(4.6) also hold for the measure instead of with the same proof.
From the rigidity estimate w.r.t. , (4.2), we have for any that
By the estimate (3.14) on , (4.7) also holds if is replaced by . From the rigidity estimate w.r.t. , we have
By (4.1) we have and also the parallel version with replaced by , we have
This guarantees that the second constraint in the definition of from (3.5) is satisfied for a set of ’s with a high -probability. The first constraint is easily satisfied for a large set of ’s by the rigidity w.r.t. . Thus we obtain
Combining (4.6) and (4.8), we obtain (4.3). ∎
where we have explicitly indicated the dependence of on . From (3.14) and we have
This condition is guaranteed by the condition (3.11) if is chosen sufficiently small. Under this condition, we have thus proved that
Recall that the -probability of the complement of the set is small, see (4.3), and we can choose where is the constant in (4.3). Together with the fact that is bounded, we can drop the characteristic function at a negligible error and we have
Edge universality of Wigner matrices: proof of Theorem 2.7
We will first prove Theorem 2.7 under the assumption that the matrix elements of the normalized matrix satisfy a uniform subexponential decay (2.13). This will be done in the following two steps. First we show that edge universality holds for Wigner matrices with a small Gaussian component. This argument is based upon the analysis of the Dyson Brownian Motion (DBM). In the second step we remove the small Gaussian component by a moment matching perturbation argument.
We first recall the notion of Dyson’s Brownian motion. It describes the evolution of the eigenvalues of a flow of Wigner matrices, , if each matrix element evolves according to independent (up to symmetry restriction) Ornstein-Uhlenbeck processes. In the Hermitian case, this process for the rescaled matrix elements is given by the stochastic differential equation
where , , are independent complex Brownian motions with variance one and are real Brownian motions of the same variance. The real symmetric case is analogous, just are real Brownian motions.
Denote the distribution of the eigenvalues \mbox{\boldmath\lambda}=(\lambda_{1},\lambda_{2},\dots,\lambda_{N}) of at time by f_{t}(\mbox{\boldmath\lambda})\mu({\rm d}\mbox{\boldmath\lambda}) where the Gaussian measure is given by (2.2) with . (This simple shift ensures that the convention made at the beginning of Section 3 holds.) The density satisfies the forward equation
with for the real symmetric case and in the complex hermitian case. The initial data given by the original generalized Wigner matrix. The main result of this section is that edge universality holds for the measure if is at least a small negative power of .
Note that, in this section, we always consider the cases or , although the proof of the following theorem could be adapted to general .
Let be the Gaussian beta ensemble, (2.2), with quadratic , and be the solution of (5.1) with initial data given by the original generalized Wigner matrix. Fix an integer and . Then there are positive constants and such that for any and for any compactly supported smooth observable we have
for any .
For any define an auxiliary potential by
The parameter will be chosen as where is some positive exponent with .
We define the probability measure , where the total Hamiltonian is given by
Here is the Gaussian Hamiltonian given by (2.2) with and is the partition function. The measure will be referred to as the relaxation measure.
Since is a generalized Wigner matrix for all , the following rigidity estimate (Theorem 2.2 and Theorem 7.6 ) holds:
where is computed w.r.t. the semicircle law and we have used as the small positive exponent needed in the rigidity estimate so that . Together with a trivial tail estimate from (2.13),
for any if is large enough.
Recall the definition of the Dirichlet form w.r.t. a probability measure
and the definition of the relative entropy of two probability measures and
The prefactor in the definition of the Dirichlet form as well as in (5.2) originates from the -rescaling of the matrix elements .
By the Bakry-Émery criterion ), the local relaxation measure satisfies the logarithmic Sobolev inequality, i.e.,
for any probability measure .
Now we recall Theorem 2.5 from (the equation (2.37) in has a typo and the correct form should be ). This theorem was first proved in ; a closely related result was obtained earlier in in .
Let be a (possibly -dependent) parameter. Consider the local relaxation measure . Set and let . Suppose there is a constant such that
Fix an . Then for any the entropy and the Dirichlet form satisfy the estimates:
where the constants depend on and .
We remark that the condition (5.6) is trivially satisfied in our applications for any since
and , where is the GOE/GUE matrix. The other two terms in (5.8) satisfy a similar bound by (5.3).
Recall the probability measure (3.2) and define by
From (5.3)–(5.4) and (5.7) (and recalling that we have shifted the eigenvalues in such a way that the left spectral edge is now shifted to ), we can check that
for any .
In this estimate we used that is bounded from below, see (2.3), and that
holds for any and .
Define to be the conditional density of w.r.t. given , i.e., it is defined by the relation . From the bound (5.10) we have the logarithmic Sobolev inequality
Combining it with the entropy inequality, we have
The following Lemma controls the Dirichlet forms for most external configurations .
Fix , , and . Suppose the initial data of the DBM is given by a generalized Wigner ensemble. Then, for any and there exists a set of good boundary conditions with
such that for any we have
Furthermore, for any bounded observable , we have
The same bounds hold if and are replaced with and where is defined by .
Similarly, the rigidity bound (5.3) with respect to can be translated to the measure for most , i.e., there exists a set with
such that for any and for any , we have
In particular, by setting we can conclude (5.16) for any . This proves the lemma. ∎
Fix , , and . Suppose the initial data of the DBM is given by a generalized Wigner ensemble. Then, for any , , and (defined in Lemma 5.4), we have
Notice that we need in order that (5.19) has a solution with . In our application we will choose arbitrarily close to 0, then we can take any with and still find sufficiently small positive exponents with so that (5.19) holds. We will not trace the precise interrelation among these exponents. This explains the restriction in Theorem 2.7.
The following proof is essentially the same as the one for Lemma 5.5 in .
We claim that the estimate (5.18) follows from
where we have used (5.16), (5.20) and (5.19). To prove (5.20), we run the reversible dynamics
starting from initial data , where the generator is the unique reversible generator with the Dirichlet form , i.e.,
Recall that from the convexity bound (5.10), is an upper bound for the time to equilibrium of this dynamics. After differentiation and integration we get,
From the Schwarz inequality with a free parameter , we can bound the last line by
Dropping the trivial subexponential error term and using that the time integral of the Dirichlet form is bounded by the initial entropy, we can bound the last line by
Using the logarithmic Sobolev inequality for and optimizing the parameter , we can bound the last term by
Combining this bound with (5.14) with the choice , we obtain (5.20). ∎
We note that if we applied (5.15) with the special choice to control (5.20), then the error estimate would have been much worse. We stress that (5.18) is not an obvious fact although we know that it holds for with high probability w.r.t. the equilibrium measure . The key point of (5.18) is that it holds for any , i.e., for a set of ’s with ”high probability” w.r.t ! We also remark that (5.18) holds only in the sense of expectation of and have not yet established that
We will finally prove this estimate (Theorem 3.1) but only after we prove the rigidity estimate for .
We can now prove the main result of this section.
We will consider only the case since the general case is only notationally more involved. From the assumption (5.19) the right hand side of (5.15) is smaller than . Choosing sufficiently small, we thus have
for all and with the -probability of satisfying (5.13).
We now apply Theorem 3.3 to the same Gaussian beta ensemble with two different boundary conditions so that
for all . Once we prove that
then by averaging (5.22) in w.r.t. we have
Since represents the probability distribution of a generalized Wigner matrix ensemble, from the rigidity estimate (5.3), we have
From the level repulsion estimate (3.9) with , we have for any that
Applying (5.15) with and using the condition (5.19), we obtain a similar estimate w.r.t. the measure , i.e.,
This estimate (5.26) and the bound (5.25) with replaced by imply (5.24) provided and (5.19) is satisfied.
holds for . To prove (5.27), for we have from (5.15) (applied to ) that
Under the assumption (5.19), the right hand side of the last equation vanishes as . Thus we have
2 Removal of the Gaussian convolution
The last step to complete the proof of edge universality is to approximate arbitrary Wigner matrices by a Gaussian divisible ensemble. We will need the following result.
then there is an and depending on in (2.13) such that or any real parameter (may depend on ) we have
for sufficiently large, where is independent of . Analogous result holds for the smallest eigenvalue and also for extensions to the joint distributions of any finite number of eigenvalues as long as (or similar results for the smallest eigenvalues).
Rigidity of the particles
Most of this section is devoted to proving Theorem 2.4 which asserts the rigidity of the particles under the measure at the optimal scale up to the edge (which, for us, means a control throughout the support of the equilibrium measure including the edge). We recall that the same statement holds for the measure (Lemma 4.1).
Our method to prove rigidity is a multiscale analysis, initiated for the bulk particles in . It is a bootstrap argument where concentration and accuracy bounds are proved in tandem, gradually for smaller and smaller scales. Concentration bound means a control on the fluctuation of a particle around its mean; this is obtained by a local logarithmic Sobolev inequality (for non-convex we need an extra convexification argument). To estimate the log-Sobolev constant we use rigidity on a larger scale. The next step is to identify the mean, this is achieved by the first loop equation, where the error term involves the improved concentration bound. This leads to a better accuracy and thus better rigidity. This information can be used to improve the concentration bound on a smaller scale, etc. In this paper we prove rigidity up to the edge, which involves new difficulties: the loop equation is less stable since the density vanishes near the edge. Moreover, the loop equation is used to improve the accuracy of one specific particle (the leftmost one, ), whose rigidity cannot originate in the pairwise interaction from surrounding particles.
This extra difficulty (lack of a natural boundary on the left) is also critical in the last subsection, where we prove Theorem 3.1, i.e., the rigidity of the particles under the conditional measure with a Gaussian tail. Extra convexity (hence rigidity) on the left of the first particle is the reason for introducing the modification of which artificially confines the first particle.
Another extra difficulty consists in improving the accuracy without assuming that is analytic. This analyticity condition was essential in the works and the previous optimal bulk rigidity estimates . It turns out that the analyticity condition can be replaced by a much weaker smoothness assumption by a more careful analysis of the first loop equation, see (6.18) and (6.38).
In this section we disregard the shift convention which sets .
For any fixed , let the classical position of the -th particle under be defined by
where is the density of . Recall that from (2.6) denotes the limiting classical location.
In the following definitions, the potential and are fixed.
We say that rigidity at scale holds if for any , there are constants and such that for any and we have
We say that concentration at scale holds if for any , there are constants and such that for any and we have
We say that accuracy at scale holds if for any , there is a constant such that for any and we have
For the proof of Theorem 2.4 the main steps are the concentration and accuracy improvements hereafter, proved in the following subsections.
Let be , regular with equilibrium density supported on a single interval , and satisfy (2.3), (2.4). Then rigidity at scale implies concentration at scale .
Let be , regular with equilibrium density supported on a single interval , and satisfy (2.3), (2.4). Then rigidity at scale implies accuracy at scale .
Notice that the accuracy improves from scale only to scale instead of as it was achieved in the bulk case (see Proposition 3.13 in ). This weaker control is due to some difficult estimates near the edge that have not been optimized.
It is known that rigidity at scale 1 holds. More precisely, for any there are positive constants , such that, for all ,
For eigenvalues in the bulk, (6.2) follows from the large deviations for the empirical spectral measure with speed , see . For the extreme eigenvalues the large deviations principle with speed is proved in for the GOE case, and extended in Theorem 2.6.6, for the general case (up to a condition on the partition function that follows from Theorem 1 (iii) in ).
We now use Propositions 6.2 and 6.3 to obtain that concentration and accuracy hold at scale . We just need to prove that concentration and accuracy at some scale imply rigidity the same scale . Then a simple induction on scales shows that rigidity holds on scale for any integer , i.e., it holds at any positive scale .
To show the key part of the induction step, assume that concentration and accuracy hold at scale . Fix any . Then for any we have
for large enough . As we have accuracy at scale , the same conclusion holds when replacing by . We thus proved, for any , the existence of some such that for all and we have
The first term can be bounded by the concentration hypothesis, the second term is 0 for large enough , thanks to (6.3). ∎
2 Initial estimates for non-analytic potentials
Let be a continuous and bounded function. Consider the probability distribution on the simplex given by
where is defined in (1.1). We denote by the Stieltjes transform for the measure :
In the following, it will be useful to have the density supported strictly in a compact interval: for given , define the following variant of conditioned to have all particles in :
We will choose to be small, fixed number. Let denote the correlation functions and the Stieltjes transform, defined in the same way as (2.7) and (6.4), but for the underlying measure . Then Lemma 1 in (strictly speaking this result is given in only for , but the proof works for any fixed ) states that under condition (2.4), for some large enough there exists some , depending only on , such that for any , we have
and for , ,
The estimates (6.6) and (6.7) actually also hold for arbitrarily small fixed thanks to the large deviations estimates (6.2), which holds not only for but also for . From now we fix this small parameter . The following Lemma relates estimates on and concentration of linear statistics of the particles.
Let be , regular such that the equilibrium density is supported on a single interval and satisfies (2.3), (2.4). Let be functions such that , and the same for . Let and . Assume that for any and we have
Then there is a constant such that, for any , we have
Let be a small constant and be chosen such that for any , , and we have
This inequality was proved in , Theorem 2.3 (ii) Let be a smooth nonnegative cutoff function; on , on , . Let be , compactly supported on , such that on , for some . From the large deviations estimate (6.2) we have, for any ,
for some . As a consequence, to prove (6.9), we can assume that is supported on . By the Helffer-Sjöstrand formula (see formula (B.13) in ),
The term involving can be evaluated using (6.8), and is bounded by . For the term, we bound by (6.8) if and by (6.10) if . We obtain
The remainder of the proof is a classical argument: using the above estimate we get
and one concludes by the exponential Markov inequality. ∎
The following lemma provides almost optimal estimates for for till order 1. For non-analytic , it improves previous estimates by Pastur and Shcherbina by a factor , and relies on their initial estimates proved in .
Let be , regular such that the equilibrium density is supported on a single interval and satisfy (2.3), (2.4). Let be a function with . Then for any there exists a constant such that, for any , , we have
Let and . Thanks to the estimates (6.6) and (6.7), we just need to prove the lemma for the Stieltjes transform instead of .
For any , let be the following property: for any there exists a constant such that, for any , we have
We will prove that implies , which concludes the proof of the lemma by induction, as holds: Pastur and Shcherbina (see Strictly speaking these estimates were proved for , but the analysis in extends to our context in a straightforward way, when . Theorem 2.3 (ii)): proved that
the second estimate being useful later along the proof. Here we used that .
Assume that holds. To prove , we will need the quasi-analytic extension of of order three:
Note that on the real axis. One easily checks that
Thanks to the estimates (6.6) and (6.7), the above equation also holds when all considered quantities are with respect to the measure instead of , up to an exponentially small error term which is uniform in :
Take such that , let be chosen later, and consider the domain , and its boundary, encircling but not . We also use the notation, for ,
uniformly in , for some . Multiplying by and integrating counterclockwise, one can write
Together with (6.13), this implies that the right hand side of (6.22) is .
Finally, to estimate (6.23), we will use the induction hypothesis . We first introduce the notations (for )
By first using the continuity of and at and then Green’s formula separately in , , we obtain (all contour integrals being counterclockwise)
where we used (6.21). A straightforward calculation from (6.15) and (6.21) yields
Moreover, as is of class , the functions have their first two derivatives on uniformly bounded for in any compact set. Consequently, we can use Lemma 6.5 with playing the role of these functions, and we easily get, assuming (which in particular guarantees the condition (6.8) in Lemma 6.5) that
in the integration regime in (6.24). By the estimates (6.25) and (6.26) we finally obtain that both error terms in (6.24) are . We proved that the right hand side of (6.22) and (6.23) together have a size bounded by . If we choose , which yields an error term at most . If we choose , which yields an error at most . This shows that holds and it concludes the proof. ∎
An immediate consequence of Lemmas 6.5 and 6.6 is the following concentration of linear statistics.
Let be , regular such that the equilibrium density is supported on a single interval and satisfy (2.3), (2.4). Let be a function such that . Then for any there exists a constant such that, for any , we have
As we mentioned in the proof of Lemma 6.6, for fixed , as is , the functions have their first two derivatives uniformly bounded for in any compact set. Consequently, using Corollary 6.7 and Lemma 6.2, we have, for any ,
3 Proof of Proposition 6.2
For the proofs of Propositions 6.2 and 6.3 we will assume that , thus and we remove the hat from the indices.
This paragraph modifies the original measure into a log-concave one, without changing the rigidity properties. This convexification first appeared in . We state the main steps hereafter for the sake of completeness, and because the explicit form of the convexified measure will be required in the next multiscale analysis, subsection 6.3.2.
Let be a continuous nonnegative function with on $\theta^{\prime\prime}\geqslant 1|x|>1\theta(x)=(x-1)^{2}\mathds{1}_{x>1}+(x+1)^{2}\mathds{1}_{x<-1}$ in the following.
is the constant appearing in the lower bound (2.3);
the function is chosen such that and, for any and ,
where is defined by ;
;
;
We say that a sequence of events is exponentially small for a sequence of probability measures if there are constants such that, for any , we have
Note that the second statement of the lemma is not a completely direct application of the first one: if rigidity at scale holds for , by using the first statement we obtain that for any there are and such that for all and
We know from (6.7) that for any , there is a such that for , we have
Similarly to Lemma 3.6 in , for any there is a such that for any event ,
Equations (6.31) and (6.32) imply that for some positive constants and ,
Equation (6.30) together with the large-deviation type estimate (6.33) imply that
and subsequently that concentration holds for at scale . That concentration for implies concentration for can be proved in a similar way (it is easier because (6.32) is not needed, the necessary decay follows directly from (6.31)). ∎
3.2 The multiscale analysis
This subsection is similar to subsection 3.2 in , but we adapted the arguments in the scalings to improve the rigidity scale up to the edges.
Let . For any given and any integer , we denote
where . The measure will be referred to as locally constrained transform of , around , with width . The dependence of the measure on will be suppressed in the notation.
We will also frequently use the following notation for block averages in any sequence :
The reason for introducing these locally constrained measures is that they improve the convexity in on the subspace orthogonal to the constants, as explained in the following lemma which is a slight modification of Lemma 3.8 of .
Write the probability measure from (6.34) as where we denote
Then and denoting , we also have
Note that in the modification of , we only removed half of the pairwise interactions This minor point was not made explicit in . between the ’s in . This allows us to use Lemma 6.9 (with the choice ) to prove the convexity of . Denoting \mathcal{V}=\mathcal{V}(\mbox{\boldmath\lambda}):=\frac{1}{2}\sum_{j}V(\lambda_{j}), we indeed have
from (6.29) and each term on the right hand side is convex by their explicit definitions.
Concerning the lower bound for , a simple calculation gives
The above convexity bound on allows us to get an improved concentration for functions depending on differences between particles, as shown in the following lemma:
A direct application of Lemmas 6.12 and 6.13 gives, by Herbst’s lemma, the following concentration estimate.
For any function with and for any we have, for some constant that depends only on and ,
When the function is chosen of type , we get in particular the following concentration.
Take any . There are constants , such that for any , any integers , any , and from Definition 6.11 associated with , we have for any ,
Relying on Corollary 6.14, writing with some constants , one only needs to prove to conclude. An explicit computation gives . ∎
The following three Lemmas are slight modifications of Lemmas 3.15, 3.16 and 3.17 from .
Assume that for rigidity at scale holds. Take arbitrary . There exist constants such that for any , any integer satisfying , any we have
where the measure is given by Definition 6.11 with parameters .
for some constants . The total variation norm is bounded by the square root of the entropy (defined for a probability measure and a probability density (w.r.t. ), by ); moreover, by (6.33) and (6.35) the particles are bounded with very high probability, both for the measure and . We therefore have
for some independent of . In order to bound this entropy, note that the measure satisfies a logarithmic Sobolev inequality with constant of order (this follows from the convexity estimate obtained in Lemma 6.9 and an application of the Bakry-Émery criterion ): for any smooth with , we have
for some small fixed . We therefore obtain, for some large fixed ,
We claim that the above expectation can be bounded by for some fixed if is large. To prove this exponential bound, we assume for simplicity. As we saw at the beginning of this proof, if the above term is non-zero then either or is greater than , and both events have exponentially small probability. Together with and (6.33), this proves the desired estimate (6.37). ∎
Assume that for rigidity at scale holds. Take arbitrary . There are constants and such that for any , any integers , , and , we have
By Lemma 6.15 we know that the result holds when considering instead of . Moreover, by Lemma 6.16 the difference
is exponentially small. So we just need to prove that
Assume that for rigidity at scale holds. For any , there are constants such that for any and , we have
By Lemma 6.17, for any , each one of these terms has an exponentially small probability of being greater than . Consequently, choosing any and (and therefore ) such that concludes the proof. ∎
By Lemma 6.18, the first term has exponentially small probability to be greater than . Moreover, as satisfies (6.36), by the classical Herbst’s lemma (see e.g. ), the second term has exponentially small probability to be greater than . This concludes the proof of concentration at scale for the measure .
Consequently, by Lemma 6.10, for any , there are constants such that for any and we have
This probability bound together with (6.31) implies that
uniformly in and , and concludes the proof of concentration at scale for . ∎
4 Proof of Proposition 6.3
We aim at improving the accuracy from scale to scale , now that we know concentration at scale from the proven Proposition 6.2. In and we proved that, in the bulk of the spectrum,
Concentration at scale then allowed us to properly bound the above variance term, which yielded good estimates on and therefore an improved accuracy. In these previous works analyticity of was essential, as it was in and .
In the above equation, the integral term can be neglected thanks to ((6.28)). The and terms are easily shown to be of negligible order too, so for close to we have
For close to the bulk of the spectrum, is bounded away from , so this equation yields an accurate upper bound on .
The rest of the proof of accuracy improvement involves a major technical difficulty: optimal estimates up to the edge are difficult to obtain, because vanishes when is close to or . As a main difference from the accuracy improvement in , our current use of the loop equation will allow finer estimates, improving accuracy of one given particle (the first one), in Lemma 6.25. The accuracy improvement for both extreme particles together with the amelioration for ’s with will imply improvement for all particles. The following series of lemmas makes these heuristics rigorous.
the distance of from the edges of the support of the equilibrium measure. Also, in this section, means as . We will finally use the notations
as , uniformly in for some fixed and small . Then for any there are constants , such that for any we have
The same statement holds when replacing everywhere by .
where we used an easy estimate due to the square root singularity of the equilibrium measure on the edges. Equation (6.38) therefore implies
where there is a constant such that for any for any and , (we used (6.28) to bound the integral term in (6.38)).
To solve the above quadratic equation (6.40), we need a priori estimates on the coefficients. As has a square root singularity close to the edges, there is a constant such that
On the other hand, unifomly in we have
Moreover, from (6.39) and (6.42), the estimate
holds. From the estimates (6.43) and (6.44) we have , so the quadratic equation (6.40) yields
For in the bulk and we know that and , so the appropriate asymptotics needs to be . By continuity, this holds in , concluding the proof. In the case of the domain , the proof is the same. ∎
The following lemma is similar to the previous one, but aims at controlling the extreme eigenvalues. For this, we introduce the notation
Assume that for some , ,
uniformly on . Then for any we have, uniformly on , we have
This lemma can be proved in a way perfectly analogous to Lemma 6.19: we solve the quadratic equation (6.38), after bounding its integral term by . Two solutions are possible, which have asymptotics (using (6.41) and (6.46))
The proofs of the following three technical lemmas are postponed to Appendix A.
Assume that rigidity at scale and concentration at scale hold. Then for any fixed , uniformly on one has
Assume that rigidity at scale holds, and moreover that the extra rigidity at scale holds except for a few edge particles, in the following sense: for any , there are constants such that for any and we have
Let and be small enough. Then uniformly in one has
Assume that rigidity at scale holds, and moreover that the extra rigidity at scale holds except for a few edge particles, in the following sense: for any , there are constants such that for any and we have
Let . Then uniformly in (defined in (6.45)) we have
We will need to transfer information on the Stieltjes transform to the typical location of the points. The following result is similar to Lemma 2.3 in for example, except that this version will be suited to take into account the weaker information on near the edges.
a) Let be an arbitrary signed measure (depending on ) and let
be its Stieltjes transform. Let be fixed, , and . Assume that for some (possibly -dependent) we have
b) The same result holds for a specific value of below , namely for that is the unique solution of the equation .
We prove a), item b) is analogous. From (B.13) in :
for some universal , where is a smooth cutoff function with support in $\chi(y)=1|y|\leqslant\tau/2\OO(U/N)$.
Concerning the first integral, we split it into the domains and . By symmetry we only need to consider positive . The integral on the domain is easily bounded by
On the domain , we integrate by parts twice (first in , then in ), and use the Cauchy-Riemann equation () to obtain:
The first term (6.52) can be bounded by (6.49), it is
The second term, (6.53), can also be bounded thanks to (6.49), by , concluding the proof. ∎
Assume that rigidity at scale holds, and moreover that the extra rigidity at scale holds except for a few edge particles, in the following sense: for any , there are constants such that for any and we have
Then for any and large enough , we have
To prove (6.55) we will rely on lemmas 6.20 and 6.23. From the hypothesis (6.54) the conclusions (6.47) and (6.48) hold (our final choice for will satisfy the required bounds: ). As a consequence, to check the a priori bound (6.46) uniformly on , it is sufficient to prove that for small enough,
These conditions hold trivially when for example, which will be true with our choice. As , the first two terms in the are harmless, and will be satisfied in our final choice for (we will have ). The last constraint for is trivial.
On the other hand for any (we will choose greater and close to ), we have (in the first inequality we use that the concentration scale of around , , is much smaller than the scale ),
where for the last inequality we simply used that whenever . The latter inequality holds with probability since its complement is included in , but is concentrated at scale and in our final choice for ().
We now want to remove the assumption from (6.57) and bound the associated error term. For any such that we have
where we used , and chose so small that . We also used that is rigid at scale and these bounds hold outside of a set of exponentially small probability. Our final choice of and will satisfy (, ), consequently for any such that we have and we can apply
Thus, using (6.58) and we obtain
Because of accuracy at scale and concentration at scale for particles with index , we also have (using (6.59) and (6.60))
Consequently, when comparing the exponents of in equations (6.62), using the estimates (6.56), (6.63) and (6.64), and using that and , one of the following inequalities holds:
For the choice , , , and small enough, one can check that none of these equations is satisfied (these optimal constants and are obtained when, for , the third and fifth equations are equal). This is a contradiction concluding the proof. ∎
For simplicity we will improve accuracy only for particles close to the edge , , the other edge being proved in a similar way. We assume rigidity at scale . By Proposition 6.2 concentration at scale holds. Therefore, for any , by Lemma 6.21, uniformly on we have
uniformly on . To see this, as we always have . Moreover, if we have , so , so , completing the proof of (6.65).
Consequently, the conclusion of Lemma 6.19 holds: uniformly on , we have
One can therefore apply Lemma 6.24 with the choice , and (the extra assumption (6.50) about the macroscopic behaviour of holds thanks to Lemma 6.6 and condition (6.51) is satisfied thanks to (6.7)): we proved that, for any , we have
for any . Here as defined in Lemma 6.24. We choose some , so that , thus . We therefore have, using (6.66),
The error can be included into the first error term. We first assume that , and we choose (as defined in (6.1)) in the above equations, where the condition is satisfied when . We get , hence
This implies accuracy at scale : if we have , so by linearizing (6.67) we obtain
We proved that accuracy at scale holds provided that , for arbitrarily close to . We know that, for such , together with concentration at scale this implies rigidity at scale (by the same reasoning as in the proof of Theorem 2.4). This allows us first to use Lemma 6.25 to obtain that, for any , for large enough we have
It also allows us to use Lemmas 6.22 and 6.19 together to conclude that for any and small enough, we have, uniformly in ,
By part of Lemma 6.24, with , , this implies that there is a function on , on , such that
(since in this interval ), hence there is some such that for large enough we have
In particular, as when , the previous equation proves accuracy at scale for any with . For the remaining , we use (6.68), which also gives accuracy at scale because . ∎
5 Proof of Theorem 3.1
This proof goes along the same lines as the one of Theorem 2.4 up to two major differences that make it easier:
For large enough , the Hamitonian will be shown to be convex, so there is no need for introducing any convexified measure.
By the following easy lemma, the first particle satisfies a strong form of rigidity concerning deviations on the left.
There exists a constants depending only on such that for any and we have, for any ,
This concludes the proof (bounding the probability by 1 when ). ∎
The following notion of conditional rigidity at scale will be useful in our proof of optimal conditional rigidity, i.e., Theorem 3.1. It is analogous to Definition 6.1 in , which was in the context of bulk eigenvalues.
The parameter is considered fixed in this definition.
Following ideas from Section 6.1 in , we set and will consider a sequence (for some large constant ) such that for any we have (meaning that ). Here is a constant bounded by . Our first task is to prove conditional rigidity at scale for .
If , we get that (remember that the rigidity exponent is much smaller than the exponent in (3.1), so for ). If then , so in all cases we proved the inequality
because . Moreover, using the definition (3.5), we know that
The proof of the above equation relies on Herbst’s argument for concentration of measure from the logarithmic Sobolev inequality, and Lemma 3.9 in to obtain a local LSI. Note that the assumptions of this Lemma are satisfied in our case: one can decompose where
and is convex, thanks to the confining term which applies to all ’s, . Compared to (6.12) in , we obtained instead of due to and the factor in (6.72) instead of .
Moreover, using the boundedness of the ’s on the right and Lemma 6.26 on the left, similarly to (6.73) we easily obtain
Combining this with (i) and using we get
We therefore proved (i) on scale provided that .
This concludes the induction. Notice that the constant in the Gaussian tail deteriorates at each step, but we perform only finitely many steps. The result (ii) at the final scale finishes the proof of Theorem 3.1.
Analysis of the local Gibbs measure
Before studying , we remind well-known properties of the equilibrium density, at the macroscopic level: can be obtained as the unique solution to the variational problem
We now switch to the microscopic coordinates with a scaling adapted to the left edge of the spectrum at , i.e., we consider the scaling transformation . In this new coordinate, the gaps of the points at the edge are order one and the gaps in the bulk are of order . With a slight abuse of notation we will still use the same letters for the internal and external points, but from now on they should be understood in the microscopic coordinates except in the Appendix A. This means that the classical location of the -th point and the -th gap are
for any , see (2.10) (here the constant is adjusted to be 1, from the choice of normalization (2.8) and the scaling ). Recall we partition the external and internal points as
Given a boundary condition , we again set to be the configuration interval, and let be -quantiles of the density in exactly as in (3.10):
The measure from (3.2) in microscopic coordinate reads as
and the local measures are defined analogously:
Here can be viewed as the external potential of the log-gas.
Recall the rigidity bound (4.2) for . The definitions of the good boundary conditions (3.4), (3.5) and (3.6) are also rescaled:
In the new coordinates, the lower bound (5.10) on the Hessian of reads as
We also have the rescaled form of (3.14) that for any
The main universality result on the local measures is the following theorem, which is essentially the rescaled version of Theorem 3.3. We will first complete the proof of Theorem 3.3, then the rest of the paper is devoted to the proof of Theorem 7.1 which will be completed at the end of Section 10.4.
We assume the conditions of Theorem 3.3, in particular that the parameters and satisfy (3.11) and (3.12). Let and be two different boundary conditions satisfying
The main tool for proving Theorem 7.1 is the interpolating measure between and which will be defined in Section 7.3.
2 Proof of Theorem 3.3 from Theorem 7.1
and the cutoff potential , where
From and , we define the rescaled measure by the formula (2.2) and (7.5). For any observable we clearly have the relation
Furthermore, the equilibrium density for the measure (defined by the variational principle (7.1); notice that it is independent of the cutoff ) satisfies
Notice that if w.r.t. the measure then w.r.t. the measure by simple scaling. Again by scaling, we have
and thus (7.10) holds w.r.t. the measure . Furthermore, we can check (7.11) holds with replaced by . Instead of (2.8), we now have
In order to prove (7.14), we need to check that the following proof of (7.12) holds with (2.8) replaced by (7.15) and the very minor change of (7.11) just mentioned. The task is straightforward and we will only remark on a small change in the proof near the equation (7.16).
We make another small observation. Similarly to the remark after Theorem 3.3, we can replace by or simply by for the purpose of proving Theorem 7.1 as long as . This follows from the smoothness of , from (7.8) and from (7.15) that implies . If we are dealing with the measure , then for there is such that
where we have also used . From the rescaling identity (7.13) applied to an observable of special form, we have
From the rigidity estimate (3.7) (notice we need to change to the microscopic coordinates), we have
3 Outline of the proof of Theorem 7.1
The basic idea to prove (7.12) is to introduce a one-parameter family of interpolating measures between any two measures and with potentials and with fixed boundary conditions and and possible two different external potentials and . These measures are defined for any by
Notice that and . Basic properties of the measure will be established in Section 8. Now we outline our main steps to prove (7.12).
Interpolation. For any observable , we rewrite the difference of the expectations of w.r.t. the two different local measures by
So the main goal is to show that for any with good boundary conditions we have
This will hold for a certain class of observables that depend on a few coordinates near the left edge. The class of observables we are interested in have the form
Random walk representation. For any smooth observables and and any time we have the following representation formula for the time dependent correlation function (see (9.3) for the precise statement):
The matrix depends on time through the path , i.e., it is of the form . It will be defined in (9.1) and it is related to the Hessian of the Hamiltonian of the measure . Using rigidity estimates on the path , we will show that with very high probability the matrix elements of satisfy the time-independent lower bound
up to irrelevant factors (see (10.14), (10.15)).
We apply the random walk representation (7.26) for and . This is sufficient since the time to equilibrium for the process is of order , which will be guaranteed by convexity properties of the Hamiltonian of the measure (Lemma 8.1).
If the coefficient matrix satisfies (7.27), then the semigroup associated with the equation
has good decay estimates (Proposition 10.4) that follow from energy method and a new Sobolev inequality (Proposition 10.5). Rigidity estimates w.r.t. (Lemma 8.2) will ensure that the bound (7.27) holds with very high probability. The decay estimates together with the bound
that also follows from rigidity, will allow us to reduce the upper limit in the time integration in (7.26) from to in (7.26). The necessary rigidity estimate w.r.t. is obtained by interpolating between the rigidity estimates for and .
Finally, we also have a time dependent version of the decay estimate that follows from a different Sobolev inequality (see Theorem 10.8). More precisely, in Lemma 10.7 we will show that if the matrix elements satisfy (7.27), then for the -th coordinate of the solution to (7.28) we have for any
(up to irrelevant factors). We will apply this bound with to control the remaining time integration from to in (7.26).
Properties of the interpolating measure
In this section we establish the necessary apriori results for , defined in (7.21). We start with its speed to equilibrium from a convexity bound on the Hessian. The measure defines a Dirichlet form and its generator in the usual way:
Note that in the context of studying the dynamics near the edge in the microscopic coordinates, the natural Dirichlet form is defined without the prefactor in contrast to (5.5) and (5.2), where the scaling was dictated by the bulk.
Finally, let denote the corresponding stochastic process (local Dyson Brownian motion), given by
Let be any fixed positive constant and assume satisfies (3.1). Let , and set . Then the measure satisfies the logarithmic Sobolev inequality
and the time to equilibrium for the dynamics is at most of order . ∎
Next, we formulate the rigidity and level repulsion bounds for .
Let be any fixed positive constant and assume satisfies (3.1). Let , and set . Recall also the definition of from (7.4). Then the following holds:
(i) [Rigidity] There is a constant such that
(ii) [Level repulsion] For any we have
The key to translate the rigidity estimate of the measures and to the measure is the following lemma.
Let satisfy (3.1) and . Consider the local equilibrium measure defined in (7.6) and assume that (7.10) is satisfied. Let be the measure defined in (7.21). Recall that denote the equidistant points in , see (7.4). Then there exists a constant , independent of , such that
We first recall the following estimate on the entropy from Lemma 6.9 of .
Suppose is a probability measure and for some function with and normalization . Then we can bound the entropy by
Consider two probability measures , . Denote by the function
and set as above. Then we can bound the entropy by
We now apply this lemma with and to prove that
To see this, by definition of and the rigidity estimate (2.11), we have
We now assume that (8.8) holds with the choice of for simplicity of notation. By the entropy inequality, we have
Given (8.7), the proof of (8.2) follows from the argument in the proof of Theorem 3.1. Once the rigidity bound (8.2) is proved, we can follow the proof of Theorem 3.2 to obtain the repulsion estimates (8.3)-(8.4). The only modification is that we use the potential of the measure (see (7.22)) instead of . The analogue of (see (D.5)) can be directly defined for as
Formula (D.4) will be slightly modified, e.g. the factor will be replaced with , but it does not change the estimates. Similarly, the necessary bound (C.3) for the potential easily follows from (8.10) and the same bounds on and . Finally, (8.5) and (8.6) are trivial consequences of (8.3) and (8.4). ∎
Random walk representation for the correlation function
The first step to prove (7.24) is to use the random walk representation formula from Proposition 7.1 of which we restate in Proposition 9.1 below. This formula in a lattice setting was given in Proposition 2.2 of (see also Proposition 3.1 in ). The random walk representation already appeared in the earlier paper of Naddaf and Spencer , which was a probabilistic formulation of the idea of Helffer and Sjöstrand .
(Notice that depends only on ).
Here for any and for any path , we define as the solution to the equation
The dependence of on the path is present via the dependence . In other words, is the fundamental solution of the heat semigroup .
Proof of Theorem 7.1
From now on we assume the conditions of Theorem 7.1. In particular we are given some and we assume that the boundary conditions satisfy and (7.10).
We now start to estimate the correlation function in (7.24). We first apply the formula (9.3) with replaced by defined in (Step 1.) so that
We collect information on in the following lemma:
for some small and let . Then for any we have
The bound (10.2) follows from (8.3), while (10.4) will be proven in Appendix C. ∎
Since the time to equilibrium of the dynamics is of order (see Lemma 8.1), by choosing
2 Set of good paths
We have a good control on the solution to (9.4) if the coordinates of the trajectory remain close to the classical locations . Setting a constant ( is the constant in (8.2)), for any we thus define the set of “good” path as:
Assume that the rigidity estimate (8.2) holds for the measure . For the cutoff time , there exists a positive constant , depending on , such that
We first recall the following result of Kipnis-Varadhan :
For any process with a reversible measure and Dirichlet form , we have
To apply this lemma, let with
3 Restriction to the set 𝒢T{\mathcal{G}}_{T}
Now we show that the expectation (10.7) can be restricted to the good set with a small error. With a slight abuse of notations we use also to denote the characteristic function of the set . For a fixed and for a fixed we can estimate the contribution of the by
Since as a matrix, the equation (9.4) is contraction in . Clearly is a contraction in as well, hence it is a contraction in any , , by interpolation. By the Hölder inequality and the -contraction for some , we have , so we get
with some . Here we used (10.9) for the first factor. In the second factor, after the invariance of the dynamics, we used the explicit form of (Step 1.) and the level repulsion bound (8.6):
In the next step we will reduce the upper limit of the time integration from to . This reduction uses effective bounds on the solution to (9.4) that we will obtain with energy method and Nash-type argument.
4 Energy method and the evolution equation on the good set 𝒢{\mathcal{G}}
In order to study the evolution equation (9.4) with in the good set , we consider the following general evolution equation
Here and are time dependent matrices of the form
For satisfying the rigidity bound defined in the good path (10.8) we have
for some constant . Similarly, for and satisfying the rigidity bound defined in the good path (10.8) we have
where we have used the definition of in (9.2) and .
Denote the -norm of a vector by
Let be given in (10.13) and consider the evolution equation (10.12). Fix . Suppose that for some constant the coefficients of satisfy
Then for any and for any small we have the decay estimate
We consider only the case , the general case follows from scaling. We follow the idea of Nash and start from the -identity
with some positive constant . In the first inequality, to estimate the term, we have used that
to estimate the summation in (10.19) when one of the indices is bigger than . In the second inequality we used that
for any which is the support of . In the third inequality we used the discrete version of the following Sobolev type inequality that will be proved in Appendix B.
We will formulate our result both in the continuous and in the discrete setting.
Discrete version. For any small there exists such that for any sequence we have
We now return to the proof of Proposition 10.4. Combining (10.29), (10.19) with the simple Hölder estimate
since is decreasing. Thus
Thus, after interpolation we have proved (10.18). ∎
Now we apply Proposition 10.4 to our case.
Fix and set as defined in (9.1). On the set , the coefficients of satisfy (10.16) and (10.17) with the constant . Consequently, the solution to
From the estimates on and proved in (10.14, 10.15), we have proved the estimates on the kernel elements in Lemma 10.4 with . Thus (10.22) directly follows from (10.18). ∎
5 Second time cutoff
Now we specialize the observable to be of the form (7.25). Thus depends only on variables with indices in and with a finite fixed number. Its derivative is bounded by
With the help of Corollary 10.6, we can reduce the upper limit of the time integration in (10.11) from to . More precisely, using the bound of (10.22) with the choice , the integration from to in (10.11) is bounded by
where we also used (10.23) and (10.4) together with the fact that, on the set , satisfies (10.3).
with a sufficiently large constant , we conclude from (10.11) and (10.5) that
with the special choice of from (7.25).
6 A space-time decay estimate and completion of the proof of Theorem 7.1
Using (10.4), the first term in (10.26) is estimated by
The last term can be estimated using a new space-time decay estimate for the equation (10.12). Roughly speaking, the energy method asserts that the total dissipation is bounded by the initial norm. We will apply this idea to the vector , see (10.30), and combine it with a new Sobolev inequality to obtain a a control on the time integral of a weighted norm in terms of the norm (the weight comes from the fact that the dissipative term is inhomogenous in space). More precisely, we have the following estimate.
Consider as defined in (9.1). Suppose that the coefficients satisfy (10.16) and (10.17) with a constant . Then for any exponent there is a constant such that the solution to
satisfies, for any integer and for any positive time ,
With some positive constant we have the following estimate for the solution :
where we dropped the potential term and used the symmetry of in the first step. In the second step we used and the straighforward calculus inequality
with some . Integrating (10.29) from 0 to any we thus have
Using the lower bound on the coefficients of , we get
Now we formulate another Sobolev-type inequality which will be proved in Appendix B.
The factor is probably an artifact of our proof. The factor is optimal as we can take and for all other .
Using Theorem 10.8 with the choice , we have for any ,
where in the last step we used that the norm does not increase in time by (10.29). This completes the proof of Lemma 10.7. ∎
On the set , the coefficients of satisfy the bounds (10.16) and (10.17) with the constant . Using a Hölder inequality
and then (10.28), with the choice of from (10.25), we can complete the bound (10.27):
Combining (10.26), (10.27) and (10.32) we get
with the special choice of from (7.25). For any there exists an such that the exponent of is negative. Then, with a sufficiently small (depending on , and ) we obtain (7.24) and this completes the proof of Theorem 7.1. ∎
We follow the proof of Theorem 7.1, but instead of and we use the simple observables , depending on a single coordinate. Then the analogue of (10.5) gives a bound and (10.26) reads
where in the last step we used (10.28) with (10.31) as above and an inequality similar to (10.5) with (notice that the factor is not needed now.) Choosing very close to 1, we can replace with at the expense of increasing the constant in the exponent of . Optimizing these two estimates yields the choice and thus
Taking into account the rescaling explained in Section 7.1, which results in the additional factor due to the derivatives, this proves (3.15) in Theorem 3.4. ∎
Appendix A Proof of lemmas 6.21, 6.22 and 6.23
Let be fixed and arbitrarily small as in the statement of the lemma and in the definition of . In this proof, the notation means that there is an absolute constant depending only on such that for any element one has . In the same way, means for some depending only on .
For any fixed with , we define the index such that . For notational simplicity, we assume without loss of generality that and . Note that
when , from the definition of , and . Moreover, we will often use the fact that, as a consequence of , we have
Then for any fixed (we will choose close to , ) we have
We first assume that . Notice that
from the choice of and from the rigidity bound for with any . Since , we have . Using that , one can choose such that in (A.4) dominates the two error terms, for .
Suppose now that , then (A.4) can be improved by noticing that
(using rigidity for ), thus we can use
instead of (A.4). Since , we have , which is larger than the error term in (A.5).
To summarize, we proved the following estimates:
Sum over internal points. We first consider . This is smaller than
This last term is, as expected, smaller than which holds for the following reasons.
Case . The desired inequality is .
As , the desired inequality is . This holds because , hence , and .
Case . The desired inequality is . We distinguish two cases. For large , namely for , from we have
whenever . As , we have either or , so in any case we have proved the expected result.
We first consider . This summation is non-empty if .
In the case , we have
where the last step holds because , where the last inequality follows from (A.1) and the fact that .
If , we first consider the case . The following holds (using (A.1))
because .
In the last possible case , we have
because and we used (A.1).
where in the last inequality we used and , this last relation holds because on we have .
where in the last step we used that on the domain , we have .
Sum over external points on the left. We now consider , which is non-trivial only for . Beginning similarly to the previous paragraph, we can write
where in the last step we used the following.
If , then the desired inequality is which follows from , which holds since .
If , the desired relation is which again follows from as before, since .
We now consider the term.
If and , we have , so the desired result is equivalent to , i.e., , which obviously holds by the assumption .
If and , is bounded by
where in the last step we used (A.1) and that from (A.2).
If , we also have which is properly bounded, exactly as we proved it for the proof of on the domain .
A.2 Proof of Lemma 6.22
Let and . On , we have , so we want to prove that uniformly in we have
This concludes the proof because, for , , we have both
A.3 Proof of Lemma 6.23
Let . We begin with the bound on :
If and , then the contributions of both terms are easily bounded by
If , then by rigidity at scale we can use the second term in (A.6) to estimate all indices . By choosing , this gives the expected result (6.47).
We now bound the variance term, in the same way as in the previous subsection:
The announced bounds then follow by a computation of the above terms.
Appendix B Two Sobolev-type inequalities
In this section we prove two Sobolev type inequalities. The first one has a discrete and continuous version, the second one is valid only in the discrete setup.
with some explicit constant , where .
In order to bring the left hand side of (10.20) into the form similar to (B.1), we estimate, for ,
(for we have and it follows directly, for , i.e., , and we get ). Thus to prove (10.20), it is sufficient to show that
holds for any function supported on .
where we used that for positive numbers. Thus
Since is symmetric, we can assume in computing the second term:
We need that for small . Since is clearly continuous, it is sufficient to show that . This can be seen by the substitution for
since . (What we really used about the weight function is that for any .) Once , we can choose a sufficiently small so that as well. From now on we fix such a small .
So the positive term can be dropped and in order to prove (B.4), we need to prove
Denote , (recall ), we need to prove that
Recall the weighted Hardy-Littlewood-Sobolev inequality in -dimensions
In our case, , and all conditions are satisfied if we take . This completes the proof of the continuous part of Proposition 10.5. Part (ii), the discrete version (10.21), follows from (10.20) by linear interpolation exactly as in the proof of Proposition B.2 in . ∎
Continuing this procedure, after steps we get
Appendix C Proof of Lemma 10.1
Let with a constant (from the definition of ). We define
where we split the external points into two sets. The nearby external points (with indices ) are kept explicitly, while the far away points, , are kept together with the potential in because there is a cancellation between them to explore. The proof of the following lemma on the derivative of is postponed to the end of this section.
For any and with a large constant , we have
Here we assume that the density satisfies (2.8).
From the definitions (Step 1.), (C.1) we claim that
Notice that the summation over starts from , this is because the boundary terms , present both in and , cancel out. Using by the definition of , each term in the summation is bounded by . So its contribution is at most . We will use this bound for . For , we use and this gives the estimate on the first term in (C.4).
For the second term in (C.4) we use (C.2) to have
Notice that with a precision smaller than since
by the definition of , by (7.3) and (10.1). Thus we have
using that . Thus the error term in (C.5) is bounded by the r.h.s. of (10.4).
Finally, in the main term of (C.5) we use the asymptotics (7.15). The density is a -function of size of order on the integration domain. Thus a simple analysis, similar to the proof of (C.9) in the Appendix shows that
which is smaller than the r.h.s. of (10.4) by (10.1). This proves (10.4). The proof of (10.5) trivially follows from (10.4). This completes the proof of Lemma 10.1.
where we have used the equation (7.2). Thanks to rigidity, , we can replace ’s with ’s at an error
where we also used that for any and we have since is larger than the rigidity error . For the purpose of the estimates, we can thus replace with . The last step in (C.7) is a simple estimate.
with . The error can be written as
Thus for the error is bounded by
using for and that . The calculation in the last line is the same as in (C.7). Thus
Here we used that is comparable with and on the integration domain and that , see (7.3). Finally we used (10.1). Thus from (C.8) we obtained (C.2).
To obtain the bound in (C.3), we first notice in the error term in (C.2) we have since . So this can be bounded by the r.h.s. of (C.3).
The singular integral in (C.2), up to logarithmic factors, is bounded by the size of on this interval, which is at most , so this term is also bounded by the r.h.s. of (C.3). More precisely, for any and for density satisfying (2.8), we claim that
Since in our case, by the choice of , and are separated by at least , we indeed get (with )
Finally, we need to consider the case . The only difference from the proof for is that the equilibrium relation (7.2) holds with an error term:
that can be easily seen by comparing it with the case and using that is smooth and
by . This error term in (C.6) yields an error of size in the final result, which is smaller than the r.h.s. of (C.3). We thus proved Lemma C.1. ∎
Appendix D Level repulsion for the local measure: Proof of Theorem 3.2
The proof in this section uses ideas similar to those in . Before we start the actual proof of Theorem 3.2, we need some Lemmas. We first introduce an auxiliary measure which is a slightly modified version of the local equilibrium measures:
where is chosen for normalization. In other words, we drop the term from the measure in . We first prove estimates weaker than (3.8)-(3.9) for and .
Let . We have for any
The very same estimates hold if is replaced with .
We set and with . By we know that
We decompose the configurational space according to the number of the particles in , which we denote by . For any (with a small constant smaller than 1/2) we consider
where in the particle sector we changed variables to
We also exploited the fact that for we have .
Now we compare with . We fix and we work in each sector separately. The mixed interaction terms can be estimated by
for any . To estimate the effect of the scaling in the potential term , we fix a parameter with . For , i.e , we write
Notice that the index is always between 1 and , so any limits of summations automatically include this condition as well.
For the potential we have
where we have used and . The derivative of will be estimated in (C.3). In summary, from (D.6) we have the lower bound
For the other factors in (D.4), we use if , thus
Choose . After multiplying these estimates for all we thus have the bound
and after bringing this factor out of the summation, the remaining sum is just . We thus have
Now we choose . Therefore the -probability of can be estimated by
For the proof of (D.2), we first insert the characteristic function of the set
into the integral defining and denote the new quantity by . Clearly and by the rigidity bound (3.7) we know that
since .
To estimate , we follow the previous proof with two modifications. First we notice that the summation over in the definition of is restricted to on the set , since no more than particles can fall into the interval if they are approximately regularly spaced.
The other change concerns the estimate of the mixed terms (D.3) which will be improved to
for any . Here we used that for any numbers . On the set we have, by definitions of and , that
Recall that and thus . For indices with a sufficiently large we can replace with with replacement error which is smaller than . Together with , we have
The bound (D.9) will be used -times, for all .
Collecting these new estimates, instead of (D.7) we have the following prefactor depending on :
which, together with (D.8) and with the choice gives (D.2).
The proof of (D.1)–(D.2) for is very similar, just the factor is missing from (D.4) in case of . This modification does not alter the basic estimates. This concludes the proof of Lemma D.1. ∎
Recalling the definition of and setting for brevity, we have
and with the choice in (D.1) (with ) we also have
with some positive constant . This implies that
i.e., we obtained (3.8). The bound (3.9) follows similarly from (D.2) but with the choice (where is the constant in the exponent in (D.2)), and this completes the proof of Theorem 3.2. ∎
Appendix E Heuristics for the correlation decay in GUE
In this section we give a quick heuristic argument to justify the estimate (3.17), for a covariance w.r.t. the GUE measure. More precisely, for , we have
for all , where is a small constant ( is just a technical hypothesis allowing an easier use of Hermite polynomials asymptotics hereafter, the result should hold true without this condition). In the following, all but the first step can be made easily rigorous by following the method in : formula (E.1) was easier in the context of diverging covariances (this divergence holds when , i.e., with the notations of Corollary 2.3), for polynomially vanishing ones it would require a new rigorous argument. In this section means that for some constant independent of .
This relies on the idea that eigenvalues with close enough indexes move together, so for any and the events and have very close probability. To be made rigorous, this step would require that for small enough and any we have
This is expected to be true since for should imply that if , therefore
For , the spectral measure is a determinantal point process (with kernel normalized such that ), and an elementary calculation gives
Via the Christoffel-Darboux formula, the correlation kernel can be expressed in terms of two successive Hermite polynomials. The Plancherel-Rotach asymptotics then allow us to prove that in the above integral, the main contribution comes from the domain where is small enough. In this domain one can prove (see (5.4) in ) that is asymptotically equivalent to
where Ai is the Airy function and as decreases to . Thanks to the estimates
as , we can approximate by
by noting that in we have .
The end of these heuristics consists in the following calculation, where we use that the square of the oscillating term in (E.3) averages to (note that the frequencies go to ), and we note :
One concludes using the above equation, (E.1) and (E.2).