Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedPipeline-generated
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 (ξij)i,j≥1 be one infinite iid array of real random variables with mean zero, variance one and finite fourth moment. For each n, let pn be a positive integer with pn/n→γ∈(0,∞)∖{1} and let Xn=(ξij)1≤i≤n, 1≤j≤pn be the upper-left block. Let βn∈Rpn be deterministic with ∥βn∥2=r>0. Let εn∈Rn have independent centered components of variance σ2, independent of Xn (so its covariance is σ2In), and let z0,n∈Rpn be independent of (Xn,εn) with mean zero and covariance Ipn. Set yn=Xnβn+εn, β^n=Xn+yn, and Sn=XnTXn/n. Define the design-conditional prediction risk by Rn=Eεn,z0,n[(z0,nTβ^n−z0,nTβn)2∣Xn]. If γ<1, then almost surely Rn→σ2γ/(1−γ). If γ>1, then almost surely Rn→r2(1−1/γ)+σ2/(γ−1).

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 σ2In, and AC in the Statement.

[A1]

The Axiom of Choice permits a choice function for every family of nonempty sets (The Axiom of Choice).

[A2]

The noise vector is independent of the design, centered, and has covariance σ2In as stated.

[A3]

The test feature is independent of the design and noise, centered, and has covariance Ipn as stated.

[F1]

The Moore–Penrose inverse X+ is characterized by the four Penrose equations (The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations).

[F2]

X+X and XX+ are orthogonal projections with ranges Ran⁡(X+) and Ran⁡(X), respectively (The Moore-Penrose products are orthogonal projectors).

[F3]

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).

[F4]

For the nested design, the smallest positive covariance eigenvalue has limit (1−γ)2 for γ<1 and (γ−1)2 for γ>1, with eventual full rectangular rank (Almost-sure limit and structural-zero count at the lower sample-covariance edge).

[F5]

The empirical spectral distribution of Sn converges almost surely to the Marchenko–Pastur law with aspect ratio γ (Almost-sure Marchenko–Pastur law for finite-fourth-moment sample covariance matrices).

[F6]

For upper-left d×Nd blocks indexed by their row dimension d, the directional theorem with identity population gives almost-sure weak convergence to Fγ,δ1 when d/Nd→γ (Sample-covariance resolvent deterministic equivalents). Repeated dimensions pn require the argument below.

[F7]

The Marchenko–Pastur probability law has an atom (1−1/γ)+ at zero, positive support [(1−γ)2,(1+γ)2], and transform satisfying 1+zm=m/(1+γm) (Marchenko–Pastur measure with aspect ratio gamma, The Marchenko–Pastur formula defines a probability law with the fixed-point transform).

[F8]

Weak convergence gives convergence of integrals against every bounded continuous test function (Weak convergence of borel probability measures).

[F9]

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).

[F10]

Dominated convergence passes limits through integrals under an integrable majorant (Dominated convergence).

[F11]

Iid entries are independent and share one common law (Identical distribution and IID families).

[F12]

The finite-column proof of bounded resolvent concentration, steps 1.1–4.1, bounds the fourth moment of each leave-one-column increment by C/N4 and that of the centered directional resolvent by C/N2, with constants independent of the unit direction and row dimension when the population is the identity (Adapted concentration of bounded complex resolvent quadratic forms).

[F13]

For a nested real iid unit-variance finite-fourth-moment array with pn/n→γ, almost surely lim sup⁡∥Xn∥op/n≤1+γ (Finite-fourth-moment upper bound for the largest sample-covariance eigenvalue, [F3]).

[F14]

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

1.1givenA2A3F1F2F3algebra

Put Pker⁡Xn=Ipn−Xn+Xn. For any fixed v∈Rpn, Ez0,n(z0,nTv)2=vTE[z0,nz0,nT]v=∥v∥22, so the stated prediction risk equals Eεn[∥β^n−βn∥22∣Xn]. By [F2], Pn:=Xn+Xn is an orthogonal projection. The Penrose equation XnXn+Xn=Xn shows ker⁡(Pn)=ker⁡(Xn): if Xnv=0, then Pnv=0, and if Pnv=0, then Xnv=XnXn+Xnv=XnPnv=0. Hence Ran⁡(Pn)=ker⁡(Xn)⊥=Ran⁡(XnT) by the right-singular-vector basis in [F3], so β^n−βn=−Pker⁡Xnβn+Xn+εn. Conditional on Xn, the cross term has expectation zero because E[εn∣Xn]=0. Its noise contribution is Eεn∥Xn+εn∥22=σ2tr⁡(Xn+(Xn+)T)=σ2tr⁡((XnTXn)+)=σ2ntr⁡(Sn+), where the middle equality follows by writing an SVD and the last uses (aB)+=a−1B+ for a>0. With xn=βn/r, this proves the exact identity Rn=r2xnTPker⁡Xnxn+σ2ntr⁡(Sn+).

1.2givenA1F6F7F9F10F11algebra

First identify the isotropic limit. By [F7], νγ=(1−γ)δ0+γμγ is a nonnegative probability measure: when γ>1, the negative coefficient cancels exactly the zero atom of γμγ. Thus u=−(1−γ)/z+γmγ(z) is its Stieltjes transform and has positive imaginary part, as does mγ(z). The scalar equation in [F7] rearranges to mγ=(1−γ−z−γzmγ)−1; [F9] therefore identifies Fγ,δ1=μγ. For any deterministic unit directions xn and fixed z∈C+, we claim E[xnT(Sn−zI)−1xn]→mγ(z). Indeed, every subsequence has a further subsequence (nj) with strictly increasing pnj, since pn→∞. In the transposed infinite array, prescribe Nd=nj and direction xnj at d=pnj, and at all other dimensions prescribe Nd=max⁡(1,⌊d/γ⌋) and the first coordinate vector. Then d/Nd→γ, so [F6] applies to this completed sequence. The bound ∣(t−z)−1∣≤1/Im⁡z and [F10] give the claimed expectation limit along (nj). The subsequence criterion gives it along the original sequence. This argument also applies to each fixed standardized bounded truncation of the entry law.

2.1givenA1F4F5F7F8F10F11step 1.1algebra

Suppose γ<1 and set a=(1−γ)2>0. By [F4], Xn has full column rank eventually and every eigenvalue of Sn is at least a/2 eventually. Thus the bias term in step 1.1 is zero and pn−1tr⁡(Sn+)=∫f(t)dμn(t) for the bounded continuous function f(t)=1/max⁡(t,a/2). By [F5] and [F8], this converges to Jγ=∫t−1dμγ(t), since the Marchenko–Pastur support is bounded below by a. For s>0, define mγ(−s)=∫(t+s)−1dμγ(t). The integrands are bounded by 1/a and converge pointwise to 1/t, so [F10] gives mγ(−s)→Jγ as s↓0. The fixed-point equation in [F7], initially stated for z∈C+, extends to z=−s<0 by dominated convergence in its defining integral; its denominator stays nonzero because 1+γmγ(−s)>0. Taking s↓0 yields 1+(γ−1)Jγ=0, hence Jγ=1/(1−γ). Since pn/n→γ, step 1.1 gives Rn→σ2γ/(1−γ).

2.2givenF12F14step 1.2algebra

For such a bounded unit-variance truncation, let Zn be its n×pn block and Sn(K)=ZnTZn/n. Apply the finite-column argument [F12] to ZnT, which has n independent columns and identity population. More explicitly, each leave-one-column resolvent quadratic-form increment Uj has E∣Uj∣4≤CKn−4 by the bounded-entry eighth-moment linear-form estimate; its column-filtration difference Dj satisfies E∣Dj∣4≤16E∣Uj∣4. The fourth-moment recursion in [F12], aj≤aj−1+CKaj−1/n2+CK/n4, gives aj≤CK′j2/n4, and hence E∣xnT((Sn(K)−zI)−1−E(Sn(K)−zI)−1)xn∣4≤CK′/n2. These are finite-matrix estimates, with no indexing or distinctness assumption on pn. By [F14], their tails are summable in the original index n. Together with step 1.2 this proves xnT(Sn(K)−zI)−1xn→mγ(z) almost surely for each fixed K,z.

3.1givenF3F11F13step 2.2algebra

To remove boundedness, put ξ(K)=ξ1{∣ξ∣≤K}−E[ξ1{∣ξ∣≤K}], σK2=E∣ξ(K)∣2→1, and τK2=E∣ξ−ξ(K)∣2→0. For sufficiently large integers K, form Zn from ξ(K)/σK and write Xn=σKZn+Dn. The residual entries are centered with finite fourth moment and variance τK2. Applying [F13] to the original, standardized and variance-normalized residual arrays yields, with L=1+γ, almost surely lim sup⁡∥Xn∥/n≤L, lim sup⁡∥Zn∥/n≤L, and lim sup⁡∥Dn∥/n≤LτK. If τK=0, countability of the array makes every residual entry zero almost surely. The Gram-matrix identity then gives lim sup⁡∥Sn−Sn(K)∥≤L2((1+σK)τK+∣σK2−1∣). For η=Im⁡z>0, the resolvent identity bounds the difference of their directional transforms by η−2∥Sn−Sn(K)∥. Intersect the probability-one events over integers K and let K→∞ in step 2.2 to obtain xnT(Sn−zI)−1xn→mγ(z) almost surely.

4.1givenF3F4F5F7F8F10step 1.1step 3.1algebra∎

Suppose γ>1 and set a=(γ−1)2>0. By [F4], Xn has full row rank eventually, Sn has exactly pn−n zero eigenvalues, and all positive eigenvalues are at least a/2 eventually. For each rational s>0, the spectral identity bounds the difference between the directional transforms at −s and −s+iη by η/s2, both for Sn and for μγ. Use step 3.1 at −s+i/k for all positive integers k, then let k→∞, to obtain xnT(Sn+sI)−1xn→mγ(−s) on one probability-one event for all rational s>0. The gap gives 0≤sxnT(Sn+sI)−1xn−xnTPker⁡Xnxn≤2s/a eventually. Since smγ(−s)→μγ({0})=1−1/γ by [F7] and [F10], letting rational s↓0 proves the required bias limit. Define h(0)=0 and, for t>0, h(t)=t−1min⁡(1,max⁡(0,4t/a−1)). This is bounded and continuous, equals zero at zero, and equals 1/t for t≥a/2. Therefore pn−1tr⁡(Sn+)=∫h(t)dμn(t)→Jγ+:=∫(0,∞)t−1dμγ(t) by [F5] and [F8]. [F7] gives mγ(−s)=(1−1/γ)/s+Jγ++o(1) as s↓0: subtract the zero atom and use [F10] by dominated convergence on the positive support, whose lower endpoint is a>0. To compute the constant term, write α=1−1/γ and substitute m=α/s+Jγ++o(1) into 1+(γ−1−s)m−γsm2=0, the fixed-point equation at z=−s (again obtained by dominated convergence from [F7]). The coefficient of s−1 vanishes because γα=γ−1; the constant term is 1−α−(γ−1)Jγ++o(1). It must vanish, so Jγ+=1/[γ(γ−1)]. Using pn/n→γ in step 1.1 proves Rn→r2(1−1/γ)+σ2/(γ−1).

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 z↓0 interchange.

Depends on

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