Local Circular Law for Random Matrices
Paul Bourgade, Horng-Tzer Yau, Jun Yin
Introduction
A considerable literature about random matrices focuses on Hermitian or symmetric matrices with independent entries. These models are paradigms for local eigenvalues statistics of many random Hamiltonians, as envisioned by Wigner. The study of non-Hermitian random matrices goes back to Ginibre, then in Princeton and motivated by Wigner. Ginibre’s viewpoint on the problem was described as follows [Gin1965]:
Apart from the intrinsic interest of the problem, one may hope that the methods and results will provide further insight in the cases of physical interest or suggest as yet lacking applications.
This phenomenon is the non-Hermitian counterpart of the semicircular law for Wigner random Hermitian matrices, and the quarter circular limit for Marchenko-Pastur random covariance matrices.
In the case of real Gaussian entries, the join distribution of the eigenvalues is more complicated but still integrable, allowing Edelman [Ede1997] to prove the limiting circular law as well; for more precise asymptotic properties of the real Ginibre ensemble, see [ForNag2007, Sin2007, BorSin2009]. We note also that the (right) eigenvalues of the quaternionic Ginibre ensemble were recently shown to converge to a (non-uniform) measure on the unit ball of the quaternions field [BenCha2011].
From this formula, it is clear that the small eigenvalues of the Hermitian matrix play a special role due to the logarithmic singularity at . The key question is to estimate the smallest eigenvalues of , or in other words, the smallest singular values of . This problem was not treated in [Gir1984], but the gap was remedied in a series of papers. First Bai [Bai1997] was able to treat the logarithmic singularity assuming bounded density and bounded high moments for the entries of the matrix (see also [BaiSil2006]). Lower bounds on the smallest singular values were given in Rudelson, Vershynin [Rud2008, RudVer2008], and subsequently Tao, Vu [TaoVu2008], Pan, Zhou [PanZho2010] and Götze, Tikhomirov [GotTik2010] weakened the moments and smoothness assumptions for the circular law, till the optimal assumption, under which the circular law was proved in [TaoVuKri2010].
The purpose of this paper is to prove a local version of the circular law, up to the optimal scale (see Section 2 for a precise statement). Below this scale, detailed local statistics will be important and that is beyond the scope of the current paper. The main tool of this paper is a detailed analysis of the self-consistent equations of the Green functions
Finally, we remark that the local circular law demonstrates that the eigenvalue distribution in the unit disk is extremely “uniform”. If the eigenvalues are distributed in the unit disk by a uniform statistics or any other statistics with summable decay of correlations, then there will be big holes or some clusterings of eigenvalues in the disk. While the usual circular law does not rule out these phenomena, the local law established in this paper does. This implies that the eigenvalue statistics cannot be any probability laws with summable decay of correlations
The local circular law
We first introduce some notations. Let be an matrix with independent centered entries of variance . The matrix elements can be either real or complex, but for the sake of simplicity we will consider real entries in this paper. Denote the eigenvalues of by , . We will use the following notion of stochastic domination which simplifies the presentation of the results and their proofs.
Let be family a random variables and be deterministic parameters. We say that is stochastically dominated by if for any and we have
for sufficiently large . We denote this stochastic domination property by
In this paper, we will assume that the probability distributions for the matrix elements have the uniform subexponential decay property, i.e.,
for some constant independent of . This condition can of course be weakened to an hypothesis of boundedness on sufficiently high moments, but the error estimates in the following Theorem would be weakened as well. We now state our local circular law, which holds up to the optimal scale .
Let be an matrix with independent centered entries of variance . Suppose that the probability distributions of the matrix elements satisfy the uniformly subexponentially decay condition (2.1). We assume that for some fixed , for any we have ( can depend on ). Let be a smooth non-negative function which may depend on , such that , and for , for some constant independent of . Let be the approximate delta function obtained from rescaling to the size order around . We denote by the unit disk. Then for any ,
Hermitization and local Green function estimate
In the following, we will use the notation
where is the identity operator. Let be the -th eigenvalue (in the increasing ordering) of . We will generally omit the dependence in these notations. Thanks to the Hermitization technique of Girko [Gir1984], the first step in proving the local circular law is to understand the local statistics of eigenvalues of , for strictly inside the unit circle. In this section, we first recall some well-known facts about the Stieltjes transform of the empirical measure of eigenvalues of . We then present the key estimate concerning the Green function of in almost optimal spectral windows. This result will be used later on to prove a local version of the circular law.
. Define the Green function of and its trace by
We will also need the following version of the Green function later on:
As we will see, with high probability converges to pointwise, as where is the unique solution of
with positive imaginary part (see Section 3 in [GotTik2010] for the existence and uniqueness of such a solution). The limit is the Stieltjes transform of a density and we have
whenever . The function is the limiting eigenvalue density of the matrix (cf. Lemmas 4.2 and 4.3 in [Bai1997]). Let
Note that has the same sign as . The following two propositions summarize the properties of and that we will need to understand the main results in this section. They will be proved in Appendix A. In the following, we use the notation when , where is independent of .
The limiting density is compactly supported and the following properties regarding hold.
The support of is .
As from below, the behavior of is given by
For any , if , then .
Near , the behavior of can be classified as follows.
If for some fixed , then and .
If for some fixed , then and .
All of the estimates in this proposition are uniform in , or for fixed .
The preceding Proposition implies that, uniformly in in any compact set,
Moreover, the following estimates on hold.
If for some fixed , then for in any compact set.
If for some fixed , then for in any compact set.
2 Concentration estimate of the Green function up to the optimal scale.
We now state precisely the estimate regarding the convergence of to . Since the matrix is symmetric, we will follow the approach of [ErdYauYin2010Adv]. We will use extensively the following definition of high probability events.
Let . We say that an -dependent event holds with -high probability if there is some constant such that
For , define the -dependent set
Suppose for some independent of . Then for any , there exists such that the following event holds with -high probability:
Moreover, the individual matrix elements of the Green function satisfy, with -high probability,
For , we have (see Proposition 3.1), so in this case we define .
There exists such that for any if and then the following properties concerning hold. All constants in the following estimates depend on .
and . We have
(Notice that there is no restriction on whether or not ). We have
, and . We have
Here Case 1 covers the regime where and is far away from . Case 2 concerns the regime that is near , while Case 3 is for is near the origin. Finally Case 4 is for not covered by the first three cases.
There exists such that for any , if and then the following properties concerning hold. All constants in the following estimates depend on . Recall from (3.2) that .
and . We have
and . We have
, and . We have
Here Case 1 covers the regime and is far away from . Case 2 concerns the regime and is far away from . Case 3 is for near . Finally Case 4 is for not covered by the first three cases.
The following lemma concerns the two cases covered in Lemmas 4.1 and 4.2, i.e., is either strictly inside or outside of the unit disk.
There exists such that for any if either the conditions and hold or the conditions , , hold, then we have the following three bounds concerning (all constants in the following estimates depend on ):
Proof of Theorem 2.2, local circular law in the bulk
Our main tool in this section will be Theorem 3.4, which critically uses the hypothesis : when is on the unit circle the self-consistent equation (which is a fixed point equation for the function see (6.21) later in this paper) becomes unstable
We follow Girko’s idea [Gir1984] of Hermitization, which can be reformulated as the following identity (see e.g. [GuiKriZei2009]): for any smooth
We will use the notation . Choosing defined in Theorem 2.2 and changing the variable to , we can rewrite the identity (5.1) as
Recall that ’s are the ordered eigenvalues of , and define as the classical location of , i.e.
Thanks to Proposition 3.1, one can check that uniformly in , and also in the domain (), for any we have
It is known, by Lemma 4.4 of [Bai1997], that
Combining (5.4) and (5.5), we have proved (2.2) provided that we can prove (5.3). To prove (5.3), we need the following rigidity estimate which is a consequence of Theorem 3.4.
Suppose for some independent of . Then for any , there exists such that the following event holds with -high probability: for any we have
First, with (3.5) and the definition (3.4), for any there exists such that
holds with with -high probability. It also implies that for ,
and define as the smallest positive solution of
To prove (5.6), we choose to be supported in such that if and , if . We now claim that
Combining (5.12) and (5.11), we have for any ,
which implies (5.6) with in (5.6) replaced by .
It remains to prove (5.12). Since and are real, with
using (3.5) and that on the support of is in .
For the second term in the r.h.s. of (5.13), with , (5.9) and (5.10), we obtain
We now integrate the third term in (5.13) by parts first in , then in (and use the Cauchy-Riemann equation ) so that
We therefore can bound the third term in (5.13) with absolute value by
where the last term can be bounded as the first term in r.h.s. of (5.13). By using (5.9) we have
where we used . Together with (5.14) and (5.15), we obtain (5.12) and complete the proof of (5.6).
Now we prove (5.7). Using (5.2) and Proposition 3.1, we have
Combining (5.18) with (5.6), we obtain (5.7).
For (5.8), the proof is similar to the above reasoning, but simpler: in this case for . For , is bounded as (5.17), and one can check if , Proposition 3.1, we have
We return to the proof of the local circular law, Theorem 2.2. We now only need to prove (5.3) from Lemma 5.1. From (5.7) and (5.8), we have
Notice that, for large enough , there is a constant such that for any we have
with probability larger than (for this elementary fact, one can for example see that the entries of are smaller that with probability greater than by the subexponential decay assumption (2.1) and then use ), so together with the above bounds on this proves that for any , there exists such that
with -high probability. Furthermore, one can see that or estimates hold uniformly for ’s in this region.
On the other hand, the following important Lemma 5.2 holds, concerning the smallest eigenvalue. It implies that
holds uniformly for in any fixed compact set. It is easy to check that for any , for large enough ,
Hence we can extend the summation in (5.19) to all , which gives (5.3) and completes the proof of Theorem 2.2.
Under the same assumptions of Theorem 2.2,
holds uniformly for in any fixed compact set.
where is a unit vector independent of . By conditioning on , the result of this lemma is straightforward since the matrix entries have a density. ∎
Weak local Green function estimate
In this section, we make a first step towards Theorem 3.4, with a weaker version of it, stated hereafter.
This theorem will be proved in the subsequent subsections.
By definition, . Since the eigenvalues of and are the same except the zero eigenvalue, it is easy to check that
For ( is allowed) we have
By the row-column reflection symmetry, we only need to prove those formulas involving . We first prove (6.4). In [ErdYauYin2010PTRF]-[ErdYauYin2010Adv], was proved a lemma concerning Green functions of matrices and their minors. This lemma is stated as Lemma B.2 in Appendix B. Let
We now prove (6.5). Recall the rank one perturbation formula
where is a row vector and is its Hermitian conjugate. Together with
By (6.3), (6.10) holds for as well. Similar arguments can be used to prove (6.6) for , and the general cases. This completes the proof of Lemma 6.3. ∎
The next step is to derive equations between the matrix and its minors. The main results are stated as the following Lemma 6.5. We first need the following definition.
By the row-column reflection symmetry, we only need to prove the part of this lemma. Furthermore, for simplicity, we prove the case , the general case can be proved in the same way.
We first prove (6.11). Let . Similarly to (6.7) and (6.8), we define and . Then using (B.2) and (6.9), we have
From the definition of , we have . Then
We now prove (6.12). As above, using now (B.3), we have
Then using (6.16) again, we obtain (6.12). ∎
2 The self-consistent equation and its stability.
We now derive the self-consistent equation for and its stability estimates. Following [ErdYauYin2010Adv], we introduce the following control parameter:
The quantity will be our controlling small parameter in this paper.
Suppose for some . Then there exists a small constant independent of such that if the estimate
holds for some on a set in the probability space of matrix elements for , then in the set we have with -high probability
By (4.15), (4.16) and (6.20), for the following inequalities hold on the set :
Furthermore, using (6.22), (4.15), (4.16), (6.20) and (3.1), we have in the set
Moreover, we have from (C.1) that with -high probability in
where we have used (6.22) and . Together with (6.23), we thus have with -high probability
Using this estimate, (6.6) and (6.29), we can estimate by
We can now use (6.32), (6.29) and (6.6) to estimate the right hand side of (6.11) such that
where and are bounded in (6.30) and (6.32) and is bounded by
In the last inequality, we have used (6.24) to bound and (4.15) for .
Summing over the index in (6.34), we have
Together with the assumption (6.20) on and (4.15) on the order of , this proves (6.21). ∎
Comparing (6.38) with (6.34), we have proved (6.37).
We will omit in the following argument.
We define for any sequence () the quantity
In application, we often use or . Define
The following lemma is our stability estimate for the equation . Notice that it is a deterministic result. It assumes that has a crude upper bound and then derives a more precise estimate on .
Suppose that, for a fixed with for some constant independent of , (6.20) and the estimate
The three upper bounds (i.e., the first inequalities in (6.42)-(6.44)) can be summarized as
By definition of (6.21), we have
By definition of , we can express and by
Case 1: In this case, we claim that the following estimates concerning and hold:
Since and are explicit functions of , equation (6.46) is just properties of the solution of the third order polynomial . We now give a sketch of the proof. Consider first the case . Then (6.46) follows from (4.15), (4.16), (4.9) and the definitions of and .
We now assume that . Clearly, , which gives (6.46) for . To prove , by definition of (3.1), we have . Thus we can rewrite as
By (4.15) and (4.17) (where ), we obtain (6.46).
We now prove (6.42) by contradiction. If (6.42) is violated then with we have
where is a large constant in the last inequality. By (6.41) and (4.15), . Thus we have
which is a contradiction provided that is large enough.
Case 2: . Note in this case . Then by (4.3) we have
where the last equation can be checked by direct computation and we used . There is a more intrinsic reason why the last equation for holds. Notice that is a point that the polynomial has a double root. Therefore, we have .
Notice that in the case is small enough, we can approximate by linearizing w.r.t. . Thus by the defining equation , we have
where we have used that , and, by (4.3), that . While we can also check the conclusion of (6.48) by direction computation, the current derivation provides a more intrinsic reason why it is correct.
Case 2a: Suppose (6.43) is violated. We first choose large enough so that in this regime. Then by (6.47) and (6.48), with , we have
which is a contradiction provided that is large enough. Here we have used that, by the restriction of and in (6.43) that , is large enough constant and .
Case 2b: Suppose (6.44) is violated. Similarly we have
which is a contradiction. Here we have used, by the restriction of and in (6.44) and is large enough constant, that . ∎
With a slighter strong condition on and an initial estimate when , the first inequalities in (6.42)-(6.44), i.e., (6.45), always hold. We state this as the following Corollary, which is a deterministic statement.
Suppose that the assumptions of Lemma 6.9 hold. If we have
Suppose that as decreases, we get to Case 2a. Notice that when we decrease , by the conditions on we will not go back to Case 1 from either Case 2a or Case 2b. For any with large, we have
Hence at the transition point from Case 1 to Case 2a, the inequality holds. Thus by continuity of , the bound in (6.44) holds until we leave Case 2a.
It is possible that we cross from Case 2a to Case 2b. At the transition point, we have and thus
for large. Hence the first inequality of Case 2b, i.e., holds. By continuity, this bound continues to hold unless we leave Case 2b. Since is decreasing in when is small, once we get to Case 2b, we will not go back to Case 2a (or Case 1 as explained before).
It is possible that the Case 2a is omitted and we get to Case 2b directly from Case 1. Notice that at such a transition point and we have . Furthermore, by (6.40), we get at the transition point. Putting these together, we have for large,
Hence the bound in (6.44) holds. ∎
3 The large η𝜂\eta case.
Our method to estimate the Green functions and the Stieltjes transform is to fix the energy and apply a continuity argument in by first showing that the crude bound in Lemma 6.9 holds for large . In order to start this scheme, we need to establish estimates on the Green functions when . This is the main focus of this subsection. We start with the following lemma which provide a crude bound on the Green functions.
For any and for fixed , we have the bound
for some . Notice that this bound is deterministic and is independent of the randomness.
The main result of this subsection is the following bound on .
For any and , we have
From (6.25)-(6.27), for we have
From (6.49), we have and . Hence the large deviation estimate (6.27) becomes, with -high probability,
By an argument similar to the one used in (6.51), we can estimate by
for any with -high probability. This implies that, with -high probability,
For any fixed, we claim that the following inequality between the real and imaginary parts of holds:
Assume that . From (6.53), we have . Together with ,
for some constant . This contradicts and we can thus assume that when and . In this case, we also have
Then (6.52) implies for any that with -high probability
Summing up all , we have the following equation for with -high probability:
We can rewrite this equation into the following form:
It can be checked (with computer calculation or rather complicated but elementary algebraic calculation) that for and , the third order polynomial has no double root and there is only one root with positive real part. We denote this root by and the other two roots by and . For and for any fixed, the three roots are separate by order one due to compactness. Since there is no double root, we have whenever and . Thus the stability of (6.54) is trivial and we have proved that in this range of parameters
for any with -high probability. ∎
4 Proof of the weak local Green function estimates.
In this subsection, we finish the proof of Theorem 6.1. We fix an energy and we will decrease the imaginary part of . Recall all stability results are based on assumption (6.20), i.e., for some small constant , which so far was established only for large in (6.50). We would like to know that this condition continue to hold for smaller . More precisely, suppose that (6.20) holds in a set for all with where satisfies
for all for all . Since is continuous in at a scale, say, , (6.56) holds for all with -high probability in . Hence for satisfying (6.55) the estimate (6.41) holds with
With this choice, we can check that the assumption on , (6.40), holds as well. Furthermore is decreasing in when is small enough. By Corollary 6.10, (6.45) holds all .
For for some , if then and (6.45) implies
If for some then
By definition of , (6.58) and , we have
Using the restriction on so that , we have
With (6.57) and (6.59), we have thus proved that
To conclude Theorem 6.1, it remains to prove the estimate on the off-diagonal elements. Recall the identity (6.12) for and the equations (C.3) and (C.4). We can estimate the off-diagonal Green function by
Here we have used , which follows from (6.36), and
where we have used (C.4) and that, by definition, . Therefore, we have with -high probability,
where we also used . Together with (6.61) and (6.36), we have proved that with -high probability
Proof of the strong local Green function estimates
Lemma 6.7 provides an error estimate to the self-consistent equation of linearly in . The following Lemma improves this estimate to quadratic in . This is the key improvement leading to a proof of the strong local Green function estimates, i.e., Theorem 3.4.
For any , there exists such that the following statement holds. Suppose for some deterministic number (which can depend on ) we have
Notice that the probability deteriorates in the exponent by a factor.
We remark that, by Lemma 4.1, when . Hence we have to track the dependence of carefully in the previous Lemma. This is one major difference between the weak and strong local Green function estimates. Similar phenomena occur for the Stieltjes transforms of the eigenvalue distributions of Wigner matrices. Lemma 7.1 will be proved later in this section; we now use it to prove Theorem 3.4. We first give a heuristic argument.
Suppose that we have the estimate (7.2) with replaced by . We assume for convenience so that (If this assumption is violated then then (3.5) holds automatically and we have nothing to prove). Then we can apply Corollary 6.10 by choosing
which implies (6.45). Consider first the case . Using (6.45) with the choice of in (7.3) and , we have
When satisfies the condition (6.55), the coefficient of on the right side of the last equation is smaller than . Hence, using (see Proposition 3.2), we have
We now consider the case and thus . From the first inequality of (6.45), we have
Also, in the regime , (4.7) asserts that
Using the choice of in (7.3), we have
where we have used (7.4) to absorb the last term involving in the last inequality with a change of constant . This completes the heuristic proof of Theorem 3.4. We now give a formal proof of this theorem assuming Lemma 7.1.
We first prove (3.6) assuming (3.5). By (6.63) and the definition of , we have for ,
where we have used (3.5) in the last step. This proves (3.6).
holds with the probability larger than . Notice that the application of Lemma 7.1 causes the probability in the exponent to deteriorate by a factor.
Using (7.6), we can apply Corollary 6.10 with
holds with the probability larger than . We have thus proved (3.5) provided that .
holds with probability larger than . Here depends only on . From the definition of and , we have
holds with the probability larger than for some . Notice that we have used in the last step in (7.8).
holds with the probability larger than . Notice that the last constant is the same as the one appears in (7.8) and it does not change in the iteration procedure. We now iterate this process times to have
holds with the probability larger than . We need so large that
On the other hand, we need small enough so that
We note that it also guarantees (7.1), since . We choose and we have thus proved that
with the probability larger than which implies (3.5) when . This completes the proof of Theorem 3.4. ∎
The first step in proving Lemma 7.1 is to derive a second order self-consistent equation which identifies the first order dependence of the correction in the self-consistent equation derived in Lemma 6.7. The second error terms will be bounded by ; the first order terms are of the forms of averages of and . In Lemma 7.3, the averages of and will be estimated by . This improvement from the naive order to is the key ingredient to obtain the strong local law. We remark that when . Hence the dependence of verses has to be tracked carefully. We now state the second order self-consistent equation: as the following lemma.
We first take the inverse of both sides of (6.33) and sum up to get, with -high probability,
where we have used (6.30) and the bound (6.22). Recall the estimates of and by in (6.27) and (6.32). Hence we have
where and is defined in Lemma C.1. We now perform the expansion to have
Using this approximation in (7.13), we have
The diagonal element can be estimated by (7.14) so that
Notice that only the imaginary part of appears through instead of which can be much bigger near the spectral edge.
We now estimate the last term in (7.16). Notice that is the Green function of the matrix where . Then is the Green function of where we have used . Thus we can apply (7.17) (which holds for matrices of the form with A not necessarily a square matrix) to get
Inserting (7.18) and (7.19) into (7.15), we obtain
To conclude Lemma 7.2, we choose and it remains to prove . By definition of and the fact that (4.15), this inequality follows from the following property of :
This estimate on is a direct consequence of (4.2), (4.7), (4.9) and (4.10). This completes the proof of Lemma 7.2 ( with increasing by 1).
We now estimate the averages and . Our goal is to catch cancellation effects due to the average over the indices . This is the content of the next lemma, to be proved in next subsection. Clearly this lemma completes the proof of Lemma 7.1.
For any , there exists such that the following statement holds. Suppose for some deterministic number (which can depend on ) we have
where is defined in (7.2).
2 Strong bounds on [Z]delimited-[]𝑍[Z].
In this subsection, we prove Lemma 7.3. The main tool is the abstract cancellation Lemma D.1.
We first perform a cutoff for all random variables in so that . Due to the subexponential decay assumption, the probability of the complement of this event is , which is negligible.
Define and as the operator for the expectation value w.r.t. the -th row and -th column. Let
With this convention and Lemma 6.5, we can rewrite and , from Definition 6.4, as
Choosing , one can see that (7.21) follows from (7.20), (7.30) and the Markov inequality.
It remains to prove (7.28) and (7.29). We prove (7.28) first. For simplicity, we assume that . Denote the first column of by so that is a matrix. Similarly, denote by the matrix obtained after removing the first -columns of . Then we have the identity
Recall the identity (6.16): for any matrix ,
We will prove with high probability. Using (3.1), (7.24) and (6.6), we have
With (7.31) and the definition of , we have for . Therefore,
Then, together with (7.32), (7.24) and , we have thus proved that, in ,
where we used and is a linear combination of the following products of ’s
Define as the probability space for the columns and the one for the columns . Then the full probability space equals to . Define to be the projection onto and . Then is independent of . Hence we can extend (7.35) to
By (7.33), in . We now prove that
By (7.22), we have . Notice that is independent of . Since in , the same asymptotic holds in . By definitions of (7.33) and , and the assumption , we obtain (7.36) and this completes the proof of (7.28). Similarly, we can prove (7.29) and this completes the proof of Lemma 7.3.
In this appendix we are going to prove the lemma 4.1, 4.2 and 4.3. We can solve explicitly by the following formula.
By definition, is an analytic function, so we only need to prove (A.1). By definition, is one of the three solutions of (3.1), and needs to have positive imaginary part. Solving explicitly this degree three polynomial equation proves that there is just one such solution, with the limit A.1 close to the critical axis. ∎
With Lemma A.1 and (A.2), one can easily prove Proposition 3.1.
Moreover, recall that , so (still in the first case)
We also have easily easily from (A.3), we therefore obtained the l.h.s. of (4.2). Similarly, one can prove thanks to
and complete the proof for the first case.
For the second case, it is easy to prove (4.3) when , as we did from an explicit calculation. Then one obtains (4.3) by expanding around , using (3.1). The estimate (4.7) directly follows from (4.3).
Similarly, for the third case, first , i.e., when , then one can easily obtain (4.8) in case 3 by solving (3.1) with expanding around . The estimate (4.9) directly follows from (4.8). The fourth case follows from
and the properties of stated in proposition 3.1. ∎
This is similar to the proof of Lemma 4.1. ∎
We are going to prove this lemma in the case , the other cases can be proved similarly. Note first that (4.15) is a consequence of all possible cases in Lemma 4.1.
We now prove (4.16) in the four different cases, which have been classified in Lemma 4.1. In the first case, if additionally , as , the l.h.s. in (4.16) is bounded by , which implies (4.16). For the first case if is small enough, since and , so
which gives (4.16) in the first case. In the same way we get (4.16) in the second case, where . For the third case, using (4.8), one can easily prove (4.16). Finally, the fourth case is simple since the l.h.s. in (4.16) is clearly .
We now prove (4.17). Using (4.9) and (4.10), ( is a real number) we have that, in the cases three and four,
Note . For case one, with (A.4), it is easy to prove that either or . It implies that . This completes the proof. ∎
Appendix B Perturbation theorem
In this section, we introduce the theorem on the relations between the Green function of the matrix and the Green function of the minor of the matrix. This theorem was proved in [ErdYauYin2010PTRF]. We first introduce some notations (here we use instead of in [ErdYauYin2010PTRF], since upper index has been used in the main part of the paper).
The following formulas were proved in Lemma 4.2 from [ErdYauYin2010PTRF].
Appendix C Large deviation estimates.
In order to obtain the self-consistent equations for the Green functions, we needed the following large deviation estimate.
We first recall the following large deviation estimates concerning independent random variables, which were proved in Appendix B of [ErdYauYin2010PTRF].
Let () be independent complex random variables with mean zero, variance and having a uniform subexponential decay
for any sufficiently large , where depends on .
We will only prove the assertion of this lemma concerning the Green function . Similar statement for can be proved with the row-column symmetry. From now on, we will only prove all statements concerning if identical proofs are valid for and we will not repeat this comment.
with -high probability. Similarly, with (C.5), the second term on the right hand side is bounded by
The proofs for the other bounds follow from similar arguments. ∎
Appendix D Abstract decoupling lemma
We recall an abstract cancellation Lemma proved in [PilYin2011].
Let be a finite set which may depend on and
Let be random variables which depend on the independent random variables . In application, we often take and .
Let be an even integer Suppose for some constants , there is a set (the "good configurations") so that the following assumptions hold:
(Bound on in ). There exist deterministic positive numbers and such that for any set with and , in can be written as the sum of two random variables
Then, under the assumptions (i) – (iii), we have
for some and any sufficiently large .
Roughly speaking, this lemma increase the estimate of from to after averaging over .