Universality of sine-kernel for Wigner matrices with a small Gaussian perturbation
Laszlo Erdos, Jose A. Ramirez, Benjamin Schlein, Horng-Tzer Yau
Introduction
Certain spectral statistics of broad classes of random matrix ensembles are believed to follow a universal behavior in the limit . Wigner has observed that the density of eigenvalues of large symmetric or hermitian matrices with independent entries (up to the symmetry requirement) converges, as , to a universal density, the Wigner semicircle law. Dyson has observed that the local correlation statistics of neighboring eigenvalues inside the bulk of the spectrum follows another universal pattern, the Dyson sine-kernel in the limit . Moreover, any -point correlation function can be obtained as a determinant of the two point correlation functions. The precise form of the universal two point function in the bulk seems to depend only on the symmetry class of the matrix ensemble (a different universal behavior emerges near the spectral edge ).
Dyson has proved this fact for the Gaussian Unitary Ensemble (GUE), where the matrix elements are independent, identically distributed complex Gaussian random variables (subject to the hermitian constraint). A characteristic feature of GUE is that the distribution is invariant under unitary conjugation, for any unitary matrix . Dyson found an explicit formula for the joint density function of the eigenvalues. The formula contains a characteristic Vandermonde determinant and therefore it coincides with the Gibbs measure of a particle system interacting via a logarithmic potential analogously to the two dimensional Coulomb gas. Dyson also observed that the computation of two point function can be reduced to asymptotics of Hermite polynomials.
His approach has later been substantially generalized to include a large class of random matrix ensembles, but always with unitary (orthogonal, symplectic, etc.) invariance. For example, a general class of invariant ensembles can be given by the measure on the space of hermitian matrices, where stands for the Lebesgue measure for all independent matrix entries, is the normalization and is a real function with certain smoothness and growth properties. For example, the GUE ensemble corresponds to .
The joint density function is explicit in all these cases and the evaluation of the two point function can be reduced to certain asymptotic properties of orthogonal polynomials with respect to the weight function on the real line. The sine kernel can thus be proved for a wide range of potentials . Since the references in this direction are enormous, we can only refer the reader to the book by Deift for the Riemann-Hilbert approach, the paper by Levin and Lubinsky and references therein for approaches based on classical analysis of orthogonal polynomials, or the paper by Pastur and Shcherbina for a probabilistic/statistical physics approach. The book by Anderson et al or the book by Metha also contain extensive lists of literatures.
Since the computation of the explicit formula of the joint density relies on the unitary invariance, there have been very little progress in understanding non-unitary invariant ensembles. The most prominent example is the Wigner ensemble or Wigner matrices, i.e., hermitian random matrices with i.i.d. entries. Wigner matrices are not unitarily invariant unless the single entry distribution is Gaussian, i.e. for the GUE case. The disparity between our understanding of the Wigner ensembles and the unitary invariant ensembles is startling. Up until the very recent work of , there was no proof that the density follows the semicircle law in small spectral windows unless the number of eigenvalues in the window is at least . This is entirely due to a serious lack of analytic tools for studying eigenvalues once the mapping between eigenvalues and Coulomb gas ceases to apply. At present, there are only two rigorous approaches to eigenvalue distributions: the moment method and Green function method. The moment method is restricted to studying the spectrum near the edges ; the precision of the Green function method seems to be still very far from getting information on level spacing .
Beyond the unitary ensembles, Johansson proved the sine-kernel for a broader category of ensembles, i.e., for matrices of the form where is a Wigner matrix, is an independent GUE matrix and is a positive constant of order one. (Strictly speaking, in the original work , the range of the parameter depends on the energy . This restriction was later removed by Ben Arous and Péché , who also extended this approach to Wishart ensembles). Alternatively formulated, if the matrix elements are normalized to have variance one, then the distribution of the matrix elements of the ensemble is given by , where is the distribution of the Wigner matrix elements and is the centered Gaussian law with variance . Johasson’s work is based on the analysis of the explicit formula for the joint eigenvalue distribution of the matrix (see also ).
Dyson has introduced a dynamical version of generating random matrices. He considered a matrix-valued process where is a matrix-valued Brownian motion. The distribution of the eigenvalues then evolves according to a process called Dyson’s Brownian motions. For the convenience of analysis, we replace the Brownian motions by an Ornstein-Uhlenbeck process so that the distribution of GUE is the invariant measure of this modified process, which we still call Dyson’s Brownian motion. Dyson’s Brownian motion thus can be viewed as a reversible interacting particle system with a long range (logarithmic) interaction. This process is well adapted for studying the evolution of the empirical measures of the eigenvalues, see . The sine kernel, on the other hand, is a very detailed property which typically cannot be obtained from considerations of interacting particle systems. The Hamiltonian for GUE, however, is strictly convex and thus the Dyson’s Brownian motion satisfies the logarithmic Sobolev inequality (LSI). It was noted in the derivation of the Navier-Stokes equations that the combination of the Guo-Papanicolaou-Varadhan approach and LSI provides very detailed estimates on the dynamics.
The key observation of the present paper is that this method can also be used to estimate the approach to local equilibria so precisely that, after combining it with existing techniques from orthogonal polynomials, the Dyson sine kernel emerges. In pursuing this approach, we face two major obstacles: 1. Good estimate of the initial entropy, 2. Good understanding of the structure of local equilibria. It turns out that the initial entropy can be estimated using the explicitly formula for the transition kernel of the Dyson’s Brownian motion (see and ) provided strong inputs on the local semicircle law and level repulsion are available.
The structure of local equilibria, however, is much harder to analyze. Typically, the local equilibrium measures are finite volume Gibbs measures with short range interaction and the boundary effects can be easily dealt with in the high temperature phase. In the GUE case, the logarithmic potential does not even decay at large distance and the equilibrium measure can depend critically on the boundary conditions. The theory of orthogonal polynomials provides explicit formulae for the correlation functions of this highly correlated Gibbs measure. These formulae can be effectively analyzed if the external potential (or logarithm of the weight function in the terminology of the orthogonal polynomials) is very well understood. Fortunately, we have proved the local semicircle law up to scales of order and the level repulsion, which can be used to control the boundary effects. By invoking the theorem of Levin and Lubinsky and the method of Pastur and Shcherbina we are led to the sine kernel.
It is easy to see that adding a Gaussian component of size much smaller than to the original Wigner matrix would not move the eigenvalues sufficiently to change the local statistics. Our requirement that the Gaussian component is at least of size comes from technical estimates to control the initial global entropy and it does not have any intrinsic meaning. The case that the variance is of order , however, is an intrinsic barrier which is difficult to cross. Nevertheless, we believe that our method may offer a possible strategy to prove the universality of sine kernel for general Wigner matrices.
After this manuscript had been completed, we found a different approach to prove the Dyson sine kernel , partly based on a contour integral representation for the two-point correlation function . Shortly after our manuscripts were completed, we learned that our main result was also obtained by Tao and Vu in with a different method under no regularity conditions on the initial distribution provided the third moment of vanishes.
Although the results in this paper are weaker than those in and , we believe that the method presented here has certain independent interest. Unlike and , this approach does not use the contour integral representation of the two point correlation function. Hence, it may potentially have a broader applicability to other matrix ensembles for which such representation is not available.
Acknowledgements. We would like to thank the referees for suggesting several improvements of the presentation.
Main theorem and conditions
We assume that the probability measures and have a small Gaussian component of variance where is some fixed positive number. More precisely, we assume there exist probability measures and with zero expectation and variance and , respectively, such that
where is the Gaussian law with variance and , are the rescaling of the laws , to ensure that and have variance and 1; i.e, explicitly
This requirement is equivalent to considering random matrices of the form
where is a Wigner matrix with single entry distribution and , and is a GUE matrix whose elements are centered Gaussian random variables with variance .
Furthermore, we assume that is absolutely continuous with positive density functions , i.e. we can write it as with some real function . We assume the following conditions:
The measure satisfies the logarithmic Sobolev inequality, i.e. there exists a constant such that
holds for any density function with .
The Fourier transform of the functions and satisfy the decay estimates
with some constants .
There exists a such that for the distribution of the diagonal elements
Although the conditions are stated directly for the measures and , it is easy to see that it is sufficient to assume that satisfies (2.4) and (2.5) and satisfies (2.6). We remark that (2.4) implies that (2.6) holds for instead of as well (see ).
The eigenvalues of are denoted by . The law of the matrix ensemble induces a probability measure on the set of eigenvalues whose density function will be denoted by . The eigenvalues are considered unordered for the moment and thus is a symmetric function. For any , let
be the -point correlation function of the eigenvalues. The point correlation function (density) is denoted by . With our normalization convention, the density is supported in $N\to\infty$ limit it converges to the Wigner semicircle law given by the density
The main result of this paper is the following theorem:
Fix arbitrary positive constants and . Consider the Wigner matrix ensemble with a Gaussian convolution of variance given by (2.3) and assume (2.4)–(2.6). Let be the two point correlation function of the eigenvalues of this ensemble. Let and
with smooth and compactly supported functions such that and . Then we have
The factor in the observable (2.8) tests the eigenvalue differences. The factor , that disappears in the right hand side of (2.9), is only a normalization factor. Thus the special form of observable (2.8) directly exhibits the fact that the local statistics is translation invariant.
Our approach has three main ingredients. In the first step, we use the entropy method from hydrodynamical limits to establish a local equilibrium of the eigenvalues in a window of size (with some small ), i.e. window that typically contains eigenvalues. This local equilibrium is subject to an external potential generated by all other eigenvalues. In the second step we then prove that the density of this equilibrium measure is locally constant by using methods from orthogonal polynomials. Finally, in the third step, we employ a recent result to deduce the sine-kernel. We now describe each step in more details.
We generate the Wigner matrix with a small Gaussian component by running a matrix-valued Ornstein-Uhlenbeck process (3.1) for a short time of order , . This generates a stochastic process for the eigenvalues which can be described as Ornstein-Uhlenbeck processes for the individual eigenvalues with a strong interaction (3.10).
This process is the celebrated Dyson’s Brownian motion (DBM) and the equilibrium measure is the GUE distribution of eigenvalues. The transition kernel can be computed explicitly (5.12) and it contains the determinantal structure of the joint probability density of the GUE eigenvalues that is responsible for the sine-kernel. This kernel was analyzed by Johansson assuming that the time is of order one, which is the same order as the relaxation time to equilibrium for the Dyson’s Brownian motions. The sine-kernel, however, is a local statistics, and local equilibrium can be reached within a much shorter time scale. To implement this idea, we first control the global entropy on time scale by , with (Section 5.2).
More precisely, recall that the entropy of with respect to a probability measure is given by
In our application, the measure is the Gibbs measure for the equilibrium distribution of the (ordered) eigenvalues of the GUE, given by the Hamiltonian
If denotes the joint probability density of the eigenvalues at the time with respect to , then the evolution of is given by the equation
where the generator is defined via the Dirichlet form
The evolution of the entropy is given by the equation
The key initial entropy estimate is the inequality that
for any and for sufficiently large . The proof of this estimate uses the explicit formula for the transition kernel of (2.11) and several inputs from our previous papers on the local semicircle law and on the level repulsion for general Wigner matrices. We need to strengthen some of these inputs; the new result will be presented in Section 4 with proofs deferred to Appendix A, Appendix B and Appendix C.
It is natural to think of each eigenvalue as a particle and we will use the language of interacting particle systems. We remark that the entropy per particle is typically of order one in the interacting particle systems. But in our setting, due to the factor in front of the Hamiltonian (2.10), the typical size of entropy per particle is of order . Thus for a system bearing little relation to the equilibrium measure , we expect the total entropy to be . So the bound (2.12) already contains nontrivial information. However, we believe that one should be able to improve this bound to and the additional power in (2.12) is only for technical reasons. This is the main reason why our final result holds only for a Gaussian convolution with variance larger than . The additional factor originates from Lemma 5.3 where we approximate the Vandermonde determinant appearing in the transition kernel by estimating the fluctuations around the local semicircle law. We will explain the origin of in the beginning of Appendix D where the proof of Lemma 5.3 is given.
From the initial entropy estimate, it follows that the time integration of the Dirichlet form is bounded by the initial entropy. For the DBM, due to convexity of the Hamiltonian of the equilibrium measure , the Dirichlet form is actually decreasing. Thus for with some we have
The last estimate says that the Dirichlet form per particle is bounded by . So if we take an interval of particles (with coordinates given by ), then on average the total Dirichlet form of these particles is bounded by . We will choose with some very small . As always in the hydrodynamical limit approach, we consider the probability law of these particles given that all other particles (denoted by ) are fixed. Denote by the equilibrium measure of given that the coordinates of the other particles are fixed. Let be the conditional density of w.r.t. with given. The Hamiltonian of the measure is given by
If are regularly distributed, we have the convexity bound
This implies the logarithmic Sobolev inequality
where in the last estimate some additional -factors were needed to convert the local Dirichlet form estimate per particle on average to an estimate that holds for a typical particle. Thus we obtain
provided we choose with (Section 6). The last inequality asserts that the two measures and are almost the same and thus we only need to establish the sine kernel for the measure . At this point, we remark that this argument is valid only if is regularly distributed in a certain sense which we will call good configurations (Definition 4.1). Precise estimates on the local semicircle law can be used to show that most external configurations are good. Although the rigorous treatment of the good configurations and estimates on the bad configurations occupy a large part of this paper, it is of technical nature and we deferred the proofs of several steps to the appendices.
In Sections 8, 9 and 10, we refine the precision on the local density and prove that the density is essentially constant pointwise. Direct probabilistic arguments to establish the local semicircle law in rely on the law of large numbers and they give information on the density on scales of much larger than , i.e. on scales that contain many eigenvalues. The local equilibrium is reached in a window of size and within this window, we can conclude that the local semicircle law holds on scales of size with an arbitrary small . However, this still does not control the density pointwise. To get this information, we need to use orthogonal polynomials.
The density in local equilibrium can be expressed in terms of sum of squares of orthogonal polynomials with respect to the weight function generated by the external configuration (see Section 8 for precise definitions). To get a pointwise bound from the appropriate bound on average, we need only to control the derivative of the density, that, in particular, can be expressed in terms of derivatives of the orthogonal polynomials . Using integration by parts and orthogonality properties of , it is possible to control the norm of in terms of the norm of . Although the derivative of the potential is singular, can be estimated by a Schwarz inequality at the expense of treating higher norms of (Lemma 8.1). In this content, we will exploit the fact that we are dealing with polynomials by using the Nikolskii inequality which estimates higher norms in terms of lower ones at the expense of a constant depending on the degree. To avoid a very large constant in the Nikolskii inequality, in Section 7 we first cutoff the external potential and thus we reduce the degree of the weight function.
We remark that our approach of using orthogonal polynomials to control the density pointwise was motivated by the work of Pastur and Shcherbina , where they proved sine-kernel for unitary invariant matrix ensembles with a three times differentiable potential function on the real line. In our case, however, the potential is determined by the external points and it is logarithmically divergent near the edges of the window.
Finally, in Section 11, we complete the proof of the sine-kernel by applying the main theorem of . This result establishes the sine-kernel for orthogonal polynomials with respect to an -dependent sequence of weight functions under general conditions. The most serious condition to verify is that the density is essentially constant pointwise – the main result we have achieved in the Step 2 above. We also need to identify the support of the equilibrium measure which will be done in Appendix F.
We remark that, alternatively, it is possible to complete the third step along the lines of the argument of without using . Using explicit formulae from orthogonal polynomials and the pointwise control on the density and on its derivative, it is possible to prove that the local two-point correlation function is translation invariant as . After having established the translation invariance of , it is easy to derive an equation for its Fourier transform and obtain the sine-kernel as the unique solution of this equation. We will not pursue this alternative direction in this paper.
Dyson’s Brownian motion
We can generate our matrix (2.3) from a stochastic process with initial condition . Consider the following matrix valued stochastic differential equation
where \mbox{\boldmath\beta}_{t} is a hermitian matrix-valued stochastic process whose diagonal matrix elements are standard real Brownian motions and whose off-diagonal matrix elements are standard complex Brownian motions.
For completeness we describe this matrix valued Ornstein-Uhlenbeck process more precisely. The rescaled matrix elements evolve according to the complex Ornstein-Uhlenbeck process
For , is a complex Brownian motion with variance one. The real and imaginary parts of satisfy
with and where are independent standard real Brownian motions. For the diagonal elements in (3.2), is a standard real Brownian motion with variance 1.
We note that , thus
If the initial condition of (3.1) is distributed according to the law of , then the solution of (3.1) is clearly
where is a standard GUE matrix (with matrix elements having variance ) that is independent of . With the choice of satisfying , i.e. , we see that given in (2.3) has the same law as .
2 Joint probability distribution of the eigenvalues
The measure has a density with respect to Lebesgue measure given by
where \Delta_{N}(\mbox{\boldmath\lambda})=\prod_{i<j}(\lambda_{i}-\lambda_{j}). This is the joint probability distribution of the eigenvalues of the standard GUE ensemble normalized in such a way that the matrix elements have variance (see, e.g. ). With this normalization convention, the bulk of the one point function (density) is supported in $N\to\infty$ limit it converges to the Wigner semicircle law (2.7).
For any finite time we will represent the joint probability density of the eigenvalues of as f_{t}(\mbox{\boldmath\lambda})\widetilde{u}(\mbox{\boldmath\lambda}), with \lim_{t\to\infty}f_{t}(\mbox{\boldmath\lambda})=1. In particular, we write the joint distribution of the eigenvalues of the initial Wigner matrix as f_{0}(\mbox{\boldmath\lambda})\widetilde{\mu}({\rm d}\mbox{\boldmath\lambda})=f_{0}(\mbox{\boldmath\lambda})\widetilde{u}(\mbox{\boldmath\lambda}){\rm d}\mbox{\boldmath\lambda}.
3 The generator of Dyson’s Brownian motion
The Ornstein-Uhlenbeck process (3.1) induces a stochastic process for the eigenvalues.
acting on and let
be the corresponding Dirichlet form, where . Clearly is an invariant measure for the dynamics generated by .
Let the distribution of the eigenvalues of the Wigner ensemble be given by f_{0}(\mbox{\boldmath\lambda})\widetilde{\mu}({\rm d}\mbox{\boldmath\lambda}). We will evolve this distribution by the dynamics given by :
The corresponding stochastic differential equation for the eigenvalues \mbox{\boldmath\lambda}(t) is now given by (see, e.g. Section 12.1 of )
where is a collection of independent Brownian motions and with initial condition \mbox{\boldmath\lambda}(0) that is distributed according to the probability density f_{0}(\mbox{\boldmath\lambda})\widetilde{\mu}({\rm d}\mbox{\boldmath\lambda}).
We remark that \widetilde{u}(\mbox{\boldmath\lambda}) and f_{t}(\mbox{\boldmath\lambda}) are symmetric functions of the variables and vanishes whenever two points coincide. By the level repulsion we also know that f_{0}(\mbox{\boldmath\lambda})\widetilde{u}(\mbox{\boldmath\lambda}) vanishes whenever for some . We can label the eigenvalues according to their ordering, , i.e. one can consider the configuration space
with , . The constant in front of the drift term is critical for the Bessel process not to reach the boundary point .
The density function of the ordered eigenvalues is thus f_{t}(\mbox{\boldmath\lambda})u(\mbox{\boldmath\lambda}) on . Throughout this paper, with the exception of Section 5.2, we work on the space , i.e., the equilibrium measure \mu({\rm d}\mbox{\boldmath\lambda})=u(\mbox{\boldmath\lambda}){\rm d}\mbox{\boldmath\lambda} with density u(\mbox{\boldmath\lambda}) and the density function f_{t}(\mbox{\boldmath\lambda}) will be considered restricted to .
Good global configurations
Several estimates in this paper will rely on the fact that the number of eigenvalues in intervals with length much larger than is given by the semicircle law . In this section we define the set of good global configurations, i.e. the event that the semicircle law holds on all subintervals in addition to a few other typical properties.
be the empirical density of the eigenvalues. For an interval we introduce the notation
for the number of eigenvalues in . For the interval of length and centered at we will also use the notation
be the empirical density smoothed out on scale . Furthermore, let
be the Stieltjes transform of the empirical eigenvalue distribution and
be the Stieljes transform of the semicircle law. The square root here is defined as the analytic extension (away from the branch cut ${\omega}_{y}(x)=\pi^{-1}\mbox{Im}\;m(x+iy)y>0$.
We will need an improved version of Theorem 4.1 from that is also applicable near the spectral edges. The proof of the following theorem is given in Appendix A.
Assume that the Wigner matrix ensemble satisfies conditions (2.4)–(2.6) and assume that is such that .
where is independent of and .
(ii) Assume that for some . Then there exists such that
for all small enough and all large enough (independently of ). Consequently, we have
with some -dependent constant . Moreover,
for all large enough (independently of ).
(iii) Assuming and that we also have
As a corollary to Theorem 4.1, the semicircle law for the density of states holds locally on very short scales. The next proposition can be proved, starting from Theorem 4.1, exactly as Eq. (4.3) was shown in .
Assuming (2.4)–(2.6), for any sufficiently small and for any with
(with a sufficiently large constant ) we have
We also need an estimate directly on the number of eigenvalues in a certain interval, but this will be needed only away from the spectral edge. The following two results estimate the deviation of the normalized empirical counting function and its expectation
from the distribution function of the semicircle law, defined as
Assume that the Wigner matrix ensemble satisfies conditions (2.4)–(2.6). Let be fixed. For any and , we have
with -dependent constants. Moreover, there exists a constant such that
The proof of this proposition will be given in Appendix B.
Next we define the good global configurations; the idea is that good global configurations are configurations for which the semicircle law holds up to scales of the order (and so that some more technical conditions are also satisfied). By Proposition 4.1 and Proposition 4.2, we will see that set of these configurations have, asymptotically, a full measure. As a consequence, we will be able to neglect all configurations that are not good.
with respect to any Wigner ensemble. This gives rise to the following definition.
Let with some small constant , , and let be a fixed big constant. The event
will be called the set of good global configurations.
The probability of good global configurations satisfies
with respect to any Wigner ensemble satisfying the conditions (2.4) and (2.5)
Proof. The probability of was estimated in (4.17). The probability of the second event in (4.18) can be estimated by (4.13) from Proposition 4.2 and from . The third event is treated by the large deviation estimate on for any interval with length (see Theorem 4.6 from ; note that there is a small error in the statement of this theorem, since the conditions and should actually be replaced by the stronger assumptions and which are used in its proof):
The fourth event is a large deviation of the largest eigenvalue, see, e.g. Lemma 7.4. in .
In case of good configurations, the location of the eigenvalues are close to their equilibrium localition given by the semicircle law. The following lemma contains the precise statement and it will be proven in Appendix C.
Let denote the eigenvalues in increasing order and let . Then on the set and if , it holds that
for any (recall the definition of from (4.12)), and
for any and .
On the set and with the choice given in (4.15), we have
with respect to any Wigner ensemble satisfying the conditions (2.4) and (2.5)
Proof. First we partition the interval into subintervals
that have already been used in the proof of Lemma 4.3. On the set we have the bound
The second sum is bounded by . In the first sum, we use the level repulsion estimate by decomposing into intervals of length that overlap at least by , more precisely
where . Then
Using the level repulsion estimate given in Theorem 3.4 of (here the condition (2.5) is used) and the fact that since , we have
Recalling the choice of completes the proof of Lemma 4.4.
Global entropy
Recall the definition of the entropy of with respect to
and let solve (3.9). Then the evolution of the entropy is given by the equation
For dynamics with energy and the convexity condition
for some constant , the following Bakry-Emery inequality holds:
(notice the additional factor due to the in front of the second order term in the generator , see (3.7)). This implies the logarithmic Sobolev inequality that for any probability density , with respect to ,
In this case, the Dirichlet form is a decreasing function in time and we thus have for any that
as a matrix inequality away from the singularities (see remark below how to treat the singular set). Thus we have
This tells us that in (3.9) is exponential decaying as long as . But for any time fixed, the entropy is still the same order as the initial one. Note that is the case considered in Johasson’s work .
Recall that the invariant measure \exp(-{\mathcal{H}}){\rm d}\mbox{\boldmath\lambda} and the dynamics are restricted to . With we have
Computing , we have
2 Bound on the entropy
Let . For any we have
Given the density f_{0}(\mbox{\boldmath\lambda})\widetilde{\mu}({\rm d}\mbox{\boldmath\lambda}) of the eigenvalues of the Wigner matrix as an initial distribution, the eigenvalue density f_{s}(\mbox{\boldmath\lambda}) for the matrix evolved under the Dyson’s Brownian motion is given by
where for brevity. The derivation of (5.12) follows very similarly to Johansson’s presentation of the Harish-Chandra/Itzykson-Zuber formula (see Proposition 1.1 of ) with the difference that in our case the matrix elements move by the Ornstein-Uhlenbeck process (3.1) instead of the Brownian motion.
In particular, formula (5.12) implies that is an analytic function for any since
with an explicit analytic function h_{s}(\mbox{\boldmath\lambda}). Since the determinant is analytic in , we see that f_{s}(\mbox{\boldmath\lambda}) is meromorphic in each variables and the only possible poles of f_{s}(\mbox{\boldmath\lambda}) come from the factors in \Delta_{N}(\mbox{\boldmath\lambda}) near the coalescence points. But f_{s}(\mbox{\boldmath\lambda}) is a non-negative function, so it cannot have a singularity of order , thus these singular factors cancel out from a factor from the integral. Alternatively, using the Laplace expansion the determinant, one can explicitly see that each 2 by 2 subdeterminant from the -th and -th columns carry a factor .
Then, by Jensen inequality from (5.11) and from the fact that f_{0}(\mbox{\boldmath\nu})\widetilde{u}(\mbox{\boldmath\nu}) is a probability density, we have
Expanding this last expression we find, after an exact cancellation of the term ,
Since , we have and . Hence
For the determinant term, we use that each entry is at most one, thus
The last term in (5.13) can be estimated using Stirling’s formula and Riemann integration
thus the terms cancel. For the terms we need the following approximation
With respect to any Wigner ensemble whose single-site distribution satisfies (2.4)–(2.6) and for any we have
where the constant in the error term depends on and on the constants in (2.4)–(2.6).
Note that (2.6), (2.5) hold for both the initial Wigner ensemble with density and for the evolved one with density . These conditions ensure that Theorem 3.5 of is applicable.
Proof of Lemma 5.2. The quadratic term can be computed explicitly using (3.4):
The second (determinant) term will be approximated in the following lemma whose proof is postponed to Appendix D.
With respect to any Wigner ensemble whose single-site distribution satisfies (2.4)–(2.6) and for any we have
Finally, explicit calculation then shows that
Hence, continuing the estimate (5.13), we have the bound
Local equilibrium
Choose with some . Thus from (5.4) with , we have
by using (5.10). Recall that the eigenvalues are ordered, . Let ( was defined in (4.15)) and define
its complement. For convenience, we will relabel the elements of as in increasing order. The elements of will be denoted by
again in increasing order ( was defined in (3.11)). We set
to be the index set of the ’s. We will refer to the ’s as external points and to the ’s as internal points. Note that the indices are chosen such that for any we have for and for . In particular, for any fixed , we can split any as where
The set with a splitting mark after the -th coordinate will be denoted by and we use the one-to-one correspondance.
For a fixed we will often consider the expectation of functions on with respect to or ; this will always mean the marginal probability:
For a fixed and let
be the conditional density of given with respect to the conditional equilibrium measure
Here also depends on time , but we will omit this dependence in the notation. Note that for any fixed , any value lies in the interval , i.e. the functions and are supported on the set
Now we localize the good set introduced in Definition 4.1. For any fixed and we define
Note that also implies, for large , that there exists an such that . This ensures that those properties of \mbox{\boldmath\lambda}\in\Omega that are determined only by ’s, will be inherited to the ’s. E.g. will guarantee that the local density of ’s is close to the semicircle law on each interval away from . More precisely, note that for any interval of length and center , , that is disjoint from , we have, by (4.16),
Moreover, for any interval with we have, by (4.18),
For any with , let , i.e.
Using (4.21) and (4.22) from Lemma 4.3 on the set (see (4.18)), we for any we have
with some large constant . On the set we have (see (6.14)), thus , i.e.
2 Localization of the Dirichlet form
For any and any , we define the Dirichlet form
for functions defined on . Hence from (6.1) we have the inequality
and therefore, when we sum over all as on the l.h.s. of (6.17), every local Dirichlet form is summed over at most times, so we get the total Dirichlet form with a multiplicity at most .
then the above inequality guarantees that for the cardinality of ,
3 Local entropy bound
Suppose that and fix it. For any denote by
for any as a matrix inequality. On the set we have
We can apply the logarithmic Sobolev inequality (5.3) to the local measure , taking into account Remark 5.1. Thus we have
for and , we have also have
We will choose with such that
4 Good external configurations
The set of good -indices is defined by
Lemma 4.4 together with (6.19) imply that
Notice that for any fixed we can write
and similar formulae hold when is replaced with and with .
We also want to ensure that the density on scale is close to the semicircle law. Let
be the characteristic function of the interval . Consider defined in (4.16), then and (4.19) imply that
Fix , consider and define
so that if then . Moreover, on the set we know that (see (6.14)). Therefore
This gives rise to the following definition:
Let . The set of good external points is given by
It follows from (6.8), (6.16), (6.21), (6.28) and (6.30) that
5 Bounds in equilibrium
In this section we translate the bounds in the second and third lines of (6.31) into similar bounds with respect to equilibrium using that the control on the local Dirichlet form also controls the local entropy for the good indices:
Let be arbitrary and . If , i.e. , then for we have
by the entropy inequality (6.25). If and , then we have by (6.26) that
For a given , we set the observable
with . Then, for we obtain from (6.31) and (6.35) that
Combining the last two estimates proves (6.33).
The proof of (6.34) is analogous, here we use that the corresponding observable has an bound
This completes the proof of Lemma 6.1.
Cutoff Estimates
In this section, we cutoff the interaction with the far away particles. We fix a good index and a good external point configuration . Consider the measure with
The measure is supported on the interval .
where is a large positive number with . We define the measure
Let and . For , we have
This lemma will imply that one can cutoff all ’s in the potential with .
then, by (6.15) and , we have
In Lemma 7.2 we will give an upper bound on , and then we have, for , that
For and for any , we have
Proof. Recall that implies that the density of the ’s is close the semicircle law in the sense of (6.9). Let
Since , we know that (see (6.14)), thus . Taking the imaginary part of (4.3) for and renaming the variables, we have the identity
Furthermore, with we have
since is away from the spectral edge thus is continuously differentiable on the interval of integration . Thus
therefore to prove (7.7) it is sufficient to show that
We will consider only and compare the sum with the integral on the regime , the sum for is similar.
Since , i.e. , there will be no above the last interval . We subdivide each into equal disjoint subintervals of length
For , the estimate (4.22) holds for and , i.e.
(using , ), i.e.
by using the definition of from (7.8), the fact that is separated away from zero and that from (6.14).
To see the last estimate, we notice that in the first summand we have by (7.11), i.e. all these ’s lie in an interval of length , so their number is bounded by by (6.10). Thus the first term in the right hand side of (7.12) is bounded by ; the estimate of the second term is similar.
Finally, the second term on the left hand side of (7.14) is a Riemann sum of the integral in (7.9) with an error
Combining (7.12), (7.13), (7.14) and (7.15), we have proved (7.9) which completes the proof of Lemma 7.2.
Derivative Estimate of Orthogonal Polynomials
In the next few sections, we will prove the boundedness and small distance regularity of the density. Our proof follows the approach of (cf: Lemma 3.3 and 3.4 in ), but the estimates are done in a different way due to the singularity of the potential. For the rest of this paper, it is convenient to rescale the local equilibrium measure to the interval $$ as we now explain.
Suppose and . We change variables by introducing the transformation
then . Let be the measure (see (7.5)) rescaled to the interval $$, i.e.,
Let , denote the real orthonormal polynomials on $e^{-nU_{\widetilde{\bf{y}}}(\lambda)}\mbox{deg}\;p_{j}=j$ and
to be orthonormal functions with respect to the Lebesgue measure on ${\bf{y}}{\bf{y}}$ is fixed in this section and we will omit this dependence from the notation.
following the standard identities in orthogonal polynomials. For the rest of the paper we drop the tilde and all variables will denote the rescaled ones, i.e. all variables will be on the interval .
The basic ingredients of the approach can be described as follows: Suppose that the following two properties hold for the normalized function , , and for some fixed
for some positive with . We will take take , same as in . Let
Note that with some provided that . Suppose we can also prove that
with some small power , then it will follow that and this proves the regularity of the density over a distance of order . Together with the fact that the density is well approximated with the semicircle law on scales bigger than this will show that the density is close to the semicirle law pointwise. In the regularity of the density on larger scales followed from the smoothness of the potential (Theorem 2.2 of ). In our case this follows from (6.34) which is a consequence of the fact that the semicircle law is precise on scales slightly larger than that corresponds to scales bigger than after rescaling.
In proving (8.9), (8.10) and (8.12), one basic assumption in requires the potential to be in for some . The potential for our probability measure (8.2), parametrized by the boundary conditions , is singular near the boundary points . In order to control these singularities, besides using some special properties of orthogonal polynomials, we rely on via (6.33) to provide essential estimates such as level repulsions. It turns out that we can only establish (8.9) and (8.10) for following this idea. The case of has to be treated completely differently. We now start to prove (8.9) for .
Suppose that , and, after rescaling that sets , , let the -configuration satisfy
(note that the boundary terms are not included in the summations). Furthermore, assume that the density satisfies
for some . Then for the orthonormal functions from (8.4) we have
Notice that the assumptions (8.13) and (8.14) follow from (6.31) and (6.33).
In this section and in the subsequent Sections 9 and 10 we work with orthogonal polynomials on $U_{\widetilde{\bf{y}}}(x)V(x)=U_{\widetilde{\bf{y}}}(x)k{\bf{y}}1\leq|k| Proof. For simplicity, let and . Then Note that is zero at the boundary so the boundary term vanishes in the integration by parts. Since is an orthogonal polynomial, it is orthogonal to all polynomials of lower degree, thus the first integral vanishes. By Schwarz inequality, the second integral is bounded by From (8.13), and the normalization of we have To control the term , we separate the integration regimes and for some big constant . In the inside regime, we can use since . From (8.14) we obtain To estimate the singular part of the integral in near the boundary points, we can focus in estimating Notice that is a polynomial of degree . From the Nikolskii inequality (see, e.g., Theorem A.4.4 of ) with some universal constant . Here is defined as \big{(}\int_{-1}^{1}|g(x)|^{p}{\rm d}x\big{)}^{1/p} for any . Notice that Nikolskii inequality holds between spaces even with exponents . By the Hölder inequality, Thus from (8.22) we have and by Hölder inequality we have provided . Together with (8.21), this proves . Combining this with (8.20) we obtain a bound for (8.18) which proves (8.15). Using this estimate and (8.17) we obtain that by using (8.18). This completes the proof. Let be arbitrary positive numbers. Let , , suppose that the -configuration satisfies (8.13), (8.14) and the density for all . Let or be an orthogonal function. Then we have with a constant depending on and . denote the Stieltjes transform of the density and denote by the truncated correlation function, where was defined in (8.3) and computed from (8.8). We will again drop the tilde in this proof. This identity follows from expressing by an integral over variables of the equilibrium measure and then integrating by parts (see also (2.81) of ). Hence, by using (8.6), we have where, to estimate the last integral, we have used the Christoffel-Darboux formula We define a new measure on as where we already omitted the tildes and recall that . Note that this measure differs from (8.1) written in variables in that we kept the prefactor in front of the potential. Define where ’s are defined in (8.4). This latter formula follows from the recursive relation of the correlation functions for GUE-like ensembles, therefore be the Stieltjes transform of ; then we have the analogue of (9.6) Assume that satisfies . By adding to the both sides of (9.7), we obtain We divide the integral into and . In the first integration regime, since , we have Since , , we have for any . Thus, by (8.13), the prefactor in (9.8) is bounded, uniformly in , by where the constant depends on and we recall that , in the rescaled variables. In the second integration regime we use and obtain where we have used (8.15) and Hölder inequality to estimate the first term in the last line and using (8.13) for the second term. using that . Since by assumption, is bounded from below. Thus, choosing , we obtain with depending on and . Taking imaginary part, we have for any with . Integrating over and using with some positive constant , we have proved (9.1) for . The case can be done in a similar way. This completes the proof of Lemma 9.1. Suppose that the -configuration satisfies (8.13), (8.14) and the density satisfies for all for some . Let with be an orthogonal function. Then with a constant depending on and . Proof. For the case , the estimate (9.10), even with a better exponent, follows from the argument leading to (8.11) from the two assumptions (8.9) and (8.10) with , and : The estimate (8.9) was proven in Lemma 8.1, the estimate (8.10) follows from Lemma 9.1. The proof of (9.10) for requires a different argument. Let be the leading coefficient of the (normalized) -th orthogonal polynomial, i.e. . Observe that , where dots mean a polinomial of degree less than . Thus The first integral on the right hand side vanishes. By the Schwarz inequality, we have where the second integral was estimated in (8.15). Recall the standard three-term recursion relation for orthogonal polynomials with some real numbers depending on . By comparing the leading coefficients, we have and by orthonormality, we get Using the bound (9.11), we obtain (9.10) for as well. Let , . Suppose that the external -configuration satisfies (8.13) and (8.14) and assume that . Then for any we have where the constant depends on . Proof. The derivative of the density can be computed explicitly (see, e.g., (3.63) of ) as From the Christoffel-Darboux formula, we have Since , we can estimate the contribution to (10.3) from the first term in (10.4) by where we have used (8.13) to bound the factor in front of the integral The contribution from the second term in (10.4) is bounded by The first term on the right hand side is bounded by using (8.13). In the second term, we split the integration into two regimes: and with some . In the first regime, we use the bound (9.10) to obtain if . In the second regime we use the bound (8.23). This proves (10.1). For the proof of (10.2) we use the derivative estimate and the fact that the density is close to the semicircle law on scale as given in (6.34). For any we have Taking the average on the interval , we get with , where we also used that Combining these inequalities, we arrive at (10.2) and this completes the proof of Lemma 10.1. Let be the external potential on given by (8.2) after rescaling. Notice that is continuous on and . Let be the equilibrium measure, defined as the unique solution to the variational problem where is the space of probability measures on $Iq(x)Q(x)q(x)=Q(x)=\frac{1}{2}V(x)$. The equilibrium measure with support satisfies the Euler-Lagrange equations and (Theorem 2.1 of ). Moreover, since is convex in such that , the support is an interval, , whose endpoints satisfy and they are uniquely determined by the equations according to Theorem 2.4 (after adjusting a factor of 2). In our case, the potential and thus the equilibrium measure depend on and the external configuration in a non-trivial way. The main result of the recent work of Levin and Lubinsky proves the universal sine-kernel behavior for the correlation function of the orthogonal polynomials with respect to a general -dependent potential. This result fits exactly our situation, after the conditions of are verified. We recall the main result of in a special form we will need. For each , consider a positive Borel measure on the real line whose moment is finite. Let and assume that each is absolutely continuous on and they can be written as where the non-negative functions are continuous on . We define the potential and let be the solution of the variational problem (11.1) with . Let be a compact subinterval of . Assume the following conditions The equilibrium measure is absolutely continuous with , where is positive and uniformly bounded in some open interval containing ; The family is equicontinuous and uniformly bounded in some open interval containing ; The density of the first orthogonal polynomials with respect to on (defined in (8.7)) satisfies in some open interval containing ; Then for the -th reproducing kernel of the measure on (defined in (8.5)) we have Let be a bounded function and . In (2.9) we have to compute the limit of where we have changed variables. Using the form of given in (2.8), we have with a constant depending on . To see this, let be a large number so that for , then where we have used that and that for any interval of length . The bound (11.8) follows from Eq. (3.11) in after cutting the interval into subintervals of size . The estimate (11.6) and similar ideas allow us to perform many cutoffs and approximations. For example, we can replace in and by in the definition of , see (11.5), at the expense of an error that vanishes in the limit . We shall give a proof in case we perform the change for, say, : where we used that is uniformly bounded on . We will not repeat this type of simple argument in this proof. After this replacement, we can perform the integration using that : where the last error comes from the contribution of eigenvalues within distance to . With the notation and using (11.4), we thus need to prove that Recall the definition of from (4.12) and its inverse function . Note that where is the error term, defined as the difference of {\bf 1}\big{(}\Big{|}\lambda_{j}-E_{0}\Big{|}\leq\delta\big{)} and . We thus have where we used the moment bound (11.8) with and the fact that the number of subintervals is . Since is monotonic, the second expectation in (11.13) is bounded by On the set we estimate the difference of the two characteristic functions by 2, and we get from (4.19) that the contribution is subexponentially small in . On the set we can use (4.21) and we see that the difference of the two characteristic functions can be nonzero only if i.e. the number of ’s this can happen is bounded by . Recalling (4.15), we get therefore the second term in (11.12) vanishes in the limit. This shows that we can replace {\bf 1}\Big{(}\Big{|}\lambda_{j}-E_{0}\Big{|}\leq\delta\Big{)} by in the definition of a with negligible error and we can do similarly for instead of . Therefore, we need to prove that and without loss of generality, we can assume that . where depends on . This follows from the fact that, by the support of , only those index pairs give nonzero contribution for which , and thus by (4.22). Therefore the sum contains each pair at least -times and at most -times. Taking the expectation of (11.15) on , we obtain (11.14). Since is bounded by using (11.8), and we only have to estimate for a typical . Additionally to , we can thus assume that , since the relative proportion of good indices approaches one within any index set with cardinality proportional with and which is away from the boundary (see (6.29)). More precisely, we fix two sequences and such that where . We thus have to show that converges to the sine kernel. We will actually prove that converges to the sine-kernel for any sequence . The dependence on will be omitted from the notation. For , we can compute the expectation as The second term in the square bracket will be an error term since it is bounded by Since and , we have from (6.26) and (6.27) and we thus obtain For the main term, by using (7.6) and assuming that is large enough, we can also replace the measure by its cutoff version with a negligible error. Let denote the density and denote the two point marginal of this measure. Thus we have Since is an equilibrium measure, its correlation functions can be obtained as determinants of the appropriate kernels, see (8.8). In particular holds for the marginals of the measure . The lower bound on follows from the fact that is the kernel of a positive operator, i.e. . Let . We now show that, up to an error of order , the integration in (11.18) can be restricted from onto i.e. onto an interval in the middle of with length . Similarly, the integration will be restricted to i.e. onto an interval in the middle of with length . We show how to restrict the integration, the other one is analogous. The difference between the full integral and the restricted one is given by up to negligible errors. On the set we know from (4.22) that assuming that . Thus the first term in the square bracket of (11.20) can be estimated by taking into account (11.8) as before. Similar estimate holds for the second term in (11.21). Thus, restricting the -integration to results in an error of order . Doing the same restriction for the integral, we can from now on assume that both integrations in (11.18) are restricted to , i.e. it is separated away from the boundary. In particular, from (10.2) and after rescaling, we know that and are essentially constant and equal to . Moreover, on the set , we know from (6.13) that , i.e. Since , the same formula holds for for all . We now compute the restricted integrals in (11.18). Changing variables from to with , we have Since is smooth and has compact support, we have from (11.23). Therefore, when we insert (11.25) into (11.24) and use (11.19), the error term involving is bounded by and similar bound holds for the -integral. Thus we can replace the variable of in (11.24) by with negligible errors. Now Theorem 11.1 states that for all , i.e. the integration limits can be extended to infinity, noting that is compactly supported. Finally, from (11.23) we have Combining all these estimates with Theorem 11.1, we obtain where the last term error term is from Theorem 11.1 that goes to zero as . Taking the , and limits in this order, we arrive at the proof of Theorem 2.1. We start with the proof of (4.4) and (4.5). From Theorem 4.6 of , we have for all sufficiently large, and . Since moreover with probability one, we obtain, under the assumption , uniformly in . The bound (4.5) follows because . Here is the -minor of (the matrix obtained by removing the -th row and the -th column from ), are the eigenvalues and the eigenvectors of , and . Throughout the proof we let denote the real and imaginary parts of . Moreover, we will restrict our attention to . The case can be handled similarly. Step 1. Lower bound on . There exist constants such that To show (A.3), we use a continuity argument. We claim that there exist positive constants such that the following four conditions are satisfied: with probability one (see, for example (2.7) in ). Finally, the last condition can be verified by Theorem 4.1 of . Note that the last three conditions only need to hold for all large enough. Fix . For we have (using the first and the last equation in (A.4)) for all . Expanding (A.1), we obtain that where we used (A.4) and (A.6). This implies (A.3) for , and completes the proof of Step 1. Step 2. Convergence to the semicircle in probability. Suppose that , . Then there exist constants , only depending on , such that for all , and all . To show (A.7), we first observe that, by increasing the constant , we can assume to be sufficiently large. Then we expand (A.1) into From (A.3) and since, by Theorem 4.2 of , for all and , we find for small enough, , and large enough (independently of ). To prove (A.7) for , we use that, from (6.14) in , for all with and . This implies, using (A.10), that for all small enough, large enough, , . It remains to show (A.7) for . To this end, for and , we consider the event using the explicit formula (2.7) for , and therefore for all small enough, , , and large enough. Step 3. Fluctuations of . Suppose that , and . Then there exist constants such that for all , with small enough and all large enough. where we used that . Using (A.7), we obtain for large enough. For we thus obtain where we used (A.7) again. For the bound (A.12) is trivial. As a consequence of (A.12), we immediately obtain (4.7). If , we directly use (4.4). Otherwise, we use from (A.12), and we obtain the first term on the r.h.s. of (4.7). Step 4. Convergence to the semicircle in expectation. Assume that , and . Then for a universal constant . Note that this bound gains an additional factor on the precision of the estimates compared with Step 2 and Step 3, but the negative power of has increased. To prove (A.14), with , we have for arbitrary . Moreover, with fixed in (A.3), we have if is large enough. Here we used the fact that . From (A.9), we also have Combining this bound with (A.19), we find, from (A.18), that Recall that solves the equation This equation is stable in a sense that the inverse of the function near zero is Lipschitz continuous with a constant proportional to . Thus we obtain for all large enough (independently of ). Using (A.20) with , (A.25) with and , (A.21) with and (A.22), we find, by the stability argument, that which implies (A.24). This completes the proof of Theorem 4.1. We start with the proof of (4.14). From the moment method, we know that if and denote the smallest and the largest eigenvalues of the hermitian Wigner matrix , and if is large enough, then for large enough. The last term is negligible. The main estimate is contained in the following lemma whose proof is given at the end of this section. Let be a difference of two finite measures with support in for some . Let be the Stieltjes transform and the distribution function of , respectively. Denote moreover by the Stieltjes transforms of . We assume that satisfy the following bounds for : with some constants . Then with . The constant in (B.5) depends only on . We apply this lemma for the signed measure \varrho^{*}({\rm d}x)={\bf 1}(|x|\leq K)\big{[}\varrho(x)-\varrho_{sc}(x)\big{]}{\rm d}x. The bounds (B.2), (B.3), and (B.4) follow from (4.4), (4.8) and (4.9) (choosing instead of ), respectively. From (B.5) we obtain which, together with (B.1), completes the proof of (4.14). The second term on the r.h.s is estimated by , using (4.5). For the first term we use Theorem 4.6 of : Now we consider the fluctuation of the smoothed distribution function We partition into intervals of length . For with a sufficiently large , and set Analogously to the calculation (D.16), the size of the variance of is determined by the size of . On the event , we have (Note that the derivative in is with respect to the original random variables ). From the concentration inequality (Theorem 2.1 of ) we obtain that Choosing , and , it follows that Repeating the same argument with replaced by , we conclude that Combining this with (B.6) and (B.7), we have which completes the proof of Proposition 4.2. Proof of Lemma B.1. For simplicity, in the proof we omit the star from the notation. First notice that (B.2) implies that, after taking imaginary part, for any interval of length , . To express in terms of the Stieltjes transform, we use the Helffer-Sjöstrand functional calculus, see, e.g., . Let be a smooth cutoff function with support in $\chi(y)=1|y|\leq 1/2$ and with bounded derivatives. Let Using (B.3) and the support properties of and , the second contribution is bounded by For the first term in (B.13), we split the integration: where, in the second term, we dropped the imaginary part since and are real. To bound the first term we note that, for every fixed , the functions are monotonically increasing in . This implies that, for all , As for the second term on the r.h.s. of (B.15), we integrate by parts first in , then in . It is sufficient to consider the regime , the case of negative ’s is treated identically. We find Using (B.2), the second term is bounded in absolute value by The absolute value of the first term on the r.h.s. of (B.17) is estimated by Putting all terms together, we find from (B.11), (B.13), (B.14), (B.16) and (B.18) that We will use the bounds (B.2)–(B.4) and we split the integration into separate regions: As for the second term on the r.h.s. of (B.21), we divide the integral into several pieces: independently of . Inserting in (B.20), and choosing , we conclude the proof of (B.5). We partition the interval into a disjoint union of intervals by (4.16). To prove (4.21), first we locate middle eigenvalue. Let be the index such that For definiteness, we can assume that . Using the second event in (4.18) we obtain that On the other hand, with the notation , we have by (C.2) that where we used that for any and thus . From (C.4) and (C.5) we conclude that , i.e. . Thus we proved that Starting the proof of (4.21), we can assume that by symmetry. Suppose first that , i.e. for some , i.e. implies . Then we have using . using (C.2) (C.6) and that is small. Similarly Thus, combining these estimates with (C.7), we have using (11.10) and . Since , i.e. , we obtain (4.21). Finally, we consider the case when . The lower bound in (C.7) and the estimate (C.9) hold with so we get which contradicts the assumption for large . For the proof of (4.22), suppose that , . Using (4.21) and , we know that . By (4.21), we have the apriori bound by the assumption . In particular The constants depend on as . From , it also follows that Let , be the binary representation of with . Using this representation, we can concatanate the intervals , , into longer intervals of length such that Since is bounded on , we have On the set we thus have (see (4.16)) Similary, one can get a lower bound on . Recalling , and that from (C.11), we conclude from (C.13) that with , and we have proved (4.22). We start with the outline of the proof and indicate the origin of the restriction . We will first regularize the logarithmic interaction on a scale at the expense of an error of for each pair of eigenvalues, modulo logarithmic corrections (Lemma D.1). By a Schwarz inequality (D.18), the fluctuation of the regularized two body interaction is split into the product of the fluctuation of the regularized potential (D.14) and the fluctuation of the local semicircle law regularized on scale . The latter is of order by the improved fluctuation bound on the local semicircle law (4.7). The former is of order using that the logarithmic Sobolev inequality (2.4) on the single site distribution can be turned into a spectral gap estimate for . Finally, we optimize the regularization error and the fluctuation error per particle pairs, which gives a total error of order . The proof of the following regularization lemma is postponed until the end of the section: with respect to any Wigner ensemble whose single-site distribution satisfies (2.6) and (2.5). Then Lemma 5.3 directly follows from the following statement: for a universal constant and all large enough. Proof of Lemma D.2. Recall that denotes the empirical measure of the eigenvalues (4.1). We have because of the contribution of the diagonal terms. Step 1. Recall the definition of from (4.2), then Inserting this bound back into (D.4), we find for some . Moreover, define the intervals , for all nonnegative integer , and consider the event For sufficiently large and we have by Lemma 7.4 and by (4.20), after adjusting . Then because by assumption. This completes the proof of Step 1. with . To estimate the fluctuations of we use that the logarithmic Sobolev inequality (2.4) implies the spectral gap, i.e., we have Let denote the orthonormal set of eigenvectors belonging to the eigenvalues of . Taking into account the scaling (2.1), we have using that . We have from (D.15), (D.16) and (4.5) that On the other hand, from (4.7) and we have for all and for with some large constant . In order to insert this estimate into (D.13), we need to extract the necessary decay for large from . For sufficiently large and for any we can estimate Inserting the last three equations into (D.13) with , we find To control the first term on the r.h.s. of the last equation, we recall that denote the expected number of eigenvalues up to normalized by (integrated density of states) and the distribution function of the semicircle law. Note that vanishes at . Introducing and integrating by parts we find The second term on the r.h.s. of (D.20) can be bounded similarly. This completes the proof of Step 3. Combining the estimates in Step 1–3 and choosing , we finish the proof of the Lemma D.2. Proof of Lemma D.1. We split the summation into three parts: by (D.7). For the term, we remark that, for arbitrary , To bound the r.h.s. we consider the events from (D.8), (D.9) with sufficiently large and so that (D.10) holds. Then We split the interval into overlapping subintervals of length by defining For large , we can also use the bound that follows from the trivial large deviation estimate for the largest eigenvalue (Lemma 7.4 ). Inserting these last two estimates into (D.26), we have for every where for brevity. Combining (D.23), (D.25), and (D.28), we obtain (D.1). We need to establish a Wegner-type inequality, and bounds on the level repulsion in the same spirit as in Theorem 3.4 and Theorem 3.5 of , for energy intervals close to the spectral edges. Since we only need these bounds for very small values of , we are not aiming at the most general result here. The statements we present can be proven by simply replacing, in the proof of Theorems 3.4 and Theorem 3.5 of , the convergence to the semicircle law stated in Theorem 3.1 of with Theorem 4.1. Recall that Theorem 3.1 of is valid up to the smallest possible scale but only away from the spectral edges, while Theorem 4.1 holds all the way to the spectral edges, but only up to the logarithmic scale . A better -dependence of the bounds in the following theorem (but a worse -dependence) can be achieved by following the dependence on of the constants in Theorem 3.1 of . All statements assume the conditions (2.4)–(2.6). We introduce the notation that denotes the positive part of a real number . Let be an hermitian Wigner matrix and let . Denote by the largest eigenvalue below and assume that . Then there are positive constants such that for any and any . which implies, for sufficiently large , that where . The theorem then follows because, by Theorem 4.1, the event (E.2) has probability Proof. The proof of Theorem E.2 and Theorem E.3 follows exactly the proof of Theorem 3.4 and, respectively, Theorem 3.5 in , after replacing Theorem 3.3 of by Theorem E.1 above (in order to follow the dependence on the distance from the edges). Note that the results of the last three theorems are only useful in the regime of very small . Here we check the conditions (a) and (b) in Theorem 11.1. The main ingredient is the following: Let and . After rescaling, then for any fixed with , the first and second derivatives of the potential are uniformly bounded on , i.e. where the constant is independent of . Furthermore, the endpoints of the support of the equilibrium measure satisfy Condition (b) of Theorem 11.1 is given now by (F.1). To see condition (a) of Theorem 11.1, let denote the support of the equilibrium measure , then and as , thus is positive on for any fixed and any sufficiently large . For the uniform boundedness of on , we use the explicit formula (see, e.g. Theorem 2.5. of ): where P.V. denoted principal value. For sufficiently large and for any the singularity of is uniformly separated away from and , i.e. from the singularity of the square roots. Moreover, is a smooth function inside with according to (F.1). Thus the uniform boundedness of on follows immediately from (F.3) with standard estimates on the principal value. Proof of Lemma F.1. Recall the definition from (6.11). For we know from the first bound in (6.13) that , and from (4.22) that with , assuming and . After rescaling, this corresponds to where we used (F.4) and . After summation we conclude that and thus (F.1) is proven. To estimate the location of the endpoints, we substitute into the equations (11.2). We have We will need the following explicit integration formulae for (see, e.g. Formula 2.266 in ) With these formulae, (F.6) and (F.7) can be written as Using the bound (F.4) on the location of ’s, we replace the limit with and the limit with in the summations in (F.10) and (F.11), where . We have, for example, for the first sum (F.10), and the estimate for the other three sums in (F.10), (F.11) is identical. With similar argument, we can remove the ’s that are too close to $X=n^{\gamma-1}$, then where, for the lower bound, we used that , while for the upper bound we used that the number of ’s in is at most (see the third set in the definition of (4.18)) . Similarly we have to be the truncated summations. Combining the above estimates with estimates of type (F.12) and using so that , we get from (F.10), (F.11) that Using that for the number of eigenvalues in any interval of size at least (before rescaling) is approximated by the semicircle law with a precision (see (4.16)), we get Let and and we can assume, by symmetry, that . Then we can change variables in the integrals in (F.17) The first term is of order and thus negligible. Thus, from the lower bound in (F.15), we have Estimating on the integration domain, we get if . The case is treated similarly, thus we have shown that Now we consider the and assume again that . With the same change of variables as above, we have The integrals on the r.h.s of (F.20) can be explicitly computed: by using that and (see (2.7)). Combining this estimate with the upper bound in (F.16), we have by using . Therefore either or is smaller than , but then by using (F.19) we obtain that both of them are smaller then . This completes the proof of Lemma F.1. Bound on smeared-out orthogonal polynomials
Regularity of Density
Proof of the Main Theorem 2.1
Appendix A Proof of Theorem 4.1
Appendix B Proof of Proposition 4.2
Appendix C Proof of Lemma 4.3.
Appendix D Proof of Lemma 5.3
Appendix E Level repulsion near the spectral edge
Appendix F Properties of the equilibrium measure
References