Alphabeta Math
Pipeline-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.

✓ 6 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 6 also cleared it.

PCA and eigengap stability

1 · Prerequisites

2 · Summary

Objective

For a specified parametric model and finite-second-moment vector, covariance PCA orders the eigenspaces of the centered covariance matrix; correlation PCA first divides each centered coordinate by its positive standard deviation. The page proves the leading-variance interpretation, clarifies what a repeated leading eigenvalue identifies, and establishes a local perturbation bound when the population leading eigenvalue is simple and separated by a positive gap.

For iid observations with finite fourth moment and fixed dimension, the sample-centered covariance converges at rate n−1/2 in Frobenius norm. Combining that result with the local gap bound gives consistency of the sample leading eigenspace when the population gap is positive. The bound is local to a simple leading eigenvalue; it is not a general Davis--Kahan result or finite-sample selected-component inference. All probability claims are conditional mathematical consequences of their stated model assumptions; they do not establish empirical model adequacy.

3 · Logical flowchart

4 · Definitions, theorems and proofs

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Local leading-eigenvector stability under a spectral gap

Statement

Let p≥2, let A∈Rp×p be symmetric, and order its eigenvalues as λ1(A)≥⋯≥λp(A). Suppose its leading eigenvalue is simple, with gap g:=λ1(A)−λ2(A)>0, and let v be a unit leading eigenvector. Let E∈Rp×p be symmetric, put ϵ:=∥E∥op, and assume 0≤ϵ<g/2. If v~ is any unit leading eigenvector of A+E, then the leading eigenvalue of A+E is simple and ∣λ1(A+E)−λ1(A)∣≤ϵ,sin⁡∠(v,v~):=1−(vTv~)2≤ϵg−ϵ. The bound concerns the line spanned by the eigenvector, so it is unchanged by either sign choice. It is a local eigengap bound; it does not assert a dimension-free Davis--Kahan theorem or a finite-sample inference procedure.

Facts & Assumptions

Given: A real symmetric p×p matrix A, p≥2, a simple leading eigenvalue with gap g>0, a unit leading eigenvector v, a real symmetric perturbation E with operator norm ϵ<g/2, and a unit leading eigenvector v~ of A+E.

[F2]

Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces: for a symmetric operator, the ordered eigenvalues are characterized by the minimum-over-subspaces and maximum-over-subspaces Rayleigh-quotient formulas.

[F3]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: ∥E∥op=max⁡∥x∥2=1∥Ex∥2.

Proof

technique · direct
1.1F2F3F4givenalgebra

For every unit vector x, [F3] and [F4] give ∣xTEx∣≤∥x∥2∥Ex∥2≤ϵ. The top-eigenvalue Rayleigh characterization in [F2] therefore gives λ1(A+E)≤λ1(A)+ϵ, while evaluating the perturbed Rayleigh quotient at v gives λ1(A+E)≥vT(A+E)v≥λ1(A)−ϵ. This proves the eigenvalue bound.

2.1F1F2F3step 1.1algebra

The minimum--maximum formula in [F2], with the (p−1)-dimensional subspace v⊥, gives λ2(A+E)≤max⁡∥x∥2=1, x⊥vxT(A+E)x≤λ2(A)+ϵ, since every such x has xTAx≤λ2(A). Step 1.1 gives λ1(A+E)≥λ1(A)−ϵ, hence λ1(A+E)−λ2(A+E)≥g−2ϵ>0; the perturbed leading eigenvalue is simple. Also λ1(A+E)−λ2(A)≥g−ϵ>0.

3.1F1F3step 2.1algebra∎

Let P=I−vvT, the orthogonal projection onto v⊥, and write λ~1=λ1(A+E). Projecting (A+E)v~=λ~1v~ onto v⊥ gives (λ~1I−A∣v⊥)Pv~=PEv~. In an orthonormal eigenbasis of A∣v⊥, every eigenvalue of λ~1I−A∣v⊥ is at least λ~1−λ2(A)≥g−ϵ by step 2.1. Therefore (g−ϵ)∥Pv~∥2≤∥PEv~∥2≤ϵ. Indeed, z=Pz+(I−P)z is an orthogonal decomposition, so ∥Pz∥2≤∥z∥2; then [F3] and ∥v~∥2=1 give the final inequality. Since ∥Pv~∥22=1−(vTv~)2, division by g−ϵ>0 proves the angle bound.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite-fourth-moment root-n consistency of sample-centered covariance

Statement

Fix p≥1 and a Borel probability law P on Rp with EP∥X∥24<∞, mean μ, and covariance matrix Σ. For each n≥1, let Xn,1,…,Xn,n be iid with law P; the probability space may depend on n. Put Xˉn:=1n∑i=1nXn,i,Σ^n∗:=1n∑i=1n(Xn,i−Xˉn)(Xn,i−Xˉn)T, the sample-centered covariance with divisor n from Sample covariance estimators and squared operator loss. For a matrix B, define ∥B∥F:=(∑j,k=1pBjk2)1/2. Then ∥Σ^n∗−Σ∥F=OP(n−1/2), meaning n∥Σ^n∗−Σ∥F=OP(1) in the bounded-in-probability sense of Stochastic order and convergence notation for finite-dimensional random vectors. No Gaussian assumption is needed.

Facts & Assumptions

Given: A fixed finite p≥1, a law P on Rp with EP∥X∥24<∞, and for each n an iid sample of size n from P.

[F1]

Identical distribution and IID families: iid means identically distributed and mutually independent, not only pairwise independent.

[F2]

Measurable coordinatewise functions preserve independence: measurable coordinatewise functions of an independent family remain independent.

[F3]

Covariance matrix of a finite-dimensional random vector and Sample covariance estimators and squared operator loss: Σjk=E[(Xj−μj)(Xk−μk)] and Σ^n∗=n−1∑i(Xn,i−Xˉn)(Xn,i−Xˉn)T.

[F4]

Variance and covariance identities for random variables and Independence forces covariance to vanish: covariance is bilinear on finite sums, and independent square-integrable real random variables have zero covariance.

[F5]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for integrable variables.

[F6]

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

[F7]

Stochastic order and convergence notation for finite-dimensional random vectors: Zn=OP(1) means, using the Euclidean norm of its finite vectorization, that for every η>0 some M>0 satisfies lim sup⁡nP(∣Zn∣>M)≤η.

Proof

technique · direct
1.1F1F2F3F8givenalgebra

Since t2≤1+t4 for t≥0, the fourth-moment assumption gives E∥X∥22<∞. Then ∥X∥2≤1+∥X∥22 gives E∥X∥2<∞, so the coordinatewise mean μ is finite. Put Yn,i=Xn,i−μ and Mn=n−1∑iYn,iYn,iT. By [F8], ∥Yn,1∥2≤∥Xn,1∥2+∥μ∥2. For a,b≥0, 2ab≤a2+b2 gives (a+b)2≤2(a2+b2) and then (a+b)4≤4(a2+b2)2≤8(a4+b4). Hence E∥Yn,1∥24≤8(E∥X∥24+∥μ∥24)<∞. For each j,k, the variables Wn,ijk:=Yn,i,jYn,i,k−Σjk are centered and square-integrable because (Yn,i,jYn,i,k)2≤∥Yn,i∥24. The map y↦yjyk−Σjk is Borel, so [F1] and [F2] make (Wn,ijk)i=1n independent.

2.1F1F2F3F4F5F6step 1.1algebra

Let Yˉn=n−1∑iYn,i. By [F1] and [F2], the coordinate variables Yn,i,j are independent across i. Thus [F4] makes their cross-covariances zero, and [F4] and [F5] give E∥Yˉn∥22=tr⁡(Σ)/n. Also ∥YˉnYˉnT∥F=∥Yˉn∥22 by expanding both squares. For every C>0, [F6] therefore gives P(n∥YˉnYˉnT∥F>C)≤tr⁡(Σ)/(Cn)→0. Thus this centered-mean term converges to zero in probability.

2.2F1F2F3F4F6F7step 1.1algebra

For fixed j,k, all Wn,ijk are the same Borel function of the iid vectors Yn,i, so they are iid: their independence follows from [F1] and [F2], and equal laws follow because a measurable map sends equal input laws to equal output laws. Thus [F4] gives E[(Mn,jk−Σjk)2]=n−2∑iVar⁡(Wn,ijk)=n−1Var⁡(Wn,1jk). Since E[Yn,1,jYn,1,k]=Σjk, Var⁡(Wn,1jk)=E[Yn,1,j2Yn,1,k2]−Σjk2≤E[Yn,1,j2Yn,1,k2]. Summing over j,k and using ∑j,kYn,1,j2Yn,1,k2=∥Yn,1∥24 yields E∥Mn−Σ∥F2≤n−1E∥Yn,1∥24. Consequently [F6] gives, for every C>0, P(n∥Mn−Σ∥F>C)≤E∥Yn,1∥24/C2, so n∥Mn−Σ∥F=OP(1) by [F7].

3.1F3F7F8step 2.2step 2.1algebra∎

Expanding the centered sum in [F3] gives Σ^n∗=Mn−YˉnYˉnT. For a matrix B, let vec⁡(B)∈Rp2 list its entries; by the definition of the Frobenius norm, ∥vec⁡(B)∥2=∥B∥F. Applying [F8] to these vectors gives ∥B+C∥F≤∥B∥F+∥C∥F, including the triangle inequality used below. For any η>0, choose C1 so the limsup tail of n∥Mn−Σ∥F above C1 is at most η/2 by step 2.2. For all sufficiently large n, the probability that n∥YˉnYˉnT∥F>1 is at most η/2 by step 2.1. The displayed Frobenius triangle inequality then bounds the limsup probability that n∥Σ^n∗−Σ∥F>C1+1 by η. This is n∥Σ^n∗−Σ∥F=OP(1) by [F7], which is the claimed root-n rate.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Covariance and correlation principal component analysis

Definition

Let E=((X,A),Θ,(Pθ)θ∈Θ) be a parametric statistical model, let p≥1, and let X:X→Rp be a measurable random vector with Eθ∥X∥22<∞ for every θ∈Θ. Write μθ=EθX and Σθ=Cov⁡θ(X) as in Covariance matrix of a finite-dimensional random vector. The map ψ(θ)=Σθ is the covariance-matrix estimand on this model (Estimands on a statistical model).

For each θ, list the real eigenvalues of Σθ in nonincreasing order and counting multiplicity. The covariance-PCA decomposition is the list of eigenspaces of Σθ, ordered by their distinct eigenvalues from largest to smallest. Equivalently, for each distinct eigenvalue λ, its component subspace is ker⁡(Σθ−λI). The top eigenspace is the leading principal subspace; when its eigenvalue is simple it is a line, and either unit representative has the same sign-free direction. The well-definedness result A finite second moment defines a positive semidefinite covariance matrix ensures these covariance matrices are finite, symmetric, and positive semidefinite. The real spectral theorem Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis ensures their eigenspaces span Rp.

If every coordinate variance (Σθ)jj is positive, put Dθ=diag⁡((Σθ)11,…,(Σθ)pp) and standardize the centered vector as Zθ=Dθ−1(X−μθ). Its covariance is the correlation matrix Rθ=Dθ−1ΣθDθ−1. Correlation-PCA is the ordered eigenspace decomposition of Rθ. Thus both population conventions center first; correlation-PCA additionally divides each coordinate by its positive population standard deviation.

For an iid sample X1,…,Xn, sample covariance-PCA uses the eigenspaces of the sample-centered covariance Σ^n∗=n−1∑i(Xi−Xˉ)(Xi−Xˉ)T from Sample covariance estimators and squared operator loss, where Xˉ=n−1∑iXi. Sample correlation-PCA standardizes by the positive sample standard deviations when all sample coordinate variances are positive. The divisor convention here is n, not n−1. The sample covariance matrix is a statistic, and it is an estimator of the covariance target in its sample experiment, as proved in Sample-centered covariance is a measurable statistic and estimator.

This definition specifies mathematical matrices under an assumed law. The scientific model contract distinguishes that assumption from evidence that an empirical law is adequate; PCA itself makes no such adequacy claim (Scientific statistical model contracts).

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Sample-centered covariance is a measurable statistic and estimator

Statement

Let (Pθ)θ∈Θ be a family of Borel probability laws on Rp with Eθ∥X∥22<∞. For each n≥1, observe an iid sample X1,…,Xn with common law Pθ and sample law Pθ⊗n on the Borel data space (Rp)n. Put Σθ=Cov⁡θ(X) and let ψ(θ)=Σθ be the covariance-matrix estimand with target the Borel space Sp of real symmetric p×p matrices. The sample-centered covariance map Tn(x1,…,xn):=1n∑i=1n(xi−xˉ)(xi−xˉ)T,xˉ=1n∑i=1nxi, is a statistic with target the Borel space Sp, and hence is an estimator of ψ in the sense of Statistics and estimators. This statement asserts measurability and target type only; it asserts no unbiasedness or consistency.

Facts & Assumptions

Given: A finite p≥1, n≥1, a family of Borel laws (Pθ)θ∈Θ on Rp with finite second moments, and an iid sample experiment on Borel sample space (Rp)n.

[F1]

Statistical experiments and Parametric statistical models: the sample experiment is a parameter-indexed family of probability laws on its measurable data space.

[F2]

Identical distribution and IID families: under each Pθ⊗n, the sample coordinates are iid with common law Pθ.

[F3]
[F4]

Estimands on a statistical model: ψ(θ)=Σθ is the stated target function on the parameter set.

[F5]

Sample covariance estimators and squared operator loss: the sample-centered covariance is n−1∑i(Xi−Xˉ)(Xi−Xˉ)T.

[F6]

Statistics and estimators: a statistic is a measurable map from the data space to a measurable target, and it is an estimator when its target space is that of the stated estimand.

[F7]

A continuous map has Borel preimages of Borel sets: a continuous map between topological spaces has Borel preimages of Borel sets.

Proof

technique · direct
1.1F5F7givenalgebra

Regard Sp as the subspace of Rp2 with its Borel sigma-algebra. Each matrix coordinate of Tn is a polynomial in the np real sample coordinates, so Tn:(Rp)n→Rp2 is continuous. Its values are symmetric because every outer product is symmetric, hence it is also continuous as a map into the subspace Sp. By [F7] it is Borel measurable.

2.1F1F2F3F4F5F6step 1.1∎

By [F1] and [F2], the sample experiment is the stated parameter-indexed iid experiment; [F3] places Σθ in Sp, and [F4] identifies it as the estimand target. The formula in [F5] is exactly Tn. Thus [F6] and step 1.1 make Tn a statistic and, since its target space is the same Sp, an estimator of ψ.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The leading PCA eigenspace maximizes projected variance

Statement

Fix a parameter θ in the model of Covariance and correlation principal component analysis, and let X have finite second moment and covariance matrix Σθ. For every unit vector a∈Rp, Var⁡θ(aTX)=aTΣθa. Consequently, the maximum projected variance is the largest eigenvalue λ1(Σθ), and its maximizing unit vectors are exactly the unit vectors in the leading eigenspace. When all coordinate variances are positive, the same assertion applied to Dθ−1(X−μθ) says that correlation-PCA maximizes the variance of linear scores of the standardized coordinates.

Facts & Assumptions

Given: A parameter θ, a real random vector X∈Rp with finite second moment under Pθ, and a unit vector a∈Rp. For the correlation statement, assume every diagonal entry of Σθ is positive.

[F1]

Covariance and correlation principal component analysis: Σθ is the covariance matrix used for covariance-PCA, and Dθ−1(X−μθ) is the population-standardized vector used for correlation-PCA.

[F2]

Covariance matrix of a finite-dimensional random vector: the entries of Σθ are Eθ[(Xj−μθ,j)(Xk−μθ,k)].

[F3]

Moments, variance, and covariance on a probability space: variance is the expectation of the centered square.

[F4]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear on integrable finite sums.

Proof

technique · direct
1.1F2F3F4givenalgebra

Put Y=X−μθ. Finite second moments make every coordinate in the finite sums below integrable. Expanding the centered scalar square and using [F4] gives Var⁡θ(aTX)=Eθ[(aTY)2]=∑j,kajakEθ[YjYk]=aTΣθa by [F2] and [F3].

2.1F1F5step 1.1algebra

By [F5], write a=∑j=1pcjej in an orthonormal eigenbasis of Σθ with eigenvalues λ1≥⋯≥λp and ∑jcj2=1. Then aTΣθa=∑jλjcj2≤λ1∑jcj2=λ1. The difference is λ1−aTΣθa=∑j(λ1−λj)cj2, a sum of nonnegative terms, so equality holds exactly when cj=0 for every λj<λ1. This is exactly the unit sphere in the leading eigenspace. Step 1.1 identifies this Rayleigh quotient with projected variance, proving the covariance-PCA assertion.

3.1F1step 1.1step 2.1∎

If all coordinate variances are positive, [F1] defines Zθ=Dθ−1(X−μθ) with covariance Rθ=Dθ−1ΣθDθ−1. The hypotheses of steps 1.1--2.1 hold with Zθ and Rθ in place of X and Σθ, so the leading correlation-PCA eigenspace maximizes the variance of unit linear scores of Zθ.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A repeated leading PCA eigenvalue identifies a subspace, not a vector

Statement

Let Σ be a covariance matrix in the PCA definition of Covariance and correlation principal component analysis, with ordered eigenvalues λ1≥λ2≥⋯. If λ1=λ2, then the leading eigenspace E1=ker⁡(Σ−λ1I) is a uniquely specified subspace of dimension at least two. Every unit vector in E1 is a leading principal direction, so the covariance matrix determines this subspace but does not single out a unit vector in it.

Facts & Assumptions

Given: A real symmetric covariance matrix Σ∈Rp×p with p≥2 and λ1=λ2.

[F1]

Covariance and correlation principal component analysis: covariance-PCA uses the ordered eigenspaces of the symmetric covariance matrix; a component direction is a unit vector in its eigenspace.

[F2]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: Σ has an orthonormal eigenbasis, so the eigenspace dimension of an eigenvalue is its multiplicity in the ordered list.

[F3]

The leading PCA eigenspace maximizes projected variance: the unit leading directions are exactly the unit vectors in the leading eigenspace.

Proof

technique · direct
1.1F1F2givenalgebra

In the orthonormal eigenbasis supplied by [F2], the equality λ1=λ2 gives at least two linearly independent eigenvectors with eigenvalue λ1. The full eigenspace E1=ker⁡(Σ−λ1I) contains these vectors, is specified by Σ itself, and therefore has dimension at least two.

2.1F1F3step 1.1algebra∎

Every unit vector in E1 is a leading principal direction by [F3]. Because a space of dimension at least two contains noncollinear unit vectors, there is no single unit vector selected by Σ alone. The canonical object is the whole leading eigenspace E1.

CorollaryStatement: AI-generatedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A simple population eigengap gives root-n sample PCA eigenspace consistency

Statement

Let Xn,1,…,Xn,n be iid copies of a fixed X∈Rp with E∥X∥24<∞, where p≥2, and let Σ=Cov⁡(X) have a simple leading eigenvalue with gap g=λ1(Σ)−λ2(Σ)>0. Let Σ^n∗ be the sample-centered covariance with divisor n, and put ϵn=∥Σ^n∗−Σ∥op and Gn={ϵn<g/2}. Then P(Gn)→1. On Gn the sample leading eigenspace is a line; define Zn to be the sine of its angle to the population leading line and set Zn=0 off Gn. Then Zn=OP(n−1/2), hence Zn→0 in probability. In particular, the sample leading eigenspace is a unique line with probability tending to one. The angle is line-based and sign-invariant. This is a local eigenspace-consistency result, not finite-sample inference for a selected component.

Facts & Assumptions

Given: Fixed p≥2, iid samples from a law with finite fourth moment, the population covariance Σ, its simple leading eigenvalue gap g>0, and sample-centered covariance Σ^n∗ with divisor n.

[F1]

Finite-fourth-moment root-n consistency of sample-centered covariance: ∥Σ^n∗−Σ∥F=OP(n−1/2).

[F2]

Local leading-eigenvector stability under a spectral gap: if a symmetric perturbation has operator norm ϵ<g/2, the perturbed leading eigenvalue remains simple and its leading line has sine-angle at most ϵ/(g−ϵ) from the population line.

[F3]

Sample-centered covariance is a measurable statistic and estimator: the sample covariance is a measurable matrix-valued statistic.

[F4]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: ∥B∥op=max⁡∥u∥2=1∥Bu∥2.

[F6]

Stochastic order and convergence notation for finite-dimensional random vectors: OP(1) means bounded in probability; thus an OP(n−1/2) quantity becomes OP(1) after multiplication by n.

Proof

technique · direct
1.1F1F3F4F5F6givenalgebra

For every p×p matrix B and unit vector u, applying Cauchy--Schwarz to each row gives ∥Bu∥22=∑j(∑kBjkuk)2≤∑j,kBjk2=∥B∥F2. Hence [F4] gives ∥B∥op≤∥B∥F. With ϵn=∥Σ^n∗−Σ∥op, [F1] implies ϵn=OP(n−1/2) by [F6]. To see P(Gn)→1, fix η>0 and choose C so the limsup tail of n∥Σ^n∗−Σ∥F above C is at most η. For all sufficiently large n, C/n<g/2, and then Gnc⊆{n∥Σ^n∗−Σ∥F>C}. Thus lim sup⁡nP(Gnc)≤η, so the claimed probability tends to one.

2.1F1F2F3F6step 1.1algebra

On Gn, [F2] says that the sample leading eigenvalue is simple and Zn≤ϵn/(g−ϵn)≤2ϵn/g. The sample matrix is measurable by [F3]; its operator-norm distance from Σ is therefore measurable. The leading line varies continuously on the set of matrices with a simple top eigenvalue: applying [F2] with any such matrix as the base and a perturbation tending to zero makes the sign-free line angle tend to zero. Hence Zn, extended by zero off the Borel event Gn, is measurable. Pointwise, nZn≤(2/g)nϵn, so [F1] and [F6] imply nZn=OP(1) and therefore Zn=OP(n−1/2).

3.1F6step 2.1algebra∎

Fix δ>0 and η>0. Since [F6] defines nZn=OP(1), choose C so its limsup tail above C is at most η. For all sufficiently large n, C/n<δ, and then {Zn>δ}⊆{nZn>C}. Hence lim sup⁡nP(Zn>δ)≤η. Since η was arbitrary, Zn→0 in probability.

5 · Examples, counterexamples and false statements

None yet.

Sources