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 be defined on one common probability space. For each positive integer , let be a positive integer with , and let have mutually independent entries. Assume that all entries of all the matrices have one common law with mean zero, variance one, and finite fourth moment. Set and let be its empirical spectral distribution normalized by . Then converges weakly almost surely to the probability measure with density and an atom of mass 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.
The Axiom of Choice states that every family of nonempty sets has a choice function (The Axiom of Choice).
The Axiom of Choice implies countable choice (AC implies DC implies countable choice).
and ; 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).
For a probability measure on , for (Stieltjes transform of a probability measure on the real line).
For iid real coordinates of mean zero, variance one and fourth moment , an independent complex symmetric matrix satisfies (Fourth-moment bound for a centered quadratic form of an independent vector).
If is real symmetric nonnegative, then and satisfy , and for , (Rank-one resolvent update and trace bound for a positive semidefinite matrix).
For independent rank-one summands in positive integer dimension with , the normalized resolvent trace concentrates almost surely about its expectation, with the stated exponential tail (Adapted resolvent-trace martingale concentration for independent columns).
Under countable choice, the transform of the Marchenko–Pastur probability law satisfies and (The Marchenko–Pastur formula defines a probability law with the fixed-point transform).
Under countable choice, Stieltjes transforms determine Borel probability measures on (Stieltjes inversion and uniqueness for probability measures on the real line).
A tight sequence of Borel probability measures on has a weakly convergent subsequence; the used extraction theorem assumes AC (Tightness extracts a weakly convergent subsequence).
Chebyshev's inequality bounds a deviation probability by variance divided by squared deviation (Chebyshev's inequality on a finite probability space).
If event probabilities have finite sum, almost surely only finitely many of those events occur (First Borel-Cantelli lemma for events).
Weak convergence of probability measures is convergence of integrals against every bounded continuous function (Weak convergence of borel probability measures).
Within each , 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 by the Statement (Identical distribution and IID families).
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, , and AC.
Fix with . Write the transpose of row of as and set , by [F1] and [F2]. For each , let , and . The matrices are nonnegative symmetric, so their resolvents exist; diagonalizing expresses as a sum of nonnegative weights times with . Thus and , since . Consequently , so . Applying [F4] with gives , so . Since , taking normalized traces yields
Put , , and for the common entry law. Both and belong to the cone : for use the same eigenvalue calculation on . For every , , so . Conditional on , row is independent of it by [F12]. Applying [F3] conditionally and using gives By [F4], , hence . For and , , where . Therefore [step 1.1] implies
Apply [F5] to the independent vectors , whose rank-one sum is . For the fixed , almost surely, where . Also : for every , , and the tail bound in [F5] makes the second term tend to zero. Define . The cone is closed under nonnegative scaling and expectations, so it contains and . For , the denominator estimate of step 2.1 applied to gives . Taking expectations in the estimate of step 2.1 gives .
The sequence is bounded by . Moreover , so . The same closed-cone bound gives . Every convergent subsequence of therefore has a limit , with , satisfying and . The two roots of the associated quadratic have corresponding values whose sum is , with imaginary part . Thus at most one root can have . By [A2] and [F6], that root is . All subsequential limits are consequently , so and step 3.1 gives almost surely.
Perform steps 1.1–4.1 for each in the countable dense set and intersect their probability-one events. Also let . Its mean is one and its variance is . Since , [F9] gives a summable bound for every ; [F10] over positive rational yields almost surely.
On this probability-one event, and is supported on by [F1]. For every , , so the sequence is tight. By [A1] and [F8], every subsequence has a further weakly convergent subsequence with limit . Along it, [F11] applied to shows on the dense set from step 5.1. The transforms are continuous because for ; equality therefore extends to all .
By [A2] and [F7], every weak subsequential limit in step 6.1 equals . If 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 almost surely.
Depends on
- Sample covariance matrices and their empirical spectral distributions
- Stieltjes transform of a probability measure on the real line
- Marchenko–Pastur measure with aspect ratio gamma
- The empirical spectral distribution of a sample covariance matrix is a probability measure
- Fourth-moment bound for a centered quadratic form of an independent vector
- Rank-one resolvent update and trace bound for a positive semidefinite matrix
- Adapted resolvent-trace martingale concentration for independent columns
- Stieltjes inversion and uniqueness for probability measures on the real line
- Weak convergence of borel probability measures
- Tightness extracts a weakly convergent subsequence
- The Axiom of Choice
- AC implies DC implies countable choice
- Identical distribution and IID families
- Almost-sure convergence of real random variables
- First Borel-Cantelli lemma for events
- Chebyshev's inequality on a finite probability space
- The Marchenko–Pastur formula defines a probability law with the fixed-point transform
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
- Bai and Silverstein, Spectral Analysis of Large Dimensional Random Matrices, 2nd ed., Chapter 3, §3.3 (standard reference, not scraped)
- Junyi Liao, Random Matrix Theory, Theorem 2.1 and §2.1.3 (standard reference, not scraped)