Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Dense sample covariance concentration for sub-Gaussian vectors

Statement

Let Z1,…,Zn be iid centered random vectors in Rp with covariance Σ and finite second moments. Suppose each Zi is sub-Gaussian with vector proxy L=∥Σ∥op, as in Sub-Gaussian variables and vectors, and sub-exponential variables. For δ∈(0,1) put r=p+log⁡(4/δ)n. For both the known-mean estimator Σ^0=n−1∑iZiZiT and the sample-centered estimator Σ^∗=n−1∑i(Zi−Zˉ)(Zi−Zˉ)T, where Zˉ=n−1∑iZi, P(∥Σ^0−Σ∥op≤CL(r+r))≥1−δ,P(∥Σ^∗−Σ∥op≤CL(r+r))≥1−δ for a universal constant C (the proof permits C=176). Since p≥1, this is equivalent up to a universal factor to the displayed dense rate with p+log⁡(1/δ). If L=0, both estimators equal Σ=0 almost surely.

Facts & Assumptions

Given: Iid centered Zi∈Rp with covariance Σ, sub-Gaussian proxy L=∥Σ∥op, integers n,p≥1, and δ∈(0,1).

[F1]

The known-mean and sample-centered covariance estimators are as defined in Sample covariance estimators and squared operator loss.

[F2]

Each unit-direction projection of Zi is centered sub-Gaussian with proxy L (Sub-Gaussian variables and vectors, and sub-exponential variables).

[F3]

The centered product of two such projections is sub-exponential with parameters (256L2,16L) (Products of sub-Gaussian coordinates are sub-exponential).

[F4]

For independent centered sub-exponential variables with variance proxies summing to v and maximum scale b, the two-sided sum tail is 2exp⁡[−12min⁡(t2/v,t/b)] (Sub-exponential concentration for independent sums).

[F5]

A 1/4-net of the sphere has at most 9p points (Finite epsilon nets of the Euclidean sphere), and its quadratic forms control a symmetric operator norm by a factor 2 (A sphere net controls the operator norm of a symmetric matrix).

[F6]

The finite-vector sub-Gaussian net bound controls ∥W∥2 from the sub-Gaussian projections of W (Finite sub-Gaussian maxima and epsilon-net reduction).

[F7]

For independent real random variables, expectations of products of nonnegative measurable functions factor (Expectations factor over finite products of independent random variables).

[F8]

Probability is countably subadditive (Basic identities for a probability measure).

[F9]

The covariance matrix is Σ=E[ZZT], hence symmetric, and vTΣv=E[(vTZ)2]≥0 (Sample covariance estimators and squared operator loss).

[F10]

The sample vectors are iid and hence mutually independent; applying the common Borel projection and square-minus-mean map preserves independence and identical distribution, so the centered products Wi are iid (Identical distribution and IID families, Independent random elements, Measurable coordinatewise functions preserve independence).

[F11]

The operator norm is the maximum of ∥Av∥2 over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F12]

The Euclidean inner product satisfies ∣⟨u,v⟩∣≤∥u∥2∥v∥2 (The Cauchy-Schwarz inequality for finite sums).

Proof

1.1F1F2F3F6F8F9F10given

If L=0, [F2] and [F6] imply P(∥Zi∥2≥1/m)=0 for each i and positive integer m. By [F8], the countable union over i,m shows that every Zi=0 almost surely; then [F9] gives Σ=0, and both estimators are exact. Assume L>0. Fix a unit vector u and set Wi=(uTZi)2−E[(uTZi)2]. By [F2]–[F3], each Wi is centered sub-exponential with parameters (256L2,16L); [F10] gives that these variables are iid across i.

1.2F2F6F7F10givenalgebra

By [F10] the sample vectors are independent, and [F7] gives, for every u∈Rp and λ∈R, Eeλ⟨u,Zˉ⟩=∏i=1nEe(λ/n)⟨u,Zi⟩≤eLλ2∥u∥22/(2n). Thus Zˉ is centered sub-Gaussian with proxy L/n. Applying the vector clause of [F6] with a 1/2-net at s=4Lr gives P(∥Zˉ∥22>16Lr)≤2⋅5pe−2(p+x)≤δ/2, since r=(p+x)/n and x=log⁡(4/δ).

2.1F1F4step 1.1algebra

Applying [F4] to ∑iWi gives, for every t>0, P(∣uT(Σ^0−Σ)u∣>t)≤2exp⁡[−12min⁡{nt2256L2,nt16L}]. This is uniform over unit u.

3.1F5step 2.1algebra

Take a 1/4-net with at most 9p points and put x=log⁡(4/δ), so r=(p+x)/n. With C0=80 and t=C0L(r+r), the exponent in step 2.1 is at least 12min⁡{802/256,80/16}(p+x)=52(p+x)≥plog⁡9+x. A union bound gives probability at least 1−δ/2 that every net quadratic form is at most t in absolute value.

4.1F5F9step 3.1algebra

By [F9], Σ^0−Σ is symmetric. On the event in step 3.1, [F5] gives ∥Σ^0−Σ∥op≤2t=160L(r+r). This proves the first estimate.

5.1F1F8F11F12step 4.1step 1.2step 3.1algebra∎

Expanding [F1] gives Σ^∗=Σ^0−ZˉZˉT. For w≠0 and unit v, [F12] gives ∥wwTv∥2=∥w∥2∣⟨w,v⟩∣≤∥w∥22, with equality at v=w/∥w∥2; if w=0, both sides vanish. Thus [F11] gives ∥ZˉZˉT∥op=∥Zˉ∥22. For vectors a,b, [F12] and ∥a+b∥22=∥a∥22+2⟨a,b⟩+∥b∥22 give ∥a+b∥2≤∥a∥2+∥b∥2; applying this inside the maximum in [F11] gives ∥A+B∥op≤∥A∥op+∥B∥op. Combining the probability-1−δ/2 events from steps 1.2 and 3.1, their intersection has probability at least 1−δ by [F8], and the resulting error is at most 160L(r+r)+16Lr≤176L(r+r).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

77 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