Bulk universality for generalized Wigner matrices

Laszlo Erdos, Horng-Tzer Yau, Jun Yin

Introduction

One key universal quantity for random matrices is the eigenvalue gap distribution. Although the density of eigenvalues may depend on the specific model, the gap distribution or the short distance correlation function are believed to depend only on the symmetry class of the ensembles but are otherwise independent of the details of the distributions. There are two types of universality: the edge universality and the bulk universality. In this paper, we will focus on the bulk universality concerning the interior of the spectrum. The bulk universality was proved for very general classes of invariant ensembles (see, e.g. and references therein). For non-invariant ensembles, in particular for matrices with i.i.d. entries (Wigner matrices), the bulk universality was difficult to establish due to the lack of an explicit expression for the joint distribution of the eigenvalues.

The first rigorous partial result for bulk universality in the non-unitary case was given by Johansson (see also Ben Arous and Péché and the recent improvement ) stating that the bulk universality holds for Gaussian divisible Hermitian ensembles, i.e., Hermitian ensembles of the form

where H^\widehat{H} is a Wigner matrix, VV is an independent standard GUE matrix and ss is a positive constant of order one. The restriction on Gaussian divisibility turned out to be very difficult to remove. In a series of papers , we developed a new approach to prove the universality. The first step was to derive the local semicircle law, an estimate of the local eigenvalue density, down to energy scales containing around log⁡N\log N eigenvalues. Once such a strong form of the local semicircle law was obtained, the result of can be extended to a Gaussian convolution with variance only s2≍N−1+εs^{2}\asymp N^{-1+\varepsilon}. This tiny Gaussian component can then be removed via a reverse heat flow argument and this proves the bulk universality for Hermitian ensembles provided that the distributions of the matrix elements are sufficiently differentiable.

The bulk universality for Hermitian ensembles was also proved later on by Tao and Vu under the condition that the first four moments of the matrix elements match those of GUE, but without the differentiability assumption. The condition on the fourth moment was already removed in by using the result for Gaussian divisible ensembles of ; the third moment condition was then removed in by using the result of .

The four moment theorem is also valid for the symmetric ensembles, but the restriction on the matching of the first four moments cannot be weakened for the following reason. The key input to remove the fourth moment matching condition for the Hermitian case, the universality of the Gaussian divisible ensembles , relied entirely on the asymptotic analysis of an explicit formula, closely related to a formula in Brézin-Hikami , for the correlation functions of the eigenvalues for the Hermitian ensembles H^+sV\widehat{H}+sV. Since similar formulas for symmetric matrices are very complicated, the corresponding result is not available and thus the matching of the fourth moment cannot be removed in this way. Although there is a proof of universality for s2≥N−3/4s^{2}\geq N^{-3/4} without using this formula, the main ingredient of that proof, establishing the uniqueness of the local equilibria of the Dyson Brownian motion, still heavily used explicit formulas related to GUE.

In a completely different strategy was introduced based on a local relaxation flow, which locally behaves like a Dyson Brownian motion, but has a faster decay to equilibrium. This approach entirely eliminates explicit formulas and it gives a unified proof for the universality of symmetric and Hermitian Wigner matrices . It was further generalized to quaternion self-dual Wigner matrices and sample covariance matrices. The method not only applies to all these specific ensembles, but it also gives a conceptual interpretation that the occurrence of the universality is due to the relaxation to local equilibrium of the DBM. We remark that very recently the results of were also extended to sample covariance matrices .

The main input of all these methods and is an estimate of the local density of eigenvalues, the local semicircle law. This has been developed in the previous work on Wigner matrices , where the matrix elements were i.i.d. random variables. In this paper, we extend this method to random matrices with independent, but not necessarily identically distributed entries. If we denote the variance of the (i,j)(i,j) entry of the matrix by σij2\sigma_{ij}^{2}, our main interest is the case that σij\sigma_{ij} are not a constant but they satisfy the normalization condition ∑iσij2=1\sum_{i}\sigma_{ij}^{2}=1 for all jj. We will call such matrix ensembles universal Wigner matrices. For these ensembles Guionnet and Anderson-Zeitouni proved that the density of the eigenvalues converges to the Wigner semi-circle law. The simplest case is that of generalized Wigner matrices, where Nσij2N\sigma_{ij}^{2} is uniformly bounded from above and below by two fixed positive numbers. In this case, we prove the local semicircle law down to essentially the smallest possible energy scale N−1N^{-1} (modulo log⁡N\log N factors). A much more difficult case is the Wigner band matrices where, roughly speaking, σij2=0\sigma_{ij}^{2}=0 if ∣i−j∣>M|i-j|>M for some M<NM<N. In this case, we obtain the local semicircle law to the energy scale M−1M^{-1}. We note that a certain three-dimensional version of Gaussian band matrices was considered by Disertori, Pinson and Spencer using the supersymmetric method. They proved that the expectation of the density of eigenvalues is smooth and it coincides with the Wigner semicircle law.

With the local semicircle law proved up to the almost optimal scale, applying the method of leads to the identification of the correlation functions and the gap distribution for generalized Wigner matrices provided that the distribution of the matrix elements is continuous and satisfies the logarithmic Sobolev inequality. These additional assumptions can be removed if one can extend the Tao-Vu theorem to generalized Wigner matrices. In Section 8, we will introduce an approach based on a Green’s function comparison theorem, which states that the joint distributions of Green’s functions of two ensembles at different energies with imaginary parts of order 1/N1/N are identical provided that the first three moments of the two ensembles coincide and the fourth moments are close. Since local correlation functions and the gap distribution of the eigenvalues can be identified from Green’s functions, it follows that the local correlation functions of these two ensembles are identical at the scale 1/N1/N. We can thus use this theorem to remove all continuity and logarithmic Sobolev inequality restrictions in our approach. In particular, this leads to the bulk universality for generalized Wigner matrices with the subexponential decay being essentially the only assumption on the probability law. We note that one major technical difficulty in , the level repulsion estimate, is not needed in the proof of the Green’s function comparison theorem. It will be clear in Section 8 that, once the local semicircle law is established, the Green’s function comparison theorem is a simple consequence of the standard resolvent perturbation theory.

Main results

Matrices with independent, zero mean entries and with the normalization condition (2.1) will be called universal Wigner matrices. For a forthcoming review on this matrix class, see , where the terminology of random band matrices was used.

Note that Cinf=Csup{C_{inf}}={C_{sup}} corresponds to the standard Wigner matrices and the condition 0<Cinf≤Csup<∞0<{C_{inf}}\leq{C_{sup}}<\infty defines more general Wigner matrices with comparable variances.

We will also consider an even more general case when σij\sigma_{ij} for different (i,j)(i,j) indices are not comparable. The basic parameter of such matrices is the quantity

A special case is the band matrix, where σij=0\sigma_{ij}=0 for ∣i−j∣>W|i-j|>W with some parameter WW. In this case, MM and WW are related by M≤CWM\leq CW.

Denote by B:={σij2}i,j=1NB:=\{\sigma^{2}_{ij}\}_{i,j=1}^{N} the matrix of variances which is symmetric and doubly stochastic by (2.1), in particular it satisfies −1≤B≤1-1\leq B\leq 1. Let the spectrum of BB be supported in

with some nonnegative constants δ±\delta_{\pm}. We will always have the following spectral assumption

The local semicircle law will be proven under this general condition, but the precision of the estimate near the spectral edge will also depend on δ+\delta_{+} in an explicit way. For the orientation of the reader, we mention two special cases of universal Wigner matrices that provided the main motivation for our work.

Example 1. Generalized Wigner matrix. In this case we have

and one can easily prove that 11 is a simple eigenvalue of BB and (2.4) holds with

i.e., both δ−\delta_{-} and δ+\delta_{+} are positive constants independent of NN.

Example 2. Band matrix. The variances are given by

The Stieltjes transform of the empirical eigenvalue distribution of HH is given by

We define the density of the semicircle law

and, for Im z>0{\text{Im}}\,z>0, its Stieltjes transform

The Stieltjes transform msc(z)≡mscm_{sc}(z)\equiv m_{sc} may also be characterized as the unique solution of

satisfying Im msc(z)>0{\text{Im}}\,m_{sc}(z)>0 for Im z>0{\text{Im}}\,z>0, i.e.,

Here the square root function is chosen with a branch cut along the positive real axis. This guarantees that the imaginary part of mscm_{sc} is non-negative. The Wigner semicircle law states that mN(z)→msc(z)m_{N}(z)\to m_{sc}(z) for any fixed zz provided that η=Im z>0\eta={\text{Im}}\,z>0 is independent of NN. The local version of this result for universal Wigner matrices is the content of the following Theorem.

Then there exist constants C1C_{1}, C2C_{2}, CC and c>0c>0, depending only on α\alpha, β\beta and δ−\delta_{-} in (2.5), such that for any z=E+iηz=E+i\eta with η=\mboxIm z>0\eta={\mbox{I}m}\,z>0, ∣z∣≤10|z|\leq 10 and

where \kappa:=\big{|}\,|E|-2\big{|}, the Stieltjes transform of the empirical eigenvalue distribution of HH satisfies

for sufficiently large NN. In fact, the same result holds for the individual matrix elements of the Green’s function Gii(z)=(H−z)−1(i,i)G_{ii}(z)=(H-z)^{-1}(i,i):

We remark that once a local semicircle law is obtained on a scale essentially M−1M^{-1}, it is straightforward to show that eigenvectors are delocalized on a scale at least of order MM. The precise statement will be formulated in Corollary 3.2. We will prove Theorem 2.1 in Sections 3–5 by extending the approach of . The main ingredients of this approach consist of i) a derivation of a self-consistent equation for the Green’s function and ii) an induction on the scale of the imaginary part of the energy. The key novelty in this paper is that the self-consistent equation is formulated for the array of the diagonal elements of the Green’s function (G11,G22,…,GNN)(G_{11},G_{22},\ldots,G_{NN}) instead of the Stieltjes transform m=1N\mboxTr G=1N∑iGiim=\frac{1}{N}\mbox{Tr\,}G=\frac{1}{N}\sum_{i}G_{ii} itself as in . This yields for the first time a strong pointwise control on the diagonal elements GiiG_{ii}, see (2.17).

The subexponential decay condition (2.14) can be weakened if we are not aiming at error estimates faster than any power law of NN. This can be easily carried out and we will not pursue it in this paper.

Denote the eigenvalues of HH by λ1,…,λN\lambda_{1},\ldots,\lambda_{N} and let pN(x1,…,xN)p_{N}(x_{1},\ldots,x_{N}) be their (symmetric) probability density. For any k=1,2,…,Nk=1,2,\ldots,N, the kk-point correlation function of the eigenvalues is defined by

We now state our main result concerning these correlation functions.

We consider a generalized hermitian Wigner matrix such that (2.6) holds. Assume that the distributions νij\nu_{ij} of the (i,j)(i,j) matrix elements have a uniformly subexponential decay in the sense of (2.14). Suppose that the real and imaginary parts of hijh_{ij} are i.i.d., distributed according to ωij{\omega}_{ij}, i.e., νij(dh)=ωij(dIm h)ωij(dReh)\nu_{ij}({\rm d}h)={\omega}_{ij}({\rm d}{\text{Im}}\,h){\omega}_{ij}({\rm d}{\text{Re}}h). Let mk(i,j)=∫xkdωij(x)m_{k}(i,j)=\int x^{k}{\rm d}{\omega}_{ij}(x), 1≤k≤41\leq k\leq 4, denote the kk-th moment of ωij{\omega}_{ij} (m1=0m_{1}=0). Suppose that

where pGU ⁣E,N(k)p_{GU\!E,N}^{(k)} is the kk-point correlation function of the GUE ensemble. The same statement holds for generalized symmetric Wigner matrices, with GOE replacing the GUE ensemble.

The limiting correlation functions of the GUE ensemble are given by the sine kernel

and similar universal formula is available for the limiting gap distribution.

Remark: The quantity in the bracket in (2.19) is always greater or equal to 1 for any real distribution with mean zero, which can be obtained by

and it is exactly 1 if the distribution is supported on two points. For example, if ωij{\omega}_{ij} is a rescaling of a fixed distribution ω~\widetilde{\omega} with variance 12\frac{1}{2}, i.e. ωij(x)dx=σij−1ω~(x/σij)dx{\omega}_{ij}(x){\rm d}x=\sigma_{ij}^{-1}\widetilde{\omega}(x/\sigma_{ij}){\rm d}x, then condition (2.19) is satisfied under (2.6), as long as the support of ω~\widetilde{\omega} consists of at least three points. The case of a Bernoulli-type distribution supported on two points require a separate argument and it will be treated in the forthcoming paper .

We now state our main comparison theorem for matrix elements of Green’s functions of two Wigner ensembles. As in the paper , we assume conditions on four moments. It will lead quickly to Theorem 6.4 stating that the correlation functions of eigenvalues of two matrix ensembles are identical up to scale 1/N1/N provided that the first four moments of all matrix elements of these two ensembles are almost identical. Here we do not assume that the real and imaginary parts are i.i.d., hence the kk-th moment of hijh_{ij} is understood as the collection of numbers ∫hˉshk−sνij(dh)\int\bar{h}^{s}h^{k-s}\nu_{ij}({\rm d}h), s=0,1,2,…,ks=0,1,2,\ldots,k. The main result in compares the joint distribution of individual eigenvalues — which is not covered by our Theorem 2.3 — but it does not address directly the matrix elements of Green’s functions. The key input for both theorems is the local semicircle law on the almost optimal scale N−1+εN^{-1+\varepsilon}. The eigenvalue perturbation used in requires certain estimates on the eigenvalue level repulsion; the proof of Theorem 2.3 is a straightforward resolvent perturbation theory.

Suppose that we have two generalized N×NN\times N Wigner matrices, H(v)H^{(v)} and H(w)H^{(w)}, with matrix elements hijh_{ij} given by the random variables N−1/2vijN^{-1/2}v_{ij} and N−1/2wijN^{-1/2}w_{ij}, respectively, with vijv_{ij} and wijw_{ij} satisfying the uniform subexponential decay condition

with some α,β>0\alpha,\beta>0. Fix a bijective ordering map on the index set of the independent matrix elements,

and denote by HγH_{\gamma} the generalized Wigner matrix whose matrix elements hijh_{ij} follow the vv-distribution if ϕ(i,j)≤γ\phi(i,j)\leq\gamma and they follow the ww-distribution otherwise; in particular H(v)=H0H^{(v)}=H_{0} and H(w)=Hγ(N)H^{(w)}=H_{\gamma(N)}. Let κ>0\kappa>0 be arbitrary and suppose that, for any small parameter τ>0\tau>0 and for any y≥N−1+τy\geq N^{-1+\tau}, we have the following estimate on the diagonal elements of the resolvent

with some constants C,cC,c depending only on τ,κ\tau,\kappa. Moreover, we assume that the first three moments of vijv_{ij} and wijw_{ij} are the same, i.e.

and the difference between the fourth moments of vijv_{ij} and wijw_{ij} is much less than 1, say

for some given δ>0\delta>0. Let ε>0\varepsilon>0 be arbitrary and choose an η\eta with N−1−ε≤η≤N−1N^{-1-\varepsilon}\leq\eta\leq N^{-1}. For any sequence of positive integers k1,…,knk_{1},\ldots,k_{n}, set complex parameters zjm=Ejm±iηz^{m}_{j}=E^{m}_{j}\pm i\eta, j=1,…kmj=1,\ldots k_{m}, m=1,…,nm=1,\ldots,n, with ∣Ejm∣≤2−2κ|E^{m}_{j}|\leq 2-2\kappa and with an arbitrary choice of the ±\pm signs. Let G(v)(z)=(H(v)−z)−1G^{(v)}(z)=(H^{(v)}-z)^{-1} denote the resolvent and let F(x1,…,xn)F(x_{1},\ldots,x_{n}) be a function such that for any multi-index α=(α1,…,αn)\alpha=(\alpha_{1},\ldots,\alpha_{n}) with 1≤∣α∣≤51\leq|\alpha|\leq 5 and for any ε′>0\varepsilon^{\prime}>0 sufficiently small, we have

Then, there is a constant C1C_{1}, depending on α,β\alpha,\beta, ∑mkm\sum_{m}k_{m} and C0C_{0} such that for any η\eta with N−1−ε≤η≤N−1N^{-1-\varepsilon}\leq\eta\leq N^{-1} and for any choices of the signs in the imaginary part of zjmz^{m}_{j}, we have

where the arguments of FF in the second term are changed from the Green’s functions of H(v)H^{(v)} to H(w)H^{(w)} and all other parameters remain unchanged.

We also remark that Theorem 2.3 holds for generalized Wigner matrices since Csup<∞C_{sup}<\infty in (2.2). The positive lower bound on the variances, Cinf>0C_{inf}>0, is not necessary for this theorem.

Remark 2: Although we state Theorem 2.3 for Hermitian and symmetric ensembles, similar results hold for real and complex sample covariance ensembles; the modification of the proof, to be given in Section 8, is obvious and we omit the details.

To summarize, our approach to prove the universality is based on the following three steps; a detailed outline will be given in Section 6. Step 1. Local semicircle law, i.e., Theorem 2.1. This will be proved in Sections 3–5. Step 2. Universality for ensembles with smooth distributions satisfying the logarithmic Sobolev inequality (LSI), Theorem 6.3. The key input is the general theorem, Theorem 6.2, concerning the universality for the local relaxation flow. In Section 7, by using the local semicircle law and the LSI, we verify the assumptions for this theorem. Step 3. Green’s function comparison theorem, Theorem 2.3. This removes the restriction on the smoothness and the LSI, and it will be proved in Section 8.

Convention. We will frequently use the notation C,cC,c for generic positive constants whose exact values are irrelevant and may change from line to line. For two positive quantities AA, BB we also introduce the notation A≍BA\asymp B to indicate that there exists a universal constant CC such that C−1≤A/B≤CC^{-1}\leq A/B\leq C.

Proof of local semicircle law

Proof of Theorem 2.1 Recall that Gij=Gij(z)G_{ij}=G_{ij}(z) denotes the matrix element

We will prove the following more detailed stronger result.

where κ≡∣∣E∣−2∣\kappa\equiv||E|-2| and δ+\delta_{+} is given in (2.4). Then for all z=E+iηz=E+i\eta and

for sufficiently large N, with positive cc and C>0C>0 depending only α\alpha and β\beta in (2.14) and δ−\delta_{-} in (2.4) and (2.5).

Remark: The condition (3.3) is effectively a lower bound on η\eta. The control function g(z)g(z) can be estimated by

up to some factor of order one. Note that the precise formula (3.2) for g(z)g(z) is not important, only its asymptotic behaviour for small κ\kappa, η\eta and δ+\delta_{+} is relevant. The theorem remains valid if g(z)g(z) is replaced by g~(z)\widetilde{g}(z) with g~(z)≤Cg(z)\widetilde{g}(z)\leq Cg(z). In particular, g(z)g(z) can be chosen to be order one when EE is not near the edges of the spectrum. If we are only concerned with the case of generalized Wigner matrices, (2.6), we can choose g(z)=O(κ+η)g(z)=O(\sqrt{\kappa+\eta}) for any z=E+iηz=E+i\eta (η>0)(\eta>0). Note that Theorem 2.1 was obtained by replacing g(z)g(z) with the lower bound κ≤g(z)\kappa\leq g(z) in Theorem 3.1.

Once the local semicircle law is established on scale η≍1/M\eta\asymp 1/M (modulo logarithmic factors), we obtain the following supremum bound on the eigenvectors that can be interpreted as a lower bound of order 1/M1/M on the localization length. The proof of this result now is simpler than in , since we have a pointwise control on the diagonal elements of the Green’s function. Let uα{\bf u}_{\alpha} denote the normalized eigenvector of HH belonging to the eigenvalue λα\lambda_{\alpha}, α=1,2,…,N\alpha=1,2,\ldots,N, i.e., Huα=λαuαH{\bf u}_{\alpha}=\lambda_{\alpha}{\bf u}_{\alpha} and ∥uα∥=1\|{\bf u}_{\alpha}\|=1.

Let HH be as in Theorem 3.1, for any fixed κ>0\kappa>0, there exists CκC_{\kappa} that

For the case of generalized Wigner matrices, (2.6), we have the following more precise bound

Proof of Corollary 3.2. Let η=CκM−1(log⁡N)26+12α\eta=C_{\kappa}M^{-1}(\log N)^{26+12\alpha}; CκC_{\kappa} can be chosen large enough so that (3.3) is satisfied for all ∣κ′∣≤κ|\kappa^{\prime}|\leq\kappa, making use of (3.5) . Choose {Em}\{E_{m}\} as a grid of points in [−2+κ,2−κ][-2+\kappa,2-\kappa] such that the distance between any two neighbors is of order η\eta. Then with (3.4), we have

where we used g(z)≤κ+η≤Cg(z)\leq\sqrt{\kappa+\eta}\leq C from (3.5). Then, with ∣msc(z)∣≤C|m_{sc}(z)|\leq C (see (2.13)) and

where uα=(uα(1),   uα(2)…uα(N)){\bf u}_{\alpha}=(u_{\alpha}(1),\,\,\,u_{\alpha}(2)\ldots u_{\alpha}(N)), we have

By the definition of EmE_{m}, for any λα∈[−2+κ,2−κ]\lambda_{\alpha}\in[-2+\kappa,2-\kappa], there exists m′m^{\prime} such that ∣Em′−λα∣|E_{m^{\prime}}-\lambda_{\alpha}| is of the order of η\eta. Together with (3.10), we obtain (3.6).

In case of the generalized Wigner matrix (2.6), we have g(z)=κ+ηg(z)=\sqrt{\kappa+\eta} and M≍NM\asymp N. Let η\eta be the solution to η=N−1(log⁡N)26+12α(κ+η)−3/2\eta=N^{-1}(\log N)^{26+12\alpha}(\kappa+\eta)^{-3/2}, then N−1≤η≤CN−1(κ+N−1)−3/2(log⁡N)26+12αN^{-1}\leq\eta\leq CN^{-1}(\kappa+N^{-1})^{-3/2}(\log N)^{26+12\alpha}. With this choice of η\eta, (3.3) is satisfied, and max⁡i∣Gii−msc∣≤C(log⁡N)−2(κ+η)1/2\max_{i}|G_{ii}-m_{sc}|\leq C(\log N)^{-2}(\kappa+\eta)^{1/2} holds with an overwhelming probability by (3.4). Since ∣Im msc(z)∣≤Cκ+η|{\text{Im}}\,m_{sc}(z)|\leq C\sqrt{\kappa+\eta}, so max⁡iIm Gii≤C(κ+η)1/2\max_{i}{\text{Im}}\,G_{ii}\leq C(\kappa+\eta)^{1/2}. By the argument above, we obtain that ∥uα∥∞2≤Cη(κ+η)1/2\|{\bf{u}}_{\alpha}\|_{\infty}^{2}\leq C\eta(\kappa+\eta)^{1/2} on this event. This proves (3.7).

To prove that Gii(z)G_{ii}(z) is very close to msc(z)m_{sc}(z) in the sense of (3.4), we will also need to control the off-diagonal elements. In fact we will show that all GijG_{ij} (i≠ji\neq j) are bounded by O((Mη)−1)O((M\eta)^{-1}) up to some factor (log⁡N)C(\log N)^{C}. To state the result precisely, we first define some events in the probability space.

Recall that λα\lambda_{\alpha}, α=1,2,…,N\alpha=1,2,\ldots,N, denote the eigenvalues of H=(hij)H=(h_{ij}). Denote by Ω0\Omega^{0} the subset of the probability space such that

Finally, denote by Ωzd\Omega_{z}^{d} the set

and similarly define Ωzo\Omega_{z}^{o}. These sets depend on NN but we suppress this from the notations.

Proof of Theorem 3.1. The following proposition immediately implies Theorem 3.1.

Suppose that the assumptions of Theorem 3.1 hold. Then, for sufficiently large N, we have

Following the work of , we will use a continuity argument. In Section 4 we will derive a self-consistent equation of the form

Later we will give an explicit formula for Υi(z)\Upsilon_{i}(z), but for now we take (3.16) as the definition of Υi\Upsilon_{i}. Let Ω^zΥ(N)=Ω^zΥ\widehat{\Omega}^{\Upsilon}_{z}(N)=\widehat{\Omega}^{\Upsilon}_{z} be the subset of Ω0\Omega^{0} where the following inequality holds

We will use the following Lemmas that will be proved later in Section 4 and 5.

Let z=E+iηz=E+i\eta be a fixed complex number satisfying (3.3). Then there are constants CC and cc such that for N≥N0N\geq N_{0}, with N0N_{0} sufficiently large independent of EE and η\eta, the following estimates hold.

(2) Suppose that η≤3\eta\leq 3. Setting z′=z+iN−5z^{\prime}=z+iN^{-5}, we have

Suppose we are on the event Ω^zΥ\widehat{\Omega}^{\Upsilon}_{z} for some fixed z=E+iηz=E+i\eta satisfying (3.3). Suppose either 3≤η≤103\leq\eta\leq 10 or the following inequality hold:

Then, for sufficiently large NN, we have

Proof of Proposition 3.3. Recall that Ω^zd\widehat{\Omega}_{z}^{d} is the subset of Ω0\Omega^{0} where (3.12) holds. Since on Ω^zΥ\widehat{\Omega}^{\Upsilon}_{z} (3.12) follows from (3.17), the case 3≤η=Im z≤103\leq\eta={\text{Im}}\,z\leq 10 follows from Lemma 3.4 and Lemma 3.5 by taking a union bound for 0≤k≤10N50\leq k\leq 10N^{5}.

Now we prove (3.15) for the case η≤3\eta\leq 3 assuming that z=E+iηz=E+i\eta satisfies (3.3). We have shown that (3.15) holds for η=3\eta=3, now we will successively decrease η\eta by N−5N^{-5} in each step, and we continue this inductive procedure as long as (3.3) is still satisfied for the reduced η\eta. More precisely, let z′=z+iN−5z^{\prime}=z+iN^{-5} and assume that (3.15) holds for z′z^{\prime}. Our goal is to prove that

The number of steps we will be taking is of order N5N^{5}. Since N−clog⁡log⁡N≪N−5N^{-c\log\log N}\ll N^{-5}, this proves (3.15) provided that we can establish (3.26).

From (3.21), the difference between the probabilities of the sets Ω^zo∩Ωz′d∩Ωz′o\widehat{\Omega}_{z}^{o}\cap\Omega_{z^{\prime}}^{d}\cap\Omega_{z^{\prime}}^{o} and Ωz′d∩Ωz′o\Omega_{z^{\prime}}^{d}\cap\Omega_{z^{\prime}}^{o} is negligible. With the definition of Ωzd\Omega_{z}^{d} and Ωzo\Omega_{z}^{o} in (3.14), we have

Then, to prove (3.26), it remains to prove

i.e., we need to estimate the probability of the complement of Ω^zd\widehat{\Omega}_{z}^{d} on the set Ω^zo∩Ωz′d∩Ωz′o\widehat{\Omega}_{z}^{o}\cap\Omega_{z^{\prime}}^{d}\cap\Omega_{z^{\prime}}^{o}. On this set, using (3.22), we can assume that the estimate (3.17) holds with a very high probability. We will show below that (3.24) holds on Ωz′d\Omega_{z^{\prime}}^{d}. Then (3.25) together with (3.17) imply (3.12), the defining relation of Ω^zd\widehat{\Omega}_{z}^{d}. This will conclude (3.28) and complete the proof of Proposition 3.3. Therefore, we only have to verify (3.24).

Now we show that (3.24) holds on Ωz′d\Omega^{d}_{z^{\prime}}. Recall z′=z+iN−5z^{\prime}=z+iN^{-5} and we have the trivial estimate

In the set Ωz′d\Omega^{d}_{z^{\prime}}, we have

where in the second inequality we used (3.3). By the definition of g(z)g(z) from (3.2), we have g(z)≤κ+ηg(z)\leq\sqrt{\kappa+\eta}. Thus, if (3.3) holds, then, in particular,

This sets a lower bound on η\eta. Together with ∣z−z′∣=1/N5|z-z^{\prime}|=1/N^{5}, we have the trivial continuity bound

using ∣∂zmsc(z)∣≤∣Im z∣−2|\partial_{z}m_{sc}(z)|\leq|{\text{Im}}\,z|^{-2}, ∣∂zGii(z)∣=∣[(H−z)−2]ii∣≤∥(H−z)−2∥≤∣Im  z∣−2|\partial_{z}G_{ii}(z)|=|[(H-z)^{-2}]_{ii}|\leq\|(H-z)^{-2}\|\leq|{\text{Im}}\,\,z|^{-2} and η>N−1\eta>N^{-1} from (3.31). Thus

Using ∣g(z)∣≥Cη≥CN−1|g(z)|\geq C\eta\geq CN^{-1} and ∣g′(z)∣≤Cη−1≤CN|g^{\prime}(z)|\leq C\eta^{-1}\leq CN for η≤3\eta\leq 3, we have the following estimate

in the set Ωz′d\Omega^{d}_{z^{\prime}}. Thus the assumption (3.24) holds in the set Ωz′d\Omega^{d}_{z^{\prime}}.

Under the assumptions of Theorem 3.1, with (3.15), (3.20), (3.23) and the definitions in (3.14), all these Ω\Omega’s are sets of almost full probability, i.e.,

Self-consistent equation for Green’s function

For T={k1,k2,…ks}{\bf T}=\{k_{1},k_{2},\ldots k_{s}\}, we define

These quantities depend on zz, but we mostly neglect this dependence in the notation.

We start the proof with deriving some identities between the matrix elements of G=(H−z)−1G=(H-z)^{-1} and G(k1,k2,…,ks)G^{(k_{1},k_{2},\ldots,k_{s})} using the following well known result in linear algebra that we quote without proof.

Let AA , BB, CC be n×nn\times n, m×nm\times n and m×mm\times m matrices. We define (m+n)×(m+n)(m+n)\times(m+n) matrix DD as

Furthermore, let T{\bf T} denote the unordered set {k1,k2,…ks}\{k_{1},k_{2},\ldots k_{s}\} and 1≤ki≤n1\leq k_{i}\leq n, 1≤i≤s1\leq i\leq s. We define D(T)D^{({\bf T})} to be the n+m−sn+m-s by n+m−sn+m-s submatrix of DD after removing the kik_{i}-th (1≤i≤s)(1\leq i\leq s) rows and columns and define D^(T)\widehat{D}^{({\bf T})} to be the n−sn-s by n−sn-s submatrix of D^\widehat{D} after removing the kik_{i}-th (1≤i≤s)(1\leq i\leq s) rows and columns. Then for any 1≤i,j≤n1\leq i,j\leq n and i,j∉Ti,j\notin{\bf T}, we have

Using Lemma 4.1 and Definition 4.1, for 1≤i≠j≤N1\leq i\not=j\leq N, we have

For the off diagonal matrix elements GijG_{ij}, (i≠j)(i\neq j), we have

Let T{\bf T} be an unordered set {k1\{k_{1}, k2k_{2}, …\ldots, ks}k_{s}\} with 1≤kt≤N1\leq k_{t}\leq N for (1≤t≤s)(1\leq t\leq s) or T=∅\bf T=\emptyset. For simplicity, we use the notation (i T)(i\,{\bf T}) for {i}∪T\{i\}\cup{\bf T} and (ij T)(ij\,{\bf T}) for {i,j}∪T\{i,j\}\cup{\bf T}. Then we have the following identities:

For any indices ii, jj and kk that are different and i,j,k∉Ti,j,k\notin{\bf T}

Proof of Lemma 4.2. The first two identities (4.5) and (4.6) are obvious extensions of (4.3) and (4.4). To prove (4.7), without loss of generality, we may assume that i=1i=1, j=2j=2 and T=∅{\bf T}=\emptyset. Let D=H−zD=H-z and D^\widehat{D} defined as in (4.2) with n=2n=2 and m=N−2m=N-2. With Lemma 4.1, we have that for i,j=1i,j=1 or 22.

Since D^\widehat{D} is just a 2×22\times 2 matrix, one can easily check that (4.7) holds. With the same method, one can obtain (4.8) .

The diagonal matrix elements of the resolvent satisfy the following self-consistent equation.

hold with a probability larger than 1−CN−c(log⁡log⁡N)1-CN^{-c(\log\log N)} for sufficiently large NN.

Proof of Lemma 4.3. We can write G11G_{11} as follows,

Combining this identity with (4.7), we have

Clearly G11G_{11} can be replaced with any GiiG_{ii} and this proves (4.11) with the definition (4.12).

We note hiih_{ii}, vijv_{ij} and Gkl(iT)G^{(i{\bf T})}_{kl} are independent for k,l∉(iT)k,l\notin(i{\bf T}). With the sub-exponential decay (2.14) and σij2≤1/M\sigma_{ij}^{2}\leq 1/M, we have for any i,ji,j

In Corollary B.3 of Appendix B we will prove a general large deviations result. Applying (B.15) to the last term in (4.19), with the choice

and with ∑jσij2=1\sum_{j}\sigma_{ij}^{2}=1 and σii2≤1/M\sigma_{ii}^{2}\leq 1/M, we obtain that

holds with a probability larger than 1−CN−c(log⁡log⁡N)1-CN^{-c(\log\log N)}. Together with (4.21), we obtain that (4.13) holds with a probability larger than 1−CN−c(log⁡log⁡N)1-CN^{-c(\log\log N)} for sufficiently large NN.

Next we prove (4.14). By the definition of Kij(ijT)K^{(ij{\bf T})}_{ij}, i≠ji\neq j, we can write

Applying (B.16), (4.21) and σij2≤1/M\sigma^{2}_{ij}\leq 1/M, we obtain that

holds with a probability larger than 1−CN−c(log⁡log⁡N)1-CN^{-c(\log\log N)} for sufficiently large NN. With Schwarz’s inequality, for any i,ji,j,

Denote uα(ijT)u^{({ij\bf T})}_{\alpha} and λα(ijT)\lambda_{\alpha}^{({ij\bf T})} (α=1,2,…,N−∣T∣−2\alpha=1,2,\ldots,N-|{\bf T}|-2) the l2l^{2}-normalized eigenvectors and eigenvalues of H(ijT)H^{({ij\bf T})}. Let uα(ijT)(l)u^{({ij\bf T})}_{\alpha}(l) denote the ll-th coordinate of uα(ijT)u^{({ij\bf T})}_{\alpha}, then for any ll

Here we defined ∣A∣2:=A∗A|A|^{2}:=A^{*}A for any matrix AA. Inserting (4.27) into (4.25) and using the definition of MM in (2.3), we obtain that (4.14) holds with a probability larger than 1−CN−c(log⁡log⁡N)1-CN^{-c(\log\log N)} for sufficiently large NN.

and max⁡α∣λα∣≤3\max_{\alpha}|\lambda_{\alpha}|\leq 3, we have that

holds in Ω0\Omega^{0}. Together with 3≤η≤103\leq\eta\leq 10 and ∣E∣≤10|E|\leq 10, we obtain

with some positive constants. From the interlacing property of the eigenvalues of the matrix and its submatrices, we find that not only ∥H∥≤3\|H\|\leq 3 but also ∥H(T)∥≤3\|H^{(\bf T)}\|\leq 3 holds on the set Ω0\Omega^{0}. Thus for any j,kj,k such that ii, jj and kk are all different, the bounds

hold in Ω0\Omega^{0} by a similar argument that led to (4.30). Thus (4.6) implies

and (3.18) follows make use of (4.14) and η>3\eta>3.

Now we prove (3.19). Recall that the self consistent equation (3.16) with the error term Υi(z)\Upsilon_{i}(z) is given by (4.12), i.e.,

Now we bound Υi(z)\Upsilon_{i}(z) in Ω^zo\widehat{\Omega}^{o}_{z}. Since σii2≤M−1\sigma^{2}_{ii}\leq M^{-1}, with (4.31), the first term of the r.h.s. of (4.33) is less than O(M−1)O(M^{-1}). Then with (2.1), and using the bound on GijG_{ij} (i≠ji\neq j) from (3.13) and the one on GiiG_{ii} from (4.31), we obtain that the second term of the r.h.s. of (4.33) is less than C(log⁡N)10+8α(Mη)−1C(\log N)^{10+8\alpha}(M\eta)^{-1} (and with (3.31), we know it is much less than 1), i.e., in Ω^zo\widehat{\Omega}^{o}_{z}

The last term of the r.h.s. of (4.33) can be bounded, using (4.13) with T=∅{\bf T}=\emptyset, with a very large probability. Using (4.8) and (4.31), the Gkl(i)G^{(i)}_{kl}’s in (4.13) can be bounded as

Therefore, again with the bound on GijG_{ij} (i≠ji\neq j) in (3.13) and the one on GiiG_{ii} from (4.31), we see that

Now we prove (3.20) for η≥3\eta\geq 3. By the definition of Υi\Upsilon_{i} in (4.33), we have

We now claim that for some large enough C>0C>0 there exists c>0c>0 such that

The first estimate follows from the definition of Zii(i)Z_{ii}^{(i)} given in Definition 4.1 by using the sub-exponential decay of the matrix elements and by using the trivial bound ∣Gkl(i)∣≤η−1≠N|G_{kl}^{(i)}|\leq\eta^{-1}\neq N. The second estimate is a trivial consequence of the first one and the definition of Kii(i)K_{ii}^{(i)}. Together with (4.38), we obtain (3.20) in the case that 3≤η≤103\leq\eta\leq 10.

We now prove (3.21) and (3.22) for the case η≤3\eta\leq 3 satisfying (3.3). We will work in the event Ωz′d∩Ωz′d\Omega_{z^{\prime}}^{d}\cap\Omega_{z^{\prime}}^{d} where z′=z+iN−5z^{\prime}=z+iN^{-5}. Similarly as we proved (3.33), from the bound below (3.31) and the Lipschitz continuity of g(z)g(z) , we obtain that

hold in Ωz′d∩Ωz′d\Omega_{z^{\prime}}^{d}\cap\Omega_{z^{\prime}}^{d}. We note the r.h.s of these inequalities are much less than (log⁡N)−1(\log N)^{-1} by (3.3). From the explicit formula (2.13) we obtain that c≤∣msc(z)∣≤Cc\leq|m_{sc}(z)|\leq C for any ∣z∣≤10|z|\leq 10 with some positive constants. Using this observation and the fact that the r.h.s. of (4.40) is much less than (log⁡N)−1(\log N)^{-1}, we have

Hence, using (3.31), (4.7), (4.8) and the lower bound of ∣Gii∣|G_{ii}|, one can easily obtain that

hold in Ωz′o∩Ωz′d\Omega_{z^{\prime}}^{o}\cap\Omega_{z^{\prime}}^{d}, (for the third term in l.h.s., we have also used the lower bounds of Gii(j)G^{(j)}_{ii}’s as above). Then we also have

The definition of msc(z)m_{sc}(z) implies Im   msc(z)≤Cκ+η{\text{Im}}\,\,\,m_{sc}(z)\leq C\sqrt{\kappa+\eta}. Then with (4.42), (3.3) and g(z)≤κ+ηg(z)\leq\sqrt{\kappa+\eta}, we have that

holds in Ωz′o∩Ωz′d\Omega_{z^{\prime}}^{o}\cap\Omega_{z^{\prime}}^{d} for some constant C>0C>0. Inserting it into (4.14), we obtain that

Then, as we proved in (4.34) and (4.36), we get that

Finally, similarly as using (4.37)- (4.38) to prove (3.20), we can obtain (3.23) in the case that η<3\eta<3.

Stability of the self-consistent equation: proof of Lemma 3.5

In this section, we prove Lemma 3.5, i.e., we will prove the stability of the self-consistent equation with a precise error estimate given in (3.25). We set msc=msc(z)m_{sc}=m_{sc}(z) and Υ=max⁡i∣Υi(z)∣\Upsilon=\max_{i}|\Upsilon_{i}(z)| for simplicity of notation and we will omit all zz dependences in all the symbols. With the definition of msc(z)m_{sc}(z) in (2.12) and (2.13), the following properties of msc(z)m_{sc}(z) can be easily established:

Let z=E+iηz=E+i\eta with η>0\eta>0 and ∣z∣≤20|z|\leq 20. Then we have

for some constant CC. Furthermore, suppose that either 2≤∣E∣≤102\leq|E|\leq 10 or κ≤η\kappa\leq\eta. Then

For small values of ∣z2−4∣≍κ+η|z^{2}-4|\asymp\kappa+\eta, msc(z)m_{sc}(z) has the asymptotic expansion

We first prove (3.25) for the case that 3≤η≤103\leq\eta\leq 10. In this case, we can easily check that g(z)=κ+ηg(z)=\sqrt{\kappa+\eta}. Denote the difference between GiiG_{ii} and mscm_{sc} by

By the self consistent equation (3.16), (2.1) and (2.12), we have

For η≥3\eta\geq 3, ∣z+msc(z)∣>2|z+m_{sc}(z)|>2 by (2.13). Using ∣Gii∣≤η−1|G_{ii}|\leq\eta^{-1} and ∣msc∣≤η−1|m_{sc}|\leq\eta^{-1}, we obtain

From the assumption (3.17) and (3.3), we have Υ=max⁡i∣Υi∣≪1\Upsilon=\max_{i}|\Upsilon_{i}|\ll 1 in this region. Together with ∣z+msc(z)∣>2|z+m_{sc}(z)|>2 and (5.6), we obtain that the absolute value of the r.h.s. of (5.5) is less than

Taking the absolute value of (5.5) and maximizing over nn, we have

The denominator satisfies ∣z+msc(z)∣−sup⁡i∣vi∣≥2−2/3=4/3|z+m_{sc}(z)|-\sup_{i}|v_{i}|\geq 2-2/3=4/3, therefore we obtain sup⁡∣vi∣=\sup|v_{i}|= sup⁡i∣Gii−msc(z)∣≤O(Υ)\sup_{i}|G_{ii}-m_{sc}(z)|\leq O(\Upsilon), which shows (3.25) for 3≤η≤103\leq\eta\leq 10.

Next, we prove (3.25) in the case that η≤3\eta\leq 3 with η\eta satisfying (3.3) and under the condition (3.24). Define

Combining (3.17), (3.3), (3.24) with the fact that g(z)≤Cg(z)\leq C, we can see that

for some C>0C>0. Furthermore (3.24) implies

Therefore, expanding the self consistent equation (3.16) around z+m(z)z+m(z), we obtain that

where Ωi\Omega_{i} is defined by the second equality and it satisfies

with error bounds uniform in ii. Here ∥u∥∞=max⁡i∣ui∣\|{\bf u}\|_{\infty}=\max_{i}|u_{i}|. Taking the average of the r.h.s of (5.13) with respect to ii, we obtain that

Here we used ∑i∑jσij2uj=∑juj=0\sum_{i}\sum_{j}\sigma_{ij}^{2}u_{j}=\sum_{j}u_{j}=0. The bound (3.24) , (5.11) and g(z)≤κ+ηg(z)\leq\sqrt{\kappa+\eta} (from (3.2)) implies that

Together with (5.10) and (5.17), we obtain

To bound m(z)m(z), we use the following lemma.

with Im sz(t)>0{\text{Im}}\,s_{z}(t)>0 and the estimate

Proof of Lemma 5.2. It follows from (5.20) that

We denote by sz1(t)s^{1}_{z}(t) and sz2(t)s^{2}_{z}(t) the two solutions of this equation, which are continuous with respect to tt locally in the neighborhood (5.19). When t=0t=0, one of them is equal to msc(z)m_{sc}(z), we choose sz1(0)=msc(z)s^{1}_{z}(0)=m_{sc}(z). From (5.23), we have

Then, for small enough δ\delta, if ∣t∣≤δ(κ+η)|t|\leq\delta(\kappa+\eta), then ∣s1−s2∣≥12min⁡{∣z−2∣,∣z+2∣}|s^{1}-s^{2}|\geq\frac{1}{2}\min\{|z-2|,|z+2|\} by using (5.24) and that κ+η≍min⁡{∣z−2∣,∣z+2∣}\kappa+\eta\asymp\min\{|z-2|,|z+2|\}. We thus see that only one out of s1s^{1} and s2s^{2} can satisfy (5.21). With the assumption that sz1(0)=msc(z)s^{1}_{z}(0)=m_{sc}(z), it is s1s^{1} that satisfies (5.21). Then

where for the second inequality, we used ∣t∣≤δ(κ+η)|t|\leq\delta(\kappa+\eta).

Using Lemma 5.2, for sz(t)=m(z)s_{z}(t)=m(z) and t=−Ωt=-\Omega, we have

where in the second inequality we used (5.17) and (5.18). Subtracting (5.17) from (5.13), we have the equation for uiu_{i}

where wiw_{i} is defined as ui−(∑jσij2uj)(z+msc)−2u_{i}-(\sum_{j}\sigma_{ij}^{2}u_{j})(z+m_{sc})^{-2}. By (5.17), it is bounded by

Then, using (5.11) and (5.1), we obtain that

Inserting this into (5.29), using the bounds on ∥u∥∞\|{\bf u}\|_{\infty} in (5.18) and (5.27), we have

From (5.3) in Lemma 5.1, whenever ∣E∣≥2|E|\geq 2 or κ≤η\kappa\leq\eta, in which case g(z)≍κ+ηg(z)\asymp\sqrt{\kappa+\eta}, we have

for some C>0C>0. Therefore (5.28) imply in this region that

and using ∥u∥∞≪κ+η\|{\bf u}\|_{\infty}\ll\sqrt{\kappa+\eta} from (5.18), we conclude that

Combining this with the bound on m−mscm-m_{sc} (5.27) and Gii−msc=m−msc+uiG_{ii}-m_{sc}=m-m_{sc}+u_{i}, we obtain (3.25).

Finally, we consider the main interesting regime: ∣E∣≤2|E|\leq 2 and κ≥η\kappa\geq\eta. We claim that the following inequality about msc(z)m_{sc}(z) holds.

Let 1>δ−>01>\delta_{-}>0 be a given constant. Then there exist small real numbers τ≥0\tau\geq 0 and c1>0c_{1}>0, depending only on δ−\delta_{-}, such that we have

for any positive number δ+\delta_{+} such that −1+δ−≤1−δ+-1+\delta_{-}\leq 1-\delta_{+}.

We postpone the proof of this lemma to the end of this subsection and we first complete the main argument. Recall that B={σij2}i,j=1NB=\{\sigma_{ij}^{2}\}_{i,j=1}^{N} is the matrix of variances which is symmetric. We also recall δ±\delta_{\pm} from (2.4) and we will apply Lemma 5.3 with these δ−\delta_{-} and δ+\delta_{+}. Fix zz, set ζ:=msc2(z)=(msc(z)+z)−2\zeta:=m_{sc}^{2}(z)=(m_{sc}(z)+z)^{-2} and rewrite (5.28) as

by the Lemma 5.3 and w⊥(1,...,1){\bf{w}}\perp(1,...,1), the Neumann expansion of (5.38) converges on span ((1,...,1))⊥((1,...,1))^{\perp} and

since ∣ζ∣=∣msc∣2≤1|\zeta|=|m_{sc}|^{2}\leq 1 and ∑j∣Bij∣=∑jBij=∑jσij2=1\sum_{j}|B_{ij}|=\sum_{j}B_{ij}=\sum_{j}\sigma_{ij}^{2}=1. Then we have

by Lemma 5.3. Since for any N×NN\times N matrix we have

Thus, estimating the first n≤n0:=(log⁡N)(c1g^(z))−1n\leq n_{0}:=(\log N)(c_{1}\widehat{g}(z))^{-1} terms in (5.39) by (5.40), and the rest by (5.41), we get

Using the bound (5.31) on ∥w∥∞\|{\bf w}\|_{\infty} and the bound (5.18) on ∥u∥∞\|{\bf u}\|_{\infty}, we have

for some C>0C>0. Combining this with (5.27), we find

which implies (3.25), since g(z)=min⁡{κ+η,g^(z)}g(z)=\min\{\sqrt{\kappa+\eta},\widehat{g}(z)\}.

Proof of Lemma 5.3. First, if g^(z)=δ+\widehat{g}(z)=\delta_{+}, then we choose τ=0\tau=0. With ∣msc∣≤1|m_{sc}|\leq 1 in (5.1), one can see that (5.36) holds.

In the case of g^(z)=∣1−Re msc2∣\widehat{g}(z)=|1-{\rm Re}\,m_{sc}^{2}|, we have g^≤2\widehat{g}\leq 2 by using ∣msc∣≤1|m_{sc}|\leq 1. We choose τ=δ−/10\tau=\delta_{-}/10, then

For the other term in r.h.s. of (5.44), we have

With ∣msc∣≤1|m_{sc}|\leq 1 in (5.1) and g^(z)=∣1−Re (msc2)∣\widehat{g}(z)=|1-{\rm Re}\,(m_{sc}^{2})| in this case, (5.46) is bounded as

for some CC depending on δ−\delta_{-}. At last, we complete the proof by combining (5.47) and (5.45).

Proof of the universality of local statistics

We now outline the main steps to prove Theorem 2.2.

Step 1. Local relaxation flow. Following , we first prove that the local eigenvalue statistics of Dyson Brownian motion (DBM) at a fixed time tt are the same as those of GUE if t≍N−ε0t\asymp N^{-\varepsilon_{0}} for some ε0\varepsilon_{0}. The DBM is generated by the flow

(β=2\beta=2 for GUE) be the probability measure of the eigenvalues of the general β\beta ensemble, β≥1\beta\geq 1 (in this section, we often use the notation xjx_{j} for the eigenvalues to follow the notations of ). In this paper we consider the β=2\beta=2 case for simplicity, but we stress that our proof applies to the case of symmetric matrices as well. Denote the distribution of the eigenvalues at time tt by ft(x)μ(dx)f_{t}({\bf x})\mu({\rm d}{\bf x}). Then ftf_{t} satisfies

Suppose that the probability law for the initial matrix H0H_{0} satisfies the assumptions of Theorem 2.2. Then there exists ε0>0\varepsilon_{0}>0 such that for any

where pGU ⁣E,N(k)p_{GU\!E,N}^{(k)} is the kk-point correlation function of the GUE ensemble.

Proof of Theorem 6.1. We first recall the following general theorem concerning the Dyson Brownian motion from that asserts that under four general assumptions, the local eigenvalue statistics of the time evolved matrix HtH_{t} coincide with GUE. The first assumption (called Assumption I in ) is a convexity bound on H{\mathcal{H}} which is automatically satisfied in our case and we only have to verify the following three assumptions.

For the next assumption, we introduce a notation. Let γj=γj,N\gamma_{j}=\gamma_{j,N} denote the location of the jj-th point under the limiting density, i.e., γj\gamma_{j} is defined by

We will call γj\gamma_{j} the classical location of the jj-th point.

Assumption III. There exists an ε>0\varepsilon>0 such that

Assumption IV. For any compact subinterval I0⊂{E  :  ϱ(E)>0}I_{0}\subset\{E\;:\;\varrho(E)>0\} independent of NN, and for any δ>0\delta>0, σ>0\sigma>0 and r>0r>0, there are constants cc depending on I0I_{0}, δ\delta, σ\sigma and rr such that for any interval I⊂I0I\subset I_{0} with ∣I∣≥N−1+σ|I|\geq N^{-1+\sigma}, we have

where ε\varepsilon is the exponent from Assumption III.

[19, Theorem 2.1] Let ε>0\varepsilon>0 be the exponent from Assumption III. Suppose that there is a time τ<N−2ε\tau<N^{-2\varepsilon} such that the following entropy bound holds

Theorem 6.2 was exactly Theorem 2.1 of except that the assumption (6.10) on the entropy in was stated for the initial probability density f0f_{0}. Clearly, we can start the flow (6.4) from a fixed time τ≪N−2ε+δ\tau\ll N^{-2\varepsilon+\delta} since the statement of Theorem 6.2 concerns only the time t≥N−2ε+δt\geq N^{-2\varepsilon+\delta}. In the case that the flow (6.4) is generated from the matrix evolution (6.1), the entropy assumption (6.10) is satisfied automatically. To see this, let νtij\nu_{t}^{ij} denote the probability measure of the ijij-th element of the matrix HtH_{t}, i≤ji\leq j, and νˉt\bar{\nu}_{t} the probability measure of the matrix HtH_{t}. Let μˉ\bar{\mu} denote the probability measure of the GUE and μij\mu^{ij} the probability measure of its ijij-th element which is a Gaussian measure with mean zero and variance 1/N1/N. Since the dynamics of matrix elements are independent (subject to the Hermitian condition), we have the identity

The process t→νtijt\to\nu^{ij}_{t} is an Ornstein-Uhlenbeck process and each entropy term on the right hand side of the last equation is bounded by CNCN provided that t≥1/Nt\geq 1/N and ν0ij\nu^{ij}_{0} has a subexponential decay. It is easy to check from the explicit OU kernel. Since the entropy of the marginal distribution on the eigenvalues is bounded by the entropy of the total measure on the matrix, we have proved that

and this verifies (6.10). Therefore, in order to apply Theorem 6.2, we only have to verify the Assumptions II, III and IV. Clearly, Assumption II follows from Theorem 2.1 (note that in the case of generalized Wigner matrix, M≍NM\asymp N and g(z)≍κ+ηg(z)\asymp\sqrt{\kappa+\eta}). Assumption IV also follows from Theorem 2.1 by noting that NI≤C Im(E+iη){\mathcal{N}}_{I}\leq C\,{\text{Im}}(E+i\eta) if II is an interval of length η\eta about EE. We also note that Assumption IV in was stated in a slightly stronger form, requiring a large deviation bound (6.9) for all K≥1K\geq 1, but inspecting the proof of Theorem 2.1 of reveals that Assumption IV is used only for KK larger than some positive power of NN and smaller than NN (the main observation is that the upper limit of the summation in (7.16) of is effectively NN and not ∞\infty).

Having verified all other assumptions, it remains to prove (6.8), which we state as the next theorem.

Suppose HH satisfies the assumptions of Theorem 2.2, in particular, it is a generalized Wigner matrix with positive constants CinfC_{inf}, CsupC_{sup} in (2.6). Let ν~ij(x)dx:=σijνij(σijx)dx\widetilde{\nu}_{ij}(x){\rm d}x:=\sigma_{ij}\nu_{ij}(\sigma_{ij}x){\rm d}x be the rescaling of the distributions νij\nu_{ij} of the matrix elements and suppose that they satisfy the logarithmic Sobolev inequality (LSI) with a constant CSC_{S} independent of N,i,jN,i,j, i.e.,

holds for any smooth probability density uu, ∫udν~ij=1\int u{\rm d}\widetilde{\nu}_{ij}=1. Denote λi\lambda_{i} the ii-th eigenvalue of HH in increasing order, λ1≤λ2≤…≤λN\lambda_{1}\leq\lambda_{2}\leq\ldots\leq\lambda_{N}. Then there exists ε>0\varepsilon>0 depending on α,β\alpha,\beta in (2.14) but independent of CinfC_{inf}, CsupC_{sup} and CSC_{S} such that

if NN is sufficiently large (depending on CinfC_{inf}, CsupC_{sup}, CSC_{S}, α\alpha and β\beta).

The proof of Theorem 6.3 will be given in Section 7. It is easy to check that if an initial matrix H=H0H=H_{0} satisfies the conditions of Theorem 6.3, then its evolution HtH_{t} under the Ornstein-Uhlenbeck flow will also satisfy these conditions with constants changed at most by a factor two. The main condition to check is that the logarithmic Sobolev inequality (6.14) holds for 0≤t≪10\leq t\ll 1. But this was proved in the argument following Lemma 5.3 of using an estimate on the logarithmic Sobolev constant for convolution of two measures, i.e., Lemma B.1 of . Therefore Theorem 6.3 guarantees (6.15) for all positive times t>0t>0 and this proves Assumption III provided that the initial distribution satisfies the LSI (6.14). We have thus proved Theorem 2.2 for matrix ensembles of the form

where ξijG\xi^{G}_{ij} are i.i.d. complex random variables with Gaussian distribution with mean and variance 11, and h^ij\widehat{h}_{ij}’s are independent random variables such that the rescaled variables ζ^ij=h^ij/σij\widehat{\zeta}_{ij}=\widehat{h}_{ij}/\sigma_{ij} satisfy th LSI assumption (6.14). In (6.16) δ>0\delta>0 is arbitrary and ε\varepsilon is fixed in Theorem 6.3. In particular, with the choice δ=ε\delta=\varepsilon and t≍N−εt\asymp N^{-\varepsilon}, we have proved Theorem 2.2 for matrix ensembles hij=σijζijh_{ij}=\sigma_{ij}\zeta_{ij} if ζij\zeta_{ij} is of the form

Step 2. Eigenvalue correlation function comparison theorem.

The next step is to prove that the correlation functions of eigenvalues for two matrix ensembles are identical up to scale 1/N1/N provided that the first four moments of all matrix elements of these two ensembles are almost identical. This theorem is a corollary of Theorem 2.3 and we state it as the following correlation function comparison theorem. The proof will be given in Section 8. Note that the assumption (2.21) in Theorem 2.3 is satisfied by Theorem 3.1; in case of generalized Wigner matrix we have g(z)=κ+ηg(z)=\sqrt{\kappa+\eta} and M≍NM\asymp N, so in the regime where ∣E∣|E| is separated away from 2, we have from (3.4), that Gii(z)G_{ii}(z) is uniformly bounded (modulo logarithmic factors).

Step 3. Approximation of a measure by Ornstein-Uhlenbeck process for small time.

Summarizing, we have proved Theorem 2.2 in Step 1 for matrix ensembles whose probability distributions of the normalized matrix elements ζij\zeta_{ij} are of the form (6.17). Using the Green’s function comparison theorem, i.e. Theorem 6.4, we extended the class of distributions to all random variables whose first four moments can almost be matched (more precisely, match the first three moments and almost match the fourth moments in the sense of (2.22)) by random variables in the class (6.17). In order to complete the proof of Theorem 2.2, it remains to prove that for all measures in the class given by the assumptions of Theorem 2.2, i.e., measures satisfying the subexponential decay condition, the uniformly bounded-variance condition (2.6) and the moment restriction (2.19) for the real and imaginary parts, we can find random variables in the class (6.17) to almost match the first four moments. Since the real and imaginary parts are i.i.d., it is sufficient to match them individually, i.e., we can work with real random variables normalized to variance one. This is the content of the following Lemma 6.5. Notice that the uniformity in the conditions (2.19) and (2.14) guarantees that the bounds (6.19) hold with uniform constants C1,C2C_{1},C_{2}. This implies the uniformity of the LSI constants, needed in Theorem 6.3, for the random variables constructed in Lemma 6.5. The proof of this Lemma will be given in Appendix C. We have thus proved Theorem 2.2.

Let m3m_{3} and m4m_{4} be two real numbers such that

for some positive constants C1C_{1} and C2C_{2}. Then for any sufficient small γ>0\gamma>0 (depending on C1C_{1} and C2C_{2}), there exists a real random variable ξγ\xi_{\gamma} whose distribution satisfies LSI and the first 4 moments of

are , 11, m3(ξ′)=m3m_{3}(\xi^{\prime})=m_{3} and m4(ξ′)m_{4}(\xi^{\prime}), and

for some CC depending on C1C_{1} and C2C_{2}, where ξG\xi^{G} is real Gaussian random variable with mean and variance 11, independent of ξγ\xi_{\gamma}. The LSI constant of ξγ\xi_{\gamma} (and thus ξ′\xi^{\prime}) is bounded from above by a function of C1C_{1} and C2C_{2}.

Proof of Theorem 6.3

Theorem 6.3 states that the eigenvalues are at a distance N−1/2−εN^{-1/2-\varepsilon} from their classical locations in a quadratic average sense. We will deduce this conclusion from the information on the closeness of the local density to the semicircle law. We note the constants appearing in this section may also depend on α\alpha and β\beta in (2.14), but we will not mention the dependence in the proof.

First we reformulate a result, which we have proved in , in a somewhat more general setup. It states that random points, λj\lambda_{j}, are close to a fixed set of locations, γj\gamma_{j}, if the local fluctuation is controlled, if the averaged counting function is close to the counting function of the γj\gamma_{j}’s in L1L^{1}-sense and if some tightness holds. For simplicity, the result is stated for the case when γj\gamma_{j}’s are the classical locations given by the semicircle law ϱ=ϱsc\varrho=\varrho_{sc}, (6.7), but the statement (and its proof) holds for any density function with support being a compact interval and with square root singularity at the edges. In particular, we applied this result in for the Marchenko-Pastur (MP) distribution instead of the semicircle law. The counting function of γj\gamma_{j} can be replaced by its continuous version, i.e., by the distribution function of the semicircle law which defined by

Suppose the following four assumptions hold.

[Tightness at the edge] There exist m<7m<7 and ε>0\varepsilon>0 such that

[L1L^{1}-closeness of the counting functions]

[Positivity of the bulk density] There exists a small enough δ>0\delta>0 such that: for any interval II with ∣I∣=N−5/8|I|=N^{-5/8} and I⊂[−2+N−δ,2−N−δ]I\subset[-2+N^{-\delta},2-N^{-\delta}], the number of the λ\lambda’s in II is bounded from below as follows

Then there exists ε>0\varepsilon>0 (independent of the constants in these four assumptions) such that

when NN is large enough (depending on the constants in these four assumptions).

Proof of Lemma 7.1. In Theorem 9.1 of we have proved the analogous result on the singular values of the covariance matrix, where the role of the semicircle law was played by the MP law and the spectral edges, ±2\pm 2, were replaced by λ±\lambda_{\pm}, the two edges of the support of the MP distribution. In that paper we first proved the analogues of these four assumptions, then we presented the proof of (7.8) via a general argument that used only these assumptions. Inspecting the proofs of Lemma 9.5, 9.6 and 9.7 in , leading to (7.8), we observe that only equations (9.6), (9.8), (9.9) and (9.13) from were used, in addition to the lower bound on the density of the points in the scale N−5/8N^{-5/8}, which is used below (9.51) of . The lower bound on the density is granted by the last assumption (7.7) (even with a better control on the probability than we required in ). Repeating the argument from , for the proof of Lemma 7.1 it is sufficient to check that the first three assumptions in Lemma 7.1 imply equations (9.6), (9.8), (9.9) and (9.13) in . We now explain how to obtain these necessary bounds from our assumptions.

The first condition (7.3) corresponds to the input for Lemma 9.2 in , in particular, the analogue of (9.6) of ,

follows immediately from (7.3) and (7.4). We note that (9.6) in contains a threshold N−1/5N^{-1/5} but actually in the proof we only needed it to be much less than N−1/7N^{-1/7} (see (9.36)–(9.37) of for the application of (9.6)).

The second condition (7.5) corresponds to Eq. (9.8) in . As we showed in the proof of Lemma 9.3 of , Eq. (9.9) directly follows from (9.8). Here the analogous bound

follows directly from (7.5) in the same way.

Finally, the third condition (7.6) is exactly the same as (9.13) in . Simply repeating now the proof of Theorem 9.1 from , we proved Lemma 7.1.

Theorem 6.3 will now follow from Lemma 7.1 if we prove that the four conditions in the Lemma 7.1 hold in the case of generalized Wigner matrices (2.6). The last condition (7.7) follows from the local semicircle law (Theorem 2.1) and from the fact that ϱsc(x)≥cκ\varrho_{sc}(x)\geq c\sqrt{\kappa} for x∈(−2+κ,2−κ)x\in(-2+\kappa,2-\kappa). Here we list the first three conditions as three separate lemmas that will be proven in the next three subsections. This will complete the proof of Theorem 6.3.

(1) Let HH be a generalized Wigner matrix with subexponential decay, in fact it is sufficient to assume that (2.14) and the upper bound Csup<∞C_{sup}<\infty in (2.6) hold. Define nλ(E)n^{\lambda}(E) as in (7.2). Then

for any small ε>0\varepsilon>0 with an ε′>0\varepsilon^{\prime}>0 depending on ε\varepsilon. Furthermore, for K≥3K\geq 3,

(2) In fact, the last tightness bound holds in a more general situation, namely, let the universal Wigner matrix HH satisfy (2.1), (2.14) and M≥(log⁡N)9M\geq(\log N)^{9} where MM is defined in (2.3). Then we have

Let HH satisfy the conditions of Theorem 6.3. Then for any ε>0\varepsilon>0 we have

with CC depending on CsupC_{sup} in (2.6) and CSC_{S} in (6.14).

We start with the proof of (7.9) and (7.10) in the case of generalized Wigner matrices (see (2.6)). First we truncate the random variables. With the assumption of subexponential decay of hijh_{ij}, for any small δ>0\delta>0, one can find a h^ij\widehat{h}_{ij} such that

for some small number ε′\varepsilon^{\prime}, depending on δ\delta. Then we only need to bound the spectral norm of the new matrix H^=(h^ij)\widehat{H}=(\widehat{h}_{ij}). To prove (7.9), it only remains to prove that, for some small ε′>0\varepsilon^{\prime}>0,

with the choice of k0=N1/6−δ/3k_{0}=N^{1/6-\delta/3} and δ=3ε/2\delta=3\varepsilon/2, since ∥H^∥k≤\mboxTr H^k\|\widehat{H}\|^{k}\leq\mbox{Tr\,}\widehat{H}^{k} for even powers. The proof of (7.10) is analogous.

Let pp and kk be given integers. We define the concept of ordered closed walk of kk edges on an abstract ordered set Ap:={a1,a2,…,ap}A_{p}:=\{a_{1},a_{2},\ldots,a_{p}\} of pp elements with the natural ordering a1<a2<…<apa_{1}<a_{2}<\ldots<a_{p}. An ordered closed walk on pp vertices with kk edge is determined by a sequence w‾=(w1,w2,…,wk)\underline{w}=(w_{1},w_{2},\ldots,w_{k}) of the elements of ApA_{p} with the following properties:

Along the walk, the fresh vertices from ApA_{p} are adjoined in increasing order, i.e., max⁡j≤mwj≤max⁡j≤m−1wj+1\max_{j\leq m}w_{j}\leq\max_{j\leq m-1}w_{j}+1.

{w1,w2,…wk}=Ap\{w_{1},w_{2},\ldots w_{k}\}=A_{p}, i.e., all points of ApA_{p} are visited.

Let Γ(w‾)\Gamma(\underline{w}) denote the undirected graph associated with w‾\underline{w}, i.e., the vertex set of Γ(w‾)\Gamma(\underline{w}) is ApA_{p}, the edges are given by (w1,w2),(w2,w3),…(wk,w1)(w_{1},w_{2}),(w_{2},w_{3}),\ldots(w_{k},w_{1}); with multiple edges as well as self-loops (wi=wi+1w_{i}=w_{i+1} for some ii) allowed. Then every edge of Γ\Gamma appears at least twice.

Let W(k,p){\cal W}(k,p) denote the set of ordered closed walks on pp vertices with kk edges. Their number was estimated in Lemma 2.1 of

This bound will be sufficient for the proof of (7.9) with exponent 1/6+ε1/6+\varepsilon. We remark that Lemma 4.1 of gives a different bound on (7.18) that is better by essentially a factor [(k−2p)/p]k−2p[(k-2p)/p]^{k-2p}. Applying this bound, one could improve the exponent in (7.9) to 1/4+ε1/4+\varepsilon but we will not pursue this improvement here.

With these notations, we have the formula

To verify this formula, for any given sequence i1,i2,…,iki_{1},i_{2},\ldots,i_{k} on the l.h.s., let pp denote the number of different elements in this sequence and let the set ApA_{p} be identified with these different elements in the order of their appearance (i.e. for any mm we let am:=isa_{m}:=i_{s} for some ss if is≠iti_{s}\neq i_{t}, t<st<s, and isi_{s} is the mm-th freshest element among i1,i2,…,isi_{1},i_{2},\ldots,i_{s}, i.e., ∣{i1,i2,…,is−1}∣=m−1|\{i_{1},i_{2},\ldots,i_{s-1}\}|=m-1). Let w1,w2,…,wkw_{1},w_{2},\ldots,w_{k} encode the sequence i1,i2,…,iki_{1},i_{2},\ldots,i_{k} with the new labels a1,a2,…apa_{1},a_{2},\ldots a_{p}. One may think of the walk, w1,w2,…,wkw_{1},w_{2},\ldots,w_{k}, as the topological structure of the sequence (i1,i2,…,ik)(i_{1},i_{2},\ldots,i_{k}) where the original labels from the set {1,2,…,N}\{1,2,\ldots,N\} have been replaced by abstract labels, defined intrinsically from the repetition structure of (i1,i2,…,ik)(i_{1},i_{2},\ldots,i_{k}). Formula (7.1) is a resummation of all sequences (i1,i2,…,ik)(i_{1},i_{2},\ldots,i_{k}) in terms of topological walks (first and second sum) and then reintroducing the original labelling with {1,2,…,N}\{1,2,\ldots,N\} (third sum). Since the first moment of h^ij\widehat{h}_{ij} vanishes and different matrix elements are independent, all terms on the right hand side have zero expectation in which at least one factor h^ij\widehat{h}_{ij} appears only once. This justifies the requirement iii) in the definition of the ordered closed walks. The restriction p≤k/2+1p\leq k/2+1 in the summation then comes from iii). This proves (7.1).

To compute the expectation on the r.h.s. of the (7.1), we need to introduce the concept of the skeleton of the walk. Given w‾∈W(k,p)\underline{w}\in{\cal W}(k,p), its skeleton S(w‾)S(\underline{w}) is the undirected graph on ApA_{p} that is obtained from Γ(w‾)\Gamma(\underline{w}) after replacing each multiple (parallel) edge by a single undirected edge. Here S(w‾)S(\underline{w}) allows self-loops (as long as every edge has multiplicity 1). Thus the edge set E(S(w‾))E(S(\underline{w})) of the skeleton coincides with the edge set E(Γ(w‾))E(\Gamma(\underline{w})) after neglecting multiplicity and direction. The skeleton is a subgraph of the complete graph on ApA_{p}. We will also define the tree of the walk, T(w‾)T(\underline{w}), which is just a spanning tree of the skeleton S(w‾)S(\underline{w}) built up successively along the walk by a greedy algorithm: include an edge to the T(w‾)T(\underline{w}) if it does not create a loop together with the previously adjoined edges. Since Γ(w‾)\Gamma(\underline{w}) is connected, and then so is S(w‾)S(\underline{w}), thus T(w‾)T(\underline{w}) is indeed a tree on pp vertices, in particular the number of its edges is

and S(w‾)∖T(w‾)S(\underline{w})\setminus T(\underline{w}) has total edge multiplicity less than k−2(p−1)k-2(p-1).

For any edge e∈E(S(w‾))e\in E(S(\underline{w})) of the skeleton, let ν(e)\nu(e) denote the multiplicity of ee in Γ(w‾)\Gamma(\underline{w}) (edges with both orientations are taken into account). Clearly

We will use (7.22) for the edges of the tree, e∈E(T(w‾))e\in E(T(\underline{w})), and we use (7.23) for the remaining edges e∈E(S(w‾))∖E(T(w‾))e\in E(S(\underline{w}))\setminus E(T(\underline{w})). We can now estimate (7.1) using (7.21) and (7.20):

holds for any tree TT. This identity follows from successively summing up the labels for vertices with degree one in TT by using the identity ∑iσij2=1\sum_{i}\sigma_{ij}^{2}=1.

Choosing k=N1/6−δ/3k=N^{1/6-\delta/3}, we have S(k,p−1)≤S(k,p)S(k,p-1)\leq S(k,p). Inserting this into (7.25), we obtain (7.17) and complete the proof.

Now we prove (7.11) with the same method. Similarly, with the assumption on the distribution of hijh_{ij}, one can find a h^ij\widehat{h}_{ij} such that

for n=(log⁡N)(log⁡log⁡N)n=(\log N)(\log\log N). Here h^ij\widehat{h}_{ij} can be obtained by considering the cutoff random variables h_{ij}{\bf 1}\big{(}|h_{ij}|\leq M^{-1/2}(\log N)(\log\log N)\big{)} and then slightly modifying them to recover their zero expectation value.

Choosing k=nk=n, we have n2k64M<1\frac{n^{2}k^{6}}{4M}<1. Thus we obtain

2 Proof of Lemma 7.3.

First we show that the estimate on the expectation of m−mscm-m_{sc} is better than the estimate (2.16) on m−mscm-m_{sc} itself.

As a preparation to the proof, we need the following technical lemma that we state under more general conditions so that it is applicable for universal Wigner matrices.

With the assumption of Theorem 3.1, suppose (3.3) holds, we have the estimate

for some sufficiently large positive constants C0C_{0} (depending on α,β\alpha,\beta in (2.14)).

Proof of Lemma 7.6. Recall the definitions of Ωzo\Omega^{o}_{z}, Ωzd\Omega^{d}_{z} and Ω^zΥ\widehat{\Omega}^{\Upsilon}_{z} in (3.17), (3.12), (3.13) and (3.14) and we define

The r.h.s. of (7.34) is larger than N−2N^{-2}. Then with (7.36) and ∣m(z)∣≤η−1≤M|m(z)|\leq\eta^{-1}\leq M (see (3.31)), we only need to prove

Taking the expectation of the self consistent equation (4.11) with (4.12), we obtain that

Then, similarly to (5.12), on the event Ωz\Omega_{z} we have

by using ∣z+msc∣≥1|z+m_{sc}|\geq 1 and that on the set Ωz\Omega_{z}, Υ\Upsilon is small. Therefore, we can expand (7.38) as

Then summing up 1≤i≤N1\leq i\leq N, we obtain that

Applying (3.12) and the definition of Ωz\Omega_{z}, we can bound the second and third terms in the r.h.s. of (7.40) with some constant CC as follows,

Then, with the definition of Υi\Upsilon_{i} (4.12) and (4.39), we have

for some positive constants cc and CC. Inserting this and (3.20) into (7.42), we have

in the case of η>3\eta>3. If η<3\eta<3, similarly, with (3.23) we have the same result. This proves (7.37) and thus completes the proof of Lemma 7.6.

Proof of Lemma 7.5. First we will prove the result for large η\eta, more precisely we show (7.33) under the additional assumption that

with a sufficiently large constant C1C_{1}.

In the case of the generalized Wigner matrix, (2.6), we have M≥(Csup)−1NM\geq({C_{sup}})^{-1}N and δ+≥Cinf\delta_{+}\geq{C_{inf}} (2.7), then

up to an O(1)O(1) factor. Note that with a sufficiently large C1C_{1}, (7.46) implies (3.3) and thus combining Lemma 7.6 with Lemma 5.2 we obtain (7.33) under the condition that η\eta satisfies (7.46).

To prove (7.33) for any η>0\eta>0, it remains to consider the case when (7.46) does not hold. For a fixed EE, let η∗=η∗(E)>0\eta^{*}=\eta^{*}(E)>0 be the (unique) solution of Nη(κ+η)3/2=(log⁡N)C1N\eta(\kappa+\eta)^{3/2}=(\log N)^{C_{1}}, i.e. when (7.46) becomes an equality. In particular, we know that

Consider η<η∗\eta<\eta^{*}, set z=E+iηz=E+i\eta, z∗=E+iη∗z^{*}=E+i\eta^{*} and estimate

Now we use the fact that the functions y→yImm(E+iy)y\to y{\text{Im}}m(E+iy) and y→yImmsc(E+iy)y\to y{\text{Im}}m_{sc}(E+iy) are monotone increasing for any y>0y>0 since both are Stieltjes transforms of a positive measure. Therefore the integral in (7.48) can be bounded by

By the choice of η∗\eta^{*} and using that Im msc(z∗)≤Cκ+η∗{\text{Im}}\,m_{sc}(z^{*})\leq C\sqrt{\kappa+\eta^{*}}, we have

with a possible larger CC in the r.h.s. This completes the proof of Lemma 7.5.

With Lemma 7.5, it follows that for any EE and η>0\eta>0,

Now we return to the main argument to prove (7.12) in Lemma 7.3. Given (7.10), we only need to prove

This inequality follows from the next lemma by choosing the signed measure

and the conditions (7.58) and (7.59) are provided by (7.33) and (7.53). This will complete the proof of Lemma 7.3.

Let ϱΔ(dx)\varrho^{\Delta}({\rm d}x) be a finite signed measure with support in [−K,K][-K,K] for some K>0K>0. Let

be the Stieltjes transform and the distribution function of ϱΔ(dx)\varrho^{\Delta}({\rm d}x), respectively. Let κx\kappa_{x}, κE\kappa_{E} denote ∣∣x∣−2∣||x|-2| and ∣∣E∣−2∣||E|-2|. We assume that mΔm^{\Delta} satisfies the following bound with some constant CC:

for some constant C′>0C^{\prime}>0 when NN is sufficiently large.

This lemma is similar to Lemma B.1 in , but with different assumptions. Since the assumptions here are stronger than (B.3) and (B.4) in , we actually obtain a better bound (7.60) than in , where the l.h.s. of (7.60) was bounded by N−6/7N^{-6/7}.

We will choose η=N−1\eta=N^{-1} and set fE:=fE,ηf_{E}:=f_{E,\eta} with η=1/N\eta=1/N. Then to prove (7.60), we only need to prove that

To express fE(λ)f_{E}(\lambda) in terms of the Stieltjes transform, we use the Helffer-Sjöstrand functional calculus, as (B.12) in . We formulate this result in a more general form.

Let fE,ηf_{E,\eta} be given as above with some E∈[−K,K]E\in[-K,K], K≥3K\geq 3, and 0<η≤1/20<\eta\leq 1/2. Suppose that the Stieltjes transform mm of the signed measure ϱ\varrho satisfies

with some exponents 0≤τ,σ≤10\leq\tau,\sigma\leq 1 and some constant LL. Then

The condition of this lemma with τ=σ=1\tau=\sigma=1 and L=(log⁡N)CL=(\log N)^{C} coincides with (7.58), therefore, after integrating in EE and using η=1/N\eta=1/N, we obtain (7.62) which completes the proof of Lemma 7.7.

Proof of Lemma 7.8. Analogously to (B.13), (B.14) and (B.15) in we obtain that

where χ(y)\chi(y) is a smooth cutoff function with support in $,with, with\chi(y)=1forfor|y|\leq 1/2$ and with bounded derivatives. The first term is estimated by

using (7.63) and the support of χ′\chi^{\prime}.

With (7.63) and ∣fE′′∣≤Cη−2|f^{\prime\prime}_{E}|\leq C\eta^{-2} and

the second term in r.h.s. of (7.2) is bounded by

Here we used that for y≤1/2y\leq 1/2 we have

As the (B.17) and (B.19) in , we integrate the third term in (7.2) by parts first in xx, then in yy. Then bound it with absolute value by

The middle term is bounded as (7.66). With (7.63) again, we have

Then combining (7.2), (7.66), (7.67), (7.68) and (7.69) we obtain (7.64) and complete the proof of Lemma 7.8.

3 Proof of Lemma 7.4

With the choice Cα=K−1C_{\alpha}=K^{-1}, α=j,j+1,…,j+K−1\alpha=j,j+1,\ldots,j+K-1, and Cα=0C_{\alpha}=0 otherwise, we get ∣∇λj,K∣2≤Csup(NK)−1|\nabla\lambda_{j,K}|^{2}\leq C_{sup}(NK)^{-1}. Using the Bobkov-Götze concentration inequality and the uniform bound on the LSI constant (6.14), we get

for any TT and γ\gamma. Choosing γ=N−1/2+δK−1/2\gamma=N^{-1/2+\delta}K^{-1/2} and T=(NK)1/2T=(NK)^{1/2}, we obtain (7.13).

Proof of the Green’s function comparison theorem

Proof of Theorem 2.3. From the trivial bound

and from (2.21) we have the following a priori bound

Note that the supremum over η\eta can be included by establishing the estimate first for a fine grid of η\eta’s with spacing N−10N^{-10} and then extend the bound for all η\eta by using that the Green’s functions are Lipschitz continuous in η\eta with a Lipschitz constant η−2\eta^{-2}.

Let λm\lambda_{m} and umu_{m} denote the eigenvalues and eigenvectors of HγH_{\gamma}, then by the definition of the Green’s function, we have

and divide the summation over mm into ∪nUn\cup_{n}U_{n}

Using the estimate (2.21) for n=0,1,…,n0n=0,1,\ldots,n_{0} and a trivial bound of O(1)O(1) for n=∞n=\infty, we have proved that

For simplicity, we will consider the case when the test function FF has only n=1n=1 variable and k1=1k_{1}=1, i.e., we consider the trace of a first order monomial; the general case follows analogously. Consider the telescoping sum of differences of expectations

with a matrix QQ that has zero matrix element at the (i,j)(i,j) and (j,i)(j,i) positions and where we set vji:=v‾ijv_{ji}:=\overline{v}_{ij} for i<ji<j and similarly for ww. Define the Green’s functions

We first claim that the estimate (8.3) holds for the Green’s function RR as well. To see this, we have, from the resolvent expansion,

We can now start proving the main result. By the resolvent expansion,

For each diagonal element in the computation of these traces, the contribution to R^\widehat{R}, R^(m)\widehat{R}^{(m)} and Ω\Omega is a sum of a few terms. E.g.

and similar formulas hold for the other terms.

where ξ′\xi^{\prime} is a number between and ξ\xi and it depends on R^\widehat{R} and ξ\xi; the A(m)A^{(m)}’s are defined as

and similarly for A(3)A^{(3)} and A(4)A^{(4)}. Finally,

The expectation values of the terms A(m)A^{(m)}, m≤4m\leq 4, with respect to vijv_{ij} are determined by the first four moments of vijv_{ij}, for example

Finally, we have to estimate the error term A(5)A^{(5)}. All terms without Ω\Omega can be dealt with as before; after estimating the derivatives of FF by NC(τ+ε)N^{C(\tau+\varepsilon)}, one can perform the expectation with respect to vijv_{ij} that is independent of R^(m)\widehat{R}^{(m)}. For the terms involving Ω\Omega one can argue similarly, by appealing to the fact that the matrix elements of SS are also essentially bounded by NC(τ+ε)N^{C(\tau+\varepsilon)}, see (8.3), and that vijv_{ij} has subexponential decay. Alternatively, one can use Hölder inequality to decouple SS from the rest and use (8.3) directly, for example:

After summing up in (8.4) we have thus proved that

The proof can be easily generalized to functions of several variables. This concludes the proof of Theorem 2.3.

Proof of Theorem 6.4. Define an approximate delta function (times π\pi) at the scale η\eta by

For notational simplicity, we will prove only the case of three point correlation functions; the proof is analogous for the general case. By definition of the correlation function, for any fixed EE, α1,α2,α3\alpha_{1},\alpha_{2},\alpha_{3},

and similarly, B1B_{1} consists of terms with j=kj=k, while B2B_{2} consists of terms with i=ki=k.

where the function FF is chosen to be F(x1,x2,x3):=x1x2x3F(x_{1},x_{2},x_{3}):=x_{1}x_{2}x_{3} if max⁡j∣xj∣≤Nε\max_{j}|x_{j}|\leq N^{\varepsilon} and it is smoothly cutoff to go to zero in the regime max⁡j∣xj∣≥N2ε\max_{j}|x_{j}|\geq N^{2\varepsilon}. The difference between the expectation of FF and A1A_{1} is negligible, since it comes from the regime where Nε≤max⁡j1N∣Im \mboxTr (H(v)−zj)−1∣≤N2N^{\varepsilon}\leq\max_{j}\frac{1}{N}|{\text{Im}}\,\mbox{Tr\,}(H^{(v)}-z_{j})^{-1}|\leq N^{2}, which has an exponentially small probability by (8.3) (the upper bound on the Green’s function always holds since η≥N−2\eta\geq N^{-2}). Here the arguments of FF are imaginary parts of the trace of the Green’s function, but this type of function is allowed when applying Theorem 2.3, since

We remark that the main assumption (2.21) for Theorem 2.3 is satisfied by using (2.17) of Theorem 2.1 with the choice of M≍NM\asymp N.

Set η=N−1−ε\eta=N^{-1-\varepsilon} for the rest of the proof. We now show that the validity of (8.8) for any choice of EE, α1,α2,α3\alpha_{1},\alpha_{2},\alpha_{3} (recall Ej=E+αj/NE_{j}=E+\alpha_{j}/N) implies that the rescaled correlation functions, pw,N(3)(E+β1/N,…,E+β3/N)p_{w,N}^{(3)}(E+\beta_{1}/N,\ldots,E+\beta_{3}/N) and pv,N(3)(E+β1/N,…,E+β3/N)p_{v,N}^{(3)}(E+\beta_{1}/N,\ldots,E+\beta_{3}/N), as functions of the variables β1,β2,β3\beta_{1},\beta_{2},\beta_{3}, have the same weak limit.

Let OO be a smooth, compactly supported test function and let

be its smoothing on scale NηN\eta. Then we can write

The first term on the right side, after the change of variables xj=E+βj/Nx_{j}=E+\beta_{j}/N, is equal to

i.e., it can be written as an integral of expressions of the form (8.8) for which limits with pw,Np_{w,N} and pv,Np_{v,N} coincide.

Finally, the second term on the right hand side of (8) is negligible. To see this, notice that for any test function QQ, we have

If the test function QQ were supported on a ball of size Nε′N^{\varepsilon^{\prime}}, ε′>0\varepsilon^{\prime}>0, then this last term were bounded by

Here Nτ(E){\mathcal{N}}_{\tau}(E) denotes the number of eigenvalues in the interval [E−τ,E+τ][E-\tau,E+\tau] and in the estimate we used the local semicircle law on intervals of size τ≥N−1+ε′\tau\geq N^{-1+\varepsilon^{\prime}}.

Set now Q:=O−OηQ:=O-O_{\eta}. From the definition of OηO_{\eta}, it is easy to see that the function

satisfies the bound ∥Q1∥∞≤∥Q∥∞=∥O−Oη∥∞≤CNη=CN−ε\|Q_{1}\|_{\infty}\leq\|Q\|_{\infty}=\|O-O_{\eta}\|_{\infty}\leq C{N\eta}=CN^{-\varepsilon}. So choosing ε′<ε/4\varepsilon^{\prime}<\varepsilon/4, the contribution of Q1Q_{1} is negligible. Finally, Q2=Q−Q1Q_{2}=Q-Q_{1} is given by

Hence the contribution of Q2Q_{2} in the last term of (8.11) is bounded by

From Theorem 2.1, the last term is bounded by N−ε′N^{-\varepsilon^{\prime}} up to some logarithmic factor. This completes the proof of Theorem 6.4.

Appendix A Spectral condition for band matrices

for some δ>0\delta>0 and WW large enough, depending on ff.

Proof. Recall that the discrete Fourier transform in d=1d=1 dimensions is defined as follows. Let ε:=1/N\varepsilon:=1/N and

be the periodic one dimensional lattice (torus) of size 11 and spacing ε\varepsilon with its dual lattice being

Let ψ\psi be a function on Λ\Lambda. Then its Fourier transform FNψ{\cal F}_{N}\psi is a function on Λ∗\Lambda^{*} defined as

With this formula, and with the notation ψN(j):=ψ(j/N)\psi_{N}(j):=\psi(j/N) for any ψ\psi defined on Λ\Lambda, we have

which is normalized to be 11. Hence BB on the Fourier side acts as a multiplication by the function FNFW{\cal F}_{N}F_{W}, so

Since ff is nonnegative, symmetric function and ∫f=1\int f=1, we have f^\widehat{f} is real and

for some δ>0\delta>0, which completes the proof.

Appendix B Large deviation estimates

In this Appendix we prove two large deviations results. They are weaker than the corresponding results of Hanson and Wright , used in , but they require only independent, not necessarily identically distributed random variables, moreover the proofs are much simpler.

Let aia_{i} (1≤i≤N1\leq i\leq N) be NN independent complex random variables with mean zero, variance σ2\sigma^{2} and uniform subexponential decay, i.e., there exist α\alpha, β>0\beta>0 that for any x>0x>0

for some positive constants CC and cc depending on α\alpha and β\beta in (B.1).

Proof of Lemma B.1. Without loss of generality, we may assume that σ=1\sigma=1. The assumption (B.1) implies that the k−k-th moment of aia_{i} is bounded by:

for some C>0C>0 depending on α\alpha and β\beta.

With the Marcinkiewicz–Zygmund inequality, for an integer p≥2p\geq 2, we have

which implies (B.2) by choosing an even integer pp of the order (D/Ce)22+α(D/Ce)^{\frac{2}{2+\alpha}} and applying a high moment Markov inequality.

for some positive constants CC and cc depending on α\alpha and β\beta in (B.1).

Proof of Lemma B.2. Without loss of generality, we may again assume that σ=1\sigma=1. First, we prove (B.7). Notice that ∣ai∣2−1|a_{i}|^{2}-1 (1≤i≤N1\leq i\leq N) are independent random variables with mean and variance less than some constants CC. Furthermore, the kk-th moment of ∣ai∣2−1|a_{i}|^{2}-1 is bounded as

Then following the proof of the Lemma B.1 with ∣ai∣2−1|a_{i}|^{2}-1 replacing aia_{i}, we obtain (B.7).

where ξi:=∑j<iBijaj\xi_{i}:=\sum_{j<i}B_{ij}a_{j}. Note that aia_{i} and ξi\xi_{i} are independent for any fixed ii. By the definition,

is martingale. Using the Burkholder inequality, we have that

(for the constant, see Section VII.3 of ). By the generalized Minkowski inequality, by the independence of aia_{i} and ξi\xi_{i} and using (B.3), we have

Then choosing (D/Ce)12(1+α)(D/Ce)^{\frac{1}{2(1+\alpha)}} and applying Markov inequality, we obtain (B.8) .

In our applications we will need these two lemmas when DD is a power of log⁡N\log N. For simplicity, we do not want to keep track of the precise powers in the estimate and we are interested only in error bounds that decay faster than any fixed power of NN, say CN−log⁡log⁡NCN^{-\log\log N}. Therefore, in this paper we will use the following weaker form of these two lemmas, the stronger form will be useful in future applications.

for some constants CC depending on α\alpha and β\beta in (B.1).

Appendix C Proof of Lemma 6.5

We first prove a version of this lemma when the fourth moment exactly matches, i.e., γ=0\gamma=0, then we explain how to deal with the approximation. More precisely, we first show the following:

for some positive constants C1C_{1} and C2C_{2}, there exists a real random variable ξ\xi such that the first four moments of ξ\xi are , 11, m3m_{3} and m4m_{4} and the distribution ν\nu of ξ\xi satisfies logarithmic Sobolev inequality and the LSI constant is bounded from above by a function of C1C_{1} and C2C_{2}. Moreover, ν\nu can be chosen to be absolutely continuous with a smooth positive density, ν(dx)=e−U(x)dx\nu({\rm d}x)=e^{-U(x)}{\rm d}x, such that the derivatives of UU satisfy

with some fixed constant CC and kk-dependent constants CkC_{k}.

Remark. The last statement about the smoothness of UU will not be needed in this paper, but we state it for further reference.

Proof. We start with the case ∣m3∣>δ|m_{3}|>\delta, where δ\delta is small enough number to depend only on C1C_{1}, see below. Let ξ\xi be the sum of two Gaussians, with density function of the form

with some parameters a>0a>0, b>0b>0, σ>0\sigma>0. If the first 4 moments of fξ(x)f_{\xi}(x) are , 11, m3m_{3} and m4m_{4}, then we have the relations

With m3m_{3}, m4m_{4} in (C.1) and ∣m3∣≥δ|m_{3}|\geq\delta, one can always find a solution of (C.4) such that 0<σ<10<\sigma<1. Actually, one can see that c<σ<Cc<\sigma<C, where cc and CC only depend on C1C_{1}, C2C_{2} in (6.19) and δ\delta.

Once σ\sigma is found, it is easy to check that one can always find real solutions a,ba,b for (C.5) as long as m3m_{3}, m4m_{4} satisfy (C.1) and ∣m3∣≥δ|m_{3}|\geq\delta. Since the solutions a,b,σa,b,\sigma are continuous with respect to m3m_{3} and m4m_{4}, then they are uniformly bounded. Distributions of the form (C.3) satisfy the LSI, since the are log concave away from a compact set. Since the parameters a,b,σa,b,\sigma are in a compact set, the LSI constant will remain uniformly bounded with a bound depending on C1C_{1}, C2C_{2} and δ\delta. It is clear that the density function (C.3) is positive and its logarithm satisfies (C.2).

Now we consider the case that ∣m3∣<δ|m_{3}|<\delta with a small δ=1100min⁡{1,C1}\delta=\frac{1}{100}\min\{1,C_{1}\}, where C1C_{1} is the constant in (C.1). Without loss of generality, we may assume m3>0m_{3}>0. We consider the following three parameter family of probability densities

where the parameters are in the range −1<β<∞-1<\beta<\infty, 0<d<∞0<d<\infty, 0≤ε≪10\leq\varepsilon\ll 1 and a,ba,b will be chosen explicitly. Simple calculation shows that the moments of fd,β,εf_{d,\beta,\varepsilon} are m1=0m_{1}=0,

Choosing, say, a=2a=2, b=1b=1, and setting m2=1m_{2}=1, we obtain d2=1−3ε1−εβ+3β+1d^{2}=\frac{1-3\varepsilon}{1-\varepsilon}\frac{\beta+3}{\beta+1} from the first equation, ε=m3/2\varepsilon=m_{3}/2 from the second equation and finally the last equation becomes

Recall that we are in the regime where ∣m3∣≤δ≤C1/100|m_{3}|\leq\delta\leq C_{1}/100. For any fixed 0≤m3≤δ0\leq m_{3}\leq\delta, the right hand side of (C.9) is a monotonically decreasing function in β∈(−1,∞)\beta\in(-1,\infty) whose value goes down from ∞\infty to (1−3m3/2)21−m3/2+232m3≤1+20δ\frac{(1-3m_{3}/2)^{2}}{1-m_{3}/2}+\frac{23}{2}m_{3}\leq 1+20\delta. But we know from (C.1) that C2≥m4≥1+100δC_{2}\geq m_{4}\geq 1+100\delta, thus there is a value β\beta such that (C.9) holds, moreover, β\beta is in a compact subinterval of (−1,∞)(-1,\infty) that depends only on δ\delta and C2C_{2}. It is then easy to check that the support and the supremum norm of the density gd,βg_{d,\beta} also remains in a compact set, depending only on δ\delta. Therefore we constructed a probability measure with the given moments, that is a linear combination of two Gaussians plus a compactly supported piece with a nonnegative bounded density. To ensure smoothness, we replace gd,βg_{d,\beta} with g~d,β,τ:=ϑτ∗gd,β\widetilde{g}_{d,\beta,\tau}:=\vartheta_{\tau}\ast g_{d,\beta}, where ϑτ(x)=τ−1ϑ(x/τ)\vartheta_{\tau}(x)=\tau^{-1}\vartheta(x/\tau) and ϑ\vartheta is a compactly supported nonnegative smooth symmetric function with ∫ϑ=1\int\vartheta=1. The first moment m1m_{1} is unchanged and the formulas (C.6) for the higher moments will get modified by an error term of order τ\tau. Let τ\tau be much smaller than all other parameters in this proof. It is easy to see that, by a simple calculation treating τ\tau as a small perturbation, one can still choose a,b,εa,b,\varepsilon and β\beta in the previous argument to match m2=1,m3m_{2}=1,m_{3} and m4m_{4}.

Finally, note that the sum of two Gaussians satisfy the LSI, as well as its compact perturbation and the new LSI constant depends only on the supremum norm of the density of the perturbation. Since all these parameters remain uniformly controlled by C1C_{1} and C2C_{2}, we proved Lemma C.1, i.e., Lemma 6.5 for γ=0\gamma=0.

Now consider the case γ>0\gamma>0. For any real random variable ζ\zeta, independent of ξG\xi^{G}, and with the first 4 moments being , 11, m3(ζ)m_{3}(\zeta) and m4(ζ)<∞m_{4}(\zeta)<\infty, the first 4 moments of

Given m3m_{3} and m4m_{4}, satisfying (C.1) and using Lemma C.1, we obtain that for any γ\gamma small enough, there exists a real random variable ξγ\xi_{\gamma} such that the first four moments are , 11,

With m4≤C2m_{4}\leq C_{2}, we have m32≤C2m_{3}^{2}\leq C_{2}, thus

Hence with (C.11) and (C.12), we obtain that ξ′=(1−γ)1/2ξγ+γ1/2ξG\xi^{\prime}=(1-\gamma)^{1/2}\xi_{\gamma}+\gamma^{1/2}\xi^{G} satisfies m3(ξ′)=m3m_{3}(\xi^{\prime})=m_{3} and (6.21). With Lemma C.1, we obtain that the LSI constant of ξγ\xi_{\gamma} is bounded by a constant only depends on C1C_{1} and C2C_{2}, which completes the proof of Lemma 6.5.

References