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 limit of the largest sample-covariance eigenvalue
Statement
Let be one infinite iid array of real random variables with mean zero, variance one and finite fourth moment. For each positive integer , let be a positive integer and let and suppose . For , the largest eigenvalue satisfies
Statement references
Yin, Bai, and Krishnaiah, Theorem 3.1 and §4, printed pp. 517–520 (complete paper PDF).
Bai and Silverstein, Theorem 5.10, printed pp. 105–112 (complete book PDF).
Facts & Assumptions
Independent lower bound for the largest sample-covariance eigenvalue gives the independent reverse inequality for the liminf.
Proof
Given: The nested iid array and hypotheses in the Statement.
The two suppliers apply to exactly the same upper-left blocks, law, normalization and aspect ratio as in the Statement. Intersect their probability-one events to obtain the upper bound in F1 and lower bound in F2 simultaneously.
On this event the liminf and limsup of coincide with . Thus the sequence converges to that value almost surely.
Depends on
- Sample covariance matrices and their empirical spectral distributions
- Finite-fourth-moment upper bound for the largest sample-covariance eigenvalue
- Independent lower bound for the largest sample-covariance eigenvalue
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector
Used by
Dependency tree · two levels
19 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
- Yin, Bai, and Krishnaiah, On the Limit of the Largest Eigenvalue of the Large Dimensional Sample Covariance Matrix, Theorem 3.1 (standard reference, not scraped)
- Bai and Silverstein, Spectral Analysis of Large Dimensional Random Matrices, 2nd ed., Chapter 5, §5.2 (standard reference, not scraped)