Delocalization and Diffusion Profile for Random Band Matrices
Laszlo Erdos, Antti Knowles, Horng-Tzer Yau, Jun Yin
Introduction
Typically, is a mesoscopic scale, larger than the lattice spacing but smaller than the diameter of the system: . These models are natural interpolations between random Schrödinger operators with short range quantum transitions such as the Anderson model And and mean-field random matrices such as Wigner matrices Wig . In particular, random band matrices may be used to model the Anderson metal-insulator phase transition, which we briefly outline.
The analysis of the trace of the single Green function yields the limiting spectral density of which is the Wigner semicircle law provided the band width diverges as . For band matrices the semicircle law on large scales, corresponding to spectral parameter independent of , was given in MPK . More recently, a semicircle law on small scales, in which , was derived in EYY1 and generalized in EKYY4 . The results of EYY1 ; EKYY4 are summarized in Lemma 3.4 below. As an application of our method, we prove a further improvement of the semiricle law in Theorem 2.2 below.
The main new ingredient in this paper is the self-consistent equation for the matrix , whose entries
are local averages of . We show in Theorem 4.1 below that satisfies a self-consistent equation of the form
where is the matrix of second moments of (see (8.1) below). In order to give the leading-order behaviour of , we use (see (3.5) below), where
Therefore the Fourier transform of is approximately given by
in the regime and . This corresponds to the diffusion approximation on scales larger than with an effective diffusion constant . In the language of diagrammatic perturbation theory, the change from to has the interpretation of a self-energy renormalization. This result coincides with Equation (1.5.5) of Sp , which was obtained by computing the sum of ladder diagrams in a high-moment expansion.
The main result of this paper is a justification of this heuristic argument in a certain range of parameters. The error term contains fluctuations of local averages. Roughly speaking, we need to control the size of \sum_{x}\big{[}|G_{xy}|^{2}-P_{x}|G_{xy}|^{2}\big{]}, where denotes partial expectation with respect to the matrix entries in the -th row (see in (4.5) below). Unfortunately, and for are not independent; in fact they are strongly correlated for small , and they do not behave like independent random variables. Estimating high moments of these averages requires an unwrapping of the hierarchical correlation structure among several resolvent matrix entries. The necessary estimates are quite involved. They are a special case of the more general Fluctuation Averaging Theorem that is published separately EKY2 , and was originally developed for application in the current paper. There have been several previous results in this direction; see (EYY2, , Lemma 5.2), (EYY3, , Lemma 4.1), (EKYY1, , Theorem 5.6), and (PY, , Theorem 3.2). The Fluctuation Averaging Theorem generalizes these ideas to arbitrary monomials of and exploits an additional cancellation mechanism in averages of that is not present in averages of . For more details, see EKY2 .
Formulation of the results
for some fixed . The parameter is the fundamental large quantity of our model. Define the -dimensional discrete torus
where is a normalization constant chosen so that is a stochastic matrix:
In particular, we may consider the two classical symmetry classes of random matrices: real symmetric and complex Hermitian. For real symmetric band matrices we assume
For complex Hermitian band matrices we assume
in addition to (2.5). A common way to satisfy (2.9) is to choose the real and imaginary parts of to be independent with identical variance. As in EKY2 , our results also hold without this assumption, but we omit the details of this generalization to avoid needless complications.
From the definition of it is easy to see that . In particular,
The following definition introduces a notion of a high-probability bound that is suited for our purposes.
for large enough . Unless stated otherwise, throughout this paper the stochastic domination will always be uniform in all parameters apart from the parameter in (2.1) and the sequence of constants in (2.11); thus, also depends on and . If is stochastically dominated by , uniformly in , we use the equivalent notations
For example, using Chebyshev’s inequality and (2.11) one easily finds that
so that we may also write . The relation satisfies the familiar algebraic rules of order relations. The general statements are formulated later in Lemma 3.3.
We remark that Definition 2.1 is tailored to the assumption that (2.11) holds for any . If (2.11) only holds for some large but fixed then all of our results still hold, but in a somewhat weaker sense. Indeed, the control of the exceptional events in our theorems is expressed via the relation . If only finitely many moments are assumed to be finite in (2.11), then the exponents and in the definition of cannot be chosen to be arbitrary, and will in fact depend on . Repeating our arguments under this weaker assumption would require us to follow all of these exponents through the entire proof. Our assumption that (2.11) holds for any streamlines our statements and proofs, by avoiding the need to keep track of the precise values of these parameters.
Throughout the following we make use of a spectral parameter
We choose and fix two arbitrary (small) global constants and . All of our estimates will depend on and , and we shall often omit the explicit mention of this dependence. Set
We introduce the Stieltjes transform of Wigner’s semicircle law, defined by
It is well known that the Stieltjes transform is characterized by the unique solution of
with for . Thus we have
To avoid confusion, we remark that the Stieltjes transform was denoted by in the papers ESY1 ; ESY2 ; ESY3 ; ESY4 ; ESY5 ; ESY6 ; ESY7 ; ESYY ; EYY1 ; EYY2 ; EYY3 ; EKYY1 ; EKYY2 , in which had a different meaning from (2.14).
and denote its entries by . In the following sections we list our main results on the resolvent matrix entries.
We conclude this section by introducing some notation that will be used throughout the paper. We use to denote a generic large positive constant, which may depend on some fixed parameters and whose value may change from one expression to the next. Similarly, we use to denote a generic small positive constant. For two positive quantities and we sometimes use the notation to mean . Moreover, we use to mean that there exists a constant such that ; we also use to denote . (Note that these latter conventions are nonstandard.) Finally, we introduce the Japanese bracket . Most quantities in this paper depend on the spectral parameter , which we however mostly omit from the notation.
For simplicity, here we state our main results assuming that and that satisfies the decay condition
The generalization of our results to and slowly decaying is straightforward, and will be given in Section 8. We emphasize that the core of our argument, given in Sections 3–5, is valid in general, independent of the dimension.
2. Improved local semicircle law for resolvent entries and delocalization
Throughout this section we assume and (2.17). The Wigner semicircle law states that the normalized trace, , is asymptotically given by . In fact, this asymptotics holds even for individual matrix entries. Our first theorem controls the (-dependent) random variable
For the following we introduce the deterministic control parameter through
Assume and (2.17). Suppose moreover that
Clearly, the assumption can be replaced with the stronger assumption . The assumption is technical; to see why it is needed, see (6.3) in the proof of Theorem 2.2 below. In the regime (2.19), Theorem 2.2 improves the earlier result
proved in EYY1 (see Lemma 3.4 below). In fact, the estimate (2.20) is optimal, as may be seen from (2.38) and the first estimate of (2.30) below. By spectral decomposition of one easily finds that
Thus, in the regime where is bounded, the average of is of order . Here we introduced the notation , which we shall use throughout the following.
The bound (2.20) implies an estimate on the Stieltjes transform of the empirical spectral density, . Under the assumptions of Theorem 2.2 and the conditions (2.19), we have
we leave the details to the reader. We remark that (2.23) is the simplest form of the fluctuation averaging mechanism (see Section 3.1). A concise proof of (2.23) can be found in (EKYY4, , Theorem 4.6).
For we have , and the bound (2.20) therefore shows that all off-diagonal entries of have a magnitude comparable with the average of their magnitudes. We say that the resolvent is completely delocalized. Complete delocalization of the resolvent implies that the eigenvectors are completely delocalized in a weak sense. The precise formulation is given in Proposition 7.1 below. By choosing such that and invoking Proposition 7.1 we obtain the following corollary.
Assume and (2.17). If then the eigenvectors of are completely delocalized in the sense of Proposition 7.1 below.
This corollary improves the result in EK1 ; EK2 , where complete eigenvector delocalization (in a slightly weaker sense; see Remark 2.7 below) was proved under the condition . It was observed in Section 11 of EK1 that the graphical perturbative renormalization scheme of EK1 ; EK2 faces a fundamental barrier at . The reason for this barrier is that a large family of graphs whose contribution was subleading for in fact yield a leading-order contribution for if estimated individually. The cancellation mechanism among these subleading graphs has so far not been identified. As evidenced by Corollary 2.4, our present approach goes beyond this barrier.
3. Diffusion profile
Note that the matrix solves the equation
which is obtained from (1.1) by dropping the error term . Clearly, is translation invariant, i.e. with . Moreover, for all . Indeed, this follows immediately from the geometric series representation
which converges by (see (3.6) below) and the trivial bound , as follows from (2.3).
(We normalize by to account for the fact that the distribution has variance .) It is easy to see that
a precise computation is given in (5.2) below.
Note that is not symmetric, but our results also hold for replaced with the quantities or .
Assume and (2.17). Suppose that and . Then
Note that the total mass of the distribution may be computed explicitly by spectral decomposition of : assuming we have
in agreement with the corresponding statement (2.28) for the deterministic limiting profile.
We expect that (2.30) should in fact hold under the weaker conditions and . The improved local semicircle law (2.20) should also hold under these weaker conditions. In particular, this would imply complete delocalization of the eigenvectors for all . One obstacle is that a non-trivial control on in the regime is difficult to obtain.
The resolvent is controlled for (instead of ).
The control on the profile is pointwise in and (instead of in a weak sense on the scale ).
The estimates hold with high probability (instead of in expectation).
However, the result in the current paper is not uniform in , unlike that of EK1 ; EK2 .
We conclude this section with an asymptotic result on the deterministic profile . Since we are interested in large values of , we need to consider the small-momentum behaviour of the Fourier transform of . Using the small- expansion (1.2) and (1.4), we therefore find that , where we defined the -periodic function
Moreover, if and , we have the sharp upper bound .
where in the last step we used the elementary identities (3.3) and (3.5) below. In fact, the calculation (2.39) is a mere consistency check (to leading order) since ; see (5.2) below. We conclude that the average height of the profile is of order . The peak of the exponential profile has height of order , which dominates over the average height if and only if . The regime corresponds to the regime where is sufficiently large that the complete delocalization has not taken place, and the profile is mostly concentrated in the region .
These scenarios are best understood in a dynamical picture in which is decreased down from . The ensuing dynamics of corresponds to the diffusion approximation, where the quantum problem is replaced with a random walk of step-size of order . On a configuration space consisting of sites, such a random walk will reach an equilibrium beyond time scales . As observed in Remark 2.7, plays the role of time , so that in this dynamical picture equilibrium is reached for . Figure 1 illustrates this diffusive spreading of the profile for different values of .
4. Delocalization with a small mean-field component
In this section we continue to assume and (2.17). We now consider a related model
The effect of adding a small Wigner component of size is that the imaginary part of the spectral parameter effectively increases from to in the local semicircle law and in the diffusion approximation. In particular, we can eliminate the condition and still obtain delocalization for provided is not too small. These results are summarized in the following theorem. In order to state it, we introduce the control parameter
which is analogous to defined in (2.18).
Suppose that . Moreover, suppose that or . Then
Suppose that and
Then the resolvent is completely delocalized:
If then the eigenvectors of are completely delocalized in the sense of Proposition 7.1.
This theorem formulates only the bounds concerning delocalization, i.e. the counterparts of Theorem 2.2 and Corollary 2.4. Similarly to Theorem 2.5, a non-trivial profile can be proved for the average of . The profile is visible in the regime , and it is given by
where the approximation is valid in the regime . The details of the precise formulation and the proof are left to the reader.
Preliminaries
In this subsection we introduce some further notations and collect some basic facts that will be used throughout the paper. Throughout this section we work in the general -dimensional setting of Section 2.1.
For we define by
Moreover, we define the resolvent of through
Let be a random variable. For define the operations and through
We call partial expectation in the index . Moreover, we say that is independent of if for all .
Suppose that uniformly in and . If for some constant then
Suppose that uniformly in and uniformly in . Then
The claims (i) and (ii) follow from a simple union bound. The claim (iii) follows from Chebyshev’s inequality, using a high-moment estimate combined with Jensen’s inequality for partial expectation. We omit the details. ∎
Note that if for any and we have
for large enough (depending on and ) then by Chebyshev’s inequality. Moreover, if almost surely, then . Hence describes a larger class of random variables than .
We need the following bound on .
Away from the spectral edges, i.e. for , this bound was proved in Proposition 3.3 of EYY1 . In EYY1 , the matrix entries were assumed to have at most subexponential tails (a stronger assumption than (2.11) for all ), but the proof of EYY1 extends trivially to our case. See EKYY4 for a simplified and generalized alternative proof.
The following result collects some elementary facts about .
The identity (3.3) follows by taking the imaginary part of (2.15). The estimate (3.4) was proved in EYY2 , Lemma 4.2. From (2.16) we find , from which (3.5) follows easily using (3.3). Finally, (3.6) follows from Lemma 4.2 in EYY2 combined with (3.3) and (3.4). ∎
The following resolvent identities form the backbone of all of our proofs. They first appeared in (EYY1, , Lemmas 4.1 and 4.2) and (EKYY2, , Lemma 6.10). The idea behind them is that a resolvent entry depends strongly on the -th and -th columns of , but weakly on all other columns. The first set of identities (called Family A) determine how to make a resolvent entry independent of an additional index . The second set (Family B) identities express the dependence of a resolvent entry on the entries in the -th or in the -th column of .
For any Hermitian matrix and the following identities hold.
For and we have
For satisfying we have
The deterministic control parameter is admissible if
A typical example of an admissible control parameter is
If is admissible then the lower bound in (3.9) together with (2.12) ensure that .
The following lemma gives an expansion formula for the diagonal entries of .
Suppose that for some admissible . Defining
The claim is an immediate consequence of Equations (9.1) and (9.2) in EKY2 . (Related but less explicit formulas were also obtained in EYY3 ). ∎
In this section we collect the necessary results from EKY2 . The following proposition is a special case of the Fluctuation Averaging Theorem of EKY2 .
Suppose that for some admissible control parameter . Then
All of these estimates follow immediately from Theorem 4.8, Lemma B.1, and Proposition B.2 of EKY2 , recalling that by assumption by (3.6). ∎
The important quantity on the right-hand sides of (3.12), (3.13) and (3.14) is . The additional factors are a technicalThis nuisance is necessary, however, and Proposition 3.9 would be false without the factors of . See (EKY2, , Remark 4.10). nuisance, but their precise form will play some role in the large- regime, where is not negligible compared to .
To interpret these estimates, we note that each summand in (3.12), (3.13), and (3.14) has a naive size given by , where is the number of off-diagonal resolvent entries in the summand. Without averaging, this naive size would be a sharp upper bound. In the second estimate in (3.12) the averaging does not improve the bound since is positive. In all other estimates, the monomial on the left-hand side either has a nontrivial phase or its expectation is zero thanks to . Proposition 3.9 asserts that in these cases the averaged quantity is smaller than its individual summands. Note that this averaging of fluctuations is effective even though the entries of may be strongly correlated. How many additional factors of one gains depends on the structure of the left-hand side in a subtle way; see Theorem 4.8 of EKY2 for the precise statement. For the applications in this paper the second bound in (3.13) is especially important; here the averaging yields a gain of two extra factors of .
We remark that all these bounds also hold if the weight functions are replaced with a more general weight function. The precise definition is given in Definition 4.4 of EKY2 . All the weights used in this paper satisfy Definition 4.4 of EKY2 .
We also note that averaging in indices can be replaced by expectations. We shall need the following special case of Theorem 4.15 of EKY2 .
Suppose that for some admissible control parameter . Then for
Self-consistent equation for T𝑇T
After these preparations, we now move on to the main arguments of this paper. Throughout this section we work in the general -dimensional setting of Section 2.1. In this section we derive a self-consistent equation for , given in Theorem 4.1, whose error terms are controlled precisely using the fluctuation averaging from Proposition 3.9. In Section 5 we solve this self-consistent equation; the result is given in Proposition 5.1.
Suppose that for some admissible control parameter . Then we have
where the matrix entries of the error satisfy
The naive size of is of order . Notice that the error term in the self-consistent equation (4.2) is smaller by two orders. This improvement is essentially due to second estimate of (3.13).
Instead of averaging in the first index of the resolvent in the definition of (2.29), we could have averaged in the second, resulting in the quantity . Then satisfies the self-consistent equation
where also satisfies (4.3).
Before the proof we mention that this result also gives a self-consistent equation for the two-sided averaged quantity
Taking the average of (4.1), we get the following corollary.
Suppose that for some admissible control parameter . Then we have
where and each satisfy (4.3).
The rest of this section is devoted to the proof of Theorem 4.1. We begin by writing
Then by the second formula in (3.13), we have
Notice that (3.13) applies only to the summands in (4.5). The estimate for the summand follows from
where we used that (see (3.11)) and that is admissible, and in particular .
We shall compute up to error terms of order . We have the following result.
Suppose that for some admissible control parameter . Then
(It is possible to improve the last error term in (4.7), but we shall not need this.) Before proving Lemma 4.4, we show how it implies Theorem 4.1.
Equation (4.1) is an immediate consequence of (4.8), (4.6), and (4.5). Hence Theorem 4.1 follows from Lemma 4.4. ∎
Throughout the following we shall repeatedly need the simple estimate
where the first step follows from , the second from the fact that is admissible, and the last from (3.4). In particular, for , from (3.7) we get the estimate
We start the proof of Lemma 4.4 with the case . Using (3.11) we get
where in the last step we used and the large deviation bound (see Lemma B.2)
We may now compute the contribution of the main term in (4.11) to . Still assuming , we find
In the third step we used (4.9), and in the last step we added the missing term to obtain ; the resulting error term is since . Next, using (4.9) we get
In the second step, using (3.7) and (4.9), we inserted an upper index as a preparation to taking the partial expectation . We obtain
Now we take the partial expectation in in (4.15). Using that
by Proposition 3.10 and (4.10), we find that applied to the second term in (4.15) results in a quantity O_{\prec}\big{(}\Psi^{2}(\Psi+M^{-1/4})^{2}\big{)}. Thus the contribution of main term in (4.11) to is
Next, we look at the contribution of the term with a in (4.11):
Now we remove the upper indices at the expense of an error of size , and then add back the exceptional summation index as before. This gives
where in the second step we used (3.14); the various cases of coinciding indices are easily dealt with using the bound .
As remarked above, in the real symmetric case (2.8) the pairing , is also possible. This gives rise to the additional error term
Combining (4.11), (4.16) and (4.17) yields
for . This proves (4.7) for the case .
Here we used that and that by (3.11). It is possible to compute this term to high order in , but we shall not need this.
For the proof of (4.8) we run almost the same argument as above but now we aim at removing all upper indices . We first consider the summands . From (4.15) we get
where we removed the upper index using (3.7), and included the summand at the expense of a negligible error term. Taking the average of the second term on the right-hand side yields
In the first step we just added the exceptional index , and estimated the additional terms with using as well as . In the second step we used (3.14). Note that the gain comes from the summation index .
Thus the contribution of the main term of (4.11) to is
The contributions of the error terms in (4.11) to are of order O_{\prec}\bigl{(}{\Psi^{4}+\Psi^{2}M^{-1/2}}\bigr{)}; this is true even without averaging (see (4.17)). Thus we have
Finally, we consider the case . From (4.20) we get
This formula provides the missing summands in (4.24) and hence yields (4.8). ∎
Solving the equation for T𝑇T
Thus, the entries of are all equal to , and since is stochastic by (2.3). The complementary projection is denoted by .
We perform this splitting on only in the coordinate, regarding as fixed. Thus, we split
here the last step follows easily by spectral decomposition of . We can use the local semicircle law, Lemma 3.4, to get
It is instructive to perform the same averaging with the deterministic profile :
Having dealt with the component in (5.1), we devote the rest of this section to the component . The following proposition contains the main result of this section.
Suppose that for some admissible control parameter . Then we have for all
Multiplying (4.2) by from the left yields
where we used that . Therefore
Note that . Using (5.6) we therefore get (5.3) whose error term satisfies
This completes the proof of (5.3) and (5.4). ∎
Next, we estimate in terms of . In other words, we derive pointwise estimates on from estimates on the averaged quantity . This gives rise to an improved bound on , which we may plug back into Proposition 5.1. Thus we get a self-improving scheme which may be iterated.
Suppose that with some admissible control parameter and for a family of admissible control parameters indexed by a pair (see Definition 3.7). Then
(Here we write .)
We fix the index throughout the proof. Let first . Then (3.8) gives
We shall use the large deviation bounds from Theorem B.1 to estimate the sum. For that we shall need a bound on
where in the first step we used (3.7) and (4.9). Since , we get from (5.9) and Theorem B.1 (i) that
To estimate , we use (3.11) to get
where in the second step we used Theorem B.1 (i) and (ii), with the bounds and
This last estimate follows along the lines of (5.10), whereby the error terms resulting from the removal of the upper indices are estimated by Cauchy-Schwarz; we omit the details. Finally can be absorbed into by admissibility of . ∎
We may now combine Proposition 5.1 and Lemma 5.3 in an iterative self-improving scheme, which results in an improved bound on .
Suppose that and for all and , where and are admissible control parameters. Then
We apply Lemma 5.3 to the constant control parameter for each . Thus, suppose that for all , Lemma 5.3 yields
Now we can iterate this estimate, taking the role of in controlling . Thus after one iteration we get
After iterations we get . Since and are admissible, we have for . This completes the proof. ∎
First we show that for large enough the Euclidean matrix norm satisfies
with some positive constant depending on the profile . Since the matrix entries are translation invariant (see (2.2)), it is sufficient to compute its Fourier transform as defined in (5.13). Using the property , the fact that , and Plancherel’s identity, we find
The last step follows easily from (recall (2.4)) and the representation
where in the second step we used , and in the last step .
From (3.6) we get , which, combined with (5.15), yields
In order to prove (5.6), we first observe that as follows from the estimate
Delocalization bounds
In this section we prove our main results – Theorems 2.2, 2.5, and 2.11. We return to the one-dimensional case, , and continue to assume (2.17). In particular, we write instead of . The simple extension to higher dimensions is given in Section 8.
Suppose that for some admissible control parameter . Then (5.3) together with (5.4), (5.1), and (2.38) yield
Recalling Corollary 5.4, we have therefore proved
i.e. the upper bound can be replaced with the stronger bound (6.2).
We can now iterate (6.2), exactly as in the proof of Corollary 5.4. We start the iteration with ; see Lemma 3.4. Explicitly, the iteration reads
From (6.2) and Lemma 3.4 we get that for any fixed .
In order perform the iteration, we require
Thus we get the conditions and . (Here we used (2.1)). Satisfying these two conditions is the reason we need to impose the restriction on in Theorem 2.2, Corollary 2.4, and Theorem 2.5. Using (6.3) and the fact that is by definition admissible, it is now easy to see that there is a finite constant , which depends on the implicit constants in and above, such that . This concludes the proof of Theorem 2.2.
2. Delocalization with profile: proof of Theorem 2.5
By assumption we have , so that in particular . Note that this is admissible. From (2.20) we get . Now observe that for all and , as well as
by (3.3) and the property . Thus (5.3) together with (5.4) and (5.1) implies the first estimate of (2.30), since in the regime and the error term (5.4) is bounded by
The second estimate of (2.30) follows from the first one and (4.7).
Next, (2.31) follows by using (2.33) in (2.30).
Finally, using Lemma 5.3 with and , we obtain
Here we used that can be absorbed into and in the last summation can be absorbed into . This proves (2.32), and hence concludes the proof of Theorem 2.5.
3. Delocalization with a small mean-field component: proof of Theorem 2.11
with some positive constant . This implies that (5.5) and (5.6) can be improved to
Suppose now that for some admissible control parameter . Then the statement of Proposition 5.1 is modified to
Notice that the Fourier transforms of and (defined by (5.13)) satisfy
Here we treated the zero mode separately; it is given by
where in the last step we used (3.3). The error term in (6.9) is estimated using a similar calculation.
Notice that the coefficient of in the denominator of (6.9) is now , where we used (3.5). The results and the proof of Proposition 2.8 remain unchanged when is replaced with , except that must be replaced with on the right-hand side of (2.36), and the whole expression is multiplied by an additional factor . Moreover, instead of (2.38), we now have
Recall the definition (2.20) of . Following the proof of Theorem 2.2, instead of (6.2) we now obtain
As in Section 6.1, we can iterate (6.11) under the conditions
(Note that the a priori estimate is still determined by despite the small mean-field component. In Lemma 3.4 it is given by where .) The first condition of (6.12) holds if
In order to get complete delocalization of the resolvent, i.e. , we require as well as
which ensures that . Hence we get complete delocalization of the resolvent provided that (6.13), (6.14), and (6.16) hold. This concludes the proof of part (ii).
If then there exists an such that the assumptions of part (ii) are met. Hence part (ii) and Proposition 7.1 yields part (iii). This concludes the proof of Theorem 2.11.
Complete delocalization of eigenvectors
Let and define the random subset of eigenvector indices through
Suppose that for some admissible control parameter . Let be a sequence satisfying . Suppose that
uniformly in , where in the first step we used the spectral decomposition of . Thus, for all , the map is approximately a probability distribution on . Roughly, (7.1) states that this probability distribution is supported on the order of sites of . More precisely, (7.1) yields (introducing the standard basis vector defined by ), for any fixed ,
uniformly in . Here in the third step we used (7.2) and (7.1), and in the last step the upper bound and the fact that is admissible.
Therefore we may estimate the left-hand side by its square root to get the bound
Similarly, we may estimate the second term of (7.4) using
Combining (7.4) with (7.3), (7.5), and (7.6), we get
Setting in (7.8) therefore yields
Extension to higher dimensions and a slowly decaying band
In this Section we extend Theorem 2.2, Corollary 2.4, and Theorem 2.5 in two directions: higher dimensions and a slowly decaying band.
The multidimensional analogues of the slowly decaying profile are left to the reader, as is the formulation of these extensions if a small mean-field component is added to the band matrix. All these results can be obtained in a straightforward manner following the proofs for the one-dimensional case with a rapidly decaying .
Let and assume (2.17). Then there is a constant such that
In order to state the precise form of the profile , we define the covariance matrix through
Since we get uniformly in .
Next, we define the -dimensional Yukawa potential
where is a smooth function satisfying for and for , is a Schwartz function satisfying , and . (In fact, is the Fourier transform of .) The second step of (8.2) follows by Poisson summation; see Appendix A and in particular (A.14) for more details. The following lemma gives the precise error bounds in the approximation (8.2).
Let and assume (2.17). Then
The convolution in (8.2) smooths out the Yukawa potential on the scale . The error terms in (8.3) are negligible compared to the main term in the regime . Therefore the approximation is meaningful from the profile scale down to the band scale . The actual choice of the function in (8.2) is immaterial in the relevant regime , as long as is equal to one in a neighbourhood of the origin.
Next, we state the counterparts of Theorem 2.2, Corollary 2.4, and Theorem 2.5 in the higher-dimensional setting. Their proofs are trivial modifications of the proofs of their one-dimensional counterparts, using Lemmas 8.1 and 8.2.
Let and assume (2.17). Suppose moreover that and . Then we have
Let and assume (2.17). If then the eigenvectors of are completely delocalized in the sense of Proposition 7.1.
Let and assume (2.17). Suppose that and . Then
Moreover, the analogues of (2.31) and (2.32) hold with
where is an arbitrary, fixed, positive integer.
2. Slowly decaying band
In this section we make the following assumption on the band shape. Suppose that and is smooth and symmetric, and satisfies
for some fixed . Here is a symmetric function satisfying
for some fixed . Note that by definition is smooth and symmetric, so that near the origin.
In order to avoid technical issues arising from the periodicity of , we cut off the tail of at scales . Thus we set
here is a smooth, symmetric bump function satisfying for and for , where . As usual, is a normalization constant.
The following lemma is the analogue of Lemma 5.2. Its proof is similar to that of Lemma 5.2; the key input is Lemma A.2 (iii).
Suppose that and that (8.6) and (8.7) hold. Then
Next, we give the sharp upper bound on the peak of the profile.
Suppose that and that (8.6) and (8.7) hold. Then
In order to describe the asymptotic shape of the profile, we define
which plays a role similar to the unrenormalized diffusion constant from (2.26). Moreover, define the function
which is bounded for . It is easy to check that for and we have
with an explicitly computable constant .
Suppose that and that (8.6) and (8.7) hold for some . Suppose moreover that
The matrix is the resolvent of a superdiffusive operator, whose symbol in Fourier space is . Thus, under the identification from Remark 2.7, we find that the associated dynamics scales according to instead of the diffusive scaling .
We may now state the counterparts of Theorem 2.2, Corollary 2.4, and Theorem 2.5 for the slowly decaying band. Their proofs are trivial modifications of those for the strongly decaying band, using Lemmas 8.7 and 8.8.
Suppose that and that (8.6) and (8.7) hold. Suppose moreover that and . Then we have
Suppose that and that (8.6) and (8.7) hold. If then the eigenvectors of are completely delocalized in the sense of Proposition 7.1.
Suppose that and that (8.6) and (8.7) hold for some . Suppose that and . Then
Moreover, the analogues of (2.31) and (2.32) hold.
Appendix A The deterministic profile
In this appendix we establish bounds and asymptotics for the deterministic profile .
where is a bounded smooth function satisfying . Clearly, is real and . Moreover, we claim that for any there exists an such that
indeed, this follows easily from the identity
As a guide for intuition, we have , as can be seen from
Thus, our proof consists in controlling the error in the approximation
As a first step, we establish basic properties of that are analogous to (A.2) and (A.1).
The function is smooth with uniformly bounded derivatives, real, and symmetric with and . Moreover, it has the following properties.
For any there exists an such that
for large enough (depending on ).
There exists a smooth function whose derivatives are bounded uniformly in such that
The proof of (i) is similar to that of (A.2).
(recall that ) and that
to estimate the main term, and (2.1) to estimate the error term with . We also have the trivial bound on . Thus we have
We can iterate the above argument for the main term in (A.8), thus obtaining higher order divided differences of . Since is smooth and decays rapidly, (A.6) follows for . The proof for is analogous.
Now (iii) follows from the fact that the function h(q)\mathrel{\mathop{:}}=\bigl{(}{1-q^{2}/2-\cos(q)}\bigr{)}q^{-4} is smooth and its derivatives are bounded. ∎
with some positive constant . By (A.5) we have on the support of
for some depending on . Then from (A.3) we have
extended to the whole real line, is smooth and its derivatives are bounded uniformly in and (by (A.9)). (These bounds may of course depend on ). Moreover, for any ; see (A.6). By summation by parts, as in (A.8), we find that for such a function we have
Now we consider the first term in (A.10). For the following we use with to denote functions that are smooth in and whose -derivatives are uniformly bounded in , , , and . Using the Taylor expansion (A.7) and (3.5), we have (omitting the arguments for brevity)
This gives (again omitting the arguments)
where we introduced the new variable . By definition, and their -derivatives are uniformly bounded. Since and on the support of , we find that for small enough the denominator of the second line of (A.12) is bounded away from zero, uniformly in , , , and . We therefore conclude that is smooth and its derivatives (in the variable ) are uniformly bounded.
Using summation by parts, exactly as in (A.8), we get
Here we used that the sum on the left-hand side ranges over a set of size due to the factor in the definition of . Therefore (A.12) and (A.13) imply that the first term of (A.10) is given by
Notice that the error term in (A.11) is smaller than in (A.14). Next, we remove the factor from the main term, exactly as in (A.11). Plugging this into (A.10) yields
We can extend the summation in the main term
where the error term on the right-hand side is of order . Thus we have
The main term can be computed by the Poisson summation formula
In order to prove (2.38), it suffices to analyse the asymptotics of the expression
We consider two cases. If \eta\geqslant\bigl{(}{\frac{W}{N}}\bigr{)}^{2} then . On the other hand, if \eta\leqslant\bigl{(}{\frac{W}{N}}\bigr{)}^{2} we use an integral approximation to get
This concludes the proof of (2.38), and hence of Proposition 2.8.
A.2. Higher dimensions: proofs of Lemmas 8.1 and 8.2
We follow the argument from the proof of Proposition 2.8 in the previous section, and merely sketch the differences. We use the -dimensional lattices
Note that, unlike in the proof of Proposition 2.8, we keep the cutoff function in the main term since the function is not integrable in higher dimensions.
The main term of (A.17) can be computed using Poisson summation:
Using that near the origin, we find . By treating the two cases \eta\leqslant\bigl{(}{\frac{W}{N}}\bigr{)}^{2} and \eta\geqslant\bigl{(}{\frac{W}{N}}\bigr{)}^{2} separately, we find exactly as in the last paragraph of the proof of Proposition 2.8 that (A.18) is bounded by .
What remains therefore is the estimate of the error term containing in (A.17). To that end, we write
We need a more precise bound on the error term of (A.17) than the bound from the proof of Lemma 8.1. In fact, we claim that
The proof of (A.20) is a rather laborious exercise in Taylor expansion whose details we omit. The basic strategy is similar to the analysis of (A.12), except that we expand up to order (instead of ). This completes the proof of Lemma 8.2. ∎
A.3. Slowly decaying band: proof of Lemma 8.8 and Proposition 8.9
We begin by proving the following auxiliary result, which gives the relevant asymptotics of . For define
We also set , so that is continuous.
Suppose that and that (8.6) and (8.7) hold. Then the following are true.
Part (i) is proved similarly to (A.6), using summation by parts.
Let be a smooth, symmetric bump function satisfying for and for . Write . We introduce the splitting
on the right-hand side of (A.23). It is easy to check that the two first terms give a contribution of order . The last term of the splitting gives rise to
where the last step follows from a mid-point Riemann sum approximation. Now a change of variables easily yields (A.22).
Part (iii) follows from part (ii) using an argument similar to (5.15). ∎
where the first term is the contribution of the low modes and the second term the contribution of the high modes , which may be replaced with an integral and estimated using Lemma A.2. We omit the details. ∎
We proceed similarly to the proof of Proposition 2.8. We choose a cutoff scale , and denote by the bump function from the proof of Lemma A.2. The scale satisfies , and will be chosen by optimizing at the end of the proof.
We use the expansions (A.22) and (3.5). Thus we find, as in the proof of Proposition 2.8,
where is a smooth bump function as in the proof of Proposition 2.8 and
Note that for we have . Using (A.21) we may therefore estimate, as in (A.12), to get
for some , where we used (8.10). Setting and Poisson summation yields
Now (8.11) follows by noting that by (8.9), under the assumption (8.10), only the term is of leading order. ∎
Appendix B Multilinear large deviation estimates
In this appendix we give a generalization of the large deviation estimate of Corollary B.3 EYY1 . The proof is simpler and the statement is formulated under the assumption (2.11) instead of the stronger subexponential decay assumption. Moreover, since the current proof does not rely on the Burkholder inequality, it is trivially generalizable to arbitrary multilinear estimates.
Throughout the following we consider random variables satisfying
Suppose that \bigl{(}{\sum_{i}\lvert b_{i}\rvert^{2}}\bigr{)}^{1/2}\prec\Psi. Then .
Suppose that \bigl{(}{\sum_{i\neq j}\lvert a_{ij}\rvert^{2}}\bigr{)}^{1/2}\prec\Psi. Then .
Suppose that \bigl{(}{\sum_{i,j}\lvert a_{ij}\rvert^{2}}\bigr{)}^{1/2}\prec\Psi. Then .
If all of the above random variables depend on an index and the hypotheses of (i) – (iii) are uniform in , then so are the conclusions.
The rest of this appendix is devoted to the proof of Theorem B.1. Our proof in fact generalizes trivially to arbitrary multilinear estimates for quantities of the form , where the star indicates that the summation indices are constrained to be distinct.
We first recall the following version of the Marcinkiewicz-Zygmund inequality.
Let be a family of independent random variables each satisfying (B.1) and suppose that the family is deterministic. Then
The proof is a simple application of Jensen’s inequality. Writing , we get, by the classical Marcinkiewicz-Zygmund inequality stroock in the first line, that
Next, we prove the following intermediate result.
Let be independent random variables each satisfying (B.1), and suppose that the family is deterministic. Then for all we have
Note that and are independent families. By conditioning on the family , we therefore get from Lemma B.2 and the triangle inequality that
Let be independent random variables each satisfying (B.1), and suppose that the family is deterministic. Then we have
The proof relies on the identity (valid for )
where the sum ranges over nonempty subsets and . Now we may estimate
As remarked above, the proof of Lemma B.4 may be easily extended to multilinear expressions of the form .
We may now complete the proof of Theorem B.1.
The proof is a simple application of Chebyshev’s inequality. Part (i) follows from Lemma B.2, part (ii) from Lemma B.4, and part (iii) from Lemma B.3. We give the details for part (iii).
for arbitrary . In the second step we used the definition of \bigl{(}{\sum_{i\neq j}|a_{ij}|^{2}}\bigr{)}^{1/2}\prec\Psi with parameters and . In the last step we used Lemma B.4 by conditioning on . Given and , there is a large enough such that the first term on the last line is bounded by . Since and were arbitrary, the proof is complete.
The claimed uniformity in in the case that and depend on an index also follows from the above estimate. ∎