Universality for general Wigner-type matrices
Oskari Ajanki, Laszlo Erdos, Torben Krüger
Introduction
In the seminal paper Wigner introduced random self-adjoint matrices, , with centered, identically distributed and independent entries (subject to the symmetry constraint). He proved that the empirical density of the eigenvalues converges to the semicircle distribution. Wigner also conjectured that the distribution of the distance between consecutive eigenvalues (gap statistics) is universal, hence it is the same as in the Gaussian model. His revolutionary observation was that these universality phenomena hold for much larger classes of physical systems and only the basic symmetry type determines local spectral statistics. It is generally believed, but mathematically unproven, that random matrix theory (RMT), among many other examples, also describes the local statistics of random Schrödinger operators in the delocalized regime and quantization of chaotic classical Hamiltonians.
become not only deterministic but also independent of as the the matrix size goes to infinity. They asymptotically satisfy a system of self-consistent equations
that reduces to a particularly simple scalar equation
for the common value for all as . The solution of (1.3) is the Stieltjes transform of the Wigner semicircle law.
In the context of random matrices importance of this equation has been realized by Girko , Shlyakhtenko , Khorunzhy and Pastur , see also Guionnet , as well as Anderson and Zeitouni , but no detailed study has been initiated. In the companion paper we analyzed (1.4) in full detail. See also Section 3 of for how the QVE is related to other random matrix models. We showed that is the Stieltjes transform of a probability density that is supported on a finite number of intervals, inside of which it is a real analytic function. We also described the behavior of near the edges of its support; it features only square root or cubic root (cusp) singularities and an explicit one parameter family of profiles interpolating between them as a gap in the support closes.
The main result of the current paper is the universality of the local eigenvalue statistics in the bulk for Wigner-type matrices with a general variance matrix (cf. Theorem 1.16). This extends Wigner’s vision towards full universality by considering a much larger class of matrix ensembles than previously studied. In particular, we demonstrate that local statistics, as expected, are fully independent of the global density. This fact has already been established for very general -ensembles in (see also and ) and for additively deformed Wigner ensembles having a density with a single interval support . Our class admits a general variance matrix and allows for densities with several intervals (we do not, however, consider non-centered distributions here; an extension to matrices with non-centered entries on the diagonal may be incorporated in our analysis with additional technical effort).
In a separate paper we apply the results of this work and to treat Gaussian random matrices with correlated entries. Assuming translation invariance of the correlation structure in these Gaussian matrix ensembles we prove an optimal local law, bulk universality and non-trivial decay of off-diagonal resolvent entries.
Acknowledgement. We thank the anonymous referee for several useful comments and suggestions. We are grateful to Johannes Alt for pointing out several typos.
The dependence of and other quantities on the dimension will be suppressed in our notation. The matrix of variances, , is defined through
It is symmetric with non-negative entries. In it was shown that for every such matrix the quadratic vector equation (QVE),
For all the matrix is flat, i.e.,
For all the matrix is uniformly primitive, i.e.,
For all the matrix induces a bounded solution of the QVE, i.e., the unique solution of (1.7) corresponding to is bounded,
The assumption on the boundedness of is an implicit condition in the sense that it can be checked only after solving (1.7). In Theorem 6.1 of we list sufficient, explicitly checkable conditions on , which ensure (1.10). We also remark that the assumption (1.8) can be replaced by for some positive constant . This will lead to a rescaling (cf. Remark 2.2 of ) of . We pick the normalization just for convenience.
The primitivity condition (1.9) excludes some important models, e.g. matrices of the form
In addition to the assumptions on the variances of , we also require uniform boundedness of higher moments. This leads to another basic model parameter, , which is a sequence of non-negative real numbers.
For all the entries of the random matrix have bounded moments,
In order to state our main result, in the next corollary we collect a few facts about the solution of the QVE that are proven in . Although these properties are sufficient for the formulation of our results, for their proofs we will need much more precise information about the solution of the QVE. Theorems 4.1 and 4.2 summarize everything that is needed from besides the existence and uniqueness of the solution of the QVE. In particular, the statement of Corollary 1.3 follows easily from Theorem 4.1 below.
is a probability density. Its support is contained in $$ and is a union of closed disjoint intervals
There exists a positive constant , depending only on the model parameters , and , such that the sizes of these intervals are bounded from below by
Note that (1.14) provides a lower bound on the length of the intervals that constitute , while the length of the gaps, , between neighboring intervals can be arbitrarily small. Figure 1.1 shows a shape that the density of states typically might have. In particular, may have gaps in its support and may have additional zeros (cusps) in the interior of . However, the behavior of on the domain , for some sufficiently small , can be completely characterized by universal shape functions. For more details see Theorem 2.6 of .
The function defined in (1.12) is called the density of states. Its harmonic extension to the upper half plane
is again denoted by . With a slight abuse of notation we still write , as in (1.13), for the support of the density of states as a function on the real line.
Let and be the edges of the support of the density of states (cf. (1.13)) and the constant introduced in Corollary 1.3. Then for any we set
For a compact statement of the main theorem we define the notion of stochastic domination, introduced in and . This notion is designed to compare sequences of random variables in the large limit up to small powers of on high probability sets.
In this case we write .
Basic properties of the stochastic domination that are used extensively in this paper are listed in Lemma A.1. The threshold will always be an explicit function whose value will be increased throughout the paper, though we will not follow its form. This will happen only finitely many times, ensuring that stays finite. The threshold is uniform in all other parameters, e.g. in the spectral parameter , as well as in the indices of the matrix entries, that the sequences and may depend on. Typically, we will not mention the existence of - it is implicit in the notation . As an example, we see that the bounded moment condition, (D), implies
Actually, the function depends only on finitely many moment parameters instead of the entire sequence , where now the number of required moments , is an explicit function.
Now we are ready to state our main result on the local law. Suppose is a sequence of self-adjoint random matrices with the corresponding sequence of variance matrices and the induced sequence of densities of state. Recall that is the positive constant, depending only on , and , introduced in Corollary 1.3 and is defined as in Definition 1.5.
In particular, for this implies
The function may be chosen to be
where , with some that depends only on the model parameters , and .
In the regime, where is not too close to the support of the density of states in the sense that
where is considered as an additional model parameter.
Theorem 1.7 generalizes the previous local laws for stochastic variance matrices (see and references therein). It is valid for densities with an edge behavior different from the square root growth that is known from Wigner’s semicircular law. In particular, singularities that interpolate between a square root and a cubic root are possible. In the bulk of the support of the density of states, i.e., where is bounded away from zero, the function is bounded. The same is true near the edges, unless the nearby gap is small. The bound deteriorates near small gaps in the support of .
In applications, the sequence satisfying (A)–(C) may be constructed by discretizing a piecewise -Hölder continuous limit function (cf. Remark 6.2 in ). As a particularly simple example, suppose is a smooth, non-negative, symmetric, , function on with a positive diagonal, . Then the sequence of variance matrices,
satisfies conditions (A)–(C). The validity of (C) can be verified by using the general criteria (cf. Theorem 2.10 and Theorem 6.1 of ) for uniform boundedness. In this case the solution, , of the QVE converges to a limit in the sense that
The continuous QVE such as this one fall into the class of general QVEs thoroughly analyzed in the companion paper . In particular, the stability analysis applies and the density of states converges to a limit
We introduce a notion for expressing that events hold with high probability in the limit as tends to infinity.
We denote by the eigenvalues of the random matrix . The following corollary shows that the eigenvalue distribution converges to the density of states as tends to infinity.
Furthermore, for an arbitrary tolerance exponent there are no eigenvalues away from the support of the density of states,
where we interpret , and is defined as , as well as
Based on (1.16) we define the index, , of an eigenvalue that we expect to be located close to the spectral parameter by
Assume (A)-(D), and let be an arbitrary tolerance exponent. Denote
and . Then uniformly for every
Furthermore, if is close to the extreme edge, or , then
Finally, if for some , then the corresponding eigenvalue is close to an internal edge in the sense that
The statements (1.35) and (1.36) are an immediate consequence of (1.34) and (1.29). They simply express the fact that the small number of eigenvalues, very close to the edges, are found in the space that is left for them by the other eigenvalues for which the rigidity statement (1.34) applies. For an illustration see Figure 1.2. We also note that results of this type date back to at least (in the sample covariance context).
where is the function from Theorem 1.7.
In particular, the eigenvectors are completely delocalized, i.e., .
We say that is -full for some (independent of ) if either of the following applies:
is complex hermitian and for all the real symmetric -matrix,
We use the convention that every positive constant with a lower star index, such as , and , explicitly depends only on the model parameters , and from (B)–(D). These dependencies can be reconstructed from the proofs, but we will not follow them. Constants also depend only on , and . They will have a local meaning within a specific proof.
For two non-negative functions and depending on a set of parameters , we use the comparison relation
if there exists a positive constant , depending explicitly on , and such that for all . The notation means that both and hold true. In this case we say that and are comparable. We also write , if .
Bound on the random perturbation of the QVE
We will make the following standing assumptions for the rest of this paper,
The assumptions (A)–(D) hold true and an arbitrary tolerance exponent is fixed;
which are always assumed to hold unless explicitly otherwise stated.
We introduce the notation for the resolvent of the matrix , which is identical to except for the removal of the rows and columns corresponding to the indices . The enumeration of the indices is kept, even though has a lower dimension.
The diagonal elements of the resolvent, , satisfy the perturbed quadratic vector equation
Here and in the following, the upper indices on the sums indicate which indices are not summed over. For the proof of this simple identity as well as (2.3) below via the Schur complement formula we refer to . As in (2.2) we will often omit the dependence on the spectral parameter in our notation, i.e., , , etc..
We will now derive an upper bound on , provided is bounded by a small constant. At the same time we will control the off-diagonal elements of the resolvent. These satisfy the identity
for . The strategy in what follows below is that (2.2) and (2.3) are used to improve a rough bound on the entries of the resolvent to get the correct bounds on the random perturbation and the off-diagonal resolvent elements. Later, in Section 3, the stability of the QVE under the small perturbation, , will provide the improved bound on the diagonal elements, .
We introduce a short notation for the difference between and the solution of the unperturbed equation (1.7),
The following lemma is analogous to Lemma 5.2 in with minor modifications. For the completeness of this paper, we repeat these arguments. One small modification is that our estimates also deal with the regime where is large. To keep the formulas short we denote
For the proof of this lemma we will need an additional property of the solution of the QVE that is a corollary of Theorem 4.1, where all properties of taken from are summarized.
The absolute value of the solution of the QVE satisfies
Here we use the three large deviation estimates,
Since is independent of the rows and columns of with indices in , these estimates follow directly from the large deviation bounds in Appendix C of . Furthermore, we use
where latter the inequality is just assumption (1.8) and the bound on follows from (1.11). We remark that the stochastic domination in (2.7) and (2.8) is uniform in and , respectively, i.e., the threshold function in Definition 1.6 does not depend on .
We will now show that the removal of a few rows and columns in will only have a small effect on the entries of the resolvent. The general resolvent identity,
In the inequality we used that (cf. Corollary 2.2), and that is chosen to be small enough. We use (2.10) in a similar calculation for and find that on the event where ,
Again using (2.10) and that the denominator of the last expression is comparable to , we conclude
We have now collected all necessary ingredients and use them to estimate all the terms in (2.2) one by one. We start with the first summand. By (2.7a) we find
With the help of (2.10) we remove the upper index from and get
For the second summand in (2.2) we use the large deviation bound for the diagonal, (2.7c), and find that
By removing the upper index again we estimate
We use this in (2.15) and for sufficiently small we arrive at
The third summand in (2.2) is estimated directly by
We combine the estimates for the individual terms (2.14), (2.17), (2.18) and (2.8). Altogether we conclude that
Here, we applied the large deviation bound (2.7b). Using the Ward identity for the resolvent ,
and (2.10) for removing the upper index of we get
We remove the upper indices from and end up with
Local law away from local minima
In this section we will use the stability of the QVE to establish the main result away from the local minima of the density of states inside its own support, i.e. away from the set
First we consider the regime . Using we see that . Similarly, we get . Since , , are both bigger than the right hand side of (3.3), we obtain (1.21) for .
The proof of Proposition 3.1 uses a continuity argument in . In particular, continuity of the solution of the QVE is needed. The statement of the following corollary is part of the properties of listed in Theorem 4.1 below.
The solution of the QVE is uniformly Hölder-continuous,
Since we will estimate the difference, , we start by deriving an equation for this quantity. Using the QVE for and the perturbed equation (2.1) for we find
Using the bound inside the indicator function from (3.8) and the assertion (3.8) of the lemma follows.
For the proof of Proposition 3.1 we use the stability of (3.7) also close to . This requires more care and is carried out in detail in . The result of that analysis is Theorem 4.2. Here we will only need the following consequence of that theorem and (4.5a).
Furthermore, the following fluctuation averaging result is needed. It was first established for generalized Wigner matrices with Bernoulli distributed entries in .
In the setting where is a generalized Wigner matrix and this bound is precisely the content of Theorem 4.7 from .
The a priori bound used in the proof of that theorem is replaced by
for any with -independent size. This bound is proven in the same way as (2.19). Here, the hidden in the stochastic domination depends on the size of the index set. Following the proof of Theorem 4.7 given in with (3.17) and tracking the -dependence,
yields the fluctuation averaging, Theorem 3.5. ∎
From this and the definition of in (2.2) we read off the a priori bound,
Here, we used the general resolvent identity (2.9) in the form . Since satisfies the perturbed QVE (2.1) and from (3.19) and (3.18) we conclude that uniformly for we have
for . With the bound (3.20) we conclude that
For the bound on the off-diagonal error term we plug this result into (3.24) and get
according to (3.8) in Lemma 3.3 (for ) and (3.13) from Corollary 3.4 (for ), where is a sufficiently small positive constant.
Using again the weighted Cauchy-Schwarz inequality in the second term yields
In particular, we combine (3.27) and (3.28) to establish a gap in the values that can take,
Here we used . This shows that either or a.w.o.p.
Now we apply Lemma A.2 on the connected domain
The continuity condition (A.1) of the lemma for these two functions follows from the Hölder-continuity, (3.5), of the solution of the QVE and the weak continuity of the resolvent elements,
We will now sketch the proof of Corollary 1.8. The set-up in this corollary differs slightly from the one used in the rest of this paper, because the uniform bound (assumption (C)) on the solution of (1.7) is not assumed. We therefore use additional information from about in this more general setting.
Since the boundedness assumption (C) on the solution of the QVE is dropped in this corollary, its proof starts by showing that nevertheless for some constant we have
Local law close to local minima
The probability densities are comparable,
The size of the harmonic extension (1.15) of , up to constant factors, is given by explicit functions as follows. Let .
At an internal edge: At the edges with in the direction where the support of the density of states continues the size of is
Inside a gap: Between two neighboring edges and with , the function satisfies
for all .
Around an extreme edge: At the extreme points and of the density of states grows like a square root ,
Away from the support: Away from the interval in which is contained
The next theorem shows that the QVE is stable under small perturbations, , in the sense that once a solution of the perturbed QVE (4.6) is sufficiently close to , then the difference between the two can be estimated in terms of . In it is stated as Proposition 10.1.
in the following two ways. On the whole complex upper half plane
Furthermore, the function is related to the density of states by
2 Coefficients of the cubic equation
There exist such that for all the coefficients, and , of the cubic equation (4.10) satisfy the following bounds.
Around an internal edge: At the edges of the gap with length for , we have
Well inside a gap: Between two neighboring edges and of the gap with length for , the first coefficient, , satisfies
The second coefficient, , satisfies the upper bounds,
Around an extreme edge: Around the extreme points and of , we have
In the last relation we used the behavior (4.5e) of from Theorem 4.1. By (4.11) we conclude that inside the -neighborhood of ,
Using the upper and lower bounds on again, gives the desired result, (4.15e). Around an internal edge: First we prove the bounds on , starting from (4.11). The upper bound simply uses the -Hölder-continuity and the behavior at the edge points of ,
where is one of the edge points or . The claim follows from plugging in the size of from the two corresponding domains in Theorem 4.1, i.e., the domain close to an edge, (4.5b), and the domain inside a gap, (4.5c).
For the lower bound we consider two different regimes. In the first case is close to the edge point, , for some small positive constant , depending only on the model parameters , and . We find
provided is small enough. This bound coincides with the lower bound on in (4.15a), once the size of from (4.5b) is used.
This finishes the proof of the upper and lower bound on on this domain. For the claim about we plug the result about and the size of into
3 Rough bound on ΛΛ\Lambda close to local minima
Now we start the detailed proof from the fact that satisfies the cubic equation (4.10), whose right hand side is bounded by for some constant , depending only on the model parameters. Note that as long as because in this case , and satisfies the perturbed QVE with perturbation . From the definition of in (4.7) and the uniform bound on from (4.13), we get . Since the coefficient is uniformly bounded (cf. (4.11)), the cubic equation for implies the three bounds
In order to satisfy the constraint of (4.10) we have also used . This together with (4.22) yields (4.21b).
The function is from Definition 1.5 and its value is simply the length of the gap at the point where it is evaluated. We also define the -neighborhoods of these subsets,
As an immediate consequence of the upper and lower bounds on the coefficients, and , presented in Proposition 4.3, we see that
Now we make a choice for the two constants and . We express them in terms of as
We pair the bounds on from (4.21) with the corresponding bounds from (4.23) on the coefficients of the cubic equation. For small enough the conditions on in (4.21a) and in (4.21b) are automatically satisfied by the choice of and , as well as the upper and lower bounds from (4.23a) and (4.23b). Thus, for small enough we end up with
4 Proof of Theorem 1.7
When we denote by the direction that points towards the gap in at . In case we make the arbitrary choice , i.e.,
where and . We will then prove the local law in the form
where the positive error function is given as the unique solution of an explicit cubic equation in (4.30) below.
To define we introduce explicit auxiliary functions , and that are comparable in size to the corresponding functions , and . The reason for using these auxiliary quantities for the definition of instead of the original ones is twofold. Firstly, in this way will be an explicit function instead of one that is implicitly defined through the solution of the QVE. The function is explicit in the sense that there is a formula for the solution of the cubic equation that defines it and the coefficients are given by the explicit functions , and . Secondly, will be monotonic of its second variable, . This property will be used later. The definition of the three auxiliary functions will be different, depending on whether is in the boundary of the support of the density of states or not. Recall the definition (1.17) of .
Edge: If , i.e. is an edge of a gap of size in the support of the density of states or an extreme edge. Then we define the three explicit functions
Here, is the constant from Proposition 4.3.
By design (cf. Proposition 4.3 and Theorem 4.1) these functions satisfy
except in one special case where the second bound does not hold, namely when , and . In this case only the direction is true (cf. (4.15c)).
We fix a positive constant . The value of the function at is then defined to be the unique positive solution of the cubic equation
With the choices (1.23) and (1.25) for we have
for any , where the threshold here depends on in addition to , , , and . The inequality (4.31) is verified by plugging its right hand side into (4.30) in place of and checking that on each regime the resulting expression on the right hand side of (4.30) is smaller than the resulting expression on the left hand side of (4.30). The factor of in (4.31) can be absorbed in the stochastic domination in (4.26). Thus (4.26) becomes (1.20) and (1.21) of Theorem 1.7.
Before we start the proof of the local law (4.26), let us motivate the definition of . As a consequence of Lemma 4.4 the indicator function equals one a.w.o.p. in the statement of Lemma 2.1. Thus, uniformly in the -neighborhood of we have
Up to the technical factor of the right hand side coincides with the right hand side of the cubic equation defining . On the other hand, the right hand side of the cubic equation (4.10) for the quantity from Theorem 4.2 is of the same form as the left hand side of (4.33). Therefore, we infer
We will argue that on appropriately chosen domains out of the three summands in the cubic expression in always one is the biggest by far. Therefore, the error function , defined by (4.30), is essentially the best bound on that one may hope to deduce from (4.34). Indeed, since is by definition an average of , we expect .
We will now prove (4.26). To this end we gradually improve the bound on . Fix some . The sequence of deterministic bounds on this quantity is defined as
From here on until the end of this section the threshold function from the definition of the stochastic domination (cf. Definition 1.6) as well as the definition of ’a.w.o.p.’ (cf. Definition 1.9) may depend on in addition to , , , and . At the end of the proof we will remove this dependence. The following lemma is essential for doing one step in the upcoming iteration.
Then .
where from (3.15) has been neglected since . In this way we see that the hypothesis (4.36) of Lemma 4.5 is satisfied. Using the lemma the bound on is improved to
where is a bounded, , deterministic vector. Together with the bound (4.37) we apply the fluctuation averaging (Theorem 3.5) again,
We repeat this step finitely many times and each time improve by a factor of until it reaches its target value and is not improved anymore. Note that all constants in our estimates, explicit and hidden, depend only on the model parameters and . In particular, the number of steps needed is uniform in . At that stage we have
Finally, with the help of (4.9), (4.41) and the fluctuation averaging, we prove the bound on averages of against any bounded, , deterministic vector,
This finishes the proof of Theorem 1.7 apart from the proof of Lemma 4.5 which we will tackle now.
Edge: If is an edge of a gap of size , then we define
If any of the two regimes with consists of a single point only, then we set .
If consists of a single point only, then we set .
In the cubic equation (4.30), used to define the error function , the coefficients and on the left hand side are monotonously increasing functions of . The linear and the constant coefficient of on the right hand side are monotonously decreasing in . Thus, itself is a monotonously decreasing function of . From this fact and the definition of the regimes , and we see that , and for some . Here, we interpret if and if .
Now we define a -dependent indicator function
This function fixes the values of to a small interval just below the deterministic control parameter . We will prove that cannot take these values, i.e. a.w.o.p.. Figure 4.1 illustrates this argument. Compared to Figure 6.1 in we see that instead of two there are now three domains, , and , to be distinguished. The reason for this extra complication is that (4.10) is cubic in , compared to the quadratic equation for that appeared in the proof of Lemma 6.2 in . To see that , first note that the choice of the domains, , ensures that there is always one summand on the left hand side of the cubic equation (4.10) for which dominates the two others by a factor , whenever does not vanish. In fact, by construction we have: Claim: The random functions and satisfy a.w.o.p.
We will verify this fact at the end of the proof of this lemma. Now we will simply use it. First we combine the assumption (4.36) of the lemma and (4.43) to obtain
Here we also gave up a factor of to get an inequality instead of the stochastic domination, and replaced by the comparable quantity . By the definition of the indicator function we have . Using this to bound the left hand side, and that , we obtain
Comparing this with the defining equation (4.30) for we conclude that a.w.o.p. .
On the other hand, by the definition of in (4.35) we know that . These two inequalities yield
where as explained after the definition of , and above we have , and . The condition (A.1) of the lemma is satisfied by the definition of in (4.7), the Hölder-continuity of the solution of the QVE, the weak Lipschitz-continuity of with Lipschitz-constant and the Hölder-continuity of from (4.12). The gap condition, (A.2), holds because of (4.44) and the definition of and for an appropriate choice of the exponent .
This finishes the proof of Lemma 4.5 up to verifying the claim (4.43). Proof of the claim: For the proof of (4.43) one verifies case by case that on the term is bigger than the two other terms, and by a factor of . If is not empty then the term is the biggest. If is not empty, then and is the biggest term by a factor of . More specifically, when and we show
where . As an example we demonstrate these relations in a few cases:
Well inside a gap: If and then . We now check that on the linear term in is the biggest while on the cubic term dominates. First, let . Then the following chain of inequalities hold,
Here, we used (4.29), (4.15b), the definition of and (4.27c) in the form . Now we can use to replace by . By definition of and since for we also get
We conclude that on the linear term in dominates the others,
Suppose now that . In this case, using the choice of the indicator function ,
By definition of and (4.27c) we find that
Altogether we find that the cubic term dominates the two others,
Inside a gap close to an edge on : If , and , then we will show the quadratic term in dominates the two other terms. We have
where in the inequality we used the definition of . The choice of guarantees that . Thus, the quadratic term is larger than the cubic term by a factor of . On the other hand
Here, in the first inequality we used the indicator function and in the second inequality the definition of . Altogether, we arrive at
Here, we used (4.29) and the definitions of and , respectively. Since and by the definition of this shows that the linear term is larger than the quadratic term by a factor of . In order to compare the linear with the cubic term we estimate further. By definition of ,
Again we use the lower bound on and get
Thus we showed that on the domain
The other cases are proven similarly. This completes the proof of (4.43). ∎
Rigidity and delocalization of eigenvectors
Here we explain how the local law, Theorem 1.7, is used to estimate the difference between the cumulative density of states and the eigenvalue distribution function of the random matrix . The following auxiliary result shows that the difference between two probability measures can be estimated in terms of the difference of their respective Stieltjes transforms. For completeness the proof is given in the appendix. It uses a Cauchy-integral formula that was also applied in the construction of the Helffer-Sjöstrand functional calculus (cf. ) and it appeared in different variants in , and .
Here, the three contributions to the error, , and , are defined as
where denotes the Stieltjes transform of for any signed measure .
We will now apply this lemma to prove Corollary 1.10 with the choices of the measures
As a first step we show that a.w.o.p. there are no eigenvalues with an absolute value larger or equal than , i.e.,
We focus on the eigenvalues . The ones with are treated in the same way. We will show first that there are no eigenvalues in a small interval around with . In fact, we prove that for ,
For this we apply Lemma 5.1 with the same choices of the measures and as in (5.3) and with
Plugging this bound into the definitions of , and from (5.2) and using (5.1) and the fact that in this regime shows the validity of (5.5).
We conclude that a.w.o.p. there are no eigenvalues in an interval of length to the right of . By using a union bound this implies that
The eigenvalues larger than are treated by the following simple argument,
Now we apply Lemma 5.1 to prove (1.28). In case the bound (1.28) follows because a.w.o.p. there are no eigenvalues of with absolute value larger or equal than . Thus, we fix and make the choices
Again we use (1.21) from Theorem 1.7, the Lipschitz-continuity of and the Hölder-continuity of to see that uniformly for all ,
Here we evaluated and thus . With defined as in (5.2) we infer . Theorem 1.7 also implies the bound
since in this regime , thus showing that . We are left with estimating the three terms constituting . The first and second of these terms are estimated trivially by using the boundedness of their integrands. Therefore, we conclude that
This expression is derived by using the bound (1.23) on for the integrand of the third contribution to .
for any and . With this the size of is given by
The bound (5.11) follows by performing the integration over .
This finishes the proof of (5.11). We insert this bound into (5.9) and use that was arbitrary. Thus, we find
This finishes the proof of (1.28) since there are no eigenvalues below .
where are defined as in (1.30) and . Note that there is nothing to show if and the size of the gap, , is smaller than , i.e., if such a does not exist. In particular, we have . We will show that a.w.o.p. there are no eigenvalues in an interval of length to the right of , i.e.
We apply Lemma 5.1 with the same choices of the measures and as in (5.3). Additionally, we set
We use the local law, Theorem 1.7, to estimate the differences between the Stieltjes transforms of the two measures for the integrands in the definition of the three error terms, , and from (5.2). By the definition of the condition (1.24) is satisfied inside the integrals and we use the improved bound, (1.25), on . Indeed, we find
where the supremum is taken over and . With this, the definition of and the size of from (4.5c) and (4.5d) we infer
From this (5.12) follows. The claim, (1.29), is now a consequence of a simple union bound taken over the events in (5.12) with different choices of . This finishes the proof of Corollary 1.10. ∎
2 Proof of Corollary 1.11
Here we show how we get the rigidity, Corollary 1.11, from Corollary 1.10. Fix a . We define the random fluctuation to the left, , and to the right, , of the eigenvalue as
We start with the upper bound on . By the definition of we find the inequality
The definition of implies that
By monotonicity of the cumulative eigenvalue distribution, we conclude that . Thus, the upper bound is proven.
Now we show the lower bound. We start similarly,
Here the is necessary, since the cumulative eigenvalue distribution is not continuous from the left. We conclude that for all and therefore the lower bound is proven.
Now we start with the proof of (1.34). For this we show that for any that is well inside the support of the density of states, i.e., that satisfies (1.33), we have
We apply (1.28) from Corollary 1.10 and, using (4.5e) again, we get
We will now verify that for large enough ,
We distinguish three cases. First let us consider the regime where . Then we have and
Now we treat the situation where, . In this case
Finally, we consider . Then for large enough we find on the one hand
Thus, (5.19) holds true and since was arbitrary, we infer from (5.17) and (5.18) that . Along the same lines we prove . Thus (5.16) and with it (1.34) are proven.
The statement about the fluctuation of the eigenvalues at the leftmost edge, (1.35) follows directly from (1.34) and (1.29) in Corollary 1.10. Indeed, for we have and from (1.34) with , as well as , and from the definition of we see that
On the other hand, (1.29) shows that a.w.o.p. . Since was arbitrary, (1.35) follows. The rigidity at the rightmost edge is proven along the same lines.
The claim, (1.36), about the remaining eigenvalues follows from a similar argument. For , as a consequence of (1.29), we have
From (1.34) and the definition of we infer a.w.o.p., as well as a.w.o.p., which finishes the proof of (1.36). ∎
3 Proof of Corollary 1.14
The delocalization of eigenvectors is a simple consequence of the anisotropic local law Theorem 1.13 using the argument from . Expressing the resolvent in the eigenbasis, we have
by keeping only a single summand from (5.20). As was arbitrary we conclude that
Anisotropic law and universality
The first term containing the diagonal elements is clearly bounded by the right hand side of (1.37) by Theorem 1.7. This is the first instant where the nontrivial -dependence of is used.
The main technical part of the proof in is then to control , the contribution of the off diagonal terms. We can follow this proof in our case to the letter; the nontrivial -dependence of requires a slight modification only at one point. To see this, we recall the main structure of the proof. For any even , the moment
This formula replaces (5.41) from . Taking the inverse of this formula and expanding around the leading term , we get a geometric series representation for in terms of powers of the last three term in (6.2). The resulting formula is analogous to (5.42) in . The geometric series converges because the last three term on the right hand side of (6.2) are much smaller than a.w.o.p.. Indeed, the last two terms in (6.2) are of size and a.w.o.p., respectively. The double sum in (6.2) is small by using the large deviation estimates (2.7a)–(2.7c), similarly as in the proof of Lemma 2.1. When estimating the diagonal sum , we note that is small by first estimating similarly to (2.12), and then we use the local law Theorem 1.7 to see that also is small.
The proof in did not use the specific form of the subtracted term in (6.2), just the fact that the subtraction made (2.7c) applicable for the double summation in (6.2). After this slight modification, the rest of the proof in goes through without any further changes. ∎
2 Proof of Theorem 1.16
For the proof of Theorem 1.16 we follow the method developed in . Theorem 2.1 from was designed for proving universality for a random matrix with a small independent Gaussian component and densities of state that may differ from Wigner’s semicircle law. The main theorem in asserts that if local laws hold in a sufficiently strong sense then bulk universality holds locally for matrices with a small Gaussian component. We remark that a similar approach was independently developed in that can also be easily used to conclude bulk universality from Theorem 1.7, but here we follow . In Section 2.5 of a recipe was given how to use this theorem to establish universality for a quite general class of random matrix models even without the Gaussian component, as long as uniform local laws on the optimal scale are known and the matrix satisfies the appropriate -fullness condition (cf. Definition 1.15) that allows for an application of the moment matching (Lemma 6.5 in ) and the Green’s function comparison theorem (Theorem 2.3 in ).
Appendix A Appendix
The relation is transitive and it satisfies the following arithmetic rules:
If , for every , then ;
If , for some , then .
These properties follow directly from the definition (Definition 1.6) of stochastic domination. For further details see .
Then the sequence satisfies the bound
For this follows from (A.3) and (A.2). For all other it follows by induction using the continuity condition (A.1), which implies . This shows that if , then and with (A.2) even that . In particular, a.w.o.p..
where the three integrals , and are given as
and is the Stieltjes transform of .
We split the integral, , into the contributions,
For the treatment of we integrate by parts, first in and then in ,
We use and . In this way we estimate for ,
Going through the same steps we also arrive at
We continue by estimating from above.
Finally we derive a bound for . We split the integral into two components,
We combine this with the estimates from (A.5), (A.6), (A.7), (A.8) and (A.9). Altogether we have
where the three terms on the right hand side are given by
Now we use this bound for the smoothed out indicator function to derive a bound on the difference of number of eigenvalues in the interval and the predicted number, given by the integral over the density of states. We use