Random matrices: Sharp concentration of eigenvalues
Terence Tao, Van Vu
Introduction
The purpose of this paper is to sharpen the existing bounds on the eigenvalue counting function of a (normalized) Wigner matrix , and related quantities such as the Stieltjes transform and individual eigenvalues . Let us first state the Wigner random matrix model which we will use.
Let be an integer (which we view as a parameter going off to infinity; in particular, is understood to be large enough that quantities such as are well-defined and positive). An Wigner matrix is defined to be a random Hermitian matrix , in which the for are jointly independent with (in particular, the are real-valued). For , we require that the have mean zero and variance one, while for we require that the (which are necessarily real) have mean zero and variance for some independent of . For simplicity, we will also assume that for each , the real and imaginary parts , are independent. We refer to the distributions , for and for as the atom distributions of , and view them as fixed while goes off to infinity.
We say that the Wigner matrix ensemble obeys Condition C0 if we have the exponential decay condition
for all and , and some constants (independent of ).
Two Wigner matrices and are said to have matching moments to order for some if one has
for all and all natural numbers with . As we are assuming the real and imaginary parts to be independent, this condition simplifies to the conditions
for all and all . If we only require (2) or (3) to hold in the off-diagonal case (resp. in the diagonal case ), we say that and match moments to order off the diagonal (resp. on the diagonal).
We observe four basic examples of Wigner matrices:
In the symmetric Bernoulli ensemble, equals with probability and with probability for all , and .
In the complex Hermitian Bernoulli ensemble, for and for all equal with probability and with probability , and .
Note that we do not require the off-diagonal , (or the diagonal , ) to be identically distributed. This lack of an identical distribution hypothesis will be convenient when we apply the Lindeberg exchange strategy , in which one Wigner matrix is compared to another one by exchanging the entries of the former matrix with the latter oneMore precisely, we exchange the diagonal entries one at a time, and the off-diagonal entries two at a time, in order to preserve the Hermitian property throughout. at a time. As such, the intermediate stages of this exchange process need not have identically distributed entries, even if the initial and final matrices do.
The hypothesis of independence of real and imaginary parts is imposed purely to simplify the exposition, and can easily be removed at the cost of some more complicated notation; in particular, the simpler moment matching condition (3) must be replaced by the more complicated condition (2). See Remark 23.
In this paper, we will mostly deal with the (coarse-scale) normalization of of the Wigner matrix, and more specifically with the eigenvalue counting function
Let be a Wigner Hermitian matrix obeying Condition C0. Then for any fixed interval (independent of ), one has
See for instance for a proof of this theorem and for historical background. Condition C0 can be omitted from this law, but we retain the hypothesis as it will be needed for the subsequent results discussed below.
If we use to denote a quantity that goes to zero as after dividing by , we can reformulate Theorem 3 as the assertion that the asymptotic
holds with probability for each fixed .
One can also phrase the semicircular law in terms of the individual eigenvalues . If for each we define the classical location of the normalised eigenvalue by the formula
then the Wigner semicircular law (combined with an almost sure bound of for the operator norm of , due to Bai and Yin ) is equivalent to the assertion that one has
for any given , with probability .
In this paper we investigate sharper versions of the semicircular law (known in the literature as local semicircular laws), which improve upon the error terms and failure probabilities in (4) and (6), and in which the interval is now allowed to depend on .
We first discuss the case of the Gaussian Unitary Ensemble (GUE), which is the most well-understood case, as the joint distribution of the eigenvalues is given by a determinantal point process. Because of this, it is known that for any interval , the random variable in the GUE case obeys a law of the form
where the are jointly independent indicator random variables (i.e. they take values in ); see e.g. [3, Corollary 4.2.24]. The mean and variance of can also be computed in the GUE case with a high degree of accuracy:
Let be drawn from GUE, let , and let for some real number (which may depend on ). Let be independent of .
(Bulk case) If , then
(Variance bound) If one has and as , one has
In particular, one has in this regime.
Here of course we use , or to denote the estimate for some quantity independent of . We will also use to denote various small positive constants independent of (but possibly depending on the constants in Condition C0).
See [21, Lemmas 2.1, 2.2, 2.3]. Note that the normalization conventions in differ by a factor of from the ones used hereThere is a slight inaccuracy in the statement of [21, Lemma 2.2], namely that the main term of in that lemma should be replaced with the more accurate main term (which is what actually comes out of the proof of [21, Lemma 2.2]). These two main terms differ by in the regime as can be seen from a Taylor expansion, but they differ by more than outside of this regime.. ∎
By combining these estimates with a well-known inequality of Bennett , we obtain a concentration estimate for in the GUE case:
Let be drawn from GUE, let , and let be an interval. Then one has
By the triangle inequality we may take for some real number . As is supported on $10\leq N_{I}(W_{n})\leq nN_{I}(W_{n})\leq N_{J}(W_{n})I\subset Jx\inN_{I}(W_{n})\mu\sigma^{2}$ of this sum is given by
and respectively. Bennett’s inequality (see , or [23, p.29]) then asserts that
where . Since when , the claim followsIndeed, this argument shows a slightly better bound than . One can also use Bernstein’s inequality to also obtain the bound if desired.. ∎
Let us say that an event holds with overwhelming probability if it occurs with probability for each fixed . From the above corollary we see in particular that in the GUE case, one has
with overwhelming probability for each fixed , and an easy union bound argument (ranging over all intervals in, say, $n^{-100}I$ as well.
By using a general result of Costin and Lebowitz , one can also obtain a central limit theorem for as long as is not too small; see . Such results have also been recently been extended to more general Wigner matrices in . However, such theorems will not be the focus of the current paper.
Now we turn from the GUE case to more general Wigner ensembles. There has been much interest in recent years in obtaining concentration results for (and for closely related objects, such as the Stieltjes transform of ) for short intervals , due to the applicability of such results to establishing various universality properties of such matrices; see . The previous best result in this direction was by Erdős, Yau, and Yin (see also for a variant):
Let be a Wigner matrix obeying Condition C0, and let . Then, for any interval , one has
for all , and some constant .
One can reformulate (8) equivalently as the assertion that
In particular, this theorem asserts that with overwhelming probability one has
for all intervals . The proof of the above theorem is somewhat lengthy, requiring a delicate analysis of the self-consistent equation of the Stieltjes transform of . A recent preprint of Götze and Tikhomirov has claimedAt the current time of writing, the preprint is being revised to address some gaps in the proofs of some lemmas in that paper, specifically Lemmas 5.2 and 5.3 from (private communication). an improvement to this result, namely that
with probability for certain explicit exponents . This claim would imply as a consequence that for any interval , has variance .
Comparing Theorem 7 with the previous results for the GUE case, we see that there is a loss of a double logarithm in the exponent. The first main result of this paperWe would like to thank M. Ledoux for a private conversation that led to this question. is to remove this double logarithmic loss, at least under an additional vanishing moment assumption:
Let be a Wigner matrix obeying Condition C0, and let . Assume that matches moments with GUE to third order off the diagonal (i.e. have variance and third moment zero). Then, for any interval , one has
This estimate is phrased for any , but the bound only becomes non-trivial when for some sufficiently large . In that regime, we see that this result removes the double-logarithmic factor from Theorem 7; it is also comparable to the result (9) from when (though not with as sharp a set of exponents as , and one also needs an additional moment matching hypothesis), but gives additional large deviation bounds when is much larger than .
As we are assuming and to be independent, the moment matching condition simplifies to the constraints that and . However, it is possible to extend this theorem to the case when the real and imaginary parts of are not independent; see Remark 23.
The constant in the bound in Theorem 8 is quite decent in several cases. For instance, if the atom variables of are Bernoulli or have sub-gaussian tail, then we can set by optimizing our arguments (details omitted). If we assume 4 matching moments rather than 3, then we can set (see Remark 26), matching the bound in Corollary 5. It is an interesting question to determine the best value of . The value of in is implicit and rather small.
We prove Theorem 8 in Sections 2-4. Our argument differs from that in in that it only uses a relatively crude analysis of the self-consistent equation to obtain some preliminary bounds on the Stieltjes transform and on (which were also essentially implicit in previous literature). Instead, the bulk of the argument relies on using the Lindeberg swapping strategy to deduce concentration of in the non-GUE case from the concentration results in the GUE case provided by Corollary 5. In order to keep the error terms in this swapping under control, three matching momentsCompare with the “four moment theorem” from . We need one less moment here because we are working at “mesoscopic” scales (in which the number of eigenvalues involved is much larger than ) rather than at “microscopic” scales. However, in Theorem 14 below, only one eigenvalue is involved, making the problem microscopic enough to require four moments instead of three. are needed.
Very roughly speaking, the main idea of the argument is to show that high moments such as
are quite stable (in a multiplicative sense) if one swaps (the real or imaginary part of) one of the entries of (and its adjoint) with another random variable that matches the moments of the original entry to third order. For technical reasons, however, we do not quite manipulate directly, but instead work with a proxy for this quantity, namely a certain integral of the Stieltjes transform of . As observed in , the Lindeberg swapping argument is quite simple to implement at the level of the Stieltjes transform (due to the simplicity of the resolvent identities, when compared against the rather complicated Taylor expansions of individual eigenvalues used in ).
The result in Theorem 8 is well suited for controlling eigenvalues in the bulk of the spectrum, but is not sufficient by itself to control eigenvalues at the edge, and in particular the largest eigenvalue and the smallest eigenvalue . However, it is known that these eigenvalues are highly concentrated around and respectively. In the GUE case, we have the following concentration result of Aubrun :
Let be drawn from GUE, let . Then one has
As is well known, the random variable in fact converges in distribution to the Tracy-Widom law . However, we will not focus on this law here. The exponent on the right-hand side cannot be improved (indeed, it matches the decay rate of the Tracy-Widom law); see for further discussion.
This result was partially extended to the Wigner case in :
Let be a Wigner matrix obeying Condition C0, and let . Then one has
for all , for some independent of . By symmetry, one also has
As before, we can reformulate (10) equivalently as the assertion that
Our second main result is to remove the double logarithm from Theorem 13, at the cost of requiring matching GUE to fourth order rather than to third order:
Let be a Wigner matrix obeying Condition C0, and let . Assume that matches moments with GUE to fourth order off the diagonal and second order on the diagonal (i.e. ). Then one has
for any . By symmetry, one then also has
We will derive Theorem 14 from Theorem 11 in Section 5 using the same techniques used to derive Theorem 8 from Corollary 5.
By combining Theorem 8 and Theorem 14 one can “solve” for individual eigenvalues to obtain an appropriate concentration (localization) result:
Let be a Wigner matrix obeying Condition C0, and let . Assume that matches moments with GUE to fourth order off the diagonal and second order on the diagonal. Then for any , we have
If we assume only three matching moments, then the above estimate still holds provided that we have the additional hypothesis
for some fixed (where the constant above is allowed to depend on ).
The second part of this corollary significantly improves [30, Theorem 29]. (As a matter of fact, the original proof of this theorem has a gap in it; see [33, Appendix A] for a further discussion.)
First assume four matching moments. By Theorems 8, 14 and the union bound, we see that outside of an event of probability , we have
for all intervals , as well as the bounds
Some elementary estimation of the semicircular density and its integrals (cf. [17, §5]) then gives
for all . The claim follows (possibly after adjusting by a multiplicative factor).
Now suppose we only have three matching moments. Then by Theorem 8 and the union bound, we may assume that
for all . In particular (setting equal to or ) this implies that whenever . One can then argue as before. ∎
The results in this paper also hold if one replaces the GUE ensemble by the GOE ensemble, in which case one considers real symmetric Wigner matrices instead of Hermitian Wigner matrices, with the off-diagonal having mean zero, variance one, and third moment zero (if there are three matching moments) and fourth moment equal to (if there are four matching moments). To do this, one needs to replace Theorem 4 and Theorem 11 by their GOE counterparts. The GOE version of Theorem 4 was established by O’Rourke . The GOE version of Theorem 11 follows from the results in . In principle, one might be able to use other ensembles (such as the gaussian divisible matrices ) to match moments with, which would allow one to remove the moment conditions almost entirely. We will not pursue these matters here.
We are indebted to the anonymous referees for several suggestions and corrections.
Reduction to the Stieltjes transform
We now begin the proof of Theorem 8. The first step is to replace the counting function with the Stieltjes transform , defined by the formula
for any complex number with positive imaginary part. We can express this Stieltjes transform as a Riemann-Stieltjes integral
which gives a clear connection between the Stieltjes transform and the counting function; in the converse direction, we have the identity
whenever is not an eigenvalue of , showing that (in principle at least) we can reconstruct the eigenvalue counting function from the Stieltjes transform.
Using the heuristic from (4), we thus expect from (14) to have , where
As is well known (see e.g. ), can be evaluated explicitly via contour integrationFor instance, one can observe that converges to as , and then apply the Cauchy integral formula to around the slit $$.
where is the branch of the square root that is asymptotic to at infinity. In particular, exactly obeys the self-consistent equation
In the case of GUE, we may easily formalize this heuristic with the assistance of Corollary 5:
Let be drawn from GUE, and . Then for any and any complex number with , one has
We may assume that , as the claim is trivial otherwise. Let be chosen later. From Corollary 5 and the union bound, we see that with probability , one has
for all intervals in $n^{-100}I$. In particular,
for all . On the other hand, from (14) and integration by parts, one has
The error term on the right-hand side evaluates to . The claim then follows by choosing to be a small multiple of . ∎
We will use this proposition to obtain a similar concentration result for Wigner matrices:
Let be a Wigner matrix obeying Condition C0, and let . Assume that matches moments with GUE to third order off the diagonal. Then for any and any complex number with and , one has
We prove this theorem in later sections. Let us assume it for now, and use it to establish Theorem 8. The basic idea (which is standard in the Stieltjes transform approach to the local semicircle law) is to use a truncated form of (15). Let be as in the above theorem. By the triangle inequality, we may take for some real number ; from the support of , we may assume that . We may also take (say), as the claim is trivial otherwise.
Let be a quantity to be chosen later, and set . Applying Theorem 18 and the union bound, we see that outside of an event of probability at most
for all values of between and which are integer multiples of . On the other hand, in this range one easily verifies that the functions and are Lipschitz with Lipschitz norm at most (say). As a consequence, we conclude (after conditioning outside of the above exceptional event) that (19) holds for all between and .
By conditioning on another event of probability at most (18), we may assume that all entries of are of size at most (say). Among other things, this implies that all eigenvalues are (very crudely) of size at most .
Since , we conclude from (19) and (16) that
We conclude thatOne could also have used Proposition 30 at this juncture.
for all (note that this claim is trivial for ).
Next, if we integrate (19) and use the triangle inequality, we observe that
Let us now evaluate the left-hand side. From the definition of the Stieltjes transform, we may rewrite it as
where is the standard branch of the argument on the upper half-plane.
Since and , we have
(say). Also, from elementary trigonometry one has
We may therefore write the left-hand side of (21) as
(compare with (15)). On the other hand, from (20) and dyadic decomposition (recalling that ) one has
Choosing to be a small multiple of (and bounding from below by for some sufficiently small ), we obtain Theorem 8 as desired.
It remains to deduce Theorem 18 from Proposition 17. This will be the objective of the next few sections.
The moment method, and the Lindeberg strategy
Given a matrix and a complex number , define the quantity by the formula
This quantity describes the normalised deviation of the Stieltjes transform of from the semicircular law at . In this notation, Proposition 17 becomes the assertion that
whenever , , and , when is drawn from a Wigner matrix obeying Condition C0, and with and having variance and third moment zero for .
To deduce (23) from (22) we will use the moment method combined with the Lindeberg exchange strategy; more specifically, we will show that a high moment for some large even number (which one should think of, in practice, as comparable to ) is stable under the operation of replacing (the real or imaginary part of) one entry of (and its transpose) with another entry with a number of matching moments. The Lindeberg exchange strategy is by now a standard tool in establishing universality properties for Wigner matrices , , ; the main novelty hereVery recently , a similar application of the Lindeberg exchange strategy to a high moment of a spectral statistic was used to establish some related concentration results. We thank Antti Knowles for bringing this preprint to our attention. is the application of that strategy to a high moment (as opposed to a quantity such as for some smooth test function ).
Let us now make the strategy more precise. Let us call two Wigner matrices real-adjacent, or adjacent for short, if their respective atom variables are equal except for a single choice of and its transpose , and such that either have identical real parts, or identical imaginary parts. Thus, a Wigner matrix adjacent to is formed by changing the real or imaginary part of a single entry of and its adjoint, leaving the other components of unchanged. The main technical step is then to establish the following proposition.
Let be two adjacent Wigner matrices obeying Condition C0, whose moments match to order for some fixed . Let for some and , and set and . Then for any even integer , one has
Let us assume this proposition for now and establish Theorem 18. Let be as in that theorem. We may assume that (say) for some sufficiently large absolute constant , as the claim is trivial otherwise; we may also assume that , since the claim follows from existing local semicircle laws (in particular, Corollary 32). In particular, we may now assume that and . Our task is now to show that
On the other hand, if is drawn from GUE and , then from Proposition 17 one has
for all . In particular, for any , one has
We can replace with in a sequence of exchanges from one Wigner matrix to a real-adjacent one; of these exchanges arise by swapping the real or imaginary part of an off-diagonal entry of (and its transpose ) with the corresponding component of , and of these exchanges arise by swapping a diagonal entry of with the corresponding entry of . We perform these exchanges in an arbitrary order. By hypothesis, for the off-diagonal exchanges one has matching moments to order , while for the diagonal exchanges one has matching moments to order . Let denote the sequence of exchanges from to , and let be the associated rescaled Wigner matrices. By Proposition 19 one has
for , where is equal to for choices of and equal to for choices of . Concatenating these bounds, we conclude that for any one has
If we set to be the largest even integer less than for some absolute constant , and if is sufficiently large depending on , we obtain (25) as desired, thanks to the assumptions .
An inspection of the above argument reveals that we in fact have the slight refinement
in the regime , since in this regime we may take to be a small multiple of (rounded off to the nearest even integer, of course). Unfortunately, this refinement does not appear to immediately offer any significant improvement to the conclusion of Theorem 8.
It remains to establish Proposition 19. This will be achieved in the next section.
Stability of high moments
We now prove Proposition 19. We introduce a definition:
An elementary matrix is a matrix which has one of the following forms
As are real-adjacent, one can write
for some elementary matrix , some random matrix , and some real random variables independent of that match moments to order and obey the exponential decay condition
for all and some .
We now recall some (deterministic) resolvent stability results concerning matrices of the form . Define the matrix norm of a matrix by the formula
Let be a Hermitian matrix, let be an elementary matrix, and let be a real number. Let be a complex number with . Write
Furthermore, if we set , then we have the Taylor expansion
for any fixed nonnegative , where the coefficients are independent of and obey the bounds
See [32, Lemma 12] and [32, Proposition 13]. ∎
Our objective is to establish (24). From Corollary 33 we see that
with probability , while from (28) we certainly have with . Hence by the first conclusion of Proposition 22 (with and replaced with , and setting equal to ) we have
with probability . Using the crude bound , we may thus condition to be fixed and obeying (30), since the contribution of the event where (30) fails to is .
By Proposition 22, we thus see that whenever , one has
where the coefficients are deterministic (and in particular independent of , though they can depend on ), and obeys the bound .
Suppose first that . Then one has
whenever , which gives a net contribution of to ; meanwhile, from (28), the case when contributes at most . Thus we may assume that . Thus we have
for some deterministic coefficients , and assuming that . Raising this to the power (after using Taylor’s theorem with remainder to expand to order in the regime ), we conclude that
for some deterministic coefficients (which are allowed to depend on ), whenever . Taking (conditional) expectations in (using (28) and the trivial bound to handle the tail event when ) we conclude that
Since and match to order , we obtain the claim. This concludes the proof of Proposition 19 and hence Theorem 8.
It is possible to adapt the above arguments to the case when and are not assumed to be independent. The main new difficulty is that instead of swapping the real and imaginary parts of a single entry of (and its transpose ) separately, one has to swap them together. This requires one to consider perturbations of the form
where are two distinct elementary random variables, and are real random variables that are not necessarily independent and obeying the exponential decay hypothesis (28). However, it is possible to extend Proposition 22 without much difficulty to the case of two-parameter perturbations and perform a similar argument to that given above. We omit the details.
Extreme eigenvalues
We now prove Theorem 14, by combining the arguments in previous sections with some ideas from (and in particular, demonstrating a concentration of that is better than for some energy ). By symmetry, it suffices to prove the bound for . We may of course assume that is large.
By standard large deviation estimates, one has
for any ; seeOne could also use the earlier estimates in or ; see also for more discussion. [16, Lemma 7.2]. This already deals with the case when (say), and the case can be handled by crudely bounding by, say, the Frobenius norm of and using Condition C0. Thus we may restrict attention to the regime , and show that
We may assume that for some suitably large absolute constant , as the claim is trivial otherwise.
Suppose that was in the interval . Set , and let denote the quantity
where is the closest multiple of in to . Thus, by the union bound, it will suffice to show that
Let be drawn from GUE, and set . By Theorem 11, we have
outside of an event of probability ; in particular, we have
Also, from Corollary 5 and the union bound we see that outside of an event of probability , one has
(say) for all intervals . In particular, outside of this event, we have
for all , using the bound when .
From (34), (35), (32), and dyadic decomposition one easily establishes that
outside of an event of probability .
Let be an integer to be chosen later. Since we may trivially bound by , we conclude that
We claim the following stability result for , analogous to Proposition 19:
Let be two adjacent Wigner matrices obeying Condition C0, whose moments match to order for some fixed . Set and . Then for any integer , one has
Applying this proposition times with and times with we conclude that
and thus (using (36) and the hypothesis )
The desired claim (33) then follows from Markov’s inequality by taking for some sufficiently small (and assuming sufficiently large depending on ).
It remains to establish Proposition 24. As in the previous section, we write
for some elementary matrix , some random matrix , and some real random variables independent of that match moments to order and obey the exponential decay condition (28). Arguing exactly as before, we may condition to be a deterministic matrix for which
Using Proposition 22 as before, we see that
for some deterministic coefficients and , whenever .
Suppose first that . Then one has whenever , and so this case contributes to (37), which is acceptable. Thus we may restrict attention to the case when . Then we may write
whenever , where the are deterministic coefficients.
Suppose now that . Since , we may perform a Taylor expansion of to order for and conclude that
in this regime, where the are deterministic coefficients (which are allowed to depend in ). Taking expectations as in the preceding section, and using (28) to handle those with , we conclude that
and similarly for ; and the claim follows from the matching moments hypothesis.
As in Remark 23, it is possible to extend these arguments to the case when and are not independent; we leave the details to the interested reader.
Note that when one has four matching moments rather than three, the error terms are more favorable by a factor of , giving some additional room to vary the parameters of the argument by small powers of . Because of this, it is possible to modify the proof of Theorem 18 to conclude in this case that
in the regime for a sufficiently small . This is achieved by arguing as in this section, except that one allows the resolvent to be as large as rather than in order to keep the failure probability bounded by rather than . We omit the details. As a consequence, we can sharpen the conclusion of Theorem 8 to
when and matches moments with GUE to fourth order off the diagonal and second order on the diagonal.
Appendix A Local semicircle law
In this appendix we establish some preliminary local semicircle law estimates, following the treatment in and . As the methods used here are now standard, and the results very close to those in and , we shall be somewhat brief in our treatment.
We first recall a concentration estimate of Hanson and Wright .
for all and , and some independent of . Let be an matrix. Then for any , one has
outside of an event of probability .
See [16, Lemma B.1]. (Note that a factor of is missing from the statement of the exponential decay hypothesis in the lemma as stated in , which is needed in order to reduce to the case.) ∎
outside of an event of probability .
Apply the preceding proposition with (so ) and . ∎
We can also use Talagrand’s inequality as in , combining with a truncation argument (to bound each entries by some properly chosen quantity ). In the case when the atom variables have very fast decay (such as sub-gaussian) or bounded (such as Bernoulli), this calculation will actually lead to a decent bound on the value of in Theorem 8.
We can now establish a crude upper bound on the counting function of a Wigner matrix.
Let be a Wigner matrix obeying Condition C0, and let . Then for any interval , one has
outside of an event of probability .
Fix , which we write as . Suppose that
for some sufficiently large absolute constant to be chosen later. We will show that this leads to a contradiction outside of an event of probability .
On the other hand, we can write the Stieltjes transform in terms of the coefficients of the resolvent as
Thus, by the pigeonhole principle, we have
for some . By symmetry (and conceding a factor of in the failure probability estimates) we may take .
Now, a standard Schur complement computation (see e.g. [30, Lemma 42]) shows that
where is the resolvent corresponding to the matrix formed by removing the row and column from , is the bottom right entry of , and is the rightmost column of (after removing the bottom entry ). In particular, using the trivial bound , we conclude that
Now, by the Cauchy interlacing law, has consecutive eigenvalues in . There are possibilities for the starting and ending index of these eigenvalues. If we let be the space spanned by the corresponding eigenvectors, then , and from the spectral theorem we see that
outside of an event of probability . If is sufficiently large, the claim follows. ∎
This gives rise to a self-consistent equation:
Let be a Wigner matrix obeying Condition C0, and let . Then for any with and , and all , one has
outside of an event of probability . In particular, by the union bound, we have
outside of an event of probability .
We can assume that (say), as the claim is trivial otherwise. By symmetry, it will suffice to establish
outside of an event of probability . By (39), this statement is equivalent to
By Condition C0, one has outside of an event of probability , which is certainly acceptable; so our task is now to show that
outside of an event of probability .
From the Cauchy interlacing law (cf. [30, §5.2]) we know that
By Proposition 30 and the union bound, we may assume outside of an event of probability , one has
for all intervals of width at least centered at . By interlacing, we may also conclude
for such intervals. Inserting this bound into (42), we conclude that
If we then apply Proposition 27 with (say), using the hypothesis that (so that for any ) we conclude (41) outside of an event of order , as required. ∎
We can combine this proposition with a standard stability analysis of the self-consistent equation (40) to conclude a crude version of the local semicircle law:
Let be a Wigner matrix obeying Condition C0, and let . Then for any with and , and all , one has
outside of an event with probability .
We note that this corollary is essentially [17, Theorem 3.1]; in the statement of the result in the additional constraint for some constant is imposed, but this constraint is not actually used in the proof, at least if one is not concerned with obtaining the best possible bounds for the error terms. For the convenience of the reader, we sketch the proof of this corollary below.
As before we may assume that ; we may also assume that is large. By Proposition 31, we may assume that (40) holds.
Let us first dispose of the case when is large, say . In this case, the imaginary part of is at least , and hence by (40) one has ; inserting this back into (40) (and using (16)) one obtains (say). One can then deduce (44) from (40) (and (17)) by a routine application of the contraction mapping theorem.
Henceforth we assume that , so that . Then equation (40) already implies that , since (40) cannot hold if is too large. We may thus multiply out the denominator and conclude that
Since the two solutions to the quadratic equation are and , we conclude that
outside of an event with probability .
We apply this fact with replaced by an arbitrary complex numbers with and , and whose real and imaginary parts are multiples of (say). By the union bound, the probability of the failure event is still . We may then remove the latter hypotheses using the fact that and have Lipschitz constant in this region, and conclude that outside of an event of probability , one has
for all with and . On the other hand, if one has for some absolute constant , then the second possibility in (46) cannot occur for large enough, because necessarily has positive imaginary part. A continuity argument then shows that the first option in (46) holds for all in the indicated regionWhen approaches the edges of the spectrum, thus , the two options in (46) begin to overlap, but in that regime one can deduce the first option from the second (with a slightly worse error) and so the claim made in the text is still valid.. This gives (44). Among other things, this shows that (thanks to (17)), and then from (17) and the second part of Proposition 31 we obtain (45). ∎
For our applications, we will also need bounds on the coefficient norm
Let be a Wigner matrix obeying Condition C0, and let . Then for any with and , one has
outside of an event with probability .
Again, we may assume . By the union bound, it suffices to show for each that
outside of an event with probability . In the diagonal case , this follows directly from (45), so suppose that . In this case, we may use the Schur complement identity
where is the resolvent associated to the matrix formed by removing the row and column from , and is the quantity
outside of an event of probability . But by Proposition 27 (viewing the matrix as the upper-right block of a nilpotent matrix, and concatenating and together), one has
outside of an event of probability , for any . But by repeating the derivation of (43), one has
If one then sets , one obtains the claim. ∎
We remark that the above argument in fact shows that we may improve the bound to for any fixed ; compare with [17, Theorem 3.1]. However, this improvement is not used in this paper.