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.
Isotropic minimum-norm risk limits under a positive spectral gap
Statement
Assume the Axiom of Choice. Let be one infinite iid array of real random variables with mean zero, variance one and finite fourth moment. For each , let be a positive integer with and let be the upper-left block. Let be deterministic with . Let have independent centered components of variance , independent of (so its covariance is ), and let be independent of with mean zero and covariance . Set , , and . Define the design-conditional prediction risk by . If , then almost surely . If , then almost surely .
Statement references
Hastie, Montanari, Rosset, and Tibshirani, Theorem 1 and Appendix C.2 (full paper PDF).
Bai, Miao, and Pan, Theorem 1 (full paper PDF).
Facts & Assumptions
Given: The nested real iid design, deterministic signal, independent centered noise with covariance , and AC in the Statement.
The Axiom of Choice permits a choice function for every family of nonempty sets (The Axiom of Choice).
The noise vector is independent of the design, centered, and has covariance as stated.
The test feature is independent of the design and noise, centered, and has covariance as stated.
The Moore–Penrose inverse is characterized by the four Penrose equations (The Moore--Penrose pseudoinverse as the solution of the four Penrose equations).
and are orthogonal projections with ranges and , respectively (The Moore-Penrose products are orthogonal projectors).
Positive covariance eigenvalues are squared positive singular values divided by the sample size, and their number is the matrix rank (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, The rank of a linear map is the number of its nonzero singular values).
For the nested design, the smallest positive covariance eigenvalue has limit for and for , with eventual full rectangular rank (Almost-sure limit and structural-zero count at the lower sample-covariance edge).
The empirical spectral distribution of converges almost surely to the Marchenko–Pastur law with aspect ratio (Almost-sure Marchenko–Pastur law for finite-fourth-moment sample covariance matrices).
For upper-left blocks indexed by their row dimension , the directional theorem with identity population gives almost-sure weak convergence to when (Sample-covariance resolvent deterministic equivalents). Repeated dimensions require the argument below.
The Marchenko–Pastur probability law has an atom at zero, positive support , and transform satisfying (Marchenko–Pastur measure with aspect ratio gamma, The Marchenko–Pastur formula defines a probability law with the fixed-point transform).
Weak convergence gives convergence of integrals against every bounded continuous test function (Weak convergence of borel probability measures).
The deformed fixed-point solution is unique when both its transform and its companion transform have positive imaginary part (Uniqueness of the deformed Marchenko–Pastur fixed point).
Dominated convergence passes limits through integrals under an integrable majorant (Dominated convergence).
Iid entries are independent and share one common law (Identical distribution and IID families).
The finite-column proof of bounded resolvent concentration, steps 1.1–4.1, bounds the fourth moment of each leave-one-column increment by and that of the centered directional resolvent by , with constants independent of the unit direction and row dimension when the population is the identity (Adapted concentration of bounded complex resolvent quadratic forms).
For a nested real iid unit-variance finite-fourth-moment array with , almost surely (Finite-fourth-moment upper bound for the largest sample-covariance eigenvalue, [F3]).
Markov bounds a nonnegative random variable's tail by its expectation divided by the threshold; summable event probabilities imply only finitely many occurrences almost surely (Markov's inequality for random variables, First Borel-Cantelli lemma for events).
Proof
Put . For any fixed , , so the stated prediction risk equals . By [F2], is an orthogonal projection. The Penrose equation shows : if , then , and if , then . Hence by the right-singular-vector basis in [F3], so . Conditional on , the cross term has expectation zero because . Its noise contribution is where the middle equality follows by writing an SVD and the last uses for . With , this proves the exact identity
First identify the isotropic limit. By [F7], is a nonnegative probability measure: when , the negative coefficient cancels exactly the zero atom of . Thus is its Stieltjes transform and has positive imaginary part, as does . The scalar equation in [F7] rearranges to ; [F9] therefore identifies . For any deterministic unit directions and fixed , we claim . Indeed, every subsequence has a further subsequence with strictly increasing , since . In the transposed infinite array, prescribe and direction at , and at all other dimensions prescribe and the first coordinate vector. Then , so [F6] applies to this completed sequence. The bound and [F10] give the claimed expectation limit along . The subsequence criterion gives it along the original sequence. This argument also applies to each fixed standardized bounded truncation of the entry law.
Suppose and set . By [F4], has full column rank eventually and every eigenvalue of is at least eventually. Thus the bias term in step 1.1 is zero and for the bounded continuous function . By [F5] and [F8], this converges to , since the Marchenko–Pastur support is bounded below by . For , define . The integrands are bounded by and converge pointwise to , so [F10] gives as . The fixed-point equation in [F7], initially stated for , extends to by dominated convergence in its defining integral; its denominator stays nonzero because . Taking yields , hence . Since , step 1.1 gives .
For such a bounded unit-variance truncation, let be its block and . Apply the finite-column argument [F12] to , which has independent columns and identity population. More explicitly, each leave-one-column resolvent quadratic-form increment has by the bounded-entry eighth-moment linear-form estimate; its column-filtration difference satisfies . The fourth-moment recursion in [F12], , gives , and hence . These are finite-matrix estimates, with no indexing or distinctness assumption on . By [F14], their tails are summable in the original index . Together with step 1.2 this proves almost surely for each fixed .
To remove boundedness, put , , and . For sufficiently large integers , form from and write . The residual entries are centered with finite fourth moment and variance . Applying [F13] to the original, standardized and variance-normalized residual arrays yields, with , almost surely , , and . If , countability of the array makes every residual entry zero almost surely. The Gram-matrix identity then gives . For , the resolvent identity bounds the difference of their directional transforms by . Intersect the probability-one events over integers and let in step 2.2 to obtain almost surely.
Suppose and set . By [F4], has full row rank eventually, has exactly zero eigenvalues, and all positive eigenvalues are at least eventually. For each rational , the spectral identity bounds the difference between the directional transforms at and by , both for and for . Use step 3.1 at for all positive integers , then let , to obtain on one probability-one event for all rational . The gap gives eventually. Since by [F7] and [F10], letting rational proves the required bias limit. Define and, for , . This is bounded and continuous, equals zero at zero, and equals for . Therefore by [F5] and [F8]. [F7] gives as : subtract the zero atom and use [F10] by dominated convergence on the positive support, whose lower endpoint is . To compute the constant term, write and substitute into , the fixed-point equation at (again obtained by dominated convergence from [F7]). The coefficient of vanishes because ; the constant term is . It must vanish, so . Using in step 1.1 proves .
Source notes
Hastie, Montanari, Rosset, and Tibshirani, Theorem 1 and Appendix C.2 (full paper PDF). The repeated-dimension argument in steps 1.2, 2.2, and 3.1 uses injective row dimensions only for expectation limits; almost-sure concentration is summed in the original sample index. It follows the truncation and martingale structure of Bai, Miao, and Pan, Section 2, without changing the row-indexed supplier interface. The proof above separates the conditional noise expectation from the design almost-sure limits and uses a positive-edge cutoff rather than a interchange.
Depends on
- The Axiom of Choice
- Identical distribution and IID families
- The Moore--Penrose pseudoinverse $A^+$ as the solution of the four Penrose equations
- Marchenko–Pastur measure with aspect ratio gamma
- Weak convergence of borel probability measures
- Dominated convergence
- The rank of a linear map is the number of its nonzero singular values
- The Moore-Penrose products are orthogonal projectors
- The Marchenko–Pastur formula defines a probability law with the fixed-point transform
- Uniqueness of the deformed Marchenko–Pastur fixed point
- Sample-covariance resolvent deterministic equivalents
- Almost-sure Marchenko–Pastur law for finite-fourth-moment sample covariance matrices
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- Almost-sure limit and structural-zero count at the lower sample-covariance edge
- Adapted concentration of bounded complex resolvent quadratic forms
- Finite-fourth-moment upper bound for the largest sample-covariance eigenvalue
- Markov's inequality for random variables
- First Borel-Cantelli lemma for events
Used by
Dependency tree · two levels
78 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
- T. Hastie, A. Montanari, S. Rosset, and R. J. Tibshirani, Surprises in High-Dimensional Ridgeless Least Squares Interpolation (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)