Bulk universality for generalized Wigner matrices
Laszlo Erdos, Horng-Tzer Yau, Jun Yin
Introduction
One key universal quantity for random matrices is the eigenvalue gap distribution. Although the density of eigenvalues may depend on the specific model, the gap distribution or the short distance correlation function are believed to depend only on the symmetry class of the ensembles but are otherwise independent of the details of the distributions. There are two types of universality: the edge universality and the bulk universality. In this paper, we will focus on the bulk universality concerning the interior of the spectrum. The bulk universality was proved for very general classes of invariant ensembles (see, e.g. and references therein). For non-invariant ensembles, in particular for matrices with i.i.d. entries (Wigner matrices), the bulk universality was difficult to establish due to the lack of an explicit expression for the joint distribution of the eigenvalues.
The first rigorous partial result for bulk universality in the non-unitary case was given by Johansson (see also Ben Arous and Péché and the recent improvement ) stating that the bulk universality holds for Gaussian divisible Hermitian ensembles, i.e., Hermitian ensembles of the form
where is a Wigner matrix, is an independent standard GUE matrix and is a positive constant of order one. The restriction on Gaussian divisibility turned out to be very difficult to remove. In a series of papers , we developed a new approach to prove the universality. The first step was to derive the local semicircle law, an estimate of the local eigenvalue density, down to energy scales containing around eigenvalues. Once such a strong form of the local semicircle law was obtained, the result of can be extended to a Gaussian convolution with variance only . This tiny Gaussian component can then be removed via a reverse heat flow argument and this proves the bulk universality for Hermitian ensembles provided that the distributions of the matrix elements are sufficiently differentiable.
The bulk universality for Hermitian ensembles was also proved later on by Tao and Vu under the condition that the first four moments of the matrix elements match those of GUE, but without the differentiability assumption. The condition on the fourth moment was already removed in by using the result for Gaussian divisible ensembles of ; the third moment condition was then removed in by using the result of .
The four moment theorem is also valid for the symmetric ensembles, but the restriction on the matching of the first four moments cannot be weakened for the following reason. The key input to remove the fourth moment matching condition for the Hermitian case, the universality of the Gaussian divisible ensembles , relied entirely on the asymptotic analysis of an explicit formula, closely related to a formula in Brézin-Hikami , for the correlation functions of the eigenvalues for the Hermitian ensembles . Since similar formulas for symmetric matrices are very complicated, the corresponding result is not available and thus the matching of the fourth moment cannot be removed in this way. Although there is a proof of universality for without using this formula, the main ingredient of that proof, establishing the uniqueness of the local equilibria of the Dyson Brownian motion, still heavily used explicit formulas related to GUE.
In a completely different strategy was introduced based on a local relaxation flow, which locally behaves like a Dyson Brownian motion, but has a faster decay to equilibrium. This approach entirely eliminates explicit formulas and it gives a unified proof for the universality of symmetric and Hermitian Wigner matrices . It was further generalized to quaternion self-dual Wigner matrices and sample covariance matrices. The method not only applies to all these specific ensembles, but it also gives a conceptual interpretation that the occurrence of the universality is due to the relaxation to local equilibrium of the DBM. We remark that very recently the results of were also extended to sample covariance matrices .
The main input of all these methods and is an estimate of the local density of eigenvalues, the local semicircle law. This has been developed in the previous work on Wigner matrices , where the matrix elements were i.i.d. random variables. In this paper, we extend this method to random matrices with independent, but not necessarily identically distributed entries. If we denote the variance of the entry of the matrix by , our main interest is the case that are not a constant but they satisfy the normalization condition for all . We will call such matrix ensembles universal Wigner matrices. For these ensembles Guionnet and Anderson-Zeitouni proved that the density of the eigenvalues converges to the Wigner semi-circle law. The simplest case is that of generalized Wigner matrices, where is uniformly bounded from above and below by two fixed positive numbers. In this case, we prove the local semicircle law down to essentially the smallest possible energy scale (modulo factors). A much more difficult case is the Wigner band matrices where, roughly speaking, if for some . In this case, we obtain the local semicircle law to the energy scale . We note that a certain three-dimensional version of Gaussian band matrices was considered by Disertori, Pinson and Spencer using the supersymmetric method. They proved that the expectation of the density of eigenvalues is smooth and it coincides with the Wigner semicircle law.
With the local semicircle law proved up to the almost optimal scale, applying the method of leads to the identification of the correlation functions and the gap distribution for generalized Wigner matrices provided that the distribution of the matrix elements is continuous and satisfies the logarithmic Sobolev inequality. These additional assumptions can be removed if one can extend the Tao-Vu theorem to generalized Wigner matrices. In Section 8, we will introduce an approach based on a Green’s function comparison theorem, which states that the joint distributions of Green’s functions of two ensembles at different energies with imaginary parts of order are identical provided that the first three moments of the two ensembles coincide and the fourth moments are close. Since local correlation functions and the gap distribution of the eigenvalues can be identified from Green’s functions, it follows that the local correlation functions of these two ensembles are identical at the scale . We can thus use this theorem to remove all continuity and logarithmic Sobolev inequality restrictions in our approach. In particular, this leads to the bulk universality for generalized Wigner matrices with the subexponential decay being essentially the only assumption on the probability law. We note that one major technical difficulty in , the level repulsion estimate, is not needed in the proof of the Green’s function comparison theorem. It will be clear in Section 8 that, once the local semicircle law is established, the Green’s function comparison theorem is a simple consequence of the standard resolvent perturbation theory.
Main results
Matrices with independent, zero mean entries and with the normalization condition (2.1) will be called universal Wigner matrices. For a forthcoming review on this matrix class, see , where the terminology of random band matrices was used.
Note that corresponds to the standard Wigner matrices and the condition defines more general Wigner matrices with comparable variances.
We will also consider an even more general case when for different indices are not comparable. The basic parameter of such matrices is the quantity
A special case is the band matrix, where for with some parameter . In this case, and are related by .
Denote by the matrix of variances which is symmetric and doubly stochastic by (2.1), in particular it satisfies . Let the spectrum of be supported in
with some nonnegative constants . We will always have the following spectral assumption
The local semicircle law will be proven under this general condition, but the precision of the estimate near the spectral edge will also depend on in an explicit way. For the orientation of the reader, we mention two special cases of universal Wigner matrices that provided the main motivation for our work.
Example 1. Generalized Wigner matrix. In this case we have
and one can easily prove that is a simple eigenvalue of and (2.4) holds with
i.e., both and are positive constants independent of .
Example 2. Band matrix. The variances are given by
The Stieltjes transform of the empirical eigenvalue distribution of is given by
We define the density of the semicircle law
and, for , its Stieltjes transform
The Stieltjes transform may also be characterized as the unique solution of
satisfying for , i.e.,
Here the square root function is chosen with a branch cut along the positive real axis. This guarantees that the imaginary part of is non-negative. The Wigner semicircle law states that for any fixed provided that is independent of . The local version of this result for universal Wigner matrices is the content of the following Theorem.
Then there exist constants , , and , depending only on , and in (2.5), such that for any with , and
where \kappa:=\big{|}\,|E|-2\big{|}, the Stieltjes transform of the empirical eigenvalue distribution of satisfies
for sufficiently large . In fact, the same result holds for the individual matrix elements of the Green’s function :
We remark that once a local semicircle law is obtained on a scale essentially , it is straightforward to show that eigenvectors are delocalized on a scale at least of order . The precise statement will be formulated in Corollary 3.2. We will prove Theorem 2.1 in Sections 3–5 by extending the approach of . The main ingredients of this approach consist of i) a derivation of a self-consistent equation for the Green’s function and ii) an induction on the scale of the imaginary part of the energy. The key novelty in this paper is that the self-consistent equation is formulated for the array of the diagonal elements of the Green’s function instead of the Stieltjes transform itself as in . This yields for the first time a strong pointwise control on the diagonal elements , see (2.17).
The subexponential decay condition (2.14) can be weakened if we are not aiming at error estimates faster than any power law of . This can be easily carried out and we will not pursue it in this paper.
Denote the eigenvalues of by and let be their (symmetric) probability density. For any , the -point correlation function of the eigenvalues is defined by
We now state our main result concerning these correlation functions.
We consider a generalized hermitian Wigner matrix such that (2.6) holds. Assume that the distributions of the matrix elements have a uniformly subexponential decay in the sense of (2.14). Suppose that the real and imaginary parts of are i.i.d., distributed according to , i.e., . Let , , denote the -th moment of (). Suppose that
where is the -point correlation function of the GUE ensemble. The same statement holds for generalized symmetric Wigner matrices, with GOE replacing the GUE ensemble.
The limiting correlation functions of the GUE ensemble are given by the sine kernel
and similar universal formula is available for the limiting gap distribution.
Remark: The quantity in the bracket in (2.19) is always greater or equal to 1 for any real distribution with mean zero, which can be obtained by
and it is exactly 1 if the distribution is supported on two points. For example, if is a rescaling of a fixed distribution with variance , i.e. , then condition (2.19) is satisfied under (2.6), as long as the support of consists of at least three points. The case of a Bernoulli-type distribution supported on two points require a separate argument and it will be treated in the forthcoming paper .
We now state our main comparison theorem for matrix elements of Green’s functions of two Wigner ensembles. As in the paper , we assume conditions on four moments. It will lead quickly to Theorem 6.4 stating that the correlation functions of eigenvalues of two matrix ensembles are identical up to scale provided that the first four moments of all matrix elements of these two ensembles are almost identical. Here we do not assume that the real and imaginary parts are i.i.d., hence the -th moment of is understood as the collection of numbers , . The main result in compares the joint distribution of individual eigenvalues — which is not covered by our Theorem 2.3 — but it does not address directly the matrix elements of Green’s functions. The key input for both theorems is the local semicircle law on the almost optimal scale . The eigenvalue perturbation used in requires certain estimates on the eigenvalue level repulsion; the proof of Theorem 2.3 is a straightforward resolvent perturbation theory.
Suppose that we have two generalized Wigner matrices, and , with matrix elements given by the random variables and , respectively, with and satisfying the uniform subexponential decay condition
with some . Fix a bijective ordering map on the index set of the independent matrix elements,
and denote by the generalized Wigner matrix whose matrix elements follow the -distribution if and they follow the -distribution otherwise; in particular and . Let be arbitrary and suppose that, for any small parameter and for any , we have the following estimate on the diagonal elements of the resolvent
with some constants depending only on . Moreover, we assume that the first three moments of and are the same, i.e.
and the difference between the fourth moments of and is much less than 1, say
for some given . Let be arbitrary and choose an with . For any sequence of positive integers , set complex parameters , , , with and with an arbitrary choice of the signs. Let denote the resolvent and let be a function such that for any multi-index with and for any sufficiently small, we have
Then, there is a constant , depending on , and such that for any with and for any choices of the signs in the imaginary part of , we have
where the arguments of in the second term are changed from the Green’s functions of to and all other parameters remain unchanged.
We also remark that Theorem 2.3 holds for generalized Wigner matrices since in (2.2). The positive lower bound on the variances, , is not necessary for this theorem.
Remark 2: Although we state Theorem 2.3 for Hermitian and symmetric ensembles, similar results hold for real and complex sample covariance ensembles; the modification of the proof, to be given in Section 8, is obvious and we omit the details.
To summarize, our approach to prove the universality is based on the following three steps; a detailed outline will be given in Section 6. Step 1. Local semicircle law, i.e., Theorem 2.1. This will be proved in Sections 3–5. Step 2. Universality for ensembles with smooth distributions satisfying the logarithmic Sobolev inequality (LSI), Theorem 6.3. The key input is the general theorem, Theorem 6.2, concerning the universality for the local relaxation flow. In Section 7, by using the local semicircle law and the LSI, we verify the assumptions for this theorem. Step 3. Green’s function comparison theorem, Theorem 2.3. This removes the restriction on the smoothness and the LSI, and it will be proved in Section 8.
Convention. We will frequently use the notation for generic positive constants whose exact values are irrelevant and may change from line to line. For two positive quantities , we also introduce the notation to indicate that there exists a universal constant such that .
Proof of local semicircle law
Proof of Theorem 2.1 Recall that denotes the matrix element
We will prove the following more detailed stronger result.
where and is given in (2.4). Then for all and
for sufficiently large N, with positive and depending only and in (2.14) and in (2.4) and (2.5).
Remark: The condition (3.3) is effectively a lower bound on . The control function can be estimated by
up to some factor of order one. Note that the precise formula (3.2) for is not important, only its asymptotic behaviour for small , and is relevant. The theorem remains valid if is replaced by with . In particular, can be chosen to be order one when is not near the edges of the spectrum. If we are only concerned with the case of generalized Wigner matrices, (2.6), we can choose for any . Note that Theorem 2.1 was obtained by replacing with the lower bound in Theorem 3.1.
Once the local semicircle law is established on scale (modulo logarithmic factors), we obtain the following supremum bound on the eigenvectors that can be interpreted as a lower bound of order on the localization length. The proof of this result now is simpler than in , since we have a pointwise control on the diagonal elements of the Green’s function. Let denote the normalized eigenvector of belonging to the eigenvalue , , i.e., and .
Let be as in Theorem 3.1, for any fixed , there exists that
For the case of generalized Wigner matrices, (2.6), we have the following more precise bound
Proof of Corollary 3.2. Let ; can be chosen large enough so that (3.3) is satisfied for all , making use of (3.5) . Choose as a grid of points in such that the distance between any two neighbors is of order . Then with (3.4), we have
where we used from (3.5). Then, with (see (2.13)) and
where , we have
By the definition of , for any , there exists such that is of the order of . Together with (3.10), we obtain (3.6).
In case of the generalized Wigner matrix (2.6), we have and . Let be the solution to , then . With this choice of , (3.3) is satisfied, and holds with an overwhelming probability by (3.4). Since , so . By the argument above, we obtain that on this event. This proves (3.7).
To prove that is very close to in the sense of (3.4), we will also need to control the off-diagonal elements. In fact we will show that all () are bounded by up to some factor . To state the result precisely, we first define some events in the probability space.
Recall that , , denote the eigenvalues of . Denote by the subset of the probability space such that
Finally, denote by the set
and similarly define . These sets depend on but we suppress this from the notations.
Proof of Theorem 3.1. The following proposition immediately implies Theorem 3.1.
Suppose that the assumptions of Theorem 3.1 hold. Then, for sufficiently large N, we have
Following the work of , we will use a continuity argument. In Section 4 we will derive a self-consistent equation of the form
Later we will give an explicit formula for , but for now we take (3.16) as the definition of . Let be the subset of where the following inequality holds
We will use the following Lemmas that will be proved later in Section 4 and 5.
Let be a fixed complex number satisfying (3.3). Then there are constants and such that for , with sufficiently large independent of and , the following estimates hold.
(2) Suppose that . Setting , we have
Suppose we are on the event for some fixed satisfying (3.3). Suppose either or the following inequality hold:
Then, for sufficiently large , we have
Proof of Proposition 3.3. Recall that is the subset of where (3.12) holds. Since on (3.12) follows from (3.17), the case follows from Lemma 3.4 and Lemma 3.5 by taking a union bound for .
Now we prove (3.15) for the case assuming that satisfies (3.3). We have shown that (3.15) holds for , now we will successively decrease by in each step, and we continue this inductive procedure as long as (3.3) is still satisfied for the reduced . More precisely, let and assume that (3.15) holds for . Our goal is to prove that
The number of steps we will be taking is of order . Since , this proves (3.15) provided that we can establish (3.26).
From (3.21), the difference between the probabilities of the sets and is negligible. With the definition of and in (3.14), we have
Then, to prove (3.26), it remains to prove
i.e., we need to estimate the probability of the complement of on the set . On this set, using (3.22), we can assume that the estimate (3.17) holds with a very high probability. We will show below that (3.24) holds on . Then (3.25) together with (3.17) imply (3.12), the defining relation of . This will conclude (3.28) and complete the proof of Proposition 3.3. Therefore, we only have to verify (3.24).
Now we show that (3.24) holds on . Recall and we have the trivial estimate
In the set , we have
where in the second inequality we used (3.3). By the definition of from (3.2), we have . Thus, if (3.3) holds, then, in particular,
This sets a lower bound on . Together with , we have the trivial continuity bound
using , and from (3.31). Thus
Using and for , we have the following estimate
in the set . Thus the assumption (3.24) holds in the set .
Under the assumptions of Theorem 3.1, with (3.15), (3.20), (3.23) and the definitions in (3.14), all these ’s are sets of almost full probability, i.e.,
Self-consistent equation for Green’s function
For , we define
These quantities depend on , but we mostly neglect this dependence in the notation.
We start the proof with deriving some identities between the matrix elements of and using the following well known result in linear algebra that we quote without proof.
Let , , be , and matrices. We define matrix as
Furthermore, let denote the unordered set and , . We define to be the by submatrix of after removing the -th rows and columns and define to be the by submatrix of after removing the -th rows and columns. Then for any and , we have
Using Lemma 4.1 and Definition 4.1, for , we have
For the off diagonal matrix elements , , we have
Let be an unordered set , , , with for or . For simplicity, we use the notation for and for . Then we have the following identities:
For any indices , and that are different and
Proof of Lemma 4.2. The first two identities (4.5) and (4.6) are obvious extensions of (4.3) and (4.4). To prove (4.7), without loss of generality, we may assume that , and . Let and defined as in (4.2) with and . With Lemma 4.1, we have that for or .
Since is just a matrix, one can easily check that (4.7) holds. With the same method, one can obtain (4.8) .
The diagonal matrix elements of the resolvent satisfy the following self-consistent equation.
hold with a probability larger than for sufficiently large .
Proof of Lemma 4.3. We can write as follows,
Combining this identity with (4.7), we have
Clearly can be replaced with any and this proves (4.11) with the definition (4.12).
We note , and are independent for . With the sub-exponential decay (2.14) and , we have for any
In Corollary B.3 of Appendix B we will prove a general large deviations result. Applying (B.15) to the last term in (4.19), with the choice
and with and , we obtain that
holds with a probability larger than . Together with (4.21), we obtain that (4.13) holds with a probability larger than for sufficiently large .
Next we prove (4.14). By the definition of , , we can write
Applying (B.16), (4.21) and , we obtain that
holds with a probability larger than for sufficiently large . With Schwarz’s inequality, for any ,
Denote and () the -normalized eigenvectors and eigenvalues of . Let denote the -th coordinate of , then for any
Here we defined for any matrix . Inserting (4.27) into (4.25) and using the definition of in (2.3), we obtain that (4.14) holds with a probability larger than for sufficiently large .
and , we have that
holds in . Together with and , we obtain
with some positive constants. From the interlacing property of the eigenvalues of the matrix and its submatrices, we find that not only but also holds on the set . Thus for any such that , and are all different, the bounds
hold in by a similar argument that led to (4.30). Thus (4.6) implies
and (3.18) follows make use of (4.14) and .
Now we prove (3.19). Recall that the self consistent equation (3.16) with the error term is given by (4.12), i.e.,
Now we bound in . Since , with (4.31), the first term of the r.h.s. of (4.33) is less than . Then with (2.1), and using the bound on () from (3.13) and the one on from (4.31), we obtain that the second term of the r.h.s. of (4.33) is less than (and with (3.31), we know it is much less than 1), i.e., in
The last term of the r.h.s. of (4.33) can be bounded, using (4.13) with , with a very large probability. Using (4.8) and (4.31), the ’s in (4.13) can be bounded as
Therefore, again with the bound on () in (3.13) and the one on from (4.31), we see that
Now we prove (3.20) for . By the definition of in (4.33), we have
We now claim that for some large enough there exists such that
The first estimate follows from the definition of given in Definition 4.1 by using the sub-exponential decay of the matrix elements and by using the trivial bound . The second estimate is a trivial consequence of the first one and the definition of . Together with (4.38), we obtain (3.20) in the case that .
We now prove (3.21) and (3.22) for the case satisfying (3.3). We will work in the event where . Similarly as we proved (3.33), from the bound below (3.31) and the Lipschitz continuity of , we obtain that
hold in . We note the r.h.s of these inequalities are much less than by (3.3). From the explicit formula (2.13) we obtain that for any with some positive constants. Using this observation and the fact that the r.h.s. of (4.40) is much less than , we have
Hence, using (3.31), (4.7), (4.8) and the lower bound of , one can easily obtain that
hold in , (for the third term in l.h.s., we have also used the lower bounds of ’s as above). Then we also have
The definition of implies . Then with (4.42), (3.3) and , we have that
holds in for some constant . Inserting it into (4.14), we obtain that
Then, as we proved in (4.34) and (4.36), we get that
Finally, similarly as using (4.37)- (4.38) to prove (3.20), we can obtain (3.23) in the case that .
Stability of the self-consistent equation: proof of Lemma 3.5
In this section, we prove Lemma 3.5, i.e., we will prove the stability of the self-consistent equation with a precise error estimate given in (3.25). We set and for simplicity of notation and we will omit all dependences in all the symbols. With the definition of in (2.12) and (2.13), the following properties of can be easily established:
Let with and . Then we have
for some constant . Furthermore, suppose that either or . Then
For small values of , has the asymptotic expansion
We first prove (3.25) for the case that . In this case, we can easily check that . Denote the difference between and by
By the self consistent equation (3.16), (2.1) and (2.12), we have
For , by (2.13). Using and , we obtain
From the assumption (3.17) and (3.3), we have in this region. Together with and (5.6), we obtain that the absolute value of the r.h.s. of (5.5) is less than
Taking the absolute value of (5.5) and maximizing over , we have
The denominator satisfies , therefore we obtain , which shows (3.25) for .
Next, we prove (3.25) in the case that with satisfying (3.3) and under the condition (3.24). Define
Combining (3.17), (3.3), (3.24) with the fact that , we can see that
for some . Furthermore (3.24) implies
Therefore, expanding the self consistent equation (3.16) around , we obtain that
where is defined by the second equality and it satisfies
with error bounds uniform in . Here . Taking the average of the r.h.s of (5.13) with respect to , we obtain that
Here we used . The bound (3.24) , (5.11) and (from (3.2)) implies that
Together with (5.10) and (5.17), we obtain
To bound , we use the following lemma.
with and the estimate
Proof of Lemma 5.2. It follows from (5.20) that
We denote by and the two solutions of this equation, which are continuous with respect to locally in the neighborhood (5.19). When , one of them is equal to , we choose . From (5.23), we have
Then, for small enough , if , then by using (5.24) and that . We thus see that only one out of and can satisfy (5.21). With the assumption that , it is that satisfies (5.21). Then
where for the second inequality, we used .
Using Lemma 5.2, for and , we have
where in the second inequality we used (5.17) and (5.18). Subtracting (5.17) from (5.13), we have the equation for
where is defined as . By (5.17), it is bounded by
Then, using (5.11) and (5.1), we obtain that
Inserting this into (5.29), using the bounds on in (5.18) and (5.27), we have
From (5.3) in Lemma 5.1, whenever or , in which case , we have
for some . Therefore (5.28) imply in this region that
and using from (5.18), we conclude that
Combining this with the bound on (5.27) and , we obtain (3.25).
Finally, we consider the main interesting regime: and . We claim that the following inequality about holds.
Let be a given constant. Then there exist small real numbers and , depending only on , such that we have
for any positive number such that .
We postpone the proof of this lemma to the end of this subsection and we first complete the main argument. Recall that is the matrix of variances which is symmetric. We also recall from (2.4) and we will apply Lemma 5.3 with these and . Fix , set and rewrite (5.28) as
by the Lemma 5.3 and , the Neumann expansion of (5.38) converges on span and
since and . Then we have
by Lemma 5.3. Since for any matrix we have
Thus, estimating the first terms in (5.39) by (5.40), and the rest by (5.41), we get
Using the bound (5.31) on and the bound (5.18) on , we have
for some . Combining this with (5.27), we find
which implies (3.25), since .
Proof of Lemma 5.3. First, if , then we choose . With in (5.1), one can see that (5.36) holds.
In the case of , we have by using . We choose , then
For the other term in r.h.s. of (5.44), we have
With in (5.1) and in this case, (5.46) is bounded as
for some depending on . At last, we complete the proof by combining (5.47) and (5.45).
Proof of the universality of local statistics
We now outline the main steps to prove Theorem 2.2.
Step 1. Local relaxation flow. Following , we first prove that the local eigenvalue statistics of Dyson Brownian motion (DBM) at a fixed time are the same as those of GUE if for some . The DBM is generated by the flow
( for GUE) be the probability measure of the eigenvalues of the general ensemble, (in this section, we often use the notation for the eigenvalues to follow the notations of ). In this paper we consider the case for simplicity, but we stress that our proof applies to the case of symmetric matrices as well. Denote the distribution of the eigenvalues at time by . Then satisfies
Suppose that the probability law for the initial matrix satisfies the assumptions of Theorem 2.2. Then there exists such that for any
where is the -point correlation function of the GUE ensemble.
Proof of Theorem 6.1. We first recall the following general theorem concerning the Dyson Brownian motion from that asserts that under four general assumptions, the local eigenvalue statistics of the time evolved matrix coincide with GUE. The first assumption (called Assumption I in ) is a convexity bound on which is automatically satisfied in our case and we only have to verify the following three assumptions.
For the next assumption, we introduce a notation. Let denote the location of the -th point under the limiting density, i.e., is defined by
We will call the classical location of the -th point.
Assumption III. There exists an such that
Assumption IV. For any compact subinterval independent of , and for any , and , there are constants depending on , , and such that for any interval with , we have
where is the exponent from Assumption III.
[19, Theorem 2.1] Let be the exponent from Assumption III. Suppose that there is a time such that the following entropy bound holds
Theorem 6.2 was exactly Theorem 2.1 of except that the assumption (6.10) on the entropy in was stated for the initial probability density . Clearly, we can start the flow (6.4) from a fixed time since the statement of Theorem 6.2 concerns only the time . In the case that the flow (6.4) is generated from the matrix evolution (6.1), the entropy assumption (6.10) is satisfied automatically. To see this, let denote the probability measure of the -th element of the matrix , , and the probability measure of the matrix . Let denote the probability measure of the GUE and the probability measure of its -th element which is a Gaussian measure with mean zero and variance . Since the dynamics of matrix elements are independent (subject to the Hermitian condition), we have the identity
The process is an Ornstein-Uhlenbeck process and each entropy term on the right hand side of the last equation is bounded by provided that and has a subexponential decay. It is easy to check from the explicit OU kernel. Since the entropy of the marginal distribution on the eigenvalues is bounded by the entropy of the total measure on the matrix, we have proved that
and this verifies (6.10). Therefore, in order to apply Theorem 6.2, we only have to verify the Assumptions II, III and IV. Clearly, Assumption II follows from Theorem 2.1 (note that in the case of generalized Wigner matrix, and ). Assumption IV also follows from Theorem 2.1 by noting that if is an interval of length about . We also note that Assumption IV in was stated in a slightly stronger form, requiring a large deviation bound (6.9) for all , but inspecting the proof of Theorem 2.1 of reveals that Assumption IV is used only for larger than some positive power of and smaller than (the main observation is that the upper limit of the summation in (7.16) of is effectively and not ).
Having verified all other assumptions, it remains to prove (6.8), which we state as the next theorem.
Suppose satisfies the assumptions of Theorem 2.2, in particular, it is a generalized Wigner matrix with positive constants , in (2.6). Let be the rescaling of the distributions of the matrix elements and suppose that they satisfy the logarithmic Sobolev inequality (LSI) with a constant independent of , i.e.,
holds for any smooth probability density , . Denote the -th eigenvalue of in increasing order, . Then there exists depending on in (2.14) but independent of , and such that
if is sufficiently large (depending on , , , and ).
The proof of Theorem 6.3 will be given in Section 7. It is easy to check that if an initial matrix satisfies the conditions of Theorem 6.3, then its evolution under the Ornstein-Uhlenbeck flow will also satisfy these conditions with constants changed at most by a factor two. The main condition to check is that the logarithmic Sobolev inequality (6.14) holds for . But this was proved in the argument following Lemma 5.3 of using an estimate on the logarithmic Sobolev constant for convolution of two measures, i.e., Lemma B.1 of . Therefore Theorem 6.3 guarantees (6.15) for all positive times and this proves Assumption III provided that the initial distribution satisfies the LSI (6.14). We have thus proved Theorem 2.2 for matrix ensembles of the form
where are i.i.d. complex random variables with Gaussian distribution with mean and variance , and ’s are independent random variables such that the rescaled variables satisfy th LSI assumption (6.14). In (6.16) is arbitrary and is fixed in Theorem 6.3. In particular, with the choice and , we have proved Theorem 2.2 for matrix ensembles if is of the form
Step 2. Eigenvalue correlation function comparison theorem.
The next step is to prove that the correlation functions of eigenvalues for two matrix ensembles are identical up to scale provided that the first four moments of all matrix elements of these two ensembles are almost identical. This theorem is a corollary of Theorem 2.3 and we state it as the following correlation function comparison theorem. The proof will be given in Section 8. Note that the assumption (2.21) in Theorem 2.3 is satisfied by Theorem 3.1; in case of generalized Wigner matrix we have and , so in the regime where is separated away from 2, we have from (3.4), that is uniformly bounded (modulo logarithmic factors).
Step 3. Approximation of a measure by Ornstein-Uhlenbeck process for small time.
Summarizing, we have proved Theorem 2.2 in Step 1 for matrix ensembles whose probability distributions of the normalized matrix elements are of the form (6.17). Using the Green’s function comparison theorem, i.e. Theorem 6.4, we extended the class of distributions to all random variables whose first four moments can almost be matched (more precisely, match the first three moments and almost match the fourth moments in the sense of (2.22)) by random variables in the class (6.17). In order to complete the proof of Theorem 2.2, it remains to prove that for all measures in the class given by the assumptions of Theorem 2.2, i.e., measures satisfying the subexponential decay condition, the uniformly bounded-variance condition (2.6) and the moment restriction (2.19) for the real and imaginary parts, we can find random variables in the class (6.17) to almost match the first four moments. Since the real and imaginary parts are i.i.d., it is sufficient to match them individually, i.e., we can work with real random variables normalized to variance one. This is the content of the following Lemma 6.5. Notice that the uniformity in the conditions (2.19) and (2.14) guarantees that the bounds (6.19) hold with uniform constants . This implies the uniformity of the LSI constants, needed in Theorem 6.3, for the random variables constructed in Lemma 6.5. The proof of this Lemma will be given in Appendix C. We have thus proved Theorem 2.2.
Let and be two real numbers such that
for some positive constants and . Then for any sufficient small (depending on and ), there exists a real random variable whose distribution satisfies LSI and the first 4 moments of
are , , and , and
for some depending on and , where is real Gaussian random variable with mean and variance , independent of . The LSI constant of (and thus ) is bounded from above by a function of and .
Proof of Theorem 6.3
Theorem 6.3 states that the eigenvalues are at a distance from their classical locations in a quadratic average sense. We will deduce this conclusion from the information on the closeness of the local density to the semicircle law. We note the constants appearing in this section may also depend on and in (2.14), but we will not mention the dependence in the proof.
First we reformulate a result, which we have proved in , in a somewhat more general setup. It states that random points, , are close to a fixed set of locations, , if the local fluctuation is controlled, if the averaged counting function is close to the counting function of the ’s in -sense and if some tightness holds. For simplicity, the result is stated for the case when ’s are the classical locations given by the semicircle law , (6.7), but the statement (and its proof) holds for any density function with support being a compact interval and with square root singularity at the edges. In particular, we applied this result in for the Marchenko-Pastur (MP) distribution instead of the semicircle law. The counting function of can be replaced by its continuous version, i.e., by the distribution function of the semicircle law which defined by
Suppose the following four assumptions hold.
[Tightness at the edge] There exist and such that
[-closeness of the counting functions]
[Positivity of the bulk density] There exists a small enough such that: for any interval with and , the number of the ’s in is bounded from below as follows
Then there exists (independent of the constants in these four assumptions) such that
when is large enough (depending on the constants in these four assumptions).
Proof of Lemma 7.1. In Theorem 9.1 of we have proved the analogous result on the singular values of the covariance matrix, where the role of the semicircle law was played by the MP law and the spectral edges, , were replaced by , the two edges of the support of the MP distribution. In that paper we first proved the analogues of these four assumptions, then we presented the proof of (7.8) via a general argument that used only these assumptions. Inspecting the proofs of Lemma 9.5, 9.6 and 9.7 in , leading to (7.8), we observe that only equations (9.6), (9.8), (9.9) and (9.13) from were used, in addition to the lower bound on the density of the points in the scale , which is used below (9.51) of . The lower bound on the density is granted by the last assumption (7.7) (even with a better control on the probability than we required in ). Repeating the argument from , for the proof of Lemma 7.1 it is sufficient to check that the first three assumptions in Lemma 7.1 imply equations (9.6), (9.8), (9.9) and (9.13) in . We now explain how to obtain these necessary bounds from our assumptions.
The first condition (7.3) corresponds to the input for Lemma 9.2 in , in particular, the analogue of (9.6) of ,
follows immediately from (7.3) and (7.4). We note that (9.6) in contains a threshold but actually in the proof we only needed it to be much less than (see (9.36)–(9.37) of for the application of (9.6)).
The second condition (7.5) corresponds to Eq. (9.8) in . As we showed in the proof of Lemma 9.3 of , Eq. (9.9) directly follows from (9.8). Here the analogous bound
follows directly from (7.5) in the same way.
Finally, the third condition (7.6) is exactly the same as (9.13) in . Simply repeating now the proof of Theorem 9.1 from , we proved Lemma 7.1.
Theorem 6.3 will now follow from Lemma 7.1 if we prove that the four conditions in the Lemma 7.1 hold in the case of generalized Wigner matrices (2.6). The last condition (7.7) follows from the local semicircle law (Theorem 2.1) and from the fact that for . Here we list the first three conditions as three separate lemmas that will be proven in the next three subsections. This will complete the proof of Theorem 6.3.
(1) Let be a generalized Wigner matrix with subexponential decay, in fact it is sufficient to assume that (2.14) and the upper bound in (2.6) hold. Define as in (7.2). Then
for any small with an depending on . Furthermore, for ,
(2) In fact, the last tightness bound holds in a more general situation, namely, let the universal Wigner matrix satisfy (2.1), (2.14) and where is defined in (2.3). Then we have
Let satisfy the conditions of Theorem 6.3. Then for any we have
with depending on in (2.6) and in (6.14).
We start with the proof of (7.9) and (7.10) in the case of generalized Wigner matrices (see (2.6)). First we truncate the random variables. With the assumption of subexponential decay of , for any small , one can find a such that
for some small number , depending on . Then we only need to bound the spectral norm of the new matrix . To prove (7.9), it only remains to prove that, for some small ,
with the choice of and , since for even powers. The proof of (7.10) is analogous.
Let and be given integers. We define the concept of ordered closed walk of edges on an abstract ordered set of elements with the natural ordering . An ordered closed walk on vertices with edge is determined by a sequence of the elements of with the following properties:
Along the walk, the fresh vertices from are adjoined in increasing order, i.e., .
, i.e., all points of are visited.
Let denote the undirected graph associated with , i.e., the vertex set of is , the edges are given by ; with multiple edges as well as self-loops ( for some ) allowed. Then every edge of appears at least twice.
Let denote the set of ordered closed walks on vertices with edges. Their number was estimated in Lemma 2.1 of
This bound will be sufficient for the proof of (7.9) with exponent . We remark that Lemma 4.1 of gives a different bound on (7.18) that is better by essentially a factor . Applying this bound, one could improve the exponent in (7.9) to but we will not pursue this improvement here.
With these notations, we have the formula
To verify this formula, for any given sequence on the l.h.s., let denote the number of different elements in this sequence and let the set be identified with these different elements in the order of their appearance (i.e. for any we let for some if , , and is the -th freshest element among , i.e., ). Let encode the sequence with the new labels . One may think of the walk, , as the topological structure of the sequence where the original labels from the set have been replaced by abstract labels, defined intrinsically from the repetition structure of . Formula (7.1) is a resummation of all sequences in terms of topological walks (first and second sum) and then reintroducing the original labelling with (third sum). Since the first moment of vanishes and different matrix elements are independent, all terms on the right hand side have zero expectation in which at least one factor appears only once. This justifies the requirement iii) in the definition of the ordered closed walks. The restriction in the summation then comes from iii). This proves (7.1).
To compute the expectation on the r.h.s. of the (7.1), we need to introduce the concept of the skeleton of the walk. Given , its skeleton is the undirected graph on that is obtained from after replacing each multiple (parallel) edge by a single undirected edge. Here allows self-loops (as long as every edge has multiplicity 1). Thus the edge set of the skeleton coincides with the edge set after neglecting multiplicity and direction. The skeleton is a subgraph of the complete graph on . We will also define the tree of the walk, , which is just a spanning tree of the skeleton built up successively along the walk by a greedy algorithm: include an edge to the if it does not create a loop together with the previously adjoined edges. Since is connected, and then so is , thus is indeed a tree on vertices, in particular the number of its edges is
and has total edge multiplicity less than .
For any edge of the skeleton, let denote the multiplicity of in (edges with both orientations are taken into account). Clearly
We will use (7.22) for the edges of the tree, , and we use (7.23) for the remaining edges . We can now estimate (7.1) using (7.21) and (7.20):
holds for any tree . This identity follows from successively summing up the labels for vertices with degree one in by using the identity .
Choosing , we have . Inserting this into (7.25), we obtain (7.17) and complete the proof.
Now we prove (7.11) with the same method. Similarly, with the assumption on the distribution of , one can find a such that
for . Here can be obtained by considering the cutoff random variables h_{ij}{\bf 1}\big{(}|h_{ij}|\leq M^{-1/2}(\log N)(\log\log N)\big{)} and then slightly modifying them to recover their zero expectation value.
Choosing , we have . Thus we obtain
2 Proof of Lemma 7.3.
First we show that the estimate on the expectation of is better than the estimate (2.16) on itself.
As a preparation to the proof, we need the following technical lemma that we state under more general conditions so that it is applicable for universal Wigner matrices.
With the assumption of Theorem 3.1, suppose (3.3) holds, we have the estimate
for some sufficiently large positive constants (depending on in (2.14)).
Proof of Lemma 7.6. Recall the definitions of , and in (3.17), (3.12), (3.13) and (3.14) and we define
The r.h.s. of (7.34) is larger than . Then with (7.36) and (see (3.31)), we only need to prove
Taking the expectation of the self consistent equation (4.11) with (4.12), we obtain that
Then, similarly to (5.12), on the event we have
by using and that on the set , is small. Therefore, we can expand (7.38) as
Then summing up , we obtain that
Applying (3.12) and the definition of , we can bound the second and third terms in the r.h.s. of (7.40) with some constant as follows,
Then, with the definition of (4.12) and (4.39), we have
for some positive constants and . Inserting this and (3.20) into (7.42), we have
in the case of . If , similarly, with (3.23) we have the same result. This proves (7.37) and thus completes the proof of Lemma 7.6.
Proof of Lemma 7.5. First we will prove the result for large , more precisely we show (7.33) under the additional assumption that
with a sufficiently large constant .
In the case of the generalized Wigner matrix, (2.6), we have and (2.7), then
up to an factor. Note that with a sufficiently large , (7.46) implies (3.3) and thus combining Lemma 7.6 with Lemma 5.2 we obtain (7.33) under the condition that satisfies (7.46).
To prove (7.33) for any , it remains to consider the case when (7.46) does not hold. For a fixed , let be the (unique) solution of , i.e. when (7.46) becomes an equality. In particular, we know that
Consider , set , and estimate
Now we use the fact that the functions and are monotone increasing for any since both are Stieltjes transforms of a positive measure. Therefore the integral in (7.48) can be bounded by
By the choice of and using that , we have
with a possible larger in the r.h.s. This completes the proof of Lemma 7.5.
With Lemma 7.5, it follows that for any and ,
Now we return to the main argument to prove (7.12) in Lemma 7.3. Given (7.10), we only need to prove
This inequality follows from the next lemma by choosing the signed measure
and the conditions (7.58) and (7.59) are provided by (7.33) and (7.53). This will complete the proof of Lemma 7.3.
Let be a finite signed measure with support in for some . Let
be the Stieltjes transform and the distribution function of , respectively. Let , denote and . We assume that satisfies the following bound with some constant :
for some constant when is sufficiently large.
This lemma is similar to Lemma B.1 in , but with different assumptions. Since the assumptions here are stronger than (B.3) and (B.4) in , we actually obtain a better bound (7.60) than in , where the l.h.s. of (7.60) was bounded by .
We will choose and set with . Then to prove (7.60), we only need to prove that
To express in terms of the Stieltjes transform, we use the Helffer-Sjöstrand functional calculus, as (B.12) in . We formulate this result in a more general form.
Let be given as above with some , , and . Suppose that the Stieltjes transform of the signed measure satisfies
with some exponents and some constant . Then
The condition of this lemma with and coincides with (7.58), therefore, after integrating in and using , we obtain (7.62) which completes the proof of Lemma 7.7.
Proof of Lemma 7.8. Analogously to (B.13), (B.14) and (B.15) in we obtain that
where is a smooth cutoff function with support in $\chi(y)=1|y|\leq 1/2$ and with bounded derivatives. The first term is estimated by
using (7.63) and the support of .
With (7.63) and and
the second term in r.h.s. of (7.2) is bounded by
Here we used that for we have
As the (B.17) and (B.19) in , we integrate the third term in (7.2) by parts first in , then in . Then bound it with absolute value by
The middle term is bounded as (7.66). With (7.63) again, we have
Then combining (7.2), (7.66), (7.67), (7.68) and (7.69) we obtain (7.64) and complete the proof of Lemma 7.8.
3 Proof of Lemma 7.4
With the choice , , and otherwise, we get . Using the Bobkov-Götze concentration inequality and the uniform bound on the LSI constant (6.14), we get
for any and . Choosing and , we obtain (7.13).
Proof of the Green’s function comparison theorem
Proof of Theorem 2.3. From the trivial bound
and from (2.21) we have the following a priori bound
Note that the supremum over can be included by establishing the estimate first for a fine grid of ’s with spacing and then extend the bound for all by using that the Green’s functions are Lipschitz continuous in with a Lipschitz constant .
Let and denote the eigenvalues and eigenvectors of , then by the definition of the Green’s function, we have
and divide the summation over into
Using the estimate (2.21) for and a trivial bound of for , we have proved that
For simplicity, we will consider the case when the test function has only variable and , i.e., we consider the trace of a first order monomial; the general case follows analogously. Consider the telescoping sum of differences of expectations
with a matrix that has zero matrix element at the and positions and where we set for and similarly for . Define the Green’s functions
We first claim that the estimate (8.3) holds for the Green’s function as well. To see this, we have, from the resolvent expansion,
We can now start proving the main result. By the resolvent expansion,
For each diagonal element in the computation of these traces, the contribution to , and is a sum of a few terms. E.g.
and similar formulas hold for the other terms.
where is a number between and and it depends on and ; the ’s are defined as
and similarly for and . Finally,
The expectation values of the terms , , with respect to are determined by the first four moments of , for example
Finally, we have to estimate the error term . All terms without can be dealt with as before; after estimating the derivatives of by , one can perform the expectation with respect to that is independent of . For the terms involving one can argue similarly, by appealing to the fact that the matrix elements of are also essentially bounded by , see (8.3), and that has subexponential decay. Alternatively, one can use Hölder inequality to decouple from the rest and use (8.3) directly, for example:
After summing up in (8.4) we have thus proved that
The proof can be easily generalized to functions of several variables. This concludes the proof of Theorem 2.3.
Proof of Theorem 6.4. Define an approximate delta function (times ) at the scale by
For notational simplicity, we will prove only the case of three point correlation functions; the proof is analogous for the general case. By definition of the correlation function, for any fixed , ,
and similarly, consists of terms with , while consists of terms with .
where the function is chosen to be if and it is smoothly cutoff to go to zero in the regime . The difference between the expectation of and is negligible, since it comes from the regime where , which has an exponentially small probability by (8.3) (the upper bound on the Green’s function always holds since ). Here the arguments of are imaginary parts of the trace of the Green’s function, but this type of function is allowed when applying Theorem 2.3, since
We remark that the main assumption (2.21) for Theorem 2.3 is satisfied by using (2.17) of Theorem 2.1 with the choice of .
Set for the rest of the proof. We now show that the validity of (8.8) for any choice of , (recall ) implies that the rescaled correlation functions, and , as functions of the variables , have the same weak limit.
Let be a smooth, compactly supported test function and let
be its smoothing on scale . Then we can write
The first term on the right side, after the change of variables , is equal to
i.e., it can be written as an integral of expressions of the form (8.8) for which limits with and coincide.
Finally, the second term on the right hand side of (8) is negligible. To see this, notice that for any test function , we have
If the test function were supported on a ball of size , , then this last term were bounded by
Here denotes the number of eigenvalues in the interval and in the estimate we used the local semicircle law on intervals of size .
Set now . From the definition of , it is easy to see that the function
satisfies the bound . So choosing , the contribution of is negligible. Finally, is given by
Hence the contribution of in the last term of (8.11) is bounded by
From Theorem 2.1, the last term is bounded by up to some logarithmic factor. This completes the proof of Theorem 6.4.
Appendix A Spectral condition for band matrices
for some and large enough, depending on .
Proof. Recall that the discrete Fourier transform in dimensions is defined as follows. Let and
be the periodic one dimensional lattice (torus) of size and spacing with its dual lattice being
Let be a function on . Then its Fourier transform is a function on defined as
With this formula, and with the notation for any defined on , we have
which is normalized to be . Hence on the Fourier side acts as a multiplication by the function , so
Since is nonnegative, symmetric function and , we have is real and
for some , which completes the proof.
Appendix B Large deviation estimates
In this Appendix we prove two large deviations results. They are weaker than the corresponding results of Hanson and Wright , used in , but they require only independent, not necessarily identically distributed random variables, moreover the proofs are much simpler.
Let () be independent complex random variables with mean zero, variance and uniform subexponential decay, i.e., there exist , that for any
for some positive constants and depending on and in (B.1).
Proof of Lemma B.1. Without loss of generality, we may assume that . The assumption (B.1) implies that the th moment of is bounded by:
for some depending on and .
With the Marcinkiewicz–Zygmund inequality, for an integer , we have
which implies (B.2) by choosing an even integer of the order and applying a high moment Markov inequality.
for some positive constants and depending on and in (B.1).
Proof of Lemma B.2. Without loss of generality, we may again assume that . First, we prove (B.7). Notice that () are independent random variables with mean and variance less than some constants . Furthermore, the -th moment of is bounded as
Then following the proof of the Lemma B.1 with replacing , we obtain (B.7).
where . Note that and are independent for any fixed . By the definition,
is martingale. Using the Burkholder inequality, we have that
(for the constant, see Section VII.3 of ). By the generalized Minkowski inequality, by the independence of and and using (B.3), we have
Then choosing and applying Markov inequality, we obtain (B.8) .
In our applications we will need these two lemmas when is a power of . For simplicity, we do not want to keep track of the precise powers in the estimate and we are interested only in error bounds that decay faster than any fixed power of , say . Therefore, in this paper we will use the following weaker form of these two lemmas, the stronger form will be useful in future applications.
for some constants depending on and in (B.1).
Appendix C Proof of Lemma 6.5
We first prove a version of this lemma when the fourth moment exactly matches, i.e., , then we explain how to deal with the approximation. More precisely, we first show the following:
for some positive constants and , there exists a real random variable such that the first four moments of are , , and and the distribution of satisfies logarithmic Sobolev inequality and the LSI constant is bounded from above by a function of and . Moreover, can be chosen to be absolutely continuous with a smooth positive density, , such that the derivatives of satisfy
with some fixed constant and -dependent constants .
Remark. The last statement about the smoothness of will not be needed in this paper, but we state it for further reference.
Proof. We start with the case , where is small enough number to depend only on , see below. Let be the sum of two Gaussians, with density function of the form
with some parameters , , . If the first 4 moments of are , , and , then we have the relations
With , in (C.1) and , one can always find a solution of (C.4) such that . Actually, one can see that , where and only depend on , in (6.19) and .
Once is found, it is easy to check that one can always find real solutions for (C.5) as long as , satisfy (C.1) and . Since the solutions are continuous with respect to and , then they are uniformly bounded. Distributions of the form (C.3) satisfy the LSI, since the are log concave away from a compact set. Since the parameters are in a compact set, the LSI constant will remain uniformly bounded with a bound depending on , and . It is clear that the density function (C.3) is positive and its logarithm satisfies (C.2).
Now we consider the case that with a small , where is the constant in (C.1). Without loss of generality, we may assume . We consider the following three parameter family of probability densities
where the parameters are in the range , , and will be chosen explicitly. Simple calculation shows that the moments of are ,
Choosing, say, , , and setting , we obtain from the first equation, from the second equation and finally the last equation becomes
Recall that we are in the regime where . For any fixed , the right hand side of (C.9) is a monotonically decreasing function in whose value goes down from to . But we know from (C.1) that , thus there is a value such that (C.9) holds, moreover, is in a compact subinterval of that depends only on and . It is then easy to check that the support and the supremum norm of the density also remains in a compact set, depending only on . Therefore we constructed a probability measure with the given moments, that is a linear combination of two Gaussians plus a compactly supported piece with a nonnegative bounded density. To ensure smoothness, we replace with , where and is a compactly supported nonnegative smooth symmetric function with . The first moment is unchanged and the formulas (C.6) for the higher moments will get modified by an error term of order . Let be much smaller than all other parameters in this proof. It is easy to see that, by a simple calculation treating as a small perturbation, one can still choose and in the previous argument to match and .
Finally, note that the sum of two Gaussians satisfy the LSI, as well as its compact perturbation and the new LSI constant depends only on the supremum norm of the density of the perturbation. Since all these parameters remain uniformly controlled by and , we proved Lemma C.1, i.e., Lemma 6.5 for .
Now consider the case . For any real random variable , independent of , and with the first 4 moments being , , and , the first 4 moments of
Given and , satisfying (C.1) and using Lemma C.1, we obtain that for any small enough, there exists a real random variable such that the first four moments are , ,
With , we have , thus
Hence with (C.11) and (C.12), we obtain that satisfies and (6.21). With Lemma C.1, we obtain that the LSI constant of is bounded by a constant only depends on and , which completes the proof of Lemma 6.5.