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.
Sample covariance matrices and their empirical spectral distributions
Definition
For positive integers and , let and define its (uncentered, unit-variance-normalized) sample covariance matrix by It is real symmetric and non-negative. If its eigenvalues, counted with multiplicity, are , its empirical spectral distribution (ESD), normalized by the matrix dimension , is The largest eigenvalue is . When has at least one positive eigenvalue, its smallest positive eigenvalue is . For a sequence with and positive integer for every , write and .
Definition references
Bai and Silverstein, Chapter 3, §§3.1–3.3, printed pp. 39–58 (complete book PDF).
Junyi Liao, Chapter 2, §2.1, printed pp. 29–38 (complete lecture notes).
Depends on
Used by
- Finite-fourth-moment upper bound for the largest sample-covariance eigenvalue Lemma
- Independent lower bound for the largest sample-covariance eigenvalue Lemma
- The empirical spectral distribution of a sample covariance matrix is a probability measure Lemma
- Almost-sure limit and structural-zero count at the lower sample-covariance edge Theorem
- Almost-sure limit of the largest sample-covariance eigenvalue Theorem
- Almost-sure Marchenko–Pastur law for finite-fourth-moment sample covariance matrices Theorem
- Bai–Yin lower singular-value limits and full rank away from aspect one Theorem
Dependency tree · two levels
13 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 (standard reference, not scraped)
- Junyi Liao, Random Matrix Theory, Chapter 2 (standard reference, not scraped)