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 , let be a positive integer with , let 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 be deterministic Hermitian positive semidefinite (self-adjoint with for every ) with uniformly bounded induced Euclidean operator norm. Suppose the empirical eigenvalue measures converge weakly to a Borel probability measure on . Put and , and let . Then there is a unique Borel probability measure on such that, almost surely, converges weakly to . Its Stieltjes transform is the unique satisfying , with , and
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.
The Axiom of Choice permits a choice function for every family of nonempty sets (The Axiom of Choice).
The normalized eigenvalue measure of the complex Hermitian sample-covariance matrix is its empirical spectral distribution, defined as the rank-weighted finite spectral measure (Directional spectral measure of a Hermitian matrix).
Iid entries are mutually independent and share one common distribution (Identical distribution and IID families).
The Stieltjes transform convention is for (Stieltjes transform of a probability measure on the real line).
Markov's inequality bounds the mass of by the first moment divided by (Markov's inequality for random variables).
Tight families of Borel probabilities on a Polish space are relatively sequentially compact for weak convergence, under AC (Prokhorov tightness theorem on polish spaces).
The bounded-entry resolvent has the deterministic equivalent , uniformly on deterministic unit-vector quadratic forms (Deterministic equivalent for the bounded complex sample-covariance resolvent).
The normalized resolvent trace concentrates almost surely about its expectation (Concentration of the normalized complex Hermitian resolvent trace).
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).
Equal Stieltjes transforms determine probability measures on the real line (Stieltjes inversion and uniqueness for probability measures on the real line).
The normalized operator norm of bounded complex iid matrices is almost surely eventually bounded (Operator-norm bound for bounded complex iid matrices).
The nonzero eigenvalues of and agree with multiplicity (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
A probability measure is a countably additive Borel measure of total mass one (Probability measures and probability spaces).
Integrals of nonnegative increasing measurable sequences converge to the integral of their pointwise limit (Monotone convergence for the integral).
The ordered eigenvalues of a Hermitian matrix vary continuously with the matrix in operator norm (Ordered eigenvalues of Hermitian matrices are operator-norm Lipschitz).
A Polish space is a separable topological space whose topology is induced by a complete metric (Polish spaces are separable completely metrizable spaces).
Weak convergence of Borel probabilities means convergence of integrals against all bounded continuous real-valued functions (Weak convergence of borel probability measures).
The operator norm is the maximum of over unit vectors in the domain (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
Proof
Write , let , and let be defined similarly for . By [F14], each ordered eigenvalue is continuous in the matrix entries, so these setwise expectations are defined for Borel . For disjoint Borel sets, countable additivity of the random ESDs followed by [F13] gives countable additivity of and ; their total masses are one. Independence and unit second moment give and . Both first moments are uniformly bounded because and is uniformly bounded. By [F4], their tails above are at most the corresponding first moment divided by , so both expected-measure sequences are tight on . The half-line is Polish: it is a closed subset of the complete real line and is dense. By [A1] and [F5], every subsequence of has a further weakly convergent subsequence.
For each fixed , [F7] gives almost surely. Since all are on the common probability space in the Statement, intersect these events over the countable dense set .
Fix and take any such subsequence with . Let and . By [F11], the two sample-covariance matrices have the same nonzero eigenvalues, so their transforms satisfy exactly . Hence . Moreover . The first moments of are bounded, so at least half of each lies in some fixed interval ; consequently and .
Apply [F6] to an orthonormal eigenbasis of . Its uniform quadratic-form error implies Since , all are supported in one compact interval, , and , the integrands converge uniformly on that interval to . Thus . The relation for in step 2.1 gives , so satisfies the fixed-point equation in the Statement. The argument applies to every and every weak subsequential limit . 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 . Tightness then implies .
On the same event, [F10] gives eventually for a finite deterministic , so the random measures are eventually supported on 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 , its transform equals that of by steps 3.1 and 1.2, since the real and imaginary parts of are bounded continuous and [F16] applies to each. For any probability law , its transform satisfies , so equality on the dense set extends to all ; [F9] identifies the subsequential limit as . Every subsequence has the same further limit, and [F16] gives 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
- The Axiom of Choice
- Identical distribution and IID families
- Probability measures and probability spaces
- Polish spaces are separable completely metrizable spaces
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Directional spectral measure of a Hermitian matrix
- Stieltjes transform of a probability measure on the real line
- Weak convergence of borel probability measures
- Markov's inequality for random variables
- Monotone convergence for the integral
- Operator-norm bound for bounded complex iid matrices
- Concentration of the normalized complex Hermitian resolvent trace
- Deterministic equivalent for the bounded complex sample-covariance resolvent
- Uniqueness of the deformed Marchenko–Pastur fixed point
- Stieltjes inversion and uniqueness for probability measures on the real line
- Ordered eigenvalues of Hermitian matrices are operator-norm Lipschitz
- Prokhorov tightness theorem on polish spaces
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
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
- J. W. Silverstein, Strong Convergence of the Empirical Distribution of Eigenvalues of Large Dimensional Random Matrices (standard reference, not scraped)
- Z. D. Bai, B. Q. Miao, and G. M. Pan, On Asymptotics of Eigenvectors of Large Sample Covariance Matrix (standard reference, not scraped)