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.
The Spectral Theorem and SVD: Examples and Counterexamples
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
- 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
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- 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 Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
An explicit real symmetric 3x3 matrix is orthogonally diagonalised
Example
For
an orthogonal matrix
satisfies
Facts & Assumptions
Given: The real symmetric matrix above, acting on with the standard inner product.
A self-adjoint operator on a finite-dimensional real inner product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).
Verification
Direct multiplication gives , , and . After normalising the first two vectors, the three displayed columns of form an orthonormal eigenbasis, exactly as [L1] predicts.
Because the columns of are orthonormal eigenvectors with eigenvalues , the conjugated matrix is diagonal with those eigenvalues on the diagonal.
An explicit Hermitian 2x2 matrix is unitarily diagonalised
Example
For
the unitary matrix
satisfies
Facts & Assumptions
Given: The Hermitian matrix above, acting on with the standard Hermitian inner product.
A normal operator on a finite-dimensional complex inner product space has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Verification
One checks that and . After dividing by , these eigenvectors are orthonormal, so the columns of form the orthonormal eigenbasis guaranteed by [L1].
Because the columns of are orthonormal eigenvectors with eigenvalues and , the conjugated matrix is .
The real quarter-turn is normal and appears as a single 2x2 block in the real normal classification
Example
The quarter-turn
is normal on , has complex eigenvalues , and in the standard orthonormal basis already appears as the block from the real normal classification.
Facts & Assumptions
Given: The quarter-turn matrix acting on with the standard inner product.
In an orthonormal basis, normality is equivalent to commuting with the transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).
Real normal operators are orthogonally block-diagonalisable with and rotation-scaling blocks (A real normal endomorphism is orthogonally block-diagonalisable with 1x1 real blocks and 2x2 rotation-scaling blocks).
Verification
Direct multiplication gives , so is normal by [L1]. Its characteristic polynomial is , so over its eigenvalues are and .
The matrix itself has the form with and , so it is exactly one of the blocks allowed by [L2].
A complex symmetric matrix can be nonzero, square to zero, and fail to be normal
Example
The complex matrix
is symmetric, nonzero, nilpotent of index , and not normal.
Facts & Assumptions
Given: The complex matrix above.
In an orthonormal basis, normality is equivalent to commuting with the conjugate transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).
Verification
The matrix is symmetric because , and direct multiplication gives while , so is a nonzero nilpotent matrix of index .
Its conjugate transpose is , and direct multiplication gives but . Hence , so is not normal by [L1].
The non-negative square root of an explicit matrix is exhibited as a polynomial in the matrix
Example
For
the non-negative square root is
Facts & Assumptions
Given: The real symmetric matrix above.
A self-adjoint real operator has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).
The non-negative square root of a non-negative operator is a polynomial in the operator (The non-negative square root of a non-negative operator is a polynomial in the operator).
Verification
One has and , so after normalising these vectors, [L1] gives an orthonormal eigenbasis with eigenvalues and . Therefore is non-negative.
In the same eigenbasis, the non-negative square root has eigenvalues and , which corresponds in the standard basis to . Direct multiplication gives , and direct algebra gives , exactly as [L2] predicts.
A worked polar decomposition of an invertible matrix
Example
For
the polar decomposition is
Facts & Assumptions
Given: The matrix above on with the standard inner product.
Every endomorphism has a polar decomposition with and an isometry (Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible).
Verification
Direct multiplication gives , so its non-negative square root is .
The matrix satisfies , so it is orthogonal, and . Hence this is the polar decomposition predicted by [L1].
A singular matrix has a polar decomposition with visibly nonunique isometric factors
Example
For
one has the polar factor and two distinct orthogonal choices
with
Facts & Assumptions
Given: The singular matrix above on with the standard inner product.
The polar decomposition exists, and uniqueness of the isometric factor fails in general when the operator is singular (Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible).
Verification
Because , the non-negative square root is . Also and are both orthogonal because .
Direct multiplication gives , while . Hence this singular operator has more than one polar isometric factor, exactly as [L1] allows.
The singular value decomposition of an explicit 2x3 matrix
Example
For the linear map with matrix
an SVD is
Facts & Assumptions
Given: The matrix above with the standard inner products on and .
Every linear map between finite-dimensional inner product spaces admits a singular value decomposition (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
Verification
Direct multiplication gives , so the singular values are , with standard basis vectors as right-singular vectors.
The images of the first two standard basis vectors are and , so the standard basis of gives the left-singular vectors. Therefore , , and the displayed diagonal matrix give an SVD of , exactly as [L1] guarantees.
The rank-one truncation of an SVD realises the Eckart-Young minimiser
Example
For the matrix
the rank-one truncation
is a best rank-at-most-one approximation in operator norm, and the error is .
Facts & Assumptions
Given: The matrix above and its rank-one truncation .
The matrix has singular values (The singular value decomposition of an explicit 2x3 matrix).
The rank- truncation of an SVD is a best rank-at-most- approximation, with error equal to the next singular value (The best rank-at-most-k approximation in operator norm is the rank-k truncation of a singular value decomposition).
Verification
By [L1], deleting the second singular direction replaces by , which has rank , and has operator norm .
The next singular value after the retained one is , so [L2] says exactly that no rank-at-most-one matrix lies closer to in operator norm than . Therefore is the Eckart-Young minimiser.
Courant-Fischer is checked on an explicit 3x3 symmetric matrix
Example
For the symmetric matrix
the Rayleigh quotient is
so the Courant-Fischer formulas recover the ordered eigenvalues .
Facts & Assumptions
Given: The diagonal matrix on with the standard inner product.
Courant-Fischer characterises the ordered eigenvalues of a real self-adjoint operator by min-max formulas (Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces).
Verification
For every nonzero , the displayed formula shows , with the value at , the value at , and the value at . On the quotient is at most , and on it is at least .
Therefore , , and the Courant-Fischer min-max and max-min values are both . This matches the ordered eigenvalues , exactly as [L1] predicts.
The eigenvalues of a principal 2x2 submatrix interlace those of a 3x3 symmetric matrix
Example
For
the eigenvalues of are and the eigenvalues of the principal submatrix are , so they interlace.
Facts & Assumptions
Given: The matrices and above, where is the compression of to the coordinate hyperplane .
Orthogonal compression to a hyperplane gives interlacing eigenvalues for a self-adjoint operator (The eigenvalues of the orthogonal compression of a self-adjoint endomorphism to a hyperplane interlace those of the original endomorphism).
Verification
The characteristic polynomial of is , so its ordered eigenvalues are . The characteristic polynomial of is , so its ordered eigenvalues are .
These satisfy and , exactly the pattern asserted by [L1].
Gershgorin disks for an explicit 3x3 matrix contain the true spectrum
Example
For
the Gershgorin disks are
and they contain the whole spectrum .
Facts & Assumptions
Given: The upper-triangular matrix above.
Every eigenvalue lies in some Gershgorin disk (Every eigenvalue lies in some Gershgorin disk).
Verification
The row sums off the diagonal are , so the displayed three Gershgorin disks are exactly the ones attached to .
Because is upper triangular, its eigenvalues are the diagonal entries , and each of these lies in the displayed union of disks. This is the concrete containment asserted abstractly by [L1].
FALSE: Every normal operator is diagonalisable over its base field
Statement
Every normal operator is diagonalisable over its base field.
Facts & Assumptions
Given: The quarter-turn matrix on .
The real quarter-turn is normal and has complex eigenvalues (The real quarter-turn is normal and appears as a single 2x2 block in the real normal classification).
Refutation
By [L1], the quarter-turn is a normal real operator.
The same example [L1] shows that has no real eigenvalue, so it cannot have a real eigenbasis and is not diagonalisable over . This refutes the field-free claim.
FALSE: Every complex symmetric matrix is unitarily diagonalisable
Statement
Every complex symmetric matrix is unitarily diagonalisable.
Facts & Assumptions
Given: The complex symmetric matrix .
This matrix is symmetric but not normal (A complex symmetric matrix can be nonzero, square to zero, and fail to be normal).
A complex matrix is unitarily diagonalisable exactly when the corresponding operator is normal (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Refutation
By [L1], the matrix is indeed complex symmetric.
If were unitarily diagonalisable, [L2] would make it normal. That contradicts [L1]. Therefore the claim is false.
FALSE: If <Tv,v> is nonnegative for every v, then T is automatically self-adjoint
Statement
If is nonnegative for every vector , then is automatically self-adjoint.
Facts & Assumptions
Given: The quarter-turn matrix on .
The quarter-turn is not self-adjoint, because it is normal of the rotation type rather than diagonal over (The real quarter-turn is normal and appears as a single 2x2 block in the real normal classification).
Refutation
For every , one has and therefore . Thus the hypothesis of the claim holds for .
By [L1], the same operator is not self-adjoint. Hence the displayed inequality alone does not force self-adjointness, and the claim is false.
FALSE: A non-negative operator has a unique square root among all operators
Statement
A non-negative operator has a unique square root among all operators.
Facts & Assumptions
Given: The identity operator on .
A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).
Refutation
The operator is non-negative, and [L1] says its non-negative square root is uniquely itself.
Nevertheless and . So has at least two square roots, and uniqueness fails once the non-negative condition on the square root is dropped.
FALSE: The isometry in the polar decomposition is unique even for singular operators
Statement
The isometry in the polar decomposition is unique even for singular operators.
Facts & Assumptions
Given: The singular matrix .
This matrix has two distinct polar isometric factors and with the same non-negative factor (A singular matrix has a polar decomposition with visibly nonunique isometric factors).
Refutation
By [L1], the singular matrix admits both decompositions and , with .
Therefore the isometry in a polar decomposition need not be unique for a singular operator. This refutes the claim.
FALSE: The singular values of an operator are the absolute values of its eigenvalues
Statement
The singular values of an operator are the absolute values of its eigenvalues.
Facts & Assumptions
Given: The nilpotent matrix on .
Every linear map admits a singular value decomposition (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
Refutation
The characteristic polynomial of is , so both eigenvalues are and their absolute values are .
Direct multiplication gives , so the singular values are and . Because , the singular values are not the absolute values of the eigenvalues.
FALSE: The operator norm is always the largest modulus of an eigenvalue
Statement
The operator norm is always the largest modulus of an eigenvalue.
Facts & Assumptions
Given: The nilpotent matrix on .
The operator norm equals the largest singular value (The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector).
Refutation
The characteristic polynomial of is , so every eigenvalue of has modulus .
For a unit vector , one has , with equality at . Thus , which by [L1] is also its largest singular value. Because , the operator norm is not the largest eigenvalue modulus.