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.

Basic finite covariance matrix identities for robust mean bounds

Statement

Let d≥1 and let X be a Borel random vector in Rd with E∥X∥22<∞. Define μ=EX coordinatewise, Y=X−μ, and the finite matrix Σ by Σrs=E[YrYs] for 1≤r,s≤d. Then Σ is symmetric positive semidefinite,

tr⁡Σ=E∥X−μ∥22,

and 0≤λmax⁡(Σ)≤tr⁡Σ. If tr⁡Σ=0, then X=μ almost surely.

Facts & Assumptions

Given: A Borel random vector X in Rd, d≥1, with finite second moment.

[F1]

The Borel random-vector hypothesis means inverse images of Borel sets are measurable; composing with the continuous coordinate and norm-square maps preserves this property because inverse images of open sets under continuous maps are open. Expectation is integration against the probability measure and variance is the second centered moment (Random elements and real random variables, Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space).

[F2]

Expectation is linear for integrable variables (Linearity, monotonicity, and the modulus bound for expectation). The pointwise inequalities ∣x∣≤1+x2 and 2∣xy∣≤x2+y2 give the integrability bounds used below.

[F3]

The Euclidean inner product is ⟨x,y⟩=∑r=1dxryr and ∥x∥22=⟨x,x⟩ (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F4]

A nonnegative measurable function with integral zero vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[F5]

Cauchy–Schwarz holds in the Euclidean inner product, and a symmetric matrix in the standard orthonormal basis represents a self-adjoint endomorphism whose largest eigenvalue is the maximum of its Rayleigh quotient RΣ(v)=⟨Σv,v⟩/⟨v,v⟩ over nonzero v (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose, The Rayleigh quotient of a nonzero vector for a self-adjoint endomorphism, The smallest and largest eigenvalues of a self-adjoint endomorphism are the minimum and maximum Rayleigh quotients).

Proof

technique · direct

Given: A Borel random vector X in Rd, d≥1, with E∥X∥22<∞.

1.1F1F3givenalgebra

Each coordinate Xr is square-integrable because ∣Xr∣≤∥X∥2, and is integrable since ∣Xr∣≤1+Xr2. Hence each μr is finite. Also E[Yr2]≤2E[Xr2]+2μr2<∞. For every r,s, the pointwise inequality 2∣YrYs∣≤Yr2+Ys2 gives E∣YrYs∣<∞, so every entry of Σ exists. Since YrYs=YsYr, Σ is symmetric.

2.1F2F3step 1.1algebra

For v∈Rd, linearity of expectation [F2] and the finite-sum definition [F3] give vTΣv=E[⟨v,Y⟩2]≥0, so Σ is positive semidefinite. Summing its diagonal entries and using linearity again yields tr⁡Σ=E[∑r=1dYr2]=E∥Y∥22.

3.1F3F5step 2.1algebra

For nonzero v, [F5] identifies λmax⁡(Σ) with the maximum Rayleigh quotient; pointwise Euclidean Cauchy–Schwarz gives RΣ(v)=E[⟨v,Y⟩2]/∥v∥22≤E∥Y∥22=tr⁡Σ. Positive semidefiniteness from step 2.1 also gives RΣ(v)≥0, so maximizing proves 0≤λmax⁡(Σ)≤tr⁡Σ.

4.1F1F4step 2.1∎

If tr⁡Σ=0, step 2.1 gives E∥Y∥22=0. By [F1], the continuous polynomial x↦∥x−μ∥22 composed with the Borel map X is measurable, so [F4] applies and gives ∥Y∥22=0 almost surely. The Euclidean norm is positive definite, hence Y=0 almost surely and X=μ almost surely.

Depends on

Used by

Dependency tree · two levels

49 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