This paper investigates the behavior of eigenvectors associated with outlier eigenvalues in spiked Information-Plus-Noise matrices, providing insights into their alignment with the underlying spikes and extending classical results.
Contribution
It offers new theoretical results on eigenvector localization for outliers in spiked matrices, removing some technical assumptions from previous theorems.
Findings
01
Eigenvectors of outliers project significantly onto the spike directions
02
Extended classical results on eigenvalue separation without certain technical constraints
03
Provides alternative proofs for eigenvalue support and separation phenomena
Abstract
We consider an Information-Plus-Noise type matrix where the Information matrix is a spiked matrix. When some eigenvalues of the random matrix separate from the bulk, we study how the corresponding eigenvectors project onto those of the spikes. Note that, in an Appendix, we present alternative versions of the earlier results of Bai and Silverstein about the lack of eigenvalues outside the support of the deterministic equivalent measure and of Capitaine about the exact separation phenomenon, where we remove some technical assumptions.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Quantum Information and Cryptography · Matrix Theory and Algorithms
Full text
Limiting eigenvectors of outliers for Spiked Information-Plus-Noise type matrices
M. Capitaine
CNRS, Institut de Mathématiques de Toulouse,
F-31062 Toulouse Cedex 09.
E-mail: [email protected]
Abstract
We consider an Information-Plus-Noise type matrix where the Information matrix is a spiked matrix.
When some eigenvalues of the random matrix separate from the bulk, we study how the corresponding eigenvectors project
onto those of the spikes. Note that, in an Appendix, we present alternative versions of the earlier results of [3] (“noeigenvalue outside the support of the deterministic equivalent measure”) and [11] (“exact separation phenomenon”) where we remove some technical assumptions that were difficult to handle.
1 Introduction
In this paper, we consider the so-called Information-Plus-Noise type model
[TABLE]
defined as follows.
•
n=n(N), n≤N, cN=n/N→N→+∞c∈]0;1].
•
σ∈]0;+∞[.
•
XN=[Xij]1≤i≤n;1≤j≤N where
{Xij,i∈N,j∈N} is an infinite set of complex random variables such that {ℜ(Xij),ℑ(Xij),i∈N,j∈N} are independent centered random variables with variance 1/2 and satisfy
There exists K>0 and a random variable Z with finite fourth moment for which there exists x0>0 and an integer number n0>0 such that, for any x>x0 and any integer numbers n1,n2>n0, we have
[TABLE]
2. 2.
[TABLE]
•
Let ν be a compactly supported probability measure on R whose support has a finite number of connected components. Let
Θ={θ1;…;θJ} where θ1>…>θJ≥0 are
J fixed real numbers
independent of N which are outside the support of ν.
Let k1,…,kJ be fixed integer numbers independent of N and r=∑j=1Jkj.
Let βj(N)≥0, r+1≤j≤n, be such that
n1∑j=r+1nδβj(N) weakly
converges to ν and
[TABLE]
where supp(ν) denotes the support of ν.
Let αj(N),j=1,…,J, be real nonnegative numbers such that
[TABLE]
Let AN be a n×N deterministic matrix such that, for each j=1,…,J,
αj(N)
is an eigenvalue of ANAN∗ with multiplicity kj, and the other eigenvalues of ANAN∗ are the
βj(N), r+1≤j≤n. Note that the empirical spectral measure of ANAN∗ weakly
converges to ν.
Remark 1.1**.**
Note that assumption such as (1) appears in [14]. It obviously holds if the Xij’s
are identically distributed with finite fourth moment.
For any Hermitian n×n matrix Y, denote by spect(Y) its spectrum, by
[TABLE]
the ordered eigenvalues of Y and by μY the empirical spectral measure of Y:
[TABLE]
For a probability measure τ on R,
denote by gτ its Stieltjes transform defined for z∈C∖R by
[TABLE]
When the Xij’s are identically distributed, Dozier and Silverstein established
in [15] that almost surely the empirical spectral measure μMN of MN converges weakly towards a nonrandom distribution μσ,ν,c which is characterized in terms of its Stieljes transform which satisfies the following equation:
for any z∈C+,
[TABLE]
This result of convergence was extended to independent but non identically
distributed random variables by Xie in [32]. (Note that, in [19] , the authors in-
vestigated the case where
σ
is replaced by a bounded sequence of real numbers.)
In [11], the author carries on with the study of the support of the limiting spectral measure previously investigated in [16] and later
in [29, 25] and obtains that there is a one-to-one relationship between the complement of the limiting support and some subset in the complement of the support of ν which is defined in (6) below.
Proposition 1.2**.**
Define differentiable functions ωσ,ν,c and Φσ,ν,c on respectively R∖\mboxsupp(μσ,ν,c) and R∖\mboxsupp(ν) by setting
[TABLE]
and
[TABLE]
Set
[TABLE]
ωσ,ν,c* is an increasing analytic diffeomorphism with positive derivative from R∖\mboxsupp(μσ,ν,c) to Eσ,ν,c, with inverse Φσ,ν,c.*
Moreover,
extending previous results in [25] and [8] involving the Gaussian case and finite rank perturbations,
[11] establishes a one-to-one correspondance between the θi’s that belong to the set Eσ,ν,c (counting multiplicity) and the outliers in the spectrum of MN.
More precisely, setting
[11]**
Let θj be in Θσ,ν,c
and denote by nj−1+1,…,nj−1+kj the descending ranks of αj(N) among the eigenvalues of ANAN∗.
Then the kj eigenvalues (λnj−1+i(MN),1≤i≤kj)
converge almost surely outside the support of μσ,ν,c
towards ρθj:=Φσ,ν,c(θj).
Moreover, these eigenvalues asymptotically separate from the rest of the spectrum since
(with the conventions that λ0(MN)=+∞ and λN+1(MN)=−∞)
there exists δ0>0 such that
almost surely for all large N,
[TABLE]
Remark 1.5**.**
Note that Theorems 1.3 and 1.4 were established in
[11] for AN as (14) below and with S∪{0} instead of S but they hold true as stated above and in the more general framework of this paper. Indeed, these extensions can be obtained sticking to the proof of the corresponding results in [11] but using the new versions of [3]
and of the exact separation phenomenon of [11] which are presented in the Appendix A of the present paper.
The aim of this paper is to study how the eigenvectors corresponding to the outliers of MN project onto those corresponding to the spikes θi’s.
Note that there are some pionneering results investigating the eigenvectors corresponding to the outliers of
finite rank perturbations of classical random matricial models: [28] in the real Gaussian sample covariance
matrix setting, and [7, 8] dealing with finite rank additive or multiplicative
perturbations of unitarily invariant matrices. For a general perturbation, dealing
with sample covariance matrices, S. Péché and O. Ledoit [23] introduced a
tool to study the average behaviour of the eigenvectors but it seems that this
did not allow them to focus on the eigenvectors associated with the eigenvalues
that separate from the bulk. It turns out that further studies [10, 5] point
out that the angle between the eigenvectors of the outliers of the deformed
model and the eigenvectors associated to the corresponding original spikes is
determined by Biane-Voiculescu’s subordination function. For the model investigated in this paper, such a free interpretation holds but we choose not to develop this free probabilistic point of view in this paper and we refer the reader to the paper [13].
Here is the main result of the paper.
Theorem 1.6**.**
Let θj be in Θσ,ν,c (defined in (7))
and denote by nj−1+1,…,nj−1+kj the descending ranks of αj(N) among the eigenvalues of ANAN∗.
Let
ξ(j) be a normalized eigenvector of MN relative to one of the eigenvalues (λnj−1+q(MN), 1≤q≤kj).
Denote by ∥⋅∥2 the Euclidean norm on Cn. Then, almost surely
The sketch of the proof of Theorem 1.6 follows the
analysis of [10] as explained in Section 2. In Section 3, we prove a universal result allowing to reduce the study to estimating expectations of Gaussian resolvent entries carried on Section 4. In Section 5, we explain how to deduce Theorem 1.6 from the previous Sections.
In an Appendix A, we present alternative versions on the one hand of the result in [3] about the lack of eigenvalues outside the support of the deterministic equivalent measure, and, on the other hand, of the result in [11] about the exact separation phenomenon. These new versions deal with random variables whose imaginary and real parts are independent but remove the technical assumptions ((1.10) and “b1>0” in Theorem 1.1 in [3] and “ωσ,ν,c(b)>0” in Theorem 1.2 in [11]). This allows us to claim that Theorem 1.4 holds in our context (see Remark 1.5).
Finally, we present, in an Appendix B, some technical lemmas that are used throughout the paper.
2 Sketch of the proof
Throughout the paper, for any m×p matrix B, (m,p)∈N2, we will denote by ∥B∥ the largest singular value of B, and by ∥B∥2={Tr(BB∗)}21 its Hilbert-Schmidt norm.
The proof of Theorem 1.6 follows the
analysis in two steps of [10].
Step A. First, we shall prove that,
for any orthonormal system (ξ1,⋯,ξkj) of eigenvectors associated to the kj eigenvalues λnj−1+q(MN), 1≤q≤kj, the following convergence holds almost surely: ∀l=1,…,J,
[TABLE]
Note that for any smooth functions h and f on R, if v1,…,vn are eigenvectors associated to λ1(ANAN∗),…,λn(ANAN∗) and w1,…,wn are eigenvectors associated to
λ1(MN),…,λn(MN), one can easily check that
[TABLE]
Thus, since αl(N) on one hand and the kj eigenvalues of MN in (ρθj−ε,ρθj+ε) (for ϵ small enough) on the other hand, asymptotically separate from the rest of the spectrum of
respectively ANAN∗ and MN, a fit choice of h and f will allow the study of the restrictive
sum ∑p=1kjPker(αl(N)IN−ANAN∗)ξp22.
Therefore proving (11) is reduced to the study of the asymptotic
behaviour of Tr[h(MN)f(ANAN∗)] for some functions
f and h respectively concentrated on a neighborhood of θl and ρθj.
Step B: In the second, and final, step, we shall use a perturbation
argument identical to the one used in [10] to reduce the problem to the case of a
spike with multiplicity one, case that follows trivially from Step A.
Step B closely follows the lines of [10] whereas Step A requires substantial work.
We first reduce the investigations to the mean Gaussian case by proving the following.
Proposition 2.1**.**
Let XN as defined in Section 1. Let GN=[Gij]1≤i≤n,1≤j≤N be a n×N random matrix with i.i.d. standard complex normal entries.
Let h be a function in C∞(R,R) with compact support, and ΓN be a n×n Hermitian matrix
such that
[TABLE]
*Then almost surely,
Tr(h((σNXN+AN)(σNXN+AN)∗)ΓN)**
[TABLE]
The asymptotic behaviour of E(Tr[h((σNGN+AN)(σNGN+AN)∗)f(ANAN∗)]) can be deduced, by using the bi-unitarily invariance of the distribution of GN, from the following Proposition 2.2 and Lemma 5.9.
Proposition 2.2**.**
Let GN=[Gij]1≤i≤n,1≤j≤N be a n×N random matrix with i.i.d. complex standard normal entries. Assume that AN is such that
[TABLE]
where n=n(N), n≤N, cN=n/N→N→+∞c∈]0;1], for i=1,…,n, di(N)∈C, supNmaxi=1,…,n∣di(N)∣<+∞ and n1∑i=1nδ∣di(N)∣2 weakly converges to a compactly supported probability measure ν on R when N goes to infinity.
Define for all z∈C∖R,
[TABLE]
Define for any q=1,…,n,
[TABLE]
There is a polynomial P with nonnegative coefficients, a sequence (uN)N of nonnegative
real numbers converging to zero when N goes to infinity
and some nonnegative real number l,
such that for any (p,q) in {1,…,n}2, for all z∈C∖R,
In the following, we will denote by oC(1) any deterministic sequence of positive real numbers depending on the parameter C and converging for each fixed C to zero when N goes to infinity. The aim of this section is to prove Proposition
2.1.
Define for any C>0,
[TABLE]
Set
[TABLE]
We have
[TABLE]
so that
[TABLE]
Note that
[TABLE]
so that
[TABLE]
Similarly
[TABLE]
Let us assume that C>8θ∗. Then, we have
[TABLE]
Define for any C>8θ∗, XC=(XijC)1≤i≤n;1≤j≤N, where for any 1≤i≤n,1≤j≤N,
[TABLE]
Let G=[Gij]1≤i≤n,1≤j≤N be a n×N random matrix with i.i.d. standard complex normal entries, independent from XN, and define
for any α>0,
[TABLE]
Now, for any n×N matrix B, let us introduce the (N+n)×(N+n) matrix
[TABLE]
Define for any z∈C∖R,
[TABLE]
and
[TABLE]
Denote by U(n+N) the set of unitary (n+N)×(n+N) matrices.
We first establish the following approximation result.
Lemma 3.1**.**
*There exist some positive deterministic functions u and v on [0,+∞[ such that limC→+∞u(C)=0 and limα→0v(α)=0, and a polynomial P with nonnegative coefficients such that for any α and C>8θ∗, we have that *
It is straightfoward to see, using Lemma 5.8, that for any unitary (n+N)×(n+N) matrix U,
(U∗G~α,C(z)U)ij−(U∗G~(z)U)ij
[TABLE]
From Bai-Yin’s theorem (Theorem 5.8 in [2]) , we have
[TABLE]
Applying Remark 5.4 to the (n+N)×(n+N) matrix \tilde{B}=\left(\begin{array}[]{ll}0_{n\times n}~{}~{}~{}B\\
B^{*}~{}~{}~{}0_{N\times N}\end{array}\right) for B∈{XN−YC,XC−YC,XC} (see also Appendix B of [14]), we have that almost surely
Now, Lemma 5.9, Lemma 3.1 and Lemma 5.10 readily yields the following approximation lemma.
Lemma 3.2**.**
Let h be in C∞(R,R) with compact support and Γ~N be a (n+N)×(n+N) Hermitian matrix such that
such that
[TABLE]
Then, there exist some deterministic functions u and v on [0,+∞[ such that limC→+∞u(C)=0 and limα→0v(α)=0, such that for all C>0, α>0, we have almost surely for all large N,
[TABLE]
and for all large N,
[TABLE]
where
[TABLE]
Note that
the distributions of the independent random variables
ℜ(Xijα,C), ℑ(Xijα,C) are all a convolution of a centred Gaussian distribution with some variance vα, with some law with bounded support
in a ball of some radius RC,α; thus, according to Lemma 5.11,
they satisfy a Poincaré inequality with some common constant CPI(C,α) and therefore so does their product (see the Appendix B).
An important consequence of the Poincaré inequality is the following concentration result.
Lemma 3.3**.**
Lemma 4.4.3 and Exercise 4.4.5 in [1] or Chapter 3 in [24]. There exists K1>0 and K2>0 such that for any
probability measure P on RM which satisfies a Poincaré inequality with constant CPI, and for any Lipschitz function F on RM with Lipschitz constant ∣F∣Lip, we have
[TABLE]
In order to apply Lemma 3.3, we need the following preliminary lemmas.
Lemma 3.4**.**
(see Lemma 8.2 [10])
Let f be a real CL-Lipschitz function on R. Then its extension on the N×N
Hermitian matrices is CL-Lipschitz with respect to the Hilbert-Schmidt norm.
Lemma 3.5**.**
Let Γ~N be a (n+N)×(n+N) matrix and h be a real Lipschitz function on R.
For any n×N matrix B,
[TABLE]
is Lipschitz with constant bounded by 2Γ~N2∥h∥Lip.
Let Γ~N be a (n+N)×(n+N) matrix such that supN,nΓ~N2≤K. Let h be a real Lipschitz function on R.
The random variable FN=Tr[h(MN+p(NXα,C))Γ~N]
satisfies the following concentration inequality
[TABLE]
for some postive real numbers K1 and K2(α,C).
Proof.
Lemma 3.6 follows from
Lemmas 3.5 and 3.3 and basic facts on Poincaré inequality recalled at the end of the Appendix B.
∎
By Borel-Cantelli’s Lemma, we readily deduce from the above Lemma the following
Lemma 3.7**.**
*Let Γ~N be a (n+N)×(n+N) matrix such that supN,nΓ~N2≤K. Let h be a real C1- function with compact support on R.
Now, we will establish a comparison result with the Gaussian case for the mean values by using the following lemma (which is an extension of Lemma 4.1 below to the non-Gaussian case) as initiated by [22] in Random Matrix Theory.
Lemma 3.8**.**
Let ξ be a real-valued random variable such that E(∣ξ∣p+2)<∞.
Let ϕ be a function from R to C such that the first p+1 derivatives are continuous and bounded.
Then,
[TABLE]
where κa are the cumulants of ξ,
∣ϵ∣≤Ksupt∣ϕ(p+1)(t)∣E(∣ξ∣p+2),
K only depends on p.
Lemma 3.9**.**
Let GN=[Gij]1≤i≤n,1≤j≤N be a n×N random matrix with i.i.d. complex N(0,1) Gaussian entries.
Define
[TABLE]
for any z∈C∖R.
There exists a polynomial P with nonnegative coefficients such that for all large N, for any (i,j)∈{1,…,n+N}2, for any z∈C∖R, for any unitary (n+N)×(n+N) matrix U,
[TABLE]
Moreover, for any (N+n)×(N+n) matrix Γ~N such that
[TABLE]
*and any function h in C∞(R,R) with compact support, there exists some constant K>0 such that, for any large N,
We follow the approach of [27] chapters 18 and 19 consisting in introducing an interpolation matrix
XN(α)=cosαXN+sinαGN for any α in [0;2π] and the corresponding resolvent matrix G~(α,z)=(zIN+n−MN+n(σNXN(α)))−1
for any z∈C∖R.
We have, for any (s,t)∈{1,…,n+N}2,
[TABLE]
with
[TABLE]
Now, for any l=1,…,n and k=n+1,…,n+N, using Lemma 3.8 for p=1 and for each random variable ξ in the set {ℜXl(k−n),ℜGl(k−n),ℑXl(k−n),ℑGl(k−n)}, and for each ϕ in the set
[TABLE]
one can easily see that there exists some constant K>0 such that
[TABLE]
where Hn+N(C) denotes the set of (n+N)×(n+N) Hermitian matrices and
SV(Y) is a sum of a finite number independent of N and n of terms of the form
[TABLE]
with R(Y)=(zIN+n−Y)−1 and {p1,…,p6} contains exactly three k and three l.
When (p1,p6)=(k,l) or (l,k), then, using Lemma 5.8,
Then by Lemma 5.10, there exists some constant K>0 such that, for any N and n, for any (i,j)∈{1,…,n+N}2, any unitary (n+N)×(n+N) matrix U,
[TABLE]
Thus, using (97) and (30), we can deduce (31) from (33).
∎
The above comparison lemmas allow us to establish the following convergence result.
Proposition 3.10**.**
*Let h be a function in C∞(R,R) with compact support and let
Γ~N be a (n+N)×(n+N) matrix such that
supn,Nrank(Γ~N)<∞ and supn,N∥Γ~N∥<∞. Then we have that almost surely
Lemmas 3.2, 3.7 and 3.9 readily yield that there exist some positive deterministic functions u and v on [0,+∞[ with limC→+∞u(C)=0 and limα→0v(α)=0, such that for any C>0 and any α>0, almost surely
[TABLE]
[TABLE]
The result follows by letting α go to zero and C go to infinity.
∎
Now, note that, for any N×n matrix B, for any continuous real function function h on R, and any n×n Hermitian matrix ΓN, we have
[TABLE]
where h~(x)=h(x2) and Γ~N=(ΓN(0)(0)(0)). Thus, Proposition 3.10 readily yields Proposition 2.1.
The aim of this section is to prove Proposition 2.2 which deals with Gaussian random variables.Therefore we assume here that
AN is as (14) and set γq(N)=(ANAN∗)qq.
In this section, we let X stand for GN, A stands for AN, G denotes the resolvent of MN=ΣΣ∗ where Σ=σNGN+AN and
gN denotes the mean of the Stieltjes transform of the spectral measure of MN, that is
[TABLE]
4.1 Matricial master equation
To obtain the equation (35) below, we will use many ideas from [17]. The following Gaussian integration by part formula is the key tool in our approach.
Lemma 4.1**.**
[Lemma 2.4.5 [1]]
Let ξ be a real centered Gaussian random variable with variance 1. Let Φ be a differentiable function with polynomial growth of Φ and Φ′. Then,
[TABLE]
Proposition 4.2**.**
*Let z be in C∖R.
We have for any (p,q) in {1,…,n}2,
In this section, when we state that some quantity ΔN(z), z∈C∖R,
is equal to O(Np1), this means precisely that there exist some polynomial P with nonnegative coefficients and some positive real number l which are all independent of N such that for any z∈C∖R,
[TABLE]
We present now the different estimates on the variance. They rely on the following Gaussian Poincaré inequality (see the Appendix B). Let Z1,…,Zq be q real independent centered Gaussian variables with variance σ2. For any
C1 function f:Rq→C such that f and
gradf are in L2(N(0,σ2Iq)), we have
[TABLE]
denoting for any random variable a by V(a) its variance E(∣a−E(a)∣2).
Thus, (Z1,…,Zq) satisfies a Poincaré inequality with constant CPI=σ2.
The following preliminary result will be useful to these estimates.
Lemma 4.3**.**
There exists K>0 such for all N,
[TABLE]
Proof.
According to Lemma 7.2 in [20], we have for any t∈]0;N/2],
[TABLE]
By the Chebychev’s inequality, we have
[TABLE]
It follows that
[TABLE]
The result follows by optimizing in t.
∎
Lemma 4.4**.**
There exists C>0 such that for all large N, for all z∈C∖R,
[TABLE]
[TABLE]
[TABLE]
Proof.
Let us define Ψ:R2(n×N)→Mn×N(C) by
[TABLE]
where eij stands for the n×N matrix such that for any (p,q) in {1,…,n}×{1,…,N}, (eij)pq=δipδjq.
Let F be a smooth complex function on Mn×N(C) and
define the complex function f on R2(n×N) by setting f=F∘Ψ.
Then,
[TABLE]
Now, X=Ψ(ℜ(Xij),ℑ(Xij),1≤i≤n,1≤j≤N) where the distribution of {ℜ(Xij),ℑ(Xij),1≤i≤n,1≤j≤N} is N(0,21I2nN).
Moreover using Cauchy-Schwartz’s inequality and Lemma 5.8, we have
n1Tr(GσNV(σNX+A)∗G)
[TABLE]
We get obviously the same bound for
∣n1Tr(G(σNX+A)σNV∗G)∣. Thus
E(∥gradf(ℜ(Xij),ℑ(Xij),1≤i≤n,1≤j≤N)∥22)
[TABLE]
(56) readily follows from (55), (59), Theorem A.8 in [2], Lemma 4.3 and the fact that ∥AN∥ is uniformly bounded.
Similarly, considering
[TABLE]
where Eqp is the n×n matrix such that (Eqp)ij=δqiδpj, we can obtain that, for any V∈Mn×N(C) such that TrVV∗=1,
dtdF(X+tV)∣t=0
[TABLE]
Thus, one can get (57) in the same way.
Finally, considering
[TABLE]
we can obtain that, for any V∈Mn×N(C) such that TrVV∗=1,
[TABLE]
Using Lemma 5.8 (i), Theorem A.8 in [2],
Lemma 4.3, the identity
ΣΣ∗G=GΣΣ∗=−I+zG, and the fact that ∥AN∥ is uniformly bounded,
the same analysis allows to prove (58).
∎
Corollary 4.5**.**
Let Δ1(p,q), Δ2(p,q), (p,q)∈{1,…,n}2, and Δ3 be as defined in Proposition 4.2. Then there exist a polynomial P with nonnegative coefficients and a nonnegative real number l such that, for all large N, for any z∈C∖R,
[TABLE]
and for all (p,q)∈{1,…,n}2,
[TABLE]
[TABLE]
Proof.
Using the identity
[TABLE]
(61) readily follows from Cauchy-Schwartz inequality, Lemma 5.8 and (56). (62) and (60)
readily follows from Cauchy-Schwartz inequality and Lemma 4.4
∎
4.3 Estimates of Resolvent entries
In order to deduce Proposition 2.2 from Proposition 4.2 and Corollary 4.5, we need the two following Lemma 4.6
and Lemma 4.7.
Lemma 4.6**.**
For all z∈C∖R,
[TABLE]
[TABLE]
Proof.
Since μMN is supported by [0,+∞[, (63) readily follows from
Corollary 4.5 and
Lemma 4.6 yields that, there is a polynomial Q with nonnegative coefficients, a sequence bN of nonnegative
real numbers converging to zero when N goes to infinity
and some nonnegative integer number l,
such that for any p,q in {1,…,n}, for all z∈C∖R,
There is a sequence vN of nonnegative
real numbers converging to zero when N goes to infinity
such that for all z∈C∖R,
[TABLE]
Proof.
First note that it is sufficient to prove (66) for z∈C+:={z∈C;ℑz>0} since
gN(zˉ)−gμσ,ν,c(zˉ)=gN(z)−gμσ,ν,c(z).
Fix ϵ>0.
According to Theorem A.8 and Theorem 5.11 in [2], and the assumption on AN, we can choose K>max{2/ε;x,x∈supp(μσ,ν,c)} large enough such that P(∥MN∥>K)
goes to zero as N goes to infinity.
Let us write
Now, it is clear that E(n1TrGN1I∥MN∥≤K) is a sequence of locally bounded holomorphic functions on C+ which converges towards gμσ,ν,c. Hence, by Vitali’s Theorem, E(n1TrGN1I∥MN∥≤K) converges uniformly towards gμσ,ν,c on each compact subset of C+.
Thus, there exists N(ϵ)>0, such that for any N≥N(ϵ), for any z∈C+, such that ∣z∣≤2K and ℑz≥ε,
Finally, for any z∈C+, such that ℑz∈]0;ε[, we have
[TABLE]
It readily follows from (68), (69) and (70) that for N≥N(ϵ),
[TABLE]
Moreover, for N≥N′(ϵ)≥N(ϵ), P(∥MN∥>K)≤ε. Therefore, for N≥N′(ϵ), we have for any z∈C+,
gN(z)−gμσ,ν,c(z)
[TABLE]
Thus, the proof is complete by setting
[TABLE]
∎
Now set
[TABLE]
and
[TABLE]
Lemmas 4.6 and 4.7 yield that there is a polynomial R with nonnegative coefficients, a sequence wN of nonnegative
real numbers converging to zero when N goes to infinity
and some nonnegative real number l,
such that for all z∈C∖R,
[TABLE]
Now, one can easily see that,
[TABLE]
so that
[TABLE]
Note that
[TABLE]
Then, (16) readily follows from Proposition 4.2, (65), (73), (75), (76), and (ii) Lemma 5.8.
The proof of Proposition 2.2 is complete.
Let η>0 small enough and N large enough such that for any l=1,…,J, αl(N)∈[θl−η,θl+η]
and [θl−2η,θl+2η] contains no other element of the spectrum of ANAN∗ than αl(N).
For any l=1,…,J, choose fη,l in C∞(R,R) with support in [θl−2η,θl+2η] such that fη,l(x)=1 for any x∈[θl−η,θl+η] and 0≤fη,l≤1.
Let 0<ϵ<δ0 where δ0 is introduced in Theorem 1.4. Choose hε,j in C∞(R,R) with
support in [ρθj−ε,ρθj+ε] such that hε,j≡1 on [ρθj−ε/2,ρθj+ε/2] and 0≤hε,j≤1.
Almost surely for all large N, MN has kj eigenvalues in ]ρθj−ε/2,ρθj+ε/2[.
According to Theorem 1.4, denoting by (ξ1,⋯,ξkj) an orthonormal system of eigenvectors associated to the kj eigenvalues of MN in (ρθj−ε/2,ρθj+ε/2), it readily follows from (12) that almost surely for all large N,
[TABLE]
Applying Proposition 2.1 with ΓN=fη,l(ANAN∗) and K=kl, the problem of establishing (11) is reduced to prove that
Using a Singular Value Decomposition of AN and the biunitarily invariance of the distribution of GN, we can assume that
AN is as (14) and such that
for any j=1,…,J,
instead of dealing with τ~N defined in (72) at the end of the proof of Proposition 2.2, one can prove that
there is a polynomial P with nonnegative coefficients, a sequence (uN)N of nonnegative
real numbers converging to zero when N goes to infinity
and some nonnegative real number s,
such that for any k in {k1+…+kl−1+1,…,k1+…+kl}, for all z∈C∖R,
[TABLE]
with
[TABLE]
Thus,
[TABLE]
where for all z∈C∖R, ΔN(z)=∑k=k1+⋅+kl−1+1k1+⋅+klΔk,N(z),
and ∣ΔN(z)∣≤kl(1+∣z∣)sP(∣ℑz∣−1)uN.
First let us compute
[TABLE]
The function ωσ,ν,c satisfies ωσ,ν,c(z)=ωσ,ν,c(z) and gμσ,ν,c(z)=gμσ,ν,c(z), so that
ℑθl−ωσ,ν,c(t+iy)(1−σ2cgμσ,ν,c(t+iy))=2i1[θl−ωσ,ν,c(t+iy)(1−σ2cgμσ,ν,c(t+iy))−θl−ωσ,ν,c(t−iy)(1−σ2cgμσ,ν,c(t−iy))]. As in [10], the above integral is split
into three pieces, namely ∫ρθj−ερθj−ε/2+∫ρθj−ε/2ρθj+ε/2+∫ρθj+ε/2ρθj+ε. Each
of the first and third integrals are easily seen to go to zero when y↓0 by a direct
application of the definition of the functions involved and of the (Riemann) integral.
As hε,j is constantly equal to one on [ρθj−ϵ/2;ρθj+ϵ/2], the second (middle) term is simply the integral
[TABLE]
Completing this to a contour integral on the rectangular with corners ρθj±ε/2±iy
and noting that the integrals along the vertical lines tend to zero as y↓0
allows a direct application of the residue theorem for the final result, if l=j,
[TABLE]
If we consider θl for some l=j, then z↦(1−σ2cgμσ,ν,c(z))(θl−ωσ,ν,c(z))−1 is analytic around ρθj, so its residue at ρθj is zero, and the above
argument provides zero as answer.
Step B: In the second, and final, step, we shall use a perturbation
argument identical to the one used in [10] to reduce the problem to the case of a
spike with multiplicity one, case that follows trivially from Step A.
A further property of eigenvectors of Hermitian matrices which are close to each other in the norm
will be important in the analysis of the behaviour of the eigenvectors of our matrix models.
Given a Hermitian matrix M∈MN(C) and a Borel set S⊆R, we
denote by EM(S) the spectral projection of M associated to S. In other words, the range of
EM(S) is the vector space generated by the eigenvectors of M corresponding to eigenvalues
in S. The
following lemma can be found in [5].
Lemma 5.1**.**
Let M and M0 be N×N Hermitian matrices. Assume that α,β,δ∈R are such that
α<β, δ>0, M and M0 has no eigenvalues in [α−δ,α]∪[β,β+δ]. Then,
[TABLE]
In particular, for any unit vector ξ∈EM0((α,β))(CN),
[TABLE]
Assume that θi is in Θσ,ν,c defined in (7) and ki=1.
Let us denote by V1(i),…,Vki(i), an orthonormal system of eigenvectors of ANAN∗ associated with αi(N).
Consider a Singular Value Decomposition AN=UNDNVN
where VN is a N×N unitary matrix, UN is a n×n unitary matrix whose ki first columns are V1(i),…,Vki(i) and
DN is as (14) with the first ki diagonal elements equal to αi(N).
Let δ0 be as in Theorem 1.4. Almost surely, for all N
large enough, there are ki eigenvalues of MN in (ρθi−4δ0,ρθi+4δ0), namely λni−1+q(MN), q=1,…,ki (where ni−1+1,…,ni−1+ki are the descending ranks of αi(N) among the eigenvalues of ANAN∗), which are moreover
the only eigenvalues of MN in (ρθi−δ0,ρθi+δ0).
Thus, the spectrum of MN is split into three pieces:
[TABLE]
[TABLE]
[TABLE]
The distance between any of these
components is equal to 3δ0/4.
Let us fix ϵ0 such that 0≤θi(2ϵ0ki+ϵ02ki2)<dist(θi,\mboxsuppν∪i=sθs)
and such that [θi;θi+θi(2ϵ0ki+ϵ02ki2)]⊂Eσ,ν,c defined by (6).
For any 0<ϵ<ϵ0, define the matrix AN(ϵ) as AN(ϵ)=UNDN(ϵ)VN where
[TABLE]
and (DN(ϵ))pq=(DN)pq for any (p,q)∈/{(m,m),m∈{1,…,ki}}.
Set
[TABLE]
For N large enough, for each m∈{1,…,ki}, αi(N)[1+ϵ(ki−m+1)]2 is an eigenvalue of ANAN∗(ϵ) with multiplicity one. Note that, since supN∥AN∥<+∞, it is easy to see that there exist some constant C such that for any N and for any 0<ϵ<ϵ0,
[TABLE]
Applying Remark 5.4 to the (n+N)×(n+N) matrix \tilde{X}_{N}=\left(\begin{array}[]{ll}0_{n\times n}~{}~{}~{}X_{N}\\
X_{N}^{*}~{}~{}~{}0_{N\times N}\end{array}\right) (see also Appendix B of [14]), it readily follows that
there exists some constant C′ such that a.s for all large N, for any 0<ϵ<ϵ0,
[TABLE]
Therefore, for ϵ sufficiently small such that C′ϵ<δ0/4, by Theorem A.46 [2], there
are precisely ni−1 eigenvalues of MN(ϵ) in [0,ρθi−3δ0/4), precisely ki in (ρθi−δ0/2,ρθi+δ0/2) and
precisely N−(ni−1+ki) in (ρθi+3δ0/4,+∞[. All these intervals are again at strictly positive distance from
each other, in this case δ0/4.
Let ξ be a normalized eigenvector of MN relative to λni−1+q(MN) for some
q∈{1,…,ki}. As proved in Lemma 5.1, if E(ϵ) denotes the
subspace spanned by the eigenvectors associated to {λni−1+1(MN(ϵ)),…,λni−1+ki(MN(ϵ))} in CN, then there exists some constant C (which depends on δ0) such that for ϵ small enough, almost surely for large N,
[TABLE]
According to Theorem 1.4, for j∈{1,…,ki}, for large enough N, λni−1+j(MN(ϵ))
separates from the rest of the spectrum and belongs to a neighborhood of Φσ,ν,c(θi(j)(ϵ))
where
[TABLE]
If ξj(ϵ,i) denotes a normalized eigenvector associated to λni−1+j(MN(ϵ)), Step A above
implies that almost surely for any p∈{1,…,ki}, for any γ>0, for all large N,
[TABLE]
The eigenvector ξ decomposes uniquely in the orthonormal basis of eigenvectors of MN(ϵ) as ξ=∑j=1kicj(ϵ)ξj(ϵ,i)+ξ(ϵ)⊥,
where cj(ϵ)=⟨ξ∣ξj(ϵ,i)⟩ and ξ(ϵ)⊥=PE(ϵ)⊥ξ; necessarily
∑j=1ki∣cj(ϵ)∣2+∥ξ(ϵ)⊥∥22=1. Moreover, as
indicated in relation (81), ∥ξ(ϵ)⊥∥2≤Cϵ.
We have
[TABLE]
Take in the above the scalar product with ξ=∑j=1kicj(ϵ)ξj(ϵ,i)+ξ(ϵ)⊥ to get
Thus, we conclude that almost surely for any γ>0, for all large N,
[TABLE]
[TABLE]
Since we have the identity
[TABLE]
and the three obvious
convergences
limϵ→0ωσ,ν,c′(Φσ,ν,c(θi(j)(ϵ)))=ωσ,ν,c′(ρθi), limϵ→0gμσ,ν,c(Φσ,ν,c(θi(j)(ϵ)))=gμσ,ν,c(ρθi) and limϵ→0∑j=1ki∣cj(ϵ)∣2=1,
relation (83) concludes Step B and the proof of Theorem 1.6. (Note that we use (2.9) of [11] which is true for any x∈C∖R to deduce that 1−σ2cgμσ,ν,c(Φσ,ν,c(θi))=1+σ2cgν(θi)1 by letting x goes to Φσ,ν,c(θi)).
Appendix A
We present alternative versions on the one hand of the result in [3] about the lack of eigenvalues outside the support of the deterministic equivalent measure, and on the other hand of the result in [11] about the exact separation phenomenon. These new versions (Theorems 5.3 and 5.6 below) deal with random variables whose imaginary and real parts are independent, but remove the technical assumptions ((1.10) and “b1>0” in Theorem 1.1 in [3]
and “ωσ,ν,c(b)>0” in Theorem 1.2 in [11]). The proof of Theorem 5.3 is based on the results of [6].
The arguments of the proof of Theorem 1.2 in [11] and Theorem 5.3 lead to the proof of Theorem 5.6.
Theorem 5.2**.**
Consider
[TABLE]
and assume that
XN=[Xij]1≤i≤n,1≤j≤N* is a n×N random matrix such that
[Xij]i≥1,j≥1 is an infinite array of random variables which satisfy (1) and (2) and such that
ℜ(Xij), ℑ(Xij), (i,j)∈N2, are independent, centered with variance 1/2.
*
2. 2.
AN* is an n×N nonrandom matrix such that ∥AN∥ is uniformly bounded.
*
3. 3.
n≤N* and, as N tends to infinity, cN=n/N→c∈]0,1].*
4. 4.
[x,y], x<y, is such that
there exists δ>0 such that for all large N, ]x−δ;y+δ[⊂R∖supp(μσ,μANAN∗,cN)
where μσ,μANAN∗,cN is the nonrandom distribution which is characterized in terms of its Stieltjes transform which satisfies the equation (4) where we replace c by cN and ν by μANAN∗.
Then, we have
[TABLE]
Since, in the proof of Theorem 5.2, we will use tools from free probability theory,
for the reader’s convenience, we recall the following basic definitions from free probability theory. For a thorough introduction to free probability theory, we refer to [30].
•
A C∗-probability space is a pair (A,τ) consisting of a unital C∗-algebra A and a state τ on A i.e a linear map τ:A→C such that τ(1A)=1 and τ(aa∗)≥0 for all a∈A. τ is a trace if it satisfies τ(ab)=τ(ba) for every (a,b)∈A2. A trace is said to be faithful if τ(aa∗)>0 whenever a=0.
An element of A is called a noncommutative random variable.
•
The noncommutative ⋆-distribution of a family a=(a1,…,ak) of noncommutative random variables in a C∗-probability space (A,τ) is defined as the linear functional μa:P↦τ(P(a,a∗)) defined on the set of polynomials in 2k noncommutative indeterminates, where (a,a∗) denotes the 2k-uple (a1,…,ak,a1∗,…,ak∗).
For any selfadjoint element a1 in A, there exists a probability measure νa1 on R such that, for every polynomial P, we have
[TABLE]
Then we identify μa1 and νa1. If τ is faithful then the support of νa1 is the spectrum of a1 and thus ∥a1∥=sup{∣z∣,z∈support(νa1)}.
•
A family of elements (ai)i∈I in a C∗-probability space (A,τ) is free if for all k∈N and all polynomials p1,…,pk in two noncommutative indeterminates, one has
[TABLE]
whenever i1=i2,i2=i3,…,ik−1=ik, (i1,…ik)∈Ik, and τ(pl(ail,ail∗))=0 for l=1,…,k.
•
A noncommutative random variable x in a C∗-probability space (A,τ) is a standard semicircular random variable
if x=x∗ and for any k∈N,
[TABLE]
where dμsc(t)=2π14−t21I[−2;2](t)dt is the semicircular standard distribution.
•
Let k be a nonnull integer number. Denote by P the set of polynomials in 2k noncommutative indeterminates.
A sequence of families of variables (an)n≥1=(a1(n),…,ak(n))n≥1 in C∗-probability spaces
(An,τn) converges in ⋆-distribution, when n goes to infinity, to some k-tuple of noncommutative random variables a=(a1,…,ak) in a C∗-probability space (A,τ) if the map
P∈P↦τn(P(an,an∗)) converges pointwise towards P∈P↦τ(P(a,a∗)).
•
k noncommutative random variables
a1(n),…,ak(n), in C∗-probability spaces
(An,τn), n≥1, are said asymptotically free if (a1(n),…,ak(n))
converges in ⋆-distribution, as n goes to infinity, to some noncommutative random variables
(a1,…,ak) in a C∗-probability space (A,τ) where a1,…,ak are free.
We will also use the following well known result on asymptotic freeness of random matrices.
Let An be
the algebra of n×n matrices
with complex entries and endow this algebra with
the normalized trace defined for any M∈An by
τn(M)=n1Tr(M). Let us
consider a n×n so-called standard G.U.E matrix, i.e a random Hermitian matrix Gn=[Gjk]j,k=1n, where Gii,
2ℜe(Gij), 2ℑm(Gij), i<j are independent centered Gaussian random variables with variance 1.
For a fixed real number t independent from n, let Hn(1),…,Hn(t) be deterministic n×n Hermitian matrices such that maxi=1tsupn∥Hn(i)∥<+∞ and (Hn(1),…,Hn(t)), as a t-tuple of noncommutative random variables in (An,τn), converges in distribution when n goes to infinity. Then, according to Theorem 5.4.5 in [1],
nGn and (Hn(1),…,Hn(t)) are almost surely asymptotically free i.e
almost surely, for any polynomial P in t+1 noncommutative indeterminates,
[TABLE]
where h1,…,hr and s are noncommutative random variables in some C∗-probability space (A,τ)
such that (h1,…,hr) and s are free, s is a standard semi-circular noncommutative random variable and the distribution of (h1,…,ht)
is the limiting distribution of (Hn(1),…,Hn(t)).
Finally, the proof of Theorem 5.2 is based on the following result which can be established by following the proof of Theorem 1.1 in [6]. First, note that the algebra of polynomials in non-commuting
indeterminates X1,…,Xk, becomes a
⋆-algebra by anti-linear extension of
(Xi1Xi2…Xim)∗=Xim…Xi2Xi1.
Theorem 5.3**.**
Let us consider three independent infinite arrays of random variables,
[Wij(1)]i≥1,j≥1, [Wij(2)]i≥1,j≥1 and [Xij]i≥1,j≥1 where
•
for l=1,2, Wii(l),
2Re(Wij(l)), 2Im(Wij(l)),i<j, are i.i.d centered and bounded random variables with variance 1 and Wji(l)=Wij(l),
•
{ℜ(Xij),ℑ(Xij),i∈N,j∈N}* are independent centered random variables with variance 1/2 and satisfy (1) and (2).*
Let t be a fixed integer number and P be a selfadjoint polynomial in t+1 noncommutative indeterminates.
For any N∈N2, let (Bn+N(1),…,Bn+N(t)) be a t−tuple of (n+N)×(n+N) deterministic Hermitian matrices such that
for any u=1,…,t, supN∥Bn+N(u)∥<∞.
Let (A,τ) be a C∗-probability space
equipped with a faithful tracial state and
s be a standard semi-circular noncommutative random variable in (A,τ).
Let bn+N=(bn+N(1),…,bn+N(t)) be a t-tuple of noncommutative selfadjoint random variables which is free from s in (A,τ) and such that the distribution of bn+N in (A,τ) coincides with the distribution of (Bn+N(1),…,Bn+N(t)) in (Mn+N(C),n+N1Tr).
Let [x,y] be a real interval such that there exists δ>0 such that, for any large N, [x−δ,y+δ] lies outside the support of the distribution of the noncommutative random variable P(s,bn+N(1),…,bn+N(t)) in (A,τ).
Then, almost surely, for all large N,*
[TABLE]
Proof.
We start by checking that a truncation and Gaussian convolution procedure as in Section 2 of [6] can be handled for such a matrix as defined by (87),
to reduce the problem to
a fit framework
where,
(H)
for any N,
(Wn+N)ii, 2Re((Wn+N)ij), 2Im((Wn+N)ij),i<j,i≤n+N,j≤n+N, are independent, centered random variables with variance 1, which satisfy a Poincaré inequality with common fixed constant CPI.
Note that, according to Corollary 3.2 in [24], (H) implies that for any p∈N,
[TABLE]
Remark 5.4**.**
Following the proof of Lemma 2.1 in [6], one can establish that, if (Vij)i≥1,j≥1 is an infinite array of random variables such that {ℜ(Vij),ℑ(Vij),i∈N,j∈N} are independent centered random variables which satisfy (1) and (2), then
almost surely we have
[TABLE]
where
[TABLE]
Then, following the rest of the proof of Section 2 in [6], one can prove that for any polynomial P in 1+t noncommutative variables, there exists some constant L>0 such that the following holds. Set θ∗=supi,jE(∣Xij∣3). For any 0<ϵ<1, there exist Cϵ>8θ∗ (such that Cϵ>maxl=1,2∣W11(l)∣ a.s.) and δϵ>0 such that almost surely for all large N,
[TABLE]
where, for any C>8θ∗ such that C>maxl=1,2∣W11(l)∣ a.s.,
and for any δ>0, W~N+nC,δ is a (n+N)×(n+N) matrix which is defined as follows.
Let (Gij)i≥1,j≥1 be an infinite array which is independent of {Xij,Wij(1),Wij(2),(i,j)∈N2} and such that 2ℜeGij, 2ℑmGij, i<j, Gii, are independent centred standard real gaussian variables and Gij=Gji.
Set Gn+N=[Gij]1≤i,j≤n+N and define X_{N}^{C}=[X_{ij}^{C}]_{\tiny\begin{array}[]{ll}1\leq i\leq n\\
1\leq j\leq N\end{array}} as in (18).
Set
[TABLE]
W~N+nC,δ satisfies (H) (see the end of Section 2 in [6]).
(89) readily yields that it is sufficient to prove Theorem 5.3 for W~N+nC,δ.
Therefore, assume now that WN+n satisfies (H).
As explained in Section 6.2 in [6], to establish Theorem 5.3, it is sufficient to prove that
for all m∈N, all self-adjoint matrices γ,α,β1,…,βt of size m×m and
all ϵ>0, almost surely, for all large N, we have
spect(γ⊗In+N+α⊗n+NWn+N+∑u=1tβu⊗Bn+N(u))
[TABLE]
((90) is the analog of Lemma 1.3 for r=1 in [6]).
Finally, one can prove (90) by following Section 5 in [6].
∎
We will need the following lemma in the proof of Theorem 5.2.
Lemma 5.5**.**
Let AN and cN be defined as in Theorem 5.2. Define the following (n+N)×(n+N) matrices: P=(In(0)(0)(0)) and Q=((0)(0)(0)IN)
and A=((0)(0)AN(0)).
Let s,pN,qN,aN be noncommutative random variables in some C∗-probability space (A,τ) such that s is a standard semi-circular variable which is free with (pN,qN,aN) and the ⋆-distribution of (A,P,Q) in (MN+n(C),N+n1Tr) coincides with the ⋆-distribution of
(aN,pN,qN) in (A,τ).
Then, for any ϵ≥0, the distribution of (1+cNσpNsqN+1+cNσqNspN+aN+aN∗)2+ϵpN
is N+nnTϵ⋆μσ,μANAN∗,cN+N+nnμσ,μANAN∗,cN+N+nN−nδ0
where Tϵ⋆μσ,μANAN∗,cN is the pushforward of μσ,μANAN∗,cN by the map z↦z+ϵ.
Proof.
Here N and n are fixed. Let k≥1 and Ck be the k×k matrix defined by
[TABLE]
Define the k(n+N)×k(n+N) matrices
[TABLE]
For any k≥1, the ⋆-distributions of (A^k,P^k,Q^k) in (Mk(N+n)(C),k(N+n)1Tr)
and (A,P,Q) in (M(N+n)(C),(N+n)1Tr) respectively, coincide.
Indeed, let K be a noncommutative monomial in C⟨X1,X2,X3,X4⟩ and denote by q the total number of occurrences of X3 and X4 in K. We have
[TABLE]
so that
[TABLE]
Note that if q is even then Ckq=Ik so that
[TABLE]
Now, assume that q is odd. Note that PQ=QP=0,AQ=A,QA=0,AP=0 and PA=A
(and then QA∗=A∗,A∗Q=0,PA∗=0 and A∗P=A∗). Therefore, if at least one of the terms X1X2, X2X1,
X2X3, X3X1, X4X2 or X1X4 appears in the noncommutative product in K, then
K(P,Q,A,A∗)=0, so that (91) still holds. Now, if none of the terms X1X2, X2X1,
X2X3, X3X1, X4X2 or X1X4 appears in the noncommutative product in K, then we have
K(P,Q,A,A∗)=K~(A,A∗) for some noncommutative monomial K~∈C⟨X,Y⟩ with
degree q.
Either the noncommutative product in K~ contains a term such as Xp or Yp for some p≥2 and then, since A2=(A∗)2=0,
we have K~(A,A∗)=0,
or K~(X,Y) is one of the monomials (XY)2q−1X or Y(XY)2q−1. In both cases, we have TrK~(A,A∗)=0 and (91) still holds.
Now, define the k(N+n)×k(N+n) matrices
[TABLE]
where Aˇ is the kn×kN matrix defined by
[TABLE]
It is clear that there exists a real orthogonal k(N+n)×k(N+n) matrix O such that P~k=OP^kO∗, Q~k=OQ^kO∗ and
A~k=OA^kO∗. This readily yields that
the noncommutative ⋆-distributions of (A^k,P^k,Q^k) and (A~k,P~k,Q~k) in (Mk(N+n)(C),k(N+n)1Tr) coincide. Hence, for any k≥1, the distribution of (A~k,P~k,Q~k) in (Mk(N+n)(C),k(N+n)1Tr) coincides with the distribution of (aN,pN,qN) in (A,τ).
By Theorem 5.4.5 in [1], it readily follows that the distribution of (1+cNσpNsqN+1+cNσqNspN+aN+aN∗)2+ϵpN is the almost sure limiting distribution, when k goes to infinity, of
(1+cNσP~kk(N+n)GQ~k+1+cNσQ~kk(N+n)GP~k+A~k+A~k∗)2+ϵP~k in (Mk(N+n)(C),k(N+n)1Tr),
where G is a k(N+n)×k(N+n) GUE matrix with entries with variance 1.
Now, note that
[TABLE]
[TABLE]
where Gkn×kN is the upper right kn×kN corner of G.
Thus, noticing that μAˇAˇ∗=μANAN∗, the lemma follows from [15].
∎
Proof of Theorem 5.2.
Let W be
a (n+N)×(n+N) matrix as defined by (87) in Theorem 5.3.
Note that, with the notations of Lemma 5.5, for any ϵ≥0,
Let [x,y] be such that
there exists δ>0 such that for all large N, ]x−δ;y+δ[⊂R∖supp(μσ,μANAN∗,cN).
(i)
Assume x>0. Then, according to Lemma 5.5 with ϵ=0, there exists δ′>0 such that for all large n, ]x−δ′;y+δ′[ is outside the support of the distribution of
(1+cNσpNsqN+1+cNσqNspN+aN+aN∗)2.
We readily deduce that almost surely for all large N, according to Theorem 5.3, there is no eigenvalue of (1+cNPN+nσWQ+1+cNQN+nσWP+A+A∗)2 in [x,y]. Hence, by (92) with ϵ=0, almost surely for all large N, there is no eigenvalue of MN in [x,y].
(ii)
Assume x=0 and y>0. There exists 0<δ′<y such that [0,3δ′] is for all large N outside the support
of μσ,μANAN∗,cN. Hence, according to Lemma 5.5, [δ′/2,3δ′] is outside the support of the distribution of (1+cNσpNsqN+1+cNσqNspN+aN+aN∗)2+δ′pN. Then, almost surely for all large N, according to Theorem 5.3, there is no eigenvalue of (1+cNPN+nσWQ+1+cNQN+nσWP+A+A∗)2+δ′P in [δ′,2δ′] and thus, by (92), no eigenvalue of (σNX+AN)(σNXN+AN)∗+δ′In in [δ′,2δ′]. It readily follows that, almost surely for all large N, there is no eigenvalue of
(σNXN+AN)(σNXN+AN)∗ in [0,δ′]. Since moreover, according to (i), almost surely for all large N, there is no eigenvalue of
(σNXN+AN)(σNXN+AN)∗ in [δ′,y], we can conclude that there is no eigenvalue of MN in [x,y].
We are now in a position to establish the following exact separation phenomenon.
Theorem 5.6**.**
Let Mn as in (84) with assumptions [1-4] of Theorem 5.2.
Assume moreover that the empirical spectral measure μANAN∗ of ANAN∗ converges weakly to some probability measure ν.
Then for N large enough,
[TABLE]
where ωσ,ν,c is defined in (5).
With the convention that λ0(MN)=λ0(ANAN∗)=+∞ and
λn+1(MN)=λn+1(ANAN∗)=−∞, for N large enough, let iN∈{0,…,n}
be such that
[TABLE]
Then
[TABLE]
Remark 5.7**.**
Since μσ,μANAN∗,cN converges weakly towards μσ,ν,c assumption 4. implies that
∀0<τ<δ, [x−τ;y+τ]⊂R∖suppμσ,ν,c.
If ωσ,ν,c(x)<0, then iN=n in (94) and moreover we have, for all large N, ωσ,μANAN∗,cN(x)<0. According to Lemma 2.7 in [11], we can deduce that, for all large N, [x,y] is on the left hand side of the support of μσ,μANAN∗,cN so that ]−∞;y+δ] is on the left hand side of the support of μσ,μANAN∗,cN.
Since [−∣y∣−1,y] satifies the assumptions of Theorem 5.2,
we readily deduce that almost surely, for all large N, λn(MN)>y. Hence (95) holds true.
•
If ωσ,ν,c(x)≥0,
we first explain why it is sufficient to prove (95) for x such that ωσ,ν,c(x)>0.
Indeed, assume for a while that (95)
is true whenever ωσ,ν,c(x)>0.
Let us consider any interval [x,y] satisfying condition 4. of Theorem 5.2 and such that ωσ,ν,c(x)=0; then iN=n in (94). According to Proposition 1.2, ωσ,ν,c(2x+y)>0 and then almost surely for all large N,
λn(MN)>y. Finally, sticking to the proof of Theorem 1.2 in [11] leads to (95) for x such that ωσ,ν,c(x)>0.
∎
Appendix B
We first recall some basic properties of the resolvent (see [22], [12]).
Lemma 5.8**.**
*For a N×N Hermitian matrix M,
for any z∈C∖spect(M),
we denote by G(z):=(zIN−M)−1 the resolvent of M.
Let z∈C∖R,*
(i)
∥G(z)∥≤∣ℑz∣−1.
(ii)
∣G(z)ij∣≤∣ℑz∣−1* for all i,j=1,…,N.*
(iii)
G(z)M=MG(z)=−IN+zG(z)*.
*
Moreover, for any N×N Hermitian matrices M1 and M2,
[TABLE]
The following technical lemmas are fundamental in the approach of the present paper.
Lemma 5.9**.**
[Lemma 4.4 in [5]]
Let h:R→R be a continuous function with compact support. Let BN be a N×N Hermitian matrix and CN be a N×N matrix .
Then
[TABLE]
Moreover, if BN is random, we also have
[TABLE]
Lemma 5.10**.**
Let f be an analytic function on C∖R such that there exist some polynomial P with nonnegative coefficients, and some positive real number α such that
[TABLE]
Then, for any h in C∞(R,R) with compact support, there exists some constant τ depending only on h, α and P such that
[TABLE]
We refer the reader to the Appendix of [12]
where it is proved using the ideas of [21].
Finally, we recall some facts on Poincaré inequality.
A probability measure μ on R is said to satisfy the Poincaré inequality with constant CPI if
for any
C1 function f:R→C such that f and
f′ are in L2(μ),
[TABLE]
with V(f)=∫∣f−∫fdμ∣2dμ.
We refer the reader to [9] for a characterization
of the measures on R which satisfy a Poincaré inequality.
If the law of a random variable X satisfies the Poincaré inequality with constant CPI then, for any fixed α=0, the law of αX satisfies the Poincaré inequality with constant α2CPI.
Assume that probability measures μ1,…,μM on R satisfy the Poincaré inequality with constant CPI(1),…,CPI(M) respectively. Then the product measure μ1⊗⋯⊗μM on RM satisfies the Poincaré inequality with constant CPI∗=i∈{1,…,M}maxCPI(i) in the sense that for any differentiable function f such that f and its gradient gradf are in L2(μ1⊗⋯⊗μM),
[TABLE]
with V(f)=∫∣f−∫fdμ1⊗⋯⊗μM∣2dμ1⊗⋯⊗μM (see Theorem 2.5 in [18]) .
Lemma 5.11**.**
[Theorem 1.2 in [4]]
Assume that the distribution of a random variable X is supported in [−C;C] for some constant C>0. Let g be an independent standard real Gaussian random variable. Then X+δg satisfies a Poincaré inequality with constant
CPI≤δ2exp(4C2/δ2).
Acknowlegements.
The author is very grateful to Charles Bordenave and Serban Belinschi for several fruitful discussions and thanks Serban Belinschi for pointing out Lemma 4.7. The author also wants to thank an anonymous referee
who provided a much simpler proof of Lemma 4.6 and encouraged the author to establish the results for non diagonal perturbations, which led to an overall improvement of the paper.
Bibliography32
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] G. Anderson, A. Guionnet, and O. Zeitouni. An Introduction to Random Matrices . Cambridge University Press, 2009.
2[2] Z. D. Bai and J. W. Silverstein. Spectral Analysis of of large-dimensional random matrices. Mathematics Monograph Series 2, Science Press Beijing 2006.
3[3] Z. Bai and J. W. Silverstein. No eigenvalues outside the support of the limiting spectral distribution of information-plus-noise type matrices. Random Matrices Theory Appl. , 1(1):1150004, 44, 2012.
4[4] J.B. Bardet, N. Gozlan, F. Malrieu and P.-A. Zitt. Functional inequalities for Gaussian convolutions of compactly supported measures: explicit bounds and dimension dependence. Ar Xiv e-prints : 1507.02389.
5[5] S. T. Belinschi, H. Bercovici, M. Capitaine and M. Février. Outliers in the spectrum of large deformed unitarily invariant models Ar Xiv e-prints : 1412.4916, to appear in Ann. Probab.
6[6] S. T. Belinschi, M. Capitaine. Spectral properties of polynomials in independent Wigner and deterministic matrices Ar Xiv e-prints : 1611.07440, to appear in J. Funct. Anal. .
7[7] F. Benaych-Georges and R. N. Rao. The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices. Adv. in Math. , 227(1):494–521, 2011.
8[8] F. Benaych-Georges and R. N. Rao. The singular values and vectors of low rank perturbations of large rectangular random matrices. Ar Xiv e-prints : 1103.2221, 2011.