Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Almost-sure Marchenko–Pastur law for finite-fourth-moment sample covariance matrices

Statement

Assume the Axiom of Choice, and let all the matrices Xn be defined on one common probability space. For each positive integer n, let pn be a positive integer with pn/n→γ∈(0,∞), and let Xn∈Rn×pn have mutually independent entries. Assume that all entries of all the matrices Xn have one common law with mean zero, variance one, and finite fourth moment. Set Sn=XnTXn/n and let μn be its empirical spectral distribution normalized by pn. Then μn converges weakly almost surely to the probability measure with density ργ(x)={(bγ−x)(x−aγ)2πγx,aγ<x<bγ,0,x∉(aγ,bγ),aγ=(1−γ)2,bγ=(1+γ)2, and an atom of mass (1−1/γ)+ at zero.

Statement references

Bai and Silverstein, Chapter 3, §3.3, printed pp. 52–58 (complete book PDF).

Junyi Liao, Theorem 2.1 and §2.1.3, printed pp. 29–38 (complete lecture notes).

Facts & Assumptions

Given: The hypotheses and notation of the Statement, including AC, the common probability space, and the one entry law shared by all matrices.

[A1]

The Axiom of Choice states that every family of nonempty sets has a choice function (The Axiom of Choice).

[A2]

The Axiom of Choice implies countable choice (AC implies DC implies countable choice).

[F1]

Sn=XnTXn/n and μn=pn−1∑j=1pnδλj(Sn); its eigenvalues are real and nonnegative (Sample covariance matrices and their empirical spectral distributions, The empirical spectral distribution of a sample covariance matrix is a probability measure).

[F2]

For a probability measure μ on R, mμ(z)=∫(x−z)−1 dμ(x) for Im⁡z>0 (Stieltjes transform of a probability measure on the real line).

[F3]

For iid real coordinates of mean zero, variance one and fourth moment μ4, an independent complex symmetric matrix A satisfies E∣ξTAξ−tr⁡A∣2≤max⁡{μ4−1,2}E∥A∥F2 (Fourth-moment bound for a centered quadratic form of an independent vector).

[F4]

If B is real symmetric nonnegative, then R=(B−zI)−1 and Rx=(B+xxT−zI)−1 satisfy Rx=R−RxxTR/(1+xTRx), and ∣tr⁡Rx−tr⁡R∣≤1/η for z=u+iη, η>0 (Rank-one resolvent update and trace bound for a positive semidefinite matrix).

[F5]

For n independent rank-one summands in positive integer dimension dn with dn/n→c>0, the normalized resolvent trace concentrates almost surely about its expectation, with the stated exponential tail (Adapted resolvent-trace martingale concentration for independent columns).

[F6]

Under countable choice, the transform mγ of the Marchenko–Pastur probability law satisfies 1+zm=m/(1+γm) and Im⁡(1−γ−z−γzm)≤−Im⁡z (The Marchenko–Pastur formula defines a probability law with the fixed-point transform).

[F7]

Under countable choice, Stieltjes transforms determine Borel probability measures on R (Stieltjes inversion and uniqueness for probability measures on the real line).

[F8]

A tight sequence of Borel probability measures on R has a weakly convergent subsequence; the used extraction theorem assumes AC (Tightness extracts a weakly convergent subsequence).

[F9]

Chebyshev's inequality bounds a deviation probability by variance divided by squared deviation (Chebyshev's inequality on a finite probability space).

[F10]

If event probabilities have finite sum, almost surely only finitely many of those events occur (First Borel-Cantelli lemma for events).

[F11]

Weak convergence of probability measures is convergence of integrals against every bounded continuous function (Weak convergence of borel probability measures).

[F12]

Within each Xn, the entries are mutually independent and identically distributed, so its rows are independent and each row has iid coordinates; the common entry law is the same for every n by the Statement (Identical distribution and IID families).

[F13]

Almost-sure convergence means convergence on an event of probability one (Almost-sure convergence of real random variables).

Proof

Given: The independent-entry matrices on the common probability space, their single common entry law and moment assumptions, pn/n→γ, and AC.

1.1givenF1F2F4algebra

Fix z=u+iη with η>0. Write the transpose of row i of Xn as yi∈Rpn and set Q=(Sn−zI)−1, mn=pn−1tr⁡Q=mμn(z) by [F1] and [F2]. For each i, let Si=Sn−yiyiT/n, Qi=(Si−zI)−1 and βi=n−1yiTQiyi. The matrices Sn,Si are nonnegative symmetric, so their resolvents exist; diagonalizing Si expresses βi as a sum of nonnegative weights times (λ−z)−1 with λ≥0. Thus Im⁡βi≥0 and Im⁡(zβi)≥0, since Im⁡[z/(λ−z)]=ηλ/∣λ−z∣2≥0. Consequently Im⁡[z(1+βi)]≥η, so ∣1+βi∣≥η/∣z∣>0. Applying [F4] with x=yi/n gives Q=Qi−QiyiyiTQi/[n(1+βi)], so n−1yiTQyi=βi/(1+βi). Since SnQ=I+zQ, taking normalized traces yields 1+zmn=1pn∑i=1nβi1+βi.

2.1givenF3F4F12step 1.1algebra

Put γn=pn/n, vn=γnmn=n−1tr⁡Q, and μ4=Eξ4 for the common entry law. Both βi and vn belong to the cone Cz={w:Im⁡w≥0, Im⁡(zw)≥0}: for vn use the same eigenvalue calculation on Q. For every w∈Cz, Im⁡[z(1+w)]≥η, so ∣1+w∣−1≤∣z∣/η. Conditional on Qi, row yi is independent of it by [F12]. Applying [F3] conditionally and using ∥Qi∥F2≤pn/η2 gives E∣βi−1ntr⁡Qi∣≤Cpnnη,C=max⁡{μ4−1,2}. By [F4], ∣tr⁡Qi−tr⁡Q∣≤1/η, hence E∣βi−vn∣≤(Cpn+1)/(nη). For f(w)=w/(1+w) and w,v∈Cz, ∣f(w)−f(v)∣=∣w−v∣/(∣1+w∣∣1+v∣)≤Kz∣w−v∣, where Kz=(∣z∣/η)2. Therefore [step 1.1] implies E∣1+zmn−mn1+γnmn∣≤KzCpn+1pnη⟶0.

3.1F5F13step 2.1algebra

Apply [F5] to the independent vectors yi/n, whose rank-one sum is Sn. For the fixed z, mn−an→0 almost surely, where an=Emn. Also E∣mn−an∣→0: for every ε>0, E∣mn−an∣≤ε+(2/η)Pr⁡(∣mn−an∣>ε), and the tail bound in [F5] makes the second term tend to zero. Define gn(w)=1+zw−w/(1+γnw). The cone Cz is closed under nonnegative scaling and expectations, so it contains mn,an,γnmn and γnan. For w,v∈Cz, the denominator estimate of step 2.1 applied to γnw,γnv gives ∣gn(w)−gn(v)∣≤(∣z∣+Kz)∣w−v∣. Taking expectations in the estimate of step 2.1 gives gn(an)→0.

4.1A2F1F6step 3.1algebra

The sequence (an) is bounded by 1/η. Moreover Im⁡(zmn)=pn−1∑jηλj(Sn)/∣λj(Sn)−z∣2≥0, so Im⁡(1−γn−z−γnzan)≤−η. The same closed-cone bound gives ∣1+γnan∣≥η/∣z∣. Every convergent subsequence of an therefore has a limit a, with ∣1+γa∣≥η/∣z∣, satisfying 1+za=a/(1+γa) and Im⁡(1−γ−z−γza)≤−η. The two roots of the associated quadratic have corresponding values Dj=1−γ−z−γzaj whose sum is 1−γ−z, with imaginary part −η. Thus at most one root can have Im⁡Dj≤−η. By [A2] and [F6], that root is mγ(z). All subsequential limits are consequently mγ(z), so an→mγ(z) and step 3.1 gives mn(z)→mγ(z) almost surely.

5.1givenF9F10F12F13step 1.1step 4.1algebra

Perform steps 1.1–4.1 for each z in the countable dense set {u+iη:u,η∈Q,η>0} and intersect their probability-one events. Also let Tn=(npn)−1∑i,jXn,ij2. Its mean is one and its variance is (μ4−1)/(npn). Since pn/n→γ>0, [F9] gives a summable bound Pr⁡(∣Tn−1∣>ε)≤(μ4−1)/(ε2npn) for every ε>0; [F10] over positive rational ε yields Tn→1 almost surely.

6.1F1F8F11step 5.1A1algebra

On this probability-one event, ∫x dμn(x)=Tn and μn is supported on [0,∞) by [F1]. For every R>0, μn((R,∞))≤Tn/R, so the sequence is tight. By [A1] and [F8], every subsequence has a further weakly convergent subsequence with limit ν. Along it, [F11] applied to x↦(x−z)−1 shows mν(z)=mγ(z) on the dense set from step 5.1. The transforms are continuous because ∣mν(z)−mν(w)∣≤∣z−w∣/(Im⁡zIm⁡w) for z,w∈C+; equality therefore extends to all z∈C+.

7.1A2F7F8F11step 6.1algebra∎

By [A2] and [F7], every weak subsequential limit ν in step 6.1 equals μγ. If μn did not converge weakly to μγ, some bounded continuous test function and a subsequence would have integrals separated from its μγ integral by a fixed positive amount; tightness would give a further weakly convergent subsequence, contradicting its limit μγ. Therefore μn⇒μγ almost surely.

Depends on

Used by

Dependency tree · two levels

50 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