- 1Department of Mathematics, Beijing Technology and Business University, Beijing, China
- 2Department of Mathematics, University of California, Davis, Davis, CA, United States
We prove the Central Limit Theorem for finite-dimensional vectors of linear eigenvalue statistics of submatrices of Wigner random matrices under the assumption that test functions are sufficiently smooth. We connect the asymptotic covariance to a family of correlated Gaussian Free Fields.
1. Introduction
Wigner random matrices were introduced by Wigner in the 1950's (see e.g., [1–3]) to study energy levels of heavy nuclei. Let and {Wjk}1≤j<k≤n be two independent families of independent and identically distributed real-valued random variables satisfying:
Set with Wjk = Wkj. The Wigner Ensemble of normalized real symmetric n × n matrices consists of matrices M of the form
The archetypal example of a Wigner real symmetric random matrix is the Gaussian Orthogonal Ensemble (GOE) defined as [3]
where the entries of B are i.i.d. real Gaussian random variables with zero mean and variance 1/2.
Wigner Hermitian random matrices are defined in a similar fashion. Specifically, we assume that and {Wjk}1≤j<k≤n are two independent families of independent and identically distributed real, correspondingly complex random variables satisfying (1.1). The archetypal example of a Wigner Hermitian random matrix is the Gaussian Unitary Ensemble (GUE)
where the entries of B are i.i.d. complex standard Gaussian random variables [3].
Over the last sixty years, Random Matrix Theory has developed many exciting connections to Quantum Chaos [4], Quantum Gravity [5], Mesoscopic Physics [6], Numerical Analysis [7], Theoretical Neuroscience [8], Optimal Control [9], Number Theory [10], Integrable Systems [11], Combinatorics [12], Random Growth Models [13], Multivariate Statistics [14], and many other fields of Science and Engineering.
For a real symmetric (Hermitian) matrix M of order n, its empirical distribution of the eigenvalues is defined as where λ1 ≤ … ≤ λn are the (ordered) eigenvalues of M. The Wigner semicircle law states that for any bounded continuous test function φ:ℝ → ℝ, the linear statistic
converges to ∫ φ(x)dμsc(dx) in probability, where μsc is determined by its density
see e.g., Wigner [2], Ben Arous and Guionnet [15], and Anderson et al. [16].
The Gaussian fluctuation for linear statistics has been extensively studied since the pioneering paper by Jonsson [17]. We refer the reader to Johansson [18], Sinai and Soshnikov [19], Bai et al. [20], Lytova and Pastur [21], Shcherbina [22], Anderson and Zeitouni [23], Li and Soshnikov [24], Lodhia and Simm [25], and references therein. The goal of this paper is to prove the central limit theorem for the joint distribution of linear eigenvalue statistics for submatrices of Wigner random matrices.
The rest of the paper is organized as follows. We formulate our results in section 2. Theorem 2.1 is proved in section 3. Theorem 2.2 is proved in section 4. Auxiliary results are discussed in the Appendices.
Research of the last author has been partially supported by the Simons Foundation Collaboration Grant for Mathematicians # 312391.
2. Statement of Main Results
This section is devoted to formulation of the main results of the paper.
For a generic random variable ξ, in what follows denote by ξ°: = ξ − 𝔼[ξ]. For a finite set B ⊂ {1, 2, …, n} denote by M(B) the submatrix of M formed by the entries corresponding to intersections of rows and columns of M marked by the indices in B, which inherits the ordering. For example,
Let be infinite subsets of ℕ such that and their pairwise intersections have positive densities. Denote
We assume that the following limits exist:
If it does not lead to ambiguity, we will omit the superindex n in the notation for For an n × n matrix M and B ⊂ {1, 2, …, n}, consider a spectral linear statistic where are the eigenvalues of the submatrix M(B). We are going to study the joint fluctuations of linear statistics of the eigenvalues. It will be beneficial later to view the submatrices from a different perspective. Consider the matrix , which projects onto the subspace corresponding to indices in B, i.e.,
Define
where are the eigenvalues of MB. Note that the spectra of MB and M(B) differ only by a zero eigenvalue of multiplicity n − |B|. As a result, when we consider the linear statistics of their eigenvalues the extra terms (n − |B|)φ(0) cancel once we center these random variables. In general, when considering multiple sequences Bl, in order to simplify the notation we will write
Also, denote by P(l, r) the matrix which projects onto the subspace corresponding to the indices in the intersection Bl ∩ Br, i.e.,
Recall that a test function φ:ℝ → ℝ belongs to the Sobolev space if
where is its Fourier transform. First we consider Gaussian Wigner matrices.
Theorem 2.1. Let be an n × n real symmetric random matrix with Gaussian entries satisfying (1.1) and M = n−1/2 W. Let be infinite subsets of ℕ satisfying (2.2-2.5). Let φ1, ⋯ ;, φd:ℝ → ℝ be test functions that satisfy the regularity condition ||φl||s < ∞, for some Then the random vector
converges in distribution to the zero mean Gaussian vector with the covariance given by
In the expression for the covariance, (φl)k denotes the coefficients in the expansion of φl in the (rescaled) Chebyshev basis, i.e.,
and
Note the form of the kernel in the above contour integral expression for the covariance. Since it is the Green's function for the Laplacian on ℍ with Dirichlet boundary conditions (appropriately scaled), we note that the limiting distributions form a family of correlated Gaussian free fields. This is consistent with the previous work of Borodin [26, 27] for the covariance of linear eigenvalue statistics corresponding to polynomial test functions. Now we formulate our result for non-Gaussian Wigner matrices.
Theorem 2.2. Let be an n × n random matrix and M = n−1/2 W. Let be infinite subsets of ℕ satisfying (2.2-2.4) and (2.5). Assume the following conditions:
(1) All the entries of W are independent random variables.
(2) The fourth moment of the non-zero off-diagonal entries does not depend on n:
(3) There exists a constant σ6 such that for any j, k, .
Let φ1, ⋯ ;, φd: ℝ → ℝ be test functions that satisfy the regularity condition ||φl||s < ∞, for some s > 5.5. Then the random vector (2.12) converges in distribution to the zero mean Gaussian vector with the covariance given by
where Cov(Gl, Gp) is given by (2.13).
In the course of the proof of Theorem 2.1, it has been necessary to understand the following bilinear form.
Definition 2.3. Let M be a Wigner matrix satisfying (1.1), and let P(l), P(l,r) be the projection matrices defined in (2.6) and (2.10). For functions , define
Remark 2.4. The bilinear form 〈·, ·〉lr is well defined on as a consequence of Proposition 3.9. The bilinear form is also well defined for polynomial f and g, see section 3.2 and also Lemma 2.5 below.
The following diagonalization lemma is an important technical tool for the proof of Theorem 2.1.
Lemma 2.5. The two families and of rescaled Chebyshev polynomials of the second kind diagonalize the bilinear form (2.17). More precisely,
Let for some . A consequence of (2.18) is that
In section 3.2, it will also be proved that, with f, g given as above, almost surely
Remark 2.6. Recall that the rescaled Chebyshev polynomials of the second kind are orthonormal with respect to the Wigner semicircle law, i.e.,
Also,
The proof of Theorem 2.1 appears in section 3 and the proof of Theorem 2.2 appears in section 4.
Remark 2.7. Theorems 2.1 and 2.2 prove convergence of finite-dimensional distributions. This paper does not address the functional convergence which would require a tightness result.
3. Proof of Theorem 2.1
3.1. Stein-Tikhomirov Method
We follow the approach used by Lytova and Pastur [21] for the full Wigner matrix case (see also [28–30]). Essentially, it is a modification of the Stein-Tikhomirov method (see e.g., [31]). This approach was also used to prove the CLT for linear eigenvalue statistics of band random matrices in Li and Soshnikov [24], which is connected to our work through the Chu-Vandermonde identity (see section 3.2). While several steps of our proof are similar to the ones in Lytova and Pastur [21], the fact that we are dealing with submatrices introduces new technical difficulties.
We will prove Theorem 2.1 in the present section and extend the technique to non-Gaussian Wigner matrices later. The following inequalities will be used often. As a consequence of the Poincaré inequality, one can bound from above the variance of Trφ(M) for a differentiable test functions φ as
We refer the reader to Lytova and Pastur [21] for the details. The next inequality is due to Shcherbina (see [22]). Let s > 3/2 and . Then there is a constant Cs > 0, so that
Let ϵ > 0 and set . Recall that the regularity assumption on the test functions is that ||φl||5/2+ϵ < ∞, for 1 ≤ l ≤ d. There exists a Cϵ > 0 so that
The inequality holds because of (3.3), since M(Bl) is an ordinary |Bl| × |Bl| Gaussian Wigner matrix. We note that the bound is n-independent.
It is sufficient to prove the CLT for all linear combinations of the components of the random vector (2.12). Consider a linear combination , and denote the characteristic function by
It is a basic fact that the characteristic function of the Gaussian distribution with variance V is given by
As a consequence of the Levy Continuity theorem, to prove theorem 2.1 it will be sufficient to demonstrate that for each x ∈ ℝ,
where Z(x) is given as above with
So V is the limiting variance of ξ. It will be demonstrated that Zn(x) converges uniformly to the solution of the following equation
Note that (3.6) is the unique solution of (3.9) within the class of bounded and continuous functions. Therefore, to prove the theorem, it is sufficient to demonstrate that the pointwise limit of Zn(x) is a continuous and bounded function which satisfies Equation (3.9), with V given by (3.8).
Observe that
Now it follows by the Cauchy-Schwarz inequality and (3.4) that
Since Zn(0) = 1, we have by the fundamental theorem of calculus that
Then to prove the CLT it is sufficient to show that any uniformly converging subsequences {Znm} and , satisfy
and
A pre-compactness argument based on the Arzela-Ascoli theorem will be developed below, which ensures that the subsequences converge uniformly, implying that the limit is a continuous function. The estimate |Zn(x)| ≤ 1, for all n, shows that the sequence is uniformly bounded. Generally we will abuse the subsequence notation by writing {n} for a uniformly converging subsequence. Since (3.11) combined with ||φl||5/2+ϵ < ∞ justify an application of the dominated convergence theorem in (3.12), it follows from (3.13) and (3.14) that the limit of Zn(x) satisfies equation (3.9). Therefore the pointwise limit (3.7) holds. We turn our attention to the pre-compactness argument, and will argue later that (3.13) and (3.14) hold. We follow the notations used in Lytova and Pastur [21]. Denote by
Recall that U(l)(t) is a unitary matrix, and writing , we have
Moreover,
where
Applying the Fourier inversion formula
it follows that
Now define
Using the Fourier representation of the linear eigenvalue statistics in (3.10), it follows that
where
The limit of is determined later in the proof. Since
we need only consider t ≥ 0. It will now be demonstrated that each sequence is bounded and equicontinuous on compact subsets of {x ∈ ℝ, t ≥ 0}, and that every uniformly converging subsequence has the same limit Y(l), implying (3.13) and (3.14). See proposition 3.1.
Let φ(x) = eitx, and note that . Applying the inequality (3.2) to the linear eigenvalue statistic , we obtain
Now set φ(x) = ixeitx, and notice that
Using the inequality (3.1) and the fact that n−1𝔼Tr(M(l))2 ≤ σ2 + 1, it follows that
Using the Cauchy-Schwarz inequality, the bound |en(x)| ≤ 1, (3.27) and (3.28), we obtain
and also
Observe that
Using the above derivative with the Cauchy-Schwarz inequality, (3.4) and (3.27), we have that
It follows from (3.29), the mean value theorem combined with (3.30) and (3.31), and ||φr||5/2+ϵ < ∞, that each sequence is bounded and equicontinuous on compact subsets of ℝ2. The following proposition justifies this restriction.
Proposition 3.1. In order to prove the functions converge uniformly to appropriate limits so that (3.24) implies (3.14), it is sufficient to prove the convergence of on arbitrary compact subsets of {x ∈ ℝ, t ≥ 0}.
Proof: Let δ > 0. Recall that the regularity assumption on the test functions φl are
i.e., that , with s = 5/2 + ϵ. Using the Cauchy-Schwarz inequality, it follows that
which implies that
A consequence of the finiteness of the integral in (3.33), for each 1 ≤ l ≤ d, is that there exists a T > 0 so that
Using (3.24), we can write
Then (3.35), (3.29), (3.34) imply that
Notice that the estimate (3.36) is n-independent, so that in particular the estimate holds in the limit n → ∞. Since δ was arbitrary, this completes the proof of the proposition.□
This completes the pre-compactness argument, which allows us to pass to the limit in (3.24) and in (3.12), and conclude that Zn(x) converges pointwise to the unique solution of equation (3.9) belonging to Cb(ℝ), implying (3.7), and hence the conclusion of the theorem. Now we show the limiting behavior of the sequences imply (3.13) and (3.14). Consider the identity
Apply this identity, noting that , to obtain that
Recalling that , and applying the decoupling formula (see Appendix 1) for Gaussian random variables, it follows from (3.37) that
It will be useful to rewrite (3.38) as
The reason for the rewrite is that it splits the functions into a part that depends on the distribution of the diagonal entries and a part that corresponds to the same term as for the Gaussian Orthogonal Ensemble, for which σ2 = 2. Recalling that en(x) is given by (3.23), again writing and using the identity
it follows by a direct calculation that
Then for 1 ≤ l ≤ d, using (3.40) and (3.19), it follows that
and also that
Using the semigroup property
it follows form (3.41) that T1 can be written
Define
The following proposition presents the functions in a form that is amenable to asymptotic analysis.
Proposition 3.2. The equation , can be written as
where
and
Proof: Begin with the term T11, defined in (3.43). Write
so that
Noting that
and also that
it follows that
The term (3.55) goes into the remainder, which becomes (3.49). Also, (3.56) is added to the left-hand side of (3.45). Now consider the term T12, defined in (3.43). We have that
which becomes (3.48) in the remainder. Consider the term T13, also defined in (3.43). Writing
it follows, with given by (3.46), that
Then (3.59) becomes (3.50) in the remainder, while (3.60) remains on the right-hand side of (3.45). Now consider the term T21, defined in (3.42). This term becomes (3.51) in the remainder. Finally, consider the term T22, also defined in (3.42). Write
so that, with given by (3.47),
The term (3.62) becomes (3.52) in the remainder. Also, the term (3.63) remains on the right-hand side of (3.45). This completes the argument for proposition 3.2.□
We now turn our attention to the remainder term, , of proposition 3.2. The content of the following proposition is that the remainder is negligible in the limit.
Proposition 3.3. Each term of converges to 0 uniformly on compact subsets of {x ∈ ℝ, t ≥ 0}, for 1 ≤ l ≤ d. In other words, we have the uniform limit
Proof: Begin with the term (3.48). Applying the estimate (3.29), we obtain
Now consider the term (3.49). Using the bound , the Cauchy-Schwarz inequality, and (3.27) twice, it follows that
Consider the term (3.50) next. Applying (2.20) of lemma 2.5 to the exponential function and , and noting that , it follows that
While the exponential function does not belong to , we can truncate the exponential function in a smooth fashion outside the support of the semicircle law, so that the truncated exponential function belongs to . We may replace the exponential function by its truncated version because the eigenvalues of the submatrices concentrate in the support of the semicircle law with overwhelming probability. Then
Here it is not so important to know the exact value of the limit, but we will use the fact that we have convergence in the mean and almost surely to the same limit. Note the convergence in (3.67) implies that the sequence of numbers
is bounded. Also the convergence in (3.68) implies that the random variables
are bounded with probability 1. Using (3.67) and (3.68) with the dominated convergence theorem, it now follows that
Combining the bound |en(x)| ≤ 1 with (3.69), it follows that
Then, using (3.70) in the remainder term (3.50), it follows that
Consider (3.51), which is the next term in the remainder. Observe that, again using the Cauchy-Schwarz inequality and the fact that |en(x)| ≤ 1,
For fixed j, p, q ∈ Bl, using (3.19),
Using (3.73), recalling that , and the Cauchy-Schwarz inequality, it follows that
Using (3.74), the fact that , and the inequality 2ab ≤ a2 + b2, it follows that
Using the Poincaré inequality, (3.75), adding more nonnegative terms, and using the property of the unitary matrices that
it follows that
Now, combining (3.72) with (3.77), we have that
and it follows that
Now consider the final term of the remainder, given by (3.52). We apply the identity below
which is a consequence of the matrix version of the Fourier inversion formula (3.21). Using (3.80), the finiteness of the integral (3.33), the above estimate (3.78), and the dominated convergence theorem, we have that
Combining (3.65), (3.66), (3.71), (3.79), (3.81), and comparing to the remainder term (3.48), the proposition is proved.□
The goal now is to pass to the limit in (3.45). In what follows let denote the (rescaled) Chebyshev polynomials of the second kind on ,
Proposition 3.4. Let be given by (3.46), given by (3.47), and given by (3.44). Then the limits of , and as n → ∞ exist and
where
the limit of is given by
and the limit of , after rescaling by γl, is given by
Proof: Recall that . In the full Wigner matrix case one has , and the limiting behavior follows immediately from the Wigner semicircle law. In the case of submatrices with asymptotically regular intersections there are additional technical difficulties due to the fact that for the n × n submatrices M(l) = P(l)MP(l), we have
so that the summation is restricted to entries common to both submatrices, i.e., to j, k ∈ Bl ∩ Br. It follows from lemma 2.5 that the limit of exists and equals
where
This establishes (3.83). The proof of lemma 2.5 will be given in section 3.2.
We turn our attention to . First it will be argued that the variance of the matrix entries converge to zero. Using the Poincaré inequality, (3.74), (3.76), and proposition 3.1, it follows that
Note that in the course of the calculation (3.90), we showed that
The Cauchy-Schwarz inequality implies
Since ||φr||5/2+ϵ < ∞, we have the estimate
Using the Cauchy-Schwarz inequality and (3.80), it follows that
Using the Poincaré inequality, (3.91), (3.94), we obtain
Using (3.93), (3.95), (3.90), and the Cauchy-Schwarz inequality, we obtain
Using (3.96) it is justified to replace the expectation by the product , when passing to the limit. We use proposition 2.1 of Pizzo et al. [32], which guarantees that for ,
In order to apply this asymptotic to the exponential function, which is smooth enough, we truncate the function in a smooth fashion outside the support of μsc. We are justified in replacing the exponential function by its truncated version because the eigenvalues of the submatrices concentrate in the support of the semicircle law, with overwhelming probability. It is for this same reason that we may assume is compactly supported. This function is not sufficiently smooth, but we can avoid this problem by a density argument using standard convolution, and then apply the bound (3.3) on the variance of linear eigenvalue statistics.
Let satisfy , and consider the mollifiers . Then
, and using standard Fourier theory it can be shown that
It follows from (3.96) and (3.97) that
Using (3.99), we pass to the limit in (3.47), and obtain (3.85). The limit of
is given by (rescaled) Wigner semicircle law, as a consequence of the zero eigenvalues. Alternatively, it can be computed using the bilinear form in lemma 2.5, with f(x) = eitx and g(x) = 1. To facilitate solving the integral equation (3.101), below, it will be useful to rescale by γl. We obtain
which establishes (3.86). The proposition is proved.□
Now using propositions 3.2, 3.3, 3.4, we pass to the limit nm → ∞ in (3.45), and determine that the limit Y(l) of every uniformly converging subsequence satisfies the equation
where A(l)(t) is given by (3.83), Q(l)(t) is given by (3.85), and v(l)(t) is given by (3.86).
Now the argument will proceed by solving the integral equation (3.101). We use a version of the technique used by Pastur and Lytova [21], to solve this equation. Define
which is the Stieltjes transform of the rescaled semicircle law, where as z → ∞. A direct calculation shows that ṽ(l) = f, where ṽ(l) denotes the generalized Fourier transform of v(l). We obtain
We check that
Set
after replacing the integral over L by the integral over [−2γl, 2γl], and taking into account that is , on the upper and lower edges of the cut. Then the solution of (3.101) is
Then, with Flr given by (3.84),
and
Using the regularity condition ||φl||5/2+ϵ < ∞ for 1 ≤ l ≤ d, (3.107), (3.108), and the dominated convergence theorem to pass to limit in (3.24) yields
Applying the Fourier inversion formula (3.21), it follows that
We will use the fact that
Expand the test function φl in the Chebyshev basis to obtain
Returning to the computation of Z′(x), using (3.110), (3.111), and (3.112), it follows that
Using the orthogonality of the Chebyshev polynomials (2.21),
Integrating by parts yields
so that
Since
we expand φr(y) in the Chebyshev basis to obtain
Recalling that Flr is given by (3.84), it follows that
Using (3.119), (3.114), (3.115), and (3.116), in (3.113), it follows that
We have obtained the expression for the asymptotic covariance (2.14) in terms of Chebyshev polynomials. Now we write this expression as a contour integral. Let
make the change of coordinates , and use (2.14) to obtain that
Integrating by parts in θ, ω it follows that
To evaluate the infinite sum above, recall that for z ∈ ℂ with |z| < 1, we have
Noting that β < 1, using (3.123), it follows that
Making the change of coordinates , and recalling that , this can be written as
Combining (3.122), (3.125), and noting that
it follows that
Compare (3.120) to (3.8). Using (3.126), (3.13), (3.14), and (3.9), it follows that the covariance can be written as.
3.2. The Bilinear Form
The main goal of this section is to prove Lemma 2.5, to which we now turn our attention. Begin with the following definition.
Definition 3.5. Let M be a Wigner matrix satisfying (1.1), and let P(l), P(l,r) be the projection matrices defined in (2.6) and (2.10). For polynomial functions f, g:ℝ → ℝ, define
The large n limit of 〈f, g〉lr, n exists for polynomial functions because all moments of the matrix entries of M are finite. Then where 〈·, ·〉lr is the bilinear form defined in definition 2.3.
We will compute the bilinear form 〈f, g〉lr for monomial functions f(x) = xk, g(x) = xq. We will also consider the random variables n−1Tr{P(l)f(M(l))P(l, r)g(M(r))P(r)}, and prove their convergence almost surely to the non-random limit described in lemma 2.5. To this end, we will use some results and techniques from Free Probability. We refer the reader to Anderson et al. [16] for the relevant background concerning noncommutative probability spaces, asymptotic freeness of Wigner matrices, as well as the definition and the properties of the multilinear free cumulant functionals κp, for p ≥ 1.
Consider the matrices M, P(l), P(r) as noncommutative random variables in the noncommutative probability spaces and also . Since M is a Wigner random matrix and {P(l), P(r)} are deterministic Hermitian matrices, it follows from part (i) of Theorem 5.4.5 in Anderson et al. [16] that M is asymptotically free from {P(l), P(r)} with respect to the functional n−1𝔼Tr(·). In addition, it follows from part (ii) of Theorem 5.4.5 in Anderson et al. [16] that M is almost surely asymptotically free from {P(l), P(r)} with respect to the functional n−1Tr(·). The collection of all non-crossing partitions over a set with p letters is denoted below by NC(p). An important consequence of the asymptotic freeness of these matrices is that mixed free cumulants of M and {P(l), P(r)} vanish in the limit, with respect to both functionals, see Theorem 5.3.15 of Anderson et al. [16]. Therefore, letting κπ denote a product of free cumulant functionals corresponding to the block structure of the partition π, it follows that
and also that almost surely
Above NC(odd), for example, denotes the set of non-crossing partitions on the odd integers in the indicated set. Since the calculation of the joint moments in each non-commutative probability space and is identical, we make no distinction between their free cumulants. Lets denote by NCP(p) the set of all non-crossing partitions over p letters which are also pair partitions. Recall that NC(p) is a poset, the notion of partition refinement induces a partial order on NC(p), which will be denoted by π ≤ σ if, with π, σ ∈ NC(p), each block of π is contained within a block of σ. Now a notion of the complement of a partition will be developed.
Definition 3.6. With π ∈ NC(p1), define the non-crossing complement to be the unique non-crossing partition on p2 letters so that , and σ ≤ πc for all other σ ∈ NC(p2) satisfying π∪σ ∈ NC(p1 + p2).
Since the limiting spectral distribution of M is Wigner semicircle law with respect to the functional n−1𝔼Tr, and almost surely the Wigner semicircle law with respect to the functional n−1Tr, we have that κ2(M) = 1 and κp(M) = 0 for p ≠ 2. It follows now that
and also that almost surely
Supposing then that k + q is even, and continuing the calculation,
where are the blocks of the non-crossing complement of a given partition. We have used the complement partitions to write the sum of the free cumulants over the partitions of the projection matrices into a product of joint moments of the projection matrices.
Similarly, with respect to the functional n−1Tr, we have that almost surely
Recall that the non-crossing pair partitions are in bijection with Dyck paths, NCP(k + q) → D(k+q). Thus the computation for each functional reduces to counting Dyck paths. The number of Dyck paths (h(0), ⋯ ;, h(k + q)) with h(k) = j is
Note that , for any a, b ≥ 1. Also note that below the partition depends on the Dyck path d ∈ D(k+q) (which corresponds to some non-crossing pair partition). Also note that by we denote the number of blocks of . Suppose for now that both k, q are even integers.
The height of the path at h(k) must be even, say h(k) = 2j. Those blocks which consist only of the matrices P(l) will contribute a factor of γl to the product of joint moments. The number of blocks which contain only the matrices P(l) corresponds to the number of down edges of the path in the first k steps. Denote by u the number of up edges and d the number of down edges of the path up to step k. Then u + d = k and u − d = 2j, which implies that d = k/2 − j. The number of blocks which contain only the matrices P(r) is equal to the number of up edges of the path in the final q steps. This number corresponds to the exponent on the factor γr in the product of joint moments. Denote now by u the number of up edges and d the number of down edges of the path in the final q steps. The u + d = q and d − u = 2j, which implies that u = q/2 − j. The remaining blocks of the partition contain projection matrices of mixed type and will contribute a factor γlr to the product of joint moments. Since the total number of blocks in the partition is , the number of factors of γlr in the product of joint moments is 2j + 1. Partitioning the Dyck paths into equivalence classes based on the height h(k), we get that
and also, almost surely,
Now suppose that both k, q are odd. The height of the path at h(k) must be odd, say h(k) = 2j + 1. Similar to the even case, the number of blocks which consist only of the matrices P(l) equals the exponent of γl in the product of joint moments. The number of blocks which contain only the matrices P(l) corresponds to the number of down edges of the path in the first k steps. Denote by u the number of up edges and d the number of down edges of the path up to step k. Then u + d = k and u − d = 2j + 1, which implies that d = (k − 1)/2 − j. The number of blocks which contain only the matrices P(r) is equal to the number of up edges of the path in the final q steps. This number corresponds to the exponent on the factor γr in the product of joint moments. Denote now by u the number of up edges and d the number of down edges of the path in the final q steps. The u + d = q and d − u = 2j + 1, which implies that u = (q − 1)/2 − j. The remaining blocks of the partition contain projection matrices of mixed type and will contribute a factor of γlr to the product of joint moments. Since the total number of blocks in the partition is , the number of factors of γlr in the product of joint moments is 2j + 2. Partitioning the Dyck paths into equivalence classes based on the height h(k), we get that
and also, almost surely,
Now for polynomials and we have by linearity that
The intersection of countably many events, each with probability 1, occurs with probability 1. There are only countably many polynomials with rational coefficients, so we have proved that the random variables
converge almost surely to the same, non-random limit given by the right hand side of (3.134), whenever f, g are polynomials with rational coefficients.
The bilinear form 〈f, g〉lr is diagonalized in the next proposition.
Proposition 3.7. The two families and of rescaled Chebyshev polynomials of the second kind are biorthogonal with respect to the bilinear form (3.128). More precisely,
The Proposition 3.7 is proven in the Appendix 2.
Remark 3.8. Previously we have shown that whenever f, g are polynomials with rational coefficients, almost surely (a.s.)
The Chebyshev polynomials have rational coefficients, so it follows from the above argument that a.s.
Now the bilinear form 〈·, ·〉lr will be extended to functions other than polynomials. For this part of the argument, the bound on the variance of linear eigenvalue statistics in 3.3 is essential.
Proposition 3.9. Let for some , i.e., for some ϵ > 0,
Then the limit of 〈f, g〉lr, n (see definition 3.5) as n → ∞ exists and
and also, almost surely,
where the kernel Flr(x, y) is given by (3.84).
The Proposition 3.9 is proven in the Appendix 3. Lemma 2.5 now follows from Propositions 3.7 and 3.9. This also completes the proof of Theorem 2.1.
4. Proof of Theorem 2.2
It is enough to prove the case of d = 2, i.e., the limiting covariance of and . Let be defined in (3.16–3.17) respectively. U(t) and are unitrary matrices and
By Remark 3.3 in Lytova and Pastur [21], we have the following bounds
Let w be a linear combination of random variables and , and Zn(x) be the characteristic function of w, i.e.,
We note that
By the Cauchy-Schwarz inequality and (4.3–4.4) we get
Using the Fourier inversion formula we obtain
Therefore,
where
By the Cauchy-Schwarz inequality,
and
Also
where
Recall that for
and
Lemma 4.1. Let φ1, φ2 have fourth bounded derivatives. Then
where Cl(x, t) is a degree l polynomial of |x|, |t|with positive coefficients.
Proof: From (4.16) and (4.17), we have
(4.19) implies
These two inequalities complete the proof of Lemma 4.1□
We now apply the Decoupling Formula (5.1) with p = 2 to obtain
where the error term is bounded by C3(x, t) as n → ∞. The first term in (4.23) is
The first term and the second term are bounded because of (4.12). The last term is bounded by
and the third term is bounded by .
The second term in (4.23) is
The first term is bounded by 2|2−σ2||t|, and the second term is bounded by
So
By symmetry, has similar bounds. Therefore, we conclude that the sequences are bounded and equicontinuous on any finite subset of ℝ2. We will prove now that any uniformly converging subsequence of has same limit .
We deal with Yn first, and by the symmetric property, we can find . We use the identity
to write
By applying decoupling formula (5.1) with p = 3 to (4.25), we have
where
and κ3, jj, κ4, jj are uniformly bounded, i.e. there exist constants σ3, σ4 such that
and
Let
Then
and
We note that if Wjk's are Gaussian, then Yn(x, t) = T1. Thus, T1 coincide with the Yn in Theorem 2.1.
Let
Then
where
and rn(x, t) → 0 on any bounded subset of {(x, t):x ∈ ℝ, t > 0}.
Let . It follows from the proof of Theorem 2.1 that A(t) coincides with the one established in the Gaussian case.
Proposition 4.2. T2 → 0 on any bounded subset of {(x, t):x ∈ ℝ, t > 0}.
Proof: The second derivative (l=2) is
Let
Then T2 = T21+T22+T23. It has been shown in Lytova and Pastur [21] that on any bounded subset of {(x, t):x ∈ ℝ, t > 0}. Also, by Proposition 4.1 and (4.29), one has .
In T22, there are three types of a sum,
Applying the Cauchy-Schwarz inequality we obtain
Writing
where
||V(t)|| ≤ 1, ||P12U(t)P12|| ≤ 1, we conclude that , hence . This completes the proof of Proposition 4.2.□
Proposition 4.3.
where
and R3(x, t) → 0 on any bounded subset of {(x, t):x ∈ ℝ, t > 0}.
Proof:
where
By Proposition 4.1 and (4.29), we have .
The third derivative (l=3)
So any term of
containing at least one off-diagonal entry Ujk or is bounded by . Let R3(x, t) be the sum of and these terms. Then . So two terms in (4.35) containing diagonal entries of U and only left contribute to T3. They are T31 and T32.□
Let
By Wigner semicircle law, one has
Then
Let
Denote
Proposition 4.4.
uniformly on any bounded subset of {(x, t):x ∈ ℝ, t > 0}.
Proof: The proof of (4.40) can be found in Lytova and Pastur [21]. To study asymptotic behavior of the l.h.s. of (4.41) we write:
where
Then
and
where
Proposition 4.5.
uniformly on any compact set of ℝ2.
Proof: Indeed, uniformly in 1 ≤ j ≤ n and t1, t2 from a compact set of ℝ2, which follows from
(see e.g., [33]).□
So the limit of T32 is
□
So if , then Y(x, t) satisfies
Therefore, if let Y*(x, t) be the solution of
then
Symmetrically,
Therefore,
where
and G1, G2 are the random variables in Theorem 2.1 with d = 2.
Therefore,
By symmetry, for any 1 ≤ l ≤ p ≤ n,
Data Availability Statement
The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.
Author Contributions
All authors listed have made a substantial, direct and intellectual contribution to the work, and approved it for publication.
Funding
This research has been supported in part by the Simons Foundation award #312391.
Conflict of Interest
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
Supplementary Material
The Supplementary Material for this article can be found online at: https://www.frontiersin.org/articles/10.3389/fams.2020.00017/full#supplementary-material
References
1. Wigner EP. On the statistical distribution of the widths and the spacings of nuclear resonance levels. Proc Cambridge Philos Soc. (1951) 47:790–8. doi: 10.1017/S0305004100027237
2. Wigner EP. On the distribution of the roots of certain symmetric matrices. Ann Math. (1958) 67:325–7. doi: 10.2307/1970008
4. Bohigas O, Giannoni MJ, Schmit C. Characterization of chaotic quantum spectra and universality of level fluctuation laws. Phys Rev Lett. (1984) 52:1–4. doi: 10.1103/PhysRevLett.52.1
5. Franchini F, Kravtsov V. Horizon in random matrix theory, the Hawking radiation, and flow of cold atoms. Phys Rev Lett. (2009) 103:166401. doi: 10.1103/PhysRevLett.103.166401
6. Sanchez D, Buettiker DM. Magnetic-field asymmetry of nonlinear mesoscopic transport. Phys Rev Lett. (2004) 93:106802. doi: 10.1103/PhysRevLett.93.106802
7. Edelman A, Rao NR. Random matrix theory. Acta Numer. (2005) 14:233–97. doi: 10.1017/S0962492904000236
8. Sompolinsky H, Crisanti A, Sommers HH Chaos in random neural networks. Phys Rev Lett. (1988) 61:259–62. doi: 10.1103/PhysRevLett.61.259
10. Keating J. The Riemann zeta-function and quantum chaology. Proc Int School Phys Enrico Fermi CXIX. (1993) 145–85.
11. Harnad J. Editor. Random Matrices, Random Processes and Integrable Systems. CRM Series in Mathematical Physics. New York, NY: Springer (2011).
12. Romik D. The Surprising Mathematics of Longest Increasing Subsequences. New York, NY: Cambridge University Press (2015).
13. Johansson K. Random growth and random matrices. In: Proceedings of the 2000 European Congress of Mathematics, Progress in Mathematics (2001). Basel: Birkhäuser. p. 445–56.
14. Johnstone IM. High dimensional statistical inference and random matrices. In: Proceedings of the International Congress of Mathematicians. Madrid (2006).
15. Ben Arous G, Guionnet A. Wigner matrices. In: Akemann G, Baik J, Di Francesco P, editors. Oxford Handbook on Random Matrix Theory. New York, NY: Oxford University Press (2011).
16. Anderson GW, Guionnet A, Zeitouni O. An Introduction to Random Matrices. New York, NY: Cambridge University Press (2010).
17. Jonsson D. Some limit theorems for the eigenvalues of a sample covariance matrix. J Mult Anal. (1982) 12:1–38. doi: 10.1016/0047-259X(82)90080-X
18. Johansson K. On fluctuations of eigenvalues of random hermitian matrices. Duke Math J. (1998) 91:151–204. doi: 10.1215/S0012-7094-98-09108-6
19. Sinai Y, Soshnikov A. Central limit theorem for traces of large random symmetric matrices with independent matrix elements. Bol Soc Brasil Mat. (1998) 29:1–24. doi: 10.1007/BF01245866
20. Bai ZD, Wang X, Zhou W. CLT for linear spectral statistics of wigner matrices. Electron J Probabil. (2009). 14:2391–417. doi: 10.1214/EJP.v14-705
21. Lytova A, Pastur L. Central limit theorem for linear eigenvalue statistics of random matrices with independent entries. Ann Probabil. (2009) 37:1778–840. doi: 10.1214/09-AOP452
22. Shcherbina M. Central Limit Theorem for linear eigenvalue statistics of the Wigner and sample covariance random matrices. J Math Phys Anal Geometry. (2011) 7:176–92.
23. Anderson GW, Zeitouni O. A CLT for a band matrix model. Probab Theory Relat Fields. (2006) 134:283–338. doi: 10.1007/s00440-004-0422-3
24. Li L, Soshnikov A. Central limit theorem for linear statistics of eigenvalues of band random matrices. Random Matrices Theor Appl. (2013) 2:1350009. doi: 10.1142/S2010326313500093
26. Borodin A. CLT for spectra of submatrices of Wigner random matrices. Mosc Math J. (2014) 14:29–38. doi: 10.17323/1609-4514-2014-14-1-29-38
27. Borodin A. CLT for spectra of submatrices of Wigner random matrices II. Stochastic evolution. Random Matrix Theory Interact Part Integr Syst. (2014) 65:57–69.
28. Lytova A, Pastur L. Fluctuations of matrix elements of regular functions of Gaussian random matrices. J Stat Phys. (2009) 134:147–59. doi: 10.1007/s10955-008-9665-1
29. Shcherbina M, Tirozzi B. Central limit theorem for fluctuations of linear eigenvalue statistics of large random graphs. J Math Phys. (2010) 51:023523. doi: 10.1063/1.3299297
30. Shcherbina M. On fluctuations of eigenvalues of random band matrices. J Stat Phys. (2015) 161:73–90. doi: 10.1007/s10955-015-1324-8
32. Pizzo A, Renfrew D, Soshnikov A. Fluctuations of matrix entries of regular functions of wigner matrices. Ann l'Institut Henri Poincare (B) Probab Stat. (2013) 49:64–94. doi: 10.1214/11-AIHP459
Keywords: Wigner matrices, linear statistics, eigenvalues, central limit theorem, submatrices
Citation: Li L, Reed M and Soshnikov A (2020) Central Limit Theorem for Linear Eigenvalue Statistics for Submatrices of Wigner Random Matrices. Front. Appl. Math. Stat. 6:17. doi: 10.3389/fams.2020.00017
Received: 17 March 2020; Accepted: 04 May 2020;
Published: 09 June 2020.
Edited by:
Oleg N. Kirillov, Northumbria University, United KingdomReviewed by:
Rajat Subhra Hazra, Indian Statistical Institute, IndiaPragya Shukla, Indian Institute of Technology Kharagpur, India
Copyright © 2020 Li, Reed and Soshnikov. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
*Correspondence: Alexander Soshnikov, soshniko@math.ucdavis.edu