Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge 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.

Oracle-truncated covariance and vector concentration under finite matrix variance

Statement

Let Z1,…,Zm be independent copies of a centered random vector Z∈Rp, p,m≥1, with nonzero covariance Σ=EZZT and finite fourth moment. Write T=tr⁡Σ,σ02=∥E[∥Z∥22ZZT]∥op. For β>1, σ≥σ0, and t=β/m, set θ=tσ,R=1θ,w(z)=min⁡{1,R∥z∥22},w(0)=1, S=1m∑i=1mw(Zi)ZiZiT,V=1m∑i=1mw(Zi)Zi. Then there are events ES,EV such that P(ESc)≤pe−β,P(EVc)≤p+12e−β, and on the respective events ∥S−Σ∥op≤(2+log⁡2β)σt<2710σt, ∥V∥2≤σ0θ+2Tt+8t3θ. The same S also has the sharper-radius, larger-failure alternative P{∥S−Σ∥op>(2+23+14)σt}≤2pe−β. No independence between these events and a statistic formed from the same sample is asserted or needed.

Facts & Assumptions

Given: The independent vectors and finite-moment assumptions in the statement. Covariance and matrix variance have the meanings in Covariance matrix of a finite-dimensional random vector and Matrix variance for covariance estimation. The fourth moment makes every matrix and scalar expectation used below finite.

[F1]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis supplies spectral calculus for real symmetric matrices. For A=zzT, A2=∥z∥22zzT, and the sole possibly nonzero eigenvalue of A is ∥z∥22. Semidefinite order is tested on quadratic forms and is preserved by expectation.

[F2]

Bounded independent matrix Bernstein bound from the trace exponential: for independent centered Hermitian q×q matrices Bi with ∥Bi∥≤R0 and ∥EBi2∥≤v, one has Etr⁡exp⁡(s∑iBi)≤qexp⁡(ms2v/[2(1−sR0/3)]) for 0<s<3/R0. It also proves the associated fixed-parameter one-sided Chernoff bound and the explicit one-sided radius 2mvb+2R0b/3 with failure qe−b; the two-sided failure is 2qe−b.

[F3]

Cauchy–Schwarz in Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, applied to square-integrable scalar random variables with inner product E(UW), gives ∣E(UW)∣2≤EU2EW2. This expectation inner product may be read on the quotient by almost-sure equality. Independence is as in Independent random elements and is preserved under deterministic measurable transformations, by taking preimages of the defining independent events.

Proof

technique · direct
1.1givenF1F3algebra

Put A=ZZT and Aθ=w(Z)ZZT. The weight is a Borel function, including its declared value at zero, so all transformations used here preserve the independence of the samples by [F3]. The rank-one spectral calculus gives 0⪯Aθ⪯RI and Aθ2⪯A2. For a scalar x≥0, (x−R)+≤x2/(4R): the inequality is immediate for x≤R, and for x≥R it is equivalent to (x−2R)2≥0. Applying it to the eigenvalues of A proves 0⪯A−Aθ⪯θA2/4. Therefore 0⪯Σ−EAθ⪯θEA2/4 and ∥Σ−EAθ∥op≤θσ02/4. Nonzero covariance also implies σ0>0: a positive variance in some unit direction forces E[∥Z∥2⟨Z,v⟩2]≥E⟨Z,v⟩4>0. Thus the displayed thresholds are well-defined.

1.2givenF1F3algebra

Put Y=w(Z)Z. Its norm is at most 1/θ: for ∥Z∥≤R use ∥Y∥≤R, and otherwise use ∥Y∥=R/∥Z∥≤R. Since EZ=0, EY=−E[(1−w(Z))Z]. For a unit vector v, apply [F3] to U=∥Z∥⟨Z,v⟩ and W=(1−w(Z))/∥Z∥, assigning W=0 at zero. Then EU2≤σ02 by matrix variance, and W2≤θ pointwise: it vanishes on ∥Z∥2≤R, and elsewhere is at most 1/∥Z∥2≤1/R. Thus ∣⟨EY,v⟩∣≤σ0θ. Taking the Euclidean dual supremum proves ∥EY∥≤σ0θ.

2.1F1step 1.1algebra

Set Bi=Aθ,i−EAθ. Since both matrices subtracted lie between 0 and RI, −RI⪯Bi⪯RI, whence ∥Bi∥op≤R. Expanding the square and taking expectations, without any commutativity requirement, gives EBi2=EAθ2−(EAθ)2⪯EA2. The left side is positive semidefinite; hence its norm is at most σ02. The matrices Bi are independent and centered.

2.2F1step 1.1step 1.2constructalgebra

For a vector y∈Rp define its symmetric dilation D(y)=(0yTy0) of size p+1. Its square is diag⁡(∥y∥22,yyT); its nonzero eigenvalues when y≠0 are ∥y∥2 and −∥y∥2, as is checked on the span of (1,0) and (0,y/∥y∥). It vanishes on the orthogonal complement, so λmax⁡(D(y))=∥D(y)∥op=∥y∥2, also at zero. For Ci=D(Yi−EY), step 1.2 gives ∥Ci∥≤2/θ. The square identity gives ECi2=diag⁡(E∥Y−EY∥2,E[(Y−EY)(Y−EY)T]). Its norm is at most E∥Y−EY∥2≤E∥Y∥2≤E∥Z∥2=T; for the lower block, test a unit vector and bound its squared scalar projection by the squared norm. The Ci are independent centered symmetric matrices.

3.1F2step 1.1step 2.1choosealgebra

Let b=β+log⁡2 and use [F2] with the fixed Chernoff parameter s=θ; it is admissible since θR=1<3. Its exponent bound is 3mθ2σ02/4. Consequently, for u=3mθσ02/4+b/θ, the one-sided failure is at most pe−b; apply the same statement to −Bi and take a union to obtain P{∥S−EAθ∥op>3θσ02/4+b/(mθ)}≤2pe−b=pe−β. Adding the bias from step 1.1 and using σ0≤σ yields θσ02+b/(mθ)≤(2+(log⁡2)/β)σt. Define ES by this bound. Finally log⁡2<7/10 since the first four nonnegative terms of e7/10 sum to 1+7/10+49/200+343/6000>2; since β>1, the claimed strict bound by 27/10 follows.

3.2F2step 1.1step 2.1algebra

For the alternative radius, apply the two-sided explicit form in [F2] to the same Bi, now with confidence parameter β. After division by m its radius is 2σ02β/m+2Rβ/(3m). Adding the bias θσ02/4 and substituting R=1/θ, θ=t/σ, and σ0≤σ, gives the displayed radius (2+2/3+1/4)σt with failure at most 2pe−β.

4.1F2step 3.1step 3.2step 1.2step 2.2algebra∎

Apply the one-sided explicit Bernstein bound [F2] to Ci with dimension p+1, bound R0=2/θ, variance bound v=T and confidence b=β+log⁡2. Since λmax⁡(∑iCi)=∥∑i(Yi−EY)∥, division by m gives ∥V−EY∥≤2Tb/m+4b/(3mθ) outside probability (p+1)e−b=(p+1)e−β/2. Because log⁡2<1<β, one has b<2β, and the radius is at most 2Tt+8t/(3θ). Adding step 1.2 proves the stated vector bound and defines EV. The two events were obtained from the original independent observations without conditioning on any other statistic. Together with steps 3.1 and 3.2 this proves every asserted conclusion.

Depends on

Used by

Dependency tree · two levels

28 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