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.
PCA and eigengap stability — Examples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- PCA and eigengap stability
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Robust Covariance and Sparse Robust Estimation
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sparse Estimation and Covariance
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Lebesgue Integral and the Convergence Theorems
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
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
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 , take The unperturbed leading line is and the gap is . The perturbation norm is , but the perturbed leading line makes the fixed positive angle with , independent of . Thus an absolute perturbation bound alone cannot give uniform eigenspace stability as the gap vanishes.
Facts & Assumptions
Given: A real parameter , the matrices
above, and the false uniform claim stated in ## Statement refuted.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum of over unit vectors.
Local leading-eigenvector stability under a spectral gap: when , the sign-free sine-angle is bounded by .
Refutation
The eigenvalues of are and , so its leading line is and its gap is . Also , whence [F1] gives .
The characteristic polynomial of has roots , so the larger root is the leading eigenvalue. If is its leading eigenvector, the first row of the eigenvalue equation gives . Thus its line makes angle with , independently of .
Letting makes by step 1.1 while the angle in step 1.2 stays fixed and positive, contradicting the proposed uniform claim. Here , so [F2] still applies; its gap-dependent bound is consistent with the example.
Rescaling can change covariance-PCA directions
Example
Let be uniform on and set . Then The leading correlation-PCA line is , 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 with probability at each point, , , and .
Covariance matrix of a finite-dimensional random vector: covariance entries are expectations of centered coordinate products.
Covariance and correlation principal component analysis: correlation-PCA divides centered coordinates by their positive standard deviations.
The leading PCA eigenspace maximizes projected variance: the leading eigenspace is the maximizing line for projected variance.
Verification
On this four-point space, , , and because two points have and two have . Thus , , , and . This gives the stated covariance matrix.
The positive standard-deviation matrix is , so [F2] gives . This matrix sends to and to ; hence its leading line is .
The covariance matrix has characteristic roots , so its leading eigenspace is a line. It sends to , which is not a scalar multiple of . 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.
Tied PCA eigenvalues and sign ambiguity
Example
The covariance matrix has a repeated leading eigenvalue. Every unit direction in (and its line) maximizes projected variance, but the leading PCA subspace defined by the full leading eigenspace is . In contrast, has the unique leading line , but both and 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 and .
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.
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.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: each real symmetric matrix has an orthonormal eigenbasis.
The leading PCA eigenspace maximizes projected variance: for a finite-second-moment random vector with covariance and a unit vector , the projected variance is .
Verification
The eigenvalues of are , and is the zero matrix, so the defined leading eigenspace is . For any finite-second-moment random vector with covariance and every unit vector , [F4] gives . Thus every unit vector in attains the same projected variance and maximizes it; each of its lines is a variance-maximizing direction, while the defined leading PCA subspace remains all of .
The eigenvalues of are , with leading eigenspace . Both and have unit norm and satisfy and . They determine the same line, so even a simple leading eigenvalue does not orient its eigenvector.