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.

✓ 3 results · all verified · 3 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 3 also cleared it.

PCA and eigengap stability — Examples

1 · Prerequisites

2 · Summary

Objective

These finite examples show why a PCA direction may fail to be uniquely specified at a tie, why a simple eigenvector still has a sign ambiguity, and why covariance-PCA can change when measurement scales change. The final counterexample lets the eigengap shrink with the perturbation: the matrix perturbation tends to zero while the leading line retains a fixed nonzero rotation. It illustrates why the local bound depends on the gap.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A vanishing eigengap allows a fixed eigenvector rotation

Statement refuted

The following uniform claim is false: among all real symmetric matrices with a simple leading eigenvalue, an operator-norm perturbation tending to zero forces the leading eigenvector line to rotate by an angle tending uniformly to zero, without any lower bound on the eigengap.

Witness construction

For every δ>0, take Aδ=(1+δ001),Eδ=(0δ/4δ/40). The unperturbed leading line is span⁡(e1) and the gap is gδ=δ. The perturbation norm is δ/4→0, but the perturbed leading line makes the fixed positive angle arctan⁡(5−2) with span⁡(e1), independent of δ. Thus an absolute perturbation bound alone cannot give uniform eigenspace stability as the gap vanishes.

Facts & Assumptions

Given: A real parameter δ>0, the matrices Aδ,Eδ above, and the false uniform claim stated in ## Statement refuted.

[F1]

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

[F2]

Local leading-eigenvector stability under a spectral gap: when ϵ<g/2, the sign-free sine-angle is bounded by ϵ/(g−ϵ).

Refutation

technique · direct
1.1F1givenalgebra

The eigenvalues of Aδ are 1+δ and 1, so its leading line is span⁡(e1) and its gap is gδ=δ. Also EδTEδ=(δ/4)2I2, whence [F1] gives ∥Eδ∥op=δ/4.

1.2givenalgebra

The characteristic polynomial of Aδ+Eδ=(1+δδ/4δ/41) has roots 1+δ/2±(δ/2)2+(δ/4)2=1+δ/2±5 δ/4, so the larger root is the leading eigenvalue. If (x,y)T is its leading eigenvector, the first row of the eigenvalue equation gives y/x=4(λ1(Aδ+Eδ)−1−δ)/δ=5−2. Thus its line makes angle arctan⁡(5−2)>0 with span⁡(e1), independently of δ.

2.1F2step 1.1step 1.2∎

Letting δ↓0 makes ∥Eδ∥op→0 by step 1.1 while the angle in step 1.2 stays fixed and positive, contradicting the proposed uniform claim. Here ϵδ=gδ/4<gδ/2, so [F2] still applies; its gap-dependent bound is consistent with the example.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Rescaling can change covariance-PCA directions

Example

Let (U,V) be uniform on {−1,1}2 and set X=(3U,U+3V)T. Then Cov⁡(X)=(9334),R=D−1Cov⁡(X)D−1=(11/21/21). The leading correlation-PCA line is span⁡(1,1), while this line is not an eigenline of the covariance matrix. The two PCA conventions therefore give different leading directions for the same data after standardization.

Facts & Assumptions

Given: A four-point probability space Ω={−1,1}2 with probability 1/4 at each point, U(u,v)=u, V(u,v)=v, and X=(3U,U+3V)T.

[F1]

Covariance matrix of a finite-dimensional random vector: covariance entries are expectations of centered coordinate products.

[F2]

Covariance and correlation principal component analysis: correlation-PCA divides centered coordinates by their positive standard deviations.

[F3]

The leading PCA eigenspace maximizes projected variance: the leading eigenspace is the maximizing line for projected variance.

Verification

technique · direct
1.1F1givenalgebra

On this four-point space, EU=EV=0, EU2=EV2=1, and E[UV]=0 because two points have UV=1 and two have UV=−1. Thus EX=0, Var⁡(3U)=9, Var⁡(U+3V)=1+3=4, and Cov⁡(3U,U+3V)=3. This gives the stated covariance matrix.

2.1F2step 1.1algebra

The positive standard-deviation matrix is D=diag⁡(3,2), so [F2] gives D−1Cov⁡(X)D−1=(11/21/21). This matrix sends (1,1)T to 32(1,1)T and (1,−1)T to 12(1,−1)T; hence its leading line is span⁡(1,1).

3.1F1F3step 1.1step 2.1algebra∎

The covariance matrix has characteristic roots (13±61)/2, so its leading eigenspace is a line. It sends (1,1)T to (12,7)T, which is not a scalar multiple of (1,1)T. Thus the correlation-PCA leading line is not the covariance-PCA leading line, and [F3] identifies each as the maximizing line for its own projected variance.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Tied PCA eigenvalues and sign ambiguity

Example

The covariance matrix Σ1=I2 has a repeated leading eigenvalue. Every unit direction in R2 (and its line) maximizes projected variance, but the leading PCA subspace defined by the full leading eigenspace is R2. In contrast, Σ2=diag⁡(2,1) has the unique leading line span⁡(e1), but both e1 and −e1 are unit leading eigenvectors. Thus a tie makes the defined leading subspace multidimensional, while the sign ambiguity remains even when that subspace is a line.

Facts & Assumptions

Given: The two real symmetric covariance matrices Σ1=I2 and Σ2=diag⁡(2,1).

[F1]

Covariance and correlation principal component analysis: PCA uses ordered eigenspaces of the covariance matrix, and a unit eigenvector represents a direction only up to its sign.

[F2]

A repeated leading PCA eigenvalue identifies a subspace, not a vector: when the top two eigenvalues are equal, the leading eigenspace has dimension at least two and is not a distinguished unit vector.

[F4]

The leading PCA eigenspace maximizes projected variance: for a finite-second-moment random vector with covariance Σ and a unit vector a, the projected variance is Var⁡(aTX)=aTΣa.

Verification

technique · direct
1.1F1F2F4givenalgebra

The eigenvalues of Σ1=I2 are 1,1, and I2−I2 is the zero matrix, so the defined leading eigenspace is E1=ker⁡(I2−I2)=R2. For any finite-second-moment random vector X with covariance Σ1 and every unit vector a∈R2, [F4] gives Var⁡(aTX)=aTI2a=∥a∥22=1. Thus every unit vector in E1 attains the same projected variance 1 and maximizes it; each of its lines is a variance-maximizing direction, while the defined leading PCA subspace remains all of R2.

2.1F1F3step 1.1algebra∎

The eigenvalues of Σ2=diag⁡(2,1) are 2>1, with leading eigenspace span⁡(e1). Both e1 and −e1 have unit norm and satisfy Σ2e1=2e1 and Σ2(−e1)=2(−e1). They determine the same line, so even a simple leading eigenvalue does not orient its eigenvector.

Sources