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
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
- Consistency and Limiting Distributions
- 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
- Finite Probability Spaces and Random Variables
- 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
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- 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
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 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
Local leading-eigenvector stability under a spectral gap
Statement
Let , let be symmetric, and order its eigenvalues as . Suppose its leading eigenvalue is simple, with gap and let be a unit leading eigenvector. Let be symmetric, put , and assume . If is any unit leading eigenvector of , then the leading eigenvalue of is simple and 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 matrix , , a simple leading eigenvalue with gap , a unit leading eigenvector , a real symmetric perturbation with operator norm , and a unit leading eigenvector of .
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a real symmetric matrix has an orthonormal eigenbasis with real eigenvalues.
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.
The Euclidean inner product on and Cauchy–Schwarz: , with equality exactly for dependent pairs: the Euclidean norm is induced by , and .
Proof
For every unit vector , [F3] and [F4] give . The top-eigenvalue Rayleigh characterization in [F2] therefore gives , while evaluating the perturbed Rayleigh quotient at gives . This proves the eigenvalue bound.
The minimum--maximum formula in [F2], with the -dimensional subspace , gives , since every such has . Step 1.1 gives , hence ; the perturbed leading eigenvalue is simple. Also .
Let , the orthogonal projection onto , and write . Projecting onto gives . In an orthonormal eigenbasis of , every eigenvalue of is at least by step 2.1. Therefore . Indeed, is an orthogonal decomposition, so ; then [F3] and give the final inequality. Since , division by proves the angle bound.
Finite-fourth-moment root-n consistency of sample-centered covariance
Statement
Fix and a Borel probability law on with , mean , and covariance matrix . For each , let be iid with law ; the probability space may depend on . Put the sample-centered covariance with divisor from Sample covariance estimators and squared operator loss. For a matrix , define . Then meaning 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 , a law on with , and for each an iid sample of size from .
Identical distribution and IID families: iid means identically distributed and mutually independent, not only pairwise independent.
Measurable coordinatewise functions preserve independence: measurable coordinatewise functions of an independent family remain independent.
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.
Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for integrable variables.
Markov's inequality for random variables: for nonnegative and , .
Stochastic order and convergence notation for finite-dimensional random vectors: means, using the Euclidean norm of its finite vectorization, that for every some satisfies .
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: the Euclidean norm satisfies the triangle inequality in every finite dimension.
Proof
Since for , the fourth-moment assumption gives . Then gives , so the coordinatewise mean is finite. Put and . By [F8], . For , gives and then . Hence . For each , the variables are centered and square-integrable because . The map is Borel, so [F1] and [F2] make independent.
Let . By [F1] and [F2], the coordinate variables are independent across . Thus [F4] makes their cross-covariances zero, and [F4] and [F5] give . Also by expanding both squares. For every , [F6] therefore gives . Thus this centered-mean term converges to zero in probability.
For fixed , all are the same Borel function of the iid vectors , 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 . Since , . Summing over and using yields . Consequently [F6] gives, for every , , so by [F7].
Expanding the centered sum in [F3] gives . For a matrix , let list its entries; by the definition of the Frobenius norm, . Applying [F8] to these vectors gives , including the triangle inequality used below. For any , choose so the limsup tail of above is at most by step 2.2. For all sufficiently large , the probability that is at most by step 2.1. The displayed Frobenius triangle inequality then bounds the limsup probability that by . This is by [F7], which is the claimed root-n rate.
Covariance and correlation principal component analysis
Definition
Let be a parametric statistical model, let , and let be a measurable random vector with for every . Write and 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 . 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 .
If every coordinate variance is positive, put and standardize the centered vector as . Its covariance is the correlation matrix . Correlation-PCA is the ordered eigenspace decomposition of . Thus both population conventions center first; correlation-PCA additionally divides each coordinate by its positive population standard deviation.
For an iid sample , sample covariance-PCA uses the eigenspaces of the sample-centered covariance from Sample covariance estimators and squared operator loss, where . Sample correlation-PCA standardizes by the positive sample standard deviations when all sample coordinate variances are positive. The divisor convention here is , not . 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).
Sample-centered covariance is a measurable statistic and estimator
Statement
Let be a family of Borel probability laws on with . For each , observe an iid sample with common law and sample law on the Borel data space . Put and let be the covariance-matrix estimand with target the Borel space of real symmetric matrices. The sample-centered covariance map is a statistic with target the Borel space , 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 , , a family of Borel laws on with finite second moments, and an iid sample experiment on Borel sample space .
Statistical experiments and Parametric statistical models: the sample experiment is a parameter-indexed family of probability laws on its measurable data space.
Identical distribution and IID families: under each , the sample coordinates are iid with common law .
Covariance matrix of a finite-dimensional random vector and A finite second moment defines a positive semidefinite covariance matrix: the covariance is finite and symmetric, so it belongs to .
Estimands on a statistical model: is the stated target function on the parameter set.
Sample covariance estimators and squared operator loss: the sample-centered covariance is .
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.
A continuous map has Borel preimages of Borel sets: a continuous map between topological spaces has Borel preimages of Borel sets.
Proof
Regard as the subspace of with its Borel sigma-algebra. Each matrix coordinate of is a polynomial in the real sample coordinates, so is continuous. Its values are symmetric because every outer product is symmetric, hence it is also continuous as a map into the subspace . By [F7] it is Borel measurable.
By [F1] and [F2], the sample experiment is the stated parameter-indexed iid experiment; [F3] places in , and [F4] identifies it as the estimand target. The formula in [F5] is exactly . Thus [F6] and step 1.1 make a statistic and, since its target space is the same , an estimator of .
The leading PCA eigenspace maximizes projected variance
Statement
Fix a parameter in the model of Covariance and correlation principal component analysis, and let have finite second moment and covariance matrix . For every unit vector , Consequently, the maximum projected variance is the largest eigenvalue , 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 says that correlation-PCA maximizes the variance of linear scores of the standardized coordinates.
Facts & Assumptions
Given: A parameter , a real random vector with finite second moment under , and a unit vector . For the correlation statement, assume every diagonal entry of is positive.
Covariance and correlation principal component analysis: is the covariance matrix used for covariance-PCA, and is the population-standardized vector used for correlation-PCA.
Covariance matrix of a finite-dimensional random vector: the entries of are .
Moments, variance, and covariance on a probability space: variance is the expectation of the centered square.
Linearity, monotonicity, and the modulus bound for expectation: expectation is linear on integrable finite sums.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis and Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces: a real symmetric matrix has an orthonormal eigenbasis, and its largest eigenvalue is the maximum of its Rayleigh quotient on unit vectors.
Proof
Put . Finite second moments make every coordinate in the finite sums below integrable. Expanding the centered scalar square and using [F4] gives by [F2] and [F3].
By [F5], write in an orthonormal eigenbasis of with eigenvalues and . Then . The difference is , a sum of nonnegative terms, so equality holds exactly when for every . 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.
If all coordinate variances are positive, [F1] defines with covariance . The hypotheses of steps 1.1--2.1 hold with and in place of and , so the leading correlation-PCA eigenspace maximizes the variance of unit linear scores of .
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 . If , then the leading eigenspace is a uniquely specified subspace of dimension at least two. Every unit vector in 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 with and .
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.
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.
The leading PCA eigenspace maximizes projected variance: the unit leading directions are exactly the unit vectors in the leading eigenspace.
Proof
In the orthonormal eigenbasis supplied by [F2], the equality gives at least two linearly independent eigenvectors with eigenvalue . The full eigenspace contains these vectors, is specified by itself, and therefore has dimension at least two.
Every unit vector in 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 .
A simple population eigengap gives root-n sample PCA eigenspace consistency
Statement
Let be iid copies of a fixed with , where , and let have a simple leading eigenvalue with gap . Let be the sample-centered covariance with divisor , and put and . Then . On the sample leading eigenspace is a line; define to be the sine of its angle to the population leading line and set off . Then , hence 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 , iid samples from a law with finite fourth moment, the population covariance , its simple leading eigenvalue gap , and sample-centered covariance with divisor .
Local leading-eigenvector stability under a spectral gap: if a symmetric perturbation has operator norm , the perturbed leading eigenvalue remains simple and its leading line has sine-angle at most from the population line.
Sample-centered covariance is a measurable statistic and estimator: the sample covariance is a measurable matrix-valued statistic.
The Euclidean inner product on and Cauchy–Schwarz: , with equality exactly for dependent pairs: the Euclidean norm is induced by the inner product, and Cauchy--Schwarz holds.
Stochastic order and convergence notation for finite-dimensional random vectors: means bounded in probability; thus an quantity becomes after multiplication by .
Proof
For every matrix and unit vector , applying Cauchy--Schwarz to each row gives . Hence [F4] gives . With , [F1] implies by [F6]. To see , fix and choose so the limsup tail of above is at most . For all sufficiently large , , and then . Thus , so the claimed probability tends to one.
On , [F2] says that the sample leading eigenvalue is simple and . 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 , extended by zero off the Borel event , is measurable. Pointwise, , so [F1] and [F6] imply and therefore .
Fix and . Since [F6] defines , choose so its limsup tail above is at most . For all sufficiently large , , and then . Hence . Since was arbitrary, in probability.
5 · Examples, counterexamples and false statements
None yet.