Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Deterministic equivalent for the bounded complex sample-covariance resolvent

Statement

For each positive integer n, let Nn be a positive integer with Nn/n→κ∈(0,∞), let Xn∈Cn×Nn have entries from one common iid law with mean zero, second absolute moment one and ∣Xij∣≤K almost surely for a fixed K, and let Tn be deterministic Hermitian positive semidefinite (self-adjoint with v∗Tnv≥0 for every v) with induced Euclidean operator norm ∥Tn∥op≤M. Define An=Nn−1Tn1/2XnXn∗Tn1/2,A~n=Nn−1Xn∗TnXn, Rn(z)=(An−zIn)−1,R~n(z)=(A~n−zINn)−1,qn(z)=E[Nn−1tr⁡R~n(z)]. For every fixed z=u+iη with u∈R and η>0, the matrix In+qn(z)Tn is invertible and sup⁡∥x∥2=1∣x∗(ERn(z)+1z(In+qn(z)Tn)−1)x∣⟶0.

Statement references

Bai, Miao, and Pan, complete Section 2 proof of Theorem 1, printed pp. 12–16 (full paper PDF).

Silverstein, Theorem 1.1 proof, PDF pp. 3–8 (full paper PDF).

Facts & Assumptions

Given: The iid bounded entries, deterministic positive semidefinite Tn, aspect-ratio limit, and fixed z∈C+ in the Statement.

[F1]

Independent centered complex coordinates with unit second absolute moment satisfy the stated second-moment quadratic-form bound, also conditionally when the coefficient matrix is independent (Fourth-moment bound for a centered complex quadratic form).

[F2]

Adding one positive rank-one matrix has the Sherman–Morrison resolvent formula and trace-norm bound (Hermitian rank-one resolvent update and trace-norm bound).

[F3]

For bounded iid entries, each deterministic unit-vector resolvent quadratic form differs from its expectation with fourth-tail bound C/(t4Nn2) (Adapted concentration of bounded complex resolvent quadratic forms).

[F4]

Hermitian positive semidefinite matrices have nonnegative eigenvalues and an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).

[F5]

The Stieltjes transform of a probability measure uses the (t−z)−1 convention in the upper half-plane (Stieltjes transform of a probability measure on the real line).

[F6]

The operator norm is the maximum of ∥Av∥2 over unit vectors in the domain (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

Proof

1.1givenF4F5F6algebra

Fix n,z, suppress the index n, write N=Nn, sj=T1/2X⋅j/N, R=(A−zI)−1, Rj=(A−sjsj∗−zI)−1, and βj=(1+sj∗Rjsj)−1. The companion matrix A~=N−1X∗TX is positive semidefinite by [F4], so q=N−1Etr⁡(A~−zI)−1 is the Stieltjes transform of an expected probability measure on [0,∞) by [F5] and has positive imaginary part. If q=∫(λ−z)−1 dG(λ), then for every t≥0, Im⁡{z(1+tq)}=η+t∫λη∣λ−z∣2 dG(λ)≥η, so C:=(I+qT)−1 exists and ∥C∥op≤∣z∣/η. The same spectral calculation applied to A−sjsj∗ gives ∣βj∣≤∣z∣/η.

2.1givenF1F4step 1.1algebra

Set bj=(1+N−1tr⁡(TRj))−1 and ξj=sj∗Rjsj−N−1tr⁡(TRj). The trace in bj is a Stieltjes transform with nonnegative weights: in an eigenbasis of A−sjsj∗ its weights are ⟨vk,Tvk⟩/N≥0. The inequality in step 1.1 therefore also gives ∣bj∣≤∣z∣/η. Conditional on all columns except j, [F1] and ∥T1/2RjT1/2∥F2≤nM2/η2 give Ej∣ξj∣2≤C1n/N2=O(N−1), where Ej integrates column j. For any deterministic unit x, set αj=x∗Csjsj∗Rjx−N−1x∗CTRjx. This is a centered quadratic form in column j. Its coefficient matrix is N−1(T1/2Rjx)(x∗CT1/2), so it has rank at most one and Frobenius norm at most M∥C∥op/(Nη). Thus [F1] gives Ej∣αj∣2=O(N−2). Also Ejαj=0 and βj−bj=−βjbjξj.

2.2givenF4step 1.1algebra

For all sufficiently large n we have N=Nn≥2. Put Y=[s2 ⋯ sN], D=Y∗Y−zIN−1, and C−=YY∗−zIn=A−s1s1∗−zIn. The matrix A~−zI has block form (s1∗s1−zs1∗YY∗s1D). For a block matrix (ab∗bD) with invertible D, solving its product with (u,v)T=(1,0)T gives v=−D−1bu and (a−b∗D−1b)u=1. Hence its inverse's upper-left entry is (a−b∗D−1b)−1. Here (C−)Y=YD, so (C−)(I−YD−1Y∗)=C−−YY∗=−zI and I−YD−1Y∗=−zC−−1=−zR1. The Schur complement is therefore s1∗(I−YD−1Y∗)s1−z=−z(1+s1∗R1s1), proving (R~)11=−β1/z.

3.1givenF2F4step 1.1step 2.2algebra

By exchangeability of the columns and step 2.2, zq=−N−1∑j=1NEβj. The identity R−1=∑jsjsj∗−zI gives ∑jsjsj∗R=I+zR. The rank-one formula [F2] gives sjsj∗R=βjsjsj∗Rj. Substituting these identities and the formula for zq yields ER+1zC=1z∑j=1NE[βj(Csjsj∗Rj−N−1CT ER)]. Testing against x and adding then subtracting N−1x∗CTRjx and N−1x∗CTRx decomposes the right side into three terms δ1+δ2+δ3.

4.1givenF1step 2.1step 3.1algebra

For the first term, δ1=(N/z)E(β1α1). Since b1 is independent of column 1 and E1α1=0, we have E(b1α1)=0. Therefore step 2.1, Cauchy–Schwarz, and the uniform bounds on β1,b1 imply ∣δ1∣≤C2N(E∣ξ1∣2)1/2(E∣α1∣2)1/2=O(N−1/2).

4.2givenF1F2step 2.1step 3.1algebra

For the second term, R1−R=β1R1s1s1∗R1. Conditional second moments of the two linear forms x∗CTR1s1 and s1∗R1x are each O(N−1), uniformly in the other columns. Cauchy–Schwarz and boundedness of β1 yield ∣δ2∣=O(N−1).

4.3givenF3step 1.1step 3.1algebra

The third term is δ3=z−1E[β1x∗CT(R−ER)x]. For any deterministic sequence of unit vectors x=xn, put u=(CT)∗x and v=x; their norms are uniformly bounded by step 1.1. For Q(w)=w∗(R−ER)w, direct expansion gives Bn:=u∗(R−ER)v=14{Q(u+v)−Q(u−v)−iQ(u+iv)+iQ(u−iv)}. Rescale each nonzero vector to unit length; zero vectors contribute zero. For each fixed t>0, [F3] and the union bound imply P(∣Bn∣>t)→0. Also ∣Bn∣≤2∥u∥∥v∥/η≤L for a fixed finite L. Thus E∣Bn∣2≤t2+L2P(∣Bn∣>t), so first letting n→∞ and then t↓0 gives E∣Bn∣2→0. Boundedness of β1 and Cauchy–Schwarz yield δ3→0. This holds for every deterministic unit-vector sequence, hence uniformly over unit x: otherwise a sequence of deterministic directions with ∣δ3∣ bounded away from zero along a subsequence would contradict the conclusion just proved. No shrinking-threshold tail estimate is used.

5.1givenstep 3.1step 4.1step 4.2step 4.3algebra∎

The bounds in steps 4.1, 4.2, and 4.3 tend to zero uniformly over deterministic unit x. The tested resolvent identity in step 3.1 therefore proves the asserted supremum limit.

Source notes

Bai, Miao, and Pan, equations (2.2)–(2.9), printed pp. 12–15 (full paper PDF). The N-prefactor in their estimate (2.6) gives O(N−1/2) after the displayed moment bounds; the proof above retains that corrected vanishing order. Their (2.8) term is bounded here by adapted resolvent concentration and polarization.

Depends on

Used by

Dependency tree · two levels

19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources