Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

General-population sample-covariance law for bounded entries

Statement

Assume the Axiom of Choice. On a common probability space, 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 absolute value bounded by one fixed finite constant, and let Tn be deterministic Hermitian positive semidefinite (self-adjoint with v∗Tnv≥0 for every v) with uniformly bounded induced Euclidean operator norm. Suppose the empirical eigenvalue measures Hn=n−1∑i=1nδλi(Tn) converge weakly to a Borel probability measure H on [0,∞). Put c=κ−1 and An=Nn−1Tn1/2XnXn∗Tn1/2, and let Fn=n−1∑i=1nδλi(An). Then there is a unique Borel probability measure Fc,H on [0,∞) such that, almost surely, Fn converges weakly to Fc,H. Its Stieltjes transform mc,H(z)=∫(t−z)−1 dFc,H(t) is the unique m∈C satisfying Im⁡m>0, u:=−(1−c)/z+cm with Im⁡u>0, and m=∫[0,∞)1t(1−c−czm)−z dH(t)(Im⁡z>0).

Statement references

Silverstein, Theorem 1.1 and its complete proof in Section 3 (full paper PDF).

Bai, Miao, and Pan, Section 2, including the sample-covariance resolvent conventions (full paper PDF).

Facts & Assumptions

Given: The common probability space, assumptions, matrices, and empirical measures in the Statement, including AC.

[A1]

The Axiom of Choice permits a choice function for every family of nonempty sets (The Axiom of Choice).

[F1]

The normalized eigenvalue measure of the complex Hermitian sample-covariance matrix An is its empirical spectral distribution, defined as the rank-weighted finite spectral measure (Directional spectral measure of a Hermitian matrix).

[F2]

Iid entries are mutually independent and share one common distribution (Identical distribution and IID families).

[F3]

The Stieltjes transform convention is mμ(z)=∫(t−z)−1 dμ(t) for Im⁡z>0 (Stieltjes transform of a probability measure on the real line).

[F4]

Markov's inequality bounds the mass of {t>R} by the first moment divided by R (Markov's inequality for random variables).

[F5]

Tight families of Borel probabilities on a Polish space are relatively sequentially compact for weak convergence, under AC (Prokhorov tightness theorem on polish spaces).

[F6]

The bounded-entry resolvent has the deterministic equivalent −(z(I+qnTn))−1, uniformly on deterministic unit-vector quadratic forms (Deterministic equivalent for the bounded complex sample-covariance resolvent).

[F7]

The normalized resolvent trace concentrates almost surely about its expectation (Concentration of the normalized complex Hermitian resolvent trace).

[F8]

The deformed fixed-point equation has at most one solution satisfying the stated upper-half-plane conditions (Uniqueness of the deformed Marchenko–Pastur fixed point).

[F9]

Equal Stieltjes transforms determine probability measures on the real line (Stieltjes inversion and uniqueness for probability measures on the real line).

[F10]

The normalized operator norm of bounded complex iid matrices is almost surely eventually bounded (Operator-norm bound for bounded complex iid matrices).

[F11]

The nonzero eigenvalues of Y∗Y and YY∗ agree with multiplicity (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[F12]

A probability measure is a countably additive Borel measure of total mass one (Probability measures and probability spaces).

[F13]

Integrals of nonnegative increasing measurable sequences converge to the integral of their pointwise limit (Monotone convergence for the integral).

[F14]

The ordered eigenvalues of a Hermitian matrix vary continuously with the matrix in operator norm (Ordered eigenvalues of Hermitian matrices are operator-norm Lipschitz).

[F15]

A Polish space is a separable topological space whose topology is induced by a complete metric (Polish spaces are separable completely metrizable spaces).

[F16]

Weak convergence of Borel probabilities means convergence of integrals against all bounded continuous real-valued functions (Weak convergence of borel probability measures).

[F17]

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.1givenA1F1F2F4F5F12F13F14F15F17algebra

Write cn=n/Nn, let Fˉn(B)=EFn(B), and let Gˉn be defined similarly for A~n=Nn−1Xn∗TnXn. By [F14], each ordered eigenvalue is continuous in the matrix entries, so these setwise expectations are defined for Borel B. For disjoint Borel sets, countable additivity of the random ESDs followed by [F13] gives countable additivity of Fˉn and Gˉn; their total masses are one. Independence and unit second moment give ∫t dFˉn(t)=n−1tr⁡Tn and ∫t dGˉn(t)=Nn−1tr⁡Tn. Both first moments are uniformly bounded because cn→c>0 and ∥Tn∥op is uniformly bounded. By [F4], their tails above R are at most the corresponding first moment divided by R, so both expected-measure sequences are tight on [0,∞). The half-line is Polish: it is a closed subset of the complete real line and Q∩[0,∞) is dense. By [A1] and [F5], every subsequence of Fˉn has a further weakly convergent subsequence.

1.2givenF7

For each fixed z∈C+, [F7] gives ∫(t−z)−1dFn(t)−∫(t−z)−1dFˉn(t)→0 almost surely. Since all Xn are on the common probability space in the Statement, intersect these events over the countable dense set {a+ib:a,b∈Q, b>0}.

2.1givenF3F4F11F16step 1.1algebra

Fix z∈C+ and take any such subsequence with Fˉn⇒G. Let mG(z)=∫(t−z)−1dG(t) and qn(z)=∫(t−z)−1dGˉn(t). By [F11], the two sample-covariance matrices have the same nonzero eigenvalues, so their transforms satisfy exactly qn=−(1−cn)/z+cn∫(t−z)−1dFˉn(t). Hence qn→u:=−(1−c)/z+cmG(z). Moreover Im⁡mG(z)>0. The first moments of Gˉn are bounded, so at least half of each Gˉn lies in some fixed interval [0,L]; consequently Im⁡qn(z)≥η/(2(L+∣z∣)2) and Im⁡u>0.

3.1givenF3F6F8F9F16F17step 1.1step 2.1algebra

Apply [F6] to an orthonormal eigenbasis of Tn. Its uniform quadratic-form error implies ∫(t−z)−1 dFˉn(t)=−1zntr⁡(I+qnTn)−1+o(1)=−1z∫11+qnt dHn(t)+o(1). Since Hn⇒H, all Hn are supported in one compact interval, qn→u, and Im⁡u>0, the integrands converge uniformly on that interval to −1/[z(1+ut)]. Thus mG(z)=∫[−z(1+ut)]−1dH(t). The relation for u in step 2.1 gives −z(1+ut)=t(1−c−czmG(z))−z, so mG satisfies the fixed-point equation in the Statement. The argument applies to every z∈C+ and every weak subsequential limit G. By [F8], all such limits have the same transform; [F9] makes them equal. At least one such limit exists by step 1.1, so call it Fc,H. Tightness then implies Fˉn⇒Fc,H.

4.1givenA1F5F9F10F15F16step 1.1step 3.1step 1.2algebra∎

On the same event, [F10] gives ∥An∥op≤L1 eventually for a finite deterministic L1, so the random measures Fn are eventually supported on [0,L1] and are tight. The half-line is Polish by the metric facts in step 1.1 and [F15]. By [A1] and [F5], every subsequence has a weakly convergent further subsequence. For each dense-set z, its transform equals that of Fc,H by steps 3.1 and 1.2, since the real and imaginary parts of (t−z)−1 are bounded continuous and [F16] applies to each. For any probability law μ, its transform satisfies ∣mμ(z)−mμ(w)∣≤∣z−w∣/(Im⁡zIm⁡w), so equality on the dense set extends to all C+; [F9] identifies the subsequential limit as Fc,H. Every subsequence has the same further limit, and [F16] gives Fn⇒Fc,H almost surely.

Source notes

Silverstein, Theorem 1.1 and complete Section 3 proof (full paper PDF). The local proof makes the companion-transform relation and the uniqueness step explicit.

Depends on

Used by

Dependency tree · two levels

75 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