Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Gaussian sample covariance converges in operator norm when dimension is little-o of sample size

Statement

Assume AC. Let dk,nk≥1 be integer sequences with dk/nk→0. For each k, let Gk∈Rnk×dk have mutually independent N(0,1) entries. Then

∥GkTGknk−Idk∥op→k→∞P0.

Facts & Assumptions

Given: AC, integer sequences dk,nk≥1 with dk/nk→0, and matrices Gk with independent standard-normal entries.

[A1]

The finite-dimensional Gaussian construction assumes AC and gives standard-normal linear projections with the stated covariance (The Axiom of Choice, Multivariate normal law, including singular covariance).

[F1]

A standard normal has density (2π)−1/2e−x2/2 (Standard normal and normal laws).

[F2]

For a nonnegative random variable U and a>0, P(U≥a)≤E[U]/a (Markov's inequality for random variables).

[F3]

For a real symmetric matrix H, ∥H∥op=sup⁡∥x∥2=1∣xTHx∣ (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).

[F4]

The Euclidean inner product satisfies ∣xTy∣≤∥x∥2∥y∥2 (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

Proof

1.1A1F1F2givenalgebra

Fix k, abbreviate d=dk, n=nk, and take a fixed unit v∈Rd. The row products Zi=(Gkv)i are independent N(0,1) by [A1]. From [F1], EetZi2=(1−2t)−1/2 for t<1/2; applying [F2] at t=δ/(2(1+δ)) gives P(n−1∑iZi2≥1+δ)≤e−n[δ−log⁡(1+δ)]/2≤e−nδ2/8 for 0<δ≤1, since δ−log⁡(1+δ)=∫0δt/(1+t) dt≥δ2/4. For 0<δ<1, applying [F2] at u=δ/(2(1−δ)) gives P(n−1∑iZi2≤1−δ)≤e−n[−δ−log⁡(1−δ)]/2≤e−nδ2/4, since −δ−log⁡(1−δ)=∫0δt/(1−t) dt≥δ2/2; at δ=1 this event requires all Zi=0 and has probability zero. Thus P(∣vT(GkTGk/n−Id)v∣>δ)≤2e−nδ2/8.

2.1step 1.1choosealgebra

Fix 0<ε<1 and greedily add unit vectors at distance greater than 1/4 from those already chosen whenever possible. The open balls of radius 1/8 around a finite separated set are disjoint and lie in the radius-9/8 ball, so volume comparison gives ∣N∣(1/8)d≤(9/8)d; hence the process terminates within 9d choices and its maximal set is a 1/4-net. Applying step 1.1 with δ=ε/2 and taking a union bound yields P(max⁡v∈N∣vT(GkTGk/n−Id)v∣>ε/2)≤2exp⁡(dlog⁡9−nε2/32)→0 because d/n→0.

3.1F3F4step 2.1algebra∎

For any symmetric H, [F3] gives ∥H∥op=sup⁡∥x∥2=1∣xTHx∣. For each unit x, choose v∈N with ∥x−v∥2≤1/4. By [F4] and the operator-norm definition, ∣xTHx−vTHv∣=∣(x−v)THx+vTH(x−v)∣≤2(1/4)∥H∥op. Hence ∥H∥op≤2max⁡v∈N∣vTHv∣. On the complementary event in step 2.1, take H=GkTGk/n−Id to obtain ∥H∥op≤ε. Since this holds for every 0<ε<1, larger tolerances follow by monotonicity, and the claimed convergence in probability follows.

Depends on

Used by

Dependency tree · two levels

33 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