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, Positive Operators and Singular Value Decomposition
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 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
The adjoint, orthonormal bases, orthogonal projections, Jordan form, and the fundamental theorem of algebra are already in place. This page adds the finite-dimensional spectral package that those prerequisites make cheap: Schur triangularisation, the complex spectral theorem for normal operators, the real block classification for normal operators, the real spectral theorem for self-adjoint operators, spectral projections, functional calculus, and the finite-dimensional Jordan-Chevalley decomposition over a perfect field.
From that point onward the route stays algebraic. The page develops non-negative operators and their unique non-negative square roots, singular values, the singular value decomposition, polar decomposition, the operator norm and Eckart-Young, then the Rayleigh quotient, Courant-Fischer, interlacing, Weyl inequalities, and Gershgorin's disks. The companion page works these statements on explicit matrices and records the common false field-free or over-strong variants.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
Definition
Let be a finite-dimensional real or complex inner product space and let be an endomorphism. The endomorphism is self-adjoint when
and normal when
where is the adjoint from The adjoint is characterised by .
Every self-adjoint endomorphism is normal, because .
In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose
Statement
Let be a finite-dimensional real or complex inner product space, let be linear, and let be an orthonormal basis of . Write
Then:
- is self-adjoint if and only if .
- is normal if and only if .
Over , is just .
Facts & Assumptions
Given: A finite-dimensional real or complex inner product space , a linear map , an orthonormal basis , and the matrix .
In orthonormal bases, the matrix of the adjoint is the conjugate transpose (In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix).
Proof
By the definition of self-adjointness in Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, is self-adjoint exactly when . By [L1], this is equivalent to .
By the definition of normality in Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, is normal exactly when ; using [L2] and then [L1], this is equivalent to , hence to .
If the characteristic polynomial of an endomorphism splits, some orthonormal basis makes its matrix upper triangular
Statement
Let be a finite-dimensional real or complex inner product space over , and let be linear. If the characteristic polynomial of splits over , then has an orthonormal basis in which the matrix of is upper triangular.
Facts & Assumptions
Given: A finite-dimensional real or complex inner product space over and a linear endomorphism whose characteristic polynomial splits over .
An endomorphism is triangularisable exactly when its characteristic polynomial splits ( is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits).
A basis gives an upper-triangular matrix exactly when its successive spans form a complete -invariant flag (Complete invariant flags are equivalent to upper-triangular matrices).
Gram-Schmidt turns a linearly independent list into an orthonormal list with the same successive spans (Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans).
Proof
By [L1], there is a basis of in which is upper triangular; equivalently, the flag is -invariant by [L2].
Apply [L3] to and obtain an orthonormal basis such that for every , so the same successive spans are still -invariant.
Because the orthonormal basis is adapted to a complete -invariant flag, [L2] shows that the matrix of in that basis is upper triangular.
A normal upper-triangular matrix is diagonal
Statement
Let . If is upper triangular and normal, then is diagonal.
Facts & Assumptions
Given: An upper-triangular matrix that is normal.
A matrix is normal exactly when it commutes with its conjugate transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).
Proof
Because is upper triangular, the -th diagonal entry of is , while the -th diagonal entry of is ; [L1] makes these equal, so for every .
More generally, if every entry to the right of in row is already zero, then the -th diagonal entries of and are and , so [L1] forces for every .
Starting from in step 1.1 and descending through , step 2.1 shows that every entry above the diagonal is zero. Thus is diagonal.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
Statement
Let be a finite-dimensional complex inner product space and let be linear. Then is normal if and only if has an orthonormal basis consisting of eigenvectors of .
Facts & Assumptions
Given: A finite-dimensional complex inner product space and a linear endomorphism .
The field is algebraically closed (The complex numbers are algebraically closed).
If the characteristic polynomial splits, then some orthonormal basis makes the matrix upper triangular (If the characteristic polynomial of an endomorphism splits, some orthonormal basis makes its matrix upper triangular).
A normal upper-triangular complex matrix is diagonal (A normal upper-triangular matrix is diagonal).
In an orthonormal basis, a linear map is normal exactly when its matrix commutes with its conjugate transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).
Proof
Assume is normal. By [L1], the characteristic polynomial of splits over , so [L2] gives an orthonormal basis in which the matrix of is upper triangular. Because is normal, [L4] makes that matrix normal, and then [L3] makes it diagonal. Hence the chosen orthonormal basis consists of eigenvectors of .
Conversely, assume is an orthonormal basis of eigenvectors of , with . Then the matrix of in that basis is the diagonal matrix , and every diagonal matrix commutes with its conjugate transpose. By [L4], is normal.
A real normal endomorphism is orthogonally block-diagonalisable with 1x1 real blocks and 2x2 rotation-scaling blocks
Statement
Let be a finite-dimensional real inner product space and let be normal. Then has an orthonormal basis in which the matrix of is block diagonal with blocks of the two forms
where .
Facts & Assumptions
Given: A finite-dimensional real inner product space and a normal endomorphism .
In an orthonormal basis, a real operator is normal exactly when its matrix commutes with its transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).
Over a complex inner product space, a normal operator has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
The standard pairings on and are inner products (The standard formulas on and on are inner products).
Complex conjugation satisfies the usual algebraic laws (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Proof
Choose an orthonormal basis of and let be the matrix of . By [L1], . Because has real entries, its conjugate transpose over is still , so is a normal complex matrix on with the standard Hermitian inner product from [L3]. Therefore [L2] gives an orthonormal eigenbasis of for .
If is an eigenvalue and is a corresponding complex eigenvector, then , so and ; hence one of is a nonzero real eigenvector, and repeating inside each real eigenspace yields orthonormal real eigenvectors for the real eigenvalues.
If with and is a unit eigenvector, then because is real; since , the vectors and are orthogonal in the orthonormal eigenbasis from step 1.1, so writing out and using [L4] gives , hence and . Also , so and ; after normalising and , the matrix of on is .
The orthonormal complex eigenbasis from step 1.1 splits into real eigenvectors and conjugate pairs. Step 1.2 replaces each real eigenvector by a real one, and step 2.1 replaces each conjugate pair by an orthonormal real pair spanning the same real invariant plane. Collecting these mutually orthogonal pieces yields an orthonormal real basis with the stated block-diagonal matrix.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
Statement
Let be a finite-dimensional real inner product space and let be self-adjoint. Then has an orthonormal basis consisting of eigenvectors of .
Facts & Assumptions
Given: A finite-dimensional real inner product space and a self-adjoint endomorphism .
Every self-adjoint endomorphism is normal (Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space).
A real normal endomorphism admits an orthonormal block decomposition by real blocks and blocks (A real normal endomorphism is orthogonally block-diagonalisable with 1x1 real blocks and 2x2 rotation-scaling blocks).
In an orthonormal basis, self-adjointness means symmetry of the matrix (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).
Proof
By [L1] and [L2], there is an orthonormal basis in which the matrix of is block diagonal with real blocks and blocks .
Because is self-adjoint, [L3] says that the same matrix is symmetric. A block above is symmetric exactly when , so every block collapses to the scalar block . Therefore the whole matrix is diagonal.
A diagonal matrix acts on each basis vector by scalar multiplication, so the orthonormal basis from step 2.1 is an orthonormal eigenbasis of .
A normal endomorphism is a sum of its eigenvalues times pairwise orthogonal projections, and each spectral projection is a polynomial in the endomorphism
Statement
Let be a finite-dimensional complex inner product space and let be normal. If are the distinct eigenvalues of , then there are pairwise orthogonal projections such that
each projects onto the eigenspace , and every is a polynomial in .
Facts & Assumptions
Given: A finite-dimensional complex inner product space and a normal endomorphism with distinct eigenvalues .
A normal complex endomorphism has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Self-adjoint idempotents are exactly orthogonal projections (An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint).
In the primary decomposition, each primary projection is a polynomial in the endomorphism (Each projection in the primary decomposition is a polynomial in the endomorphism).
Proof
By [L1], has an orthonormal eigenbasis. If , then there are no eigenvalues and is the empty sum. Otherwise with the summands pairwise orthogonal; if is the orthogonal projection onto and with , then , hence .
Because the eigenspaces are pairwise orthogonal and the are the corresponding orthogonal projections, one has , , and for , so the are pairwise orthogonal projections in the sense of [L2].
Since is diagonalisable with distinct eigenvalues, its primary decomposition is exactly the direct sum of the eigenspaces . Therefore [L3] identifies each projection onto with a polynomial in .
The spectral functional calculus f(T) for a normal endomorphism
Definition
Let be a finite-dimensional complex inner product space, let be normal, and write the spectral resolution from A normal endomorphism is a sum of its eigenvalues times pairwise orthogonal projections, and each spectral projection is a polynomial in the endomorphism as
where the are the distinct eigenvalues of and is the orthogonal projection onto . For a function on the spectrum of , define
This is the spectral functional calculus of . For the identity function , one has .
For normal endomorphisms, the spectral functional calculus respects sums, products, adjoints, and composition of scalar functions
Statement
Let be a finite-dimensional complex inner product space, let be normal, and let .
- .
- .
- If , then .
- If , then .
Facts & Assumptions
Given: A finite-dimensional complex inner product space , a normal endomorphism , its spectral resolution and functions .
A normal endomorphism has a spectral resolution by pairwise orthogonal projections with for and (A normal endomorphism is a sum of its eigenvalues times pairwise orthogonal projections, and each spectral projection is a polynomial in the endomorphism).
Proof
By definition and , so ; using for and from [L1], one also gets .
Because each is self-adjoint by [L1], one has .
Put for the distinct values taken by on and define ; then the are pairwise orthogonal projections, , and applying the same definition of functional calculus once more gives .
Semisimple endomorphisms as endomorphisms diagonalisable over an algebraic closure, and nilpotent endomorphisms
Definition
Let be a finite-dimensional vector space over a field , and let be linear. The endomorphism is semisimple when its minimal polynomial is separable in the sense of Repeated roots in extension fields and separable polynomials.
Equivalently, choose any basis of , regard the matrix of as a matrix over an algebraic closure from An algebraic closure of a field, and let it act on . That endomorphism is diagonalisable over . This is basis-independent because the minimal polynomial is unchanged by field extension, and an endomorphism is diagonalisable exactly when its minimal polynomial splits with distinct roots.
The endomorphism is nilpotent when for some positive integer, equivalently when it is nilpotent in the sense of Nilpotent endomorphisms and their nilpotency index.
Over a perfect field, every endomorphism has a unique commuting semisimple-plus-nilpotent decomposition, polynomial in the endomorphism
Statement
Assume the Axiom of Choice.
Let be a finite-dimensional vector space over a perfect field , and let be linear. Then there exist unique endomorphisms such that
is semisimple, is nilpotent, and both and are polynomials in with coefficients in .
Facts & Assumptions
Given: Assume the Axiom of Choice. Let be a finite-dimensional vector space over a perfect field , and let be a linear endomorphism.
Every algebraic extension of a perfect field is separable (Every algebraic extension of a perfect field is separable).
If the characteristic polynomial splits, then Jordan form exists (Jordan form over the base field exists exactly when the characteristic polynomial splits).
In a primary decomposition, each primary projection is a polynomial in the endomorphism (Each projection in the primary decomposition is a polynomial in the endomorphism).
A finite extension is Galois exactly when it is the splitting field of a separable polynomial, and then the fixed field of its full Galois group is the base field (Equivalent characterizations of a finite Galois extension).
An endomorphism is diagonalisable exactly when its minimal polynomial splits with distinct roots (An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors).
Proof
Choose an algebraic closure as in An algebraic closure of a field. Let be the product of the distinct monic irreducible factors of the characteristic polynomial of , and let be its splitting field. By [L1], the polynomial is separable, so [L4] makes finite Galois with fixed field . The characteristic polynomial splits over , and [L2] gives Jordan form for the matrix of over . Thus decomposes as the direct sum of generalized eigenspaces , and is nilpotent.
Let be the projection onto along the sum of the other generalized eigenspaces. By [L3], each is a polynomial in . Define and . Then , the operators commute because they are polynomials in , the minimal polynomial of divides and therefore has distinct roots, so [L5] makes semisimple, and is nilpotent because its restriction to each is .
Suppose also that with semisimple, nilpotent, and . Because commutes with , every generalized eigenspace from step 1.1 is invariant under both and . On , the operator has only the eigenvalue , while has only the eigenvalue ; hence the semisimple operator has only the eigenvalue , so on and therefore there. Thus and .
Let . Acting entrywise, fixes the matrix of and permutes the roots of its characteristic polynomial. Applying to the construction in step 2.1 therefore produces another commuting semisimple-plus-nilpotent decomposition of . Uniqueness in step 3.1 forces and .
Choose an -basis of the finite-dimensional algebra . The same matrices form an -basis of . Write with . Step 4.1 and uniqueness of coordinates give for every , so [L4] gives . Hence is the scalar extension of a polynomial with . The same argument applies to , giving with . Extending the identities of step 2.1 back down to gives and ; semisimplicity and nilpotence descend because their minimal-polynomial identities have coefficients in . Uniqueness follows after extension to from step 3.1.
Non-negative and positive operators
Definition
Let be a finite-dimensional real or complex inner product space and let be linear. The operator is non-negative when is self-adjoint in the sense of Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space and
for every .
The operator is positive when is self-adjoint and
for every nonzero .
Over the reals, non-negative and positive operators correspond exactly to positive semidefinite and positive definite symmetric forms
Statement
Let be a finite-dimensional real inner product space. The assignment
restricts to a bijection between self-adjoint endomorphisms of and symmetric bilinear forms on . Under this bijection, non-negative operators correspond exactly to positive semidefinite forms, and positive operators correspond exactly to positive definite forms.
Facts & Assumptions
Given: A finite-dimensional real inner product space , a linear map , and the bilinear form .
Bilinear forms on correspond bijectively to linear maps (Bilinear forms on correspond linearly and bijectively to linear maps ).
On a finite-dimensional real inner product space, every linear functional is uniquely of the form for some (Finite-dimensional Riesz representation: every functional is uniquely ).
A symmetric bilinear form is positive semidefinite or positive definite exactly when its quadratic values satisfy the corresponding weak or strict inequalities (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
Proof
For a linear map , the form is bilinear. Conversely, let be a bilinear form on . By [L1], the assignment is a linear map . For each , [L2] gives a unique vector such that for every . If and , then for every one has so uniqueness in [L2] gives . Thus is linear, and the correspondence is bijective on all linear maps and bilinear forms. In the real case, is self-adjoint exactly when for all , and symmetry of the inner product makes this exactly the condition . Thus self-adjoint endomorphisms correspond exactly to symmetric bilinear forms.
For every , one has . Therefore the weak inequality in Non-negative and positive operators is exactly the positive-semidefinite condition in [L3], and the strict inequality on nonzero vectors is exactly the positive-definite condition in [L3].
A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
Statement
Let be a finite-dimensional real or complex inner product space and let be linear. The following are equivalent:
- is non-negative.
- is self-adjoint and every eigenvalue of is a nonnegative real number.
- Some orthonormal basis makes the matrix of diagonal with nonnegative real diagonal entries.
- There exists a linear map such that .
Facts & Assumptions
Given: A finite-dimensional real or complex inner product space and a linear endomorphism .
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).
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).
Every nonnegative real number has a unique nonnegative square root (Square roots exist: a unique with ; the positives are ).
Proof
Assume is non-negative. Then is self-adjoint by Non-negative and positive operators. If is real, [L1] gives an orthonormal eigenbasis; if is complex, the identity yields , so [L2] gives an orthonormal eigenbasis. For any eigenvector with , the equality and non-negativity give , and self-adjointness makes real. Thus claim 1 implies claim 2.
Assume claim 3. If the diagonal entries are , then [L3] gives square roots ; the diagonal operator with diagonal entries satisfies . Thus claim 3 implies claim 4.
In the orthonormal eigenbasis from step 1.1, the matrix of is diagonal with those nonnegative real eigenvalues on the diagonal. Thus claim 2 implies claim 3.
Assume claim 4, so . Then for every one has , and for all one has . Hence is self-adjoint and non-negative. Thus claim 4 implies claim 1.
A non-negative operator has a unique non-negative square root
Statement
Let be a finite-dimensional real or complex inner product space and let be non-negative. Then there exists a unique non-negative operator such that
Facts & Assumptions
Given: A finite-dimensional real or complex inner product space and a non-negative endomorphism .
A non-negative operator has an orthonormal eigenbasis with nonnegative eigenvalues (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).
Every nonnegative real number has a unique nonnegative square root (Square roots exist: a unique with ; the positives are ).
Proof
By [L1], there is an orthonormal basis of and numbers such that . By [L2], each has a nonnegative square root. Define by . Then for every , so ; the same basis shows that is self-adjoint with nonnegative eigenvalues, hence non-negative by [L1].
Let be another non-negative square root of . Because , each eigenspace is -invariant. On one has , and [L1] applied to the non-negative operator shows that all its eigenvalues are nonnegative; by [L2], the only nonnegative number whose square is is , so on . Thus acts on every basis vector exactly as does, and therefore .
The non-negative square root of a non-negative operator is a polynomial in the operator
Statement
Let be a non-negative operator on a finite-dimensional real or complex inner product space. Then its unique non-negative square root is for some polynomial .
Facts & Assumptions
Given: A finite-dimensional real or complex inner product space , a non-negative endomorphism , and the distinct eigenvalues of .
A non-negative operator has an orthonormal eigenbasis with nonnegative eigenvalues (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).
A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).
Proof
By [L1], has an orthonormal eigenbasis consisting of eigenvectors of , and every eigenvalue is a nonnegative real number. Interpolation on the finite set gives a polynomial with for every .
On each eigenspace , the operator acts as multiplication by . Therefore acts as multiplication by , so ; the same eigenbasis shows that is non-negative. By [L2], is the unique non-negative square root of .
The singular values of a linear map as the eigenvalues of the positive square root of T^*T
Definition
Let be a linear map between finite-dimensional real or complex inner product spaces. Because
for every , and because by Adjoints satisfy , , , and , the operator is non-negative. Let
the unique non-negative square root from A non-negative operator has a unique non-negative square root. The singular values of are the eigenvalues of , listed with multiplicity in weakly decreasing order.
In particular, this definition applies to endomorphisms by taking .
Singular values are well defined because the positive square root of T^*T is unique
Statement
For a linear map between finite-dimensional real or complex inner product spaces, the multiset of singular values depends only on .
Facts & Assumptions
Given: A linear map between finite-dimensional real or complex inner product spaces.
The singular values of are defined as the eigenvalues of the unique non-negative square root (The singular values of a linear map as the eigenvalues of the positive square root of T^*T).
A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).
Proof
The operator is determined by , and [L2] gives it a unique non-negative square root. Therefore the operator in [L1] is determined uniquely by .
The singular values are the eigenvalues of that uniquely determined operator , counted with multiplicity. Hence they depend only on .
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
Statement
Let be a linear map between finite-dimensional real or complex inner product spaces, and let be the number of positive singular values of . Then there exist orthonormal bases of and of , together with singular values
such that
for every .
Facts & Assumptions
Given: A linear map between finite-dimensional real or complex inner product spaces.
The singular values of are the eigenvalues of the non-negative operator (The singular values of a linear map as the eigenvalues of the positive square root of T^*T, Singular values are well defined because the positive square root of T^*T is unique).
A non-negative operator has an orthonormal eigenbasis with nonnegative eigenvalues (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).
Every finite-dimensional real or complex inner product space has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).
Proof
By [L1] and [L2], the non-negative operator on has an orthonormal eigenbasis with and . Because , one has and therefore .
For each , define . Then , and for one has . For , step 1.1 gives , so .
The orthonormal set , which may be empty when , extends to an orthonormal basis of by [L3]. If , then step 2.1 gives , and when this is the empty sum .
The rank of a linear map is the number of its nonzero singular values
Statement
Let be a linear map between finite-dimensional real or complex inner product spaces. Then equals the number of positive singular values of .
Facts & Assumptions
Given: A linear map between finite-dimensional real or complex inner product spaces, and an SVD with .
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).
Rank-nullity holds for linear maps with finite-dimensional domain (Rank-nullity: ).
Proof
By [L1], one has exactly when for , so and therefore .
By [L2], . Combining this with step 1.1 gives , the number of positive singular values.
An endomorphism and its adjoint have the same singular values
Statement
Let be an endomorphism of a finite-dimensional real or complex inner product space. Then and have the same singular values.
Facts & Assumptions
Given: An endomorphism of a finite-dimensional real or complex inner product space.
The singular value decomposition of has the form for orthonormal bases and and singular values (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
Proof
By [L1], define by . For all , orthonormality gives , so .
The formula in step 1.1 is itself a singular value decomposition of , with the same diagonal coefficients . Therefore has the same singular values as .
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
Statement
Let be an endomorphism of a finite-dimensional real or complex inner product space. Then there exist a non-negative endomorphism and a linear isometry such that
Equivalently, is an isometry on . The factor is unique if and only if is invertible.
Facts & Assumptions
Given: An endomorphism of a finite-dimensional real or complex inner product space.
There are orthonormal bases and and singular values such that for all (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
A linear map that sends an orthonormal basis to an orthonormal basis is a linear isometry (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).
A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).
Proof
By [L1], define and for every . Then is a linear isometry by [L2], for every basis vector, hence , and . Thus , and because is self-adjoint with nonnegative eigenvalues in the basis , [L3] identifies with the unique non-negative square root .
If is invertible, then all singular values are positive, so is invertible. Any other factorisation with the same non-negative factor satisfies , so is unique.
If is not invertible, then . Define another isometry by for and . Then , but for and for because . Hence , so uniqueness fails.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
Definition
Let be a linear map between finite-dimensional real or complex inner product spaces. If , define . If , define the operator norm of by
The next theorem proves that this maximum exists and 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
Statement
Let be a linear map between finite-dimensional real or complex inner product spaces.
If , then
If and is the largest singular value of , then
In the nonzero case, the maximum in The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| is attained at a right-singular vector for .
Facts & Assumptions
Given: A linear map between finite-dimensional real or complex inner product spaces.
There is a singular value decomposition with (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
Proof
If , then The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| gives . Assume now that , and choose an SVD from [L1]: Extend this list by zeros, setting ; then the displayed formula gives for every , so is the largest singular value of . Writing a unit vector as , one gets so every unit vector satisfies .
For the right-singular vector , step 1.1 gives . Therefore the maximum defining equals the largest singular value , and it is attained at when .
The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2
Statement
For compatible linear maps between finite-dimensional real or complex inner product spaces,
For every such linear map ,
Facts & Assumptions
Given: Compatible finite-dimensional linear maps and between real or complex inner product spaces.
The operator norm is defined by the maximum over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
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).
If is a singular value decomposition, then (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
Proof
For every unit vector in the domain of , [L1] gives . Taking the maximum over all unit yields .
If are the singular values of , then [L3] shows that has eigenvalues and is already non-negative. Hence its singular values are , so [L2] gives .
The best rank-at-most-k approximation in operator norm is the rank-k truncation of a singular value decomposition
Statement
Let be a linear map between finite-dimensional real or complex inner product spaces, let
be a singular value decomposition with , and fix an integer with . Define
Then , one has
with the convention when , and every linear map with satisfies
Facts & Assumptions
Given: A linear map between finite-dimensional real or complex inner product spaces and the rank- truncation above.
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).
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).
Rank-nullity holds for linear maps with finite-dimensional domain (Rank-nullity: ).
A linear subspace of a finite-dimensional vector space cannot have larger dimension than the ambient space (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
Proof
The image of is contained in , so . When , the defining sum for is empty and ; in general , which is again an SVD, so [L2] gives , with value when .
Let have rank at most , and put . If were injective, then [L3] applied to would force , but and [L4] gives , contradiction. Hence some unit vector satisfies .
Write that unit vector as . Then . Because , one has . Combined with step 1.1, this proves that is a best rank-at-most- approximation in operator norm.
The Rayleigh quotient of a nonzero vector for a self-adjoint endomorphism
Definition
Let be a finite-dimensional real inner product space, let be self-adjoint, and let be nonzero. The Rayleigh quotient of for is
Because for nonzero in an inner product space, this quotient is a well-defined real number.
Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces
Statement
Let be self-adjoint on an -dimensional real inner product space, and list its eigenvalues in weakly decreasing order:
Then for every ,
Facts & Assumptions
Given: A self-adjoint endomorphism of an -dimensional real inner product space.
A self-adjoint operator has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).
A subspace of an -dimensional vector space cannot have dimension greater than (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
Proof
By [L1], choose an orthonormal eigenbasis with . For every nonzero , one has , so on every Rayleigh quotient is at least and on every Rayleigh quotient is at most ; equality holds at in both cases.
Let have dimension . If , then , whose dimension is , contradicting [L2]. Thus some nonzero satisfies by step 1.1, so . Since step 1.1 also gives , the first Courant-Fischer equality follows.
Let have dimension . If , then , whose dimension is , contradicting [L2]. Thus some nonzero satisfies by step 1.1, so . Since step 1.1 also gives , the second Courant-Fischer equality follows.
The smallest and largest eigenvalues of a self-adjoint endomorphism are the minimum and maximum Rayleigh quotients
Statement
If is self-adjoint on a nonzero finite-dimensional real inner product space and its eigenvalues are ordered as
then
Facts & Assumptions
Given: A self-adjoint endomorphism on a nonzero finite-dimensional real inner product space.
Proof
Taking in [L1] gives , because every one-dimensional subspace consists of the nonzero scalar multiples of any one of its nonzero vectors.
Taking in [L1] gives for the same reason.
The eigenvalues of the orthogonal compression of a self-adjoint endomorphism to a hyperplane interlace those of the original endomorphism
Statement
Let be self-adjoint on an -dimensional real inner product space, let be a hyperplane, and let
be the orthogonal compression, where is the orthogonal projection onto . If the eigenvalues of and are ordered by
then
Facts & Assumptions
Given: A self-adjoint endomorphism on an -dimensional real inner product space, a hyperplane , and its orthogonal projection .
Every vector decomposes uniquely as a vector in plus a vector in (For a subspace of a finite-dimensional inner product space, , The orthogonal projection is the -component in ).
Courant-Fischer characterises the ordered eigenvalues of a self-adjoint operator by min-max formulas (Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces).
Proof
For , the decomposition in [L1] gives , so is self-adjoint on . Also for every nonzero .
For any , Courant-Fischer in and step 1.1 give , because the maximisation is over fewer -dimensional subspaces than in [L2]. Likewise , because is the subspace dimension appearing in Courant-Fischer for the -st eigenvalue of . Hence .
Weyl inequalities bound the eigenvalues of a sum of self-adjoint endomorphisms
Statement
Let be self-adjoint endomorphisms of an -dimensional real inner product space. Order the eigenvalues of , , and by
Then, for integers :
- If , then .
- If , then .
Facts & Assumptions
Given: Self-adjoint endomorphisms and of an -dimensional real inner product space.
Courant-Fischer characterises ordered eigenvalues by min-max formulas (Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces).
For finite-dimensional subspaces and , one has (The dimension formula: for finite-dimensional linear subspaces and of , the subspaces and are finite-dimensional and ).
Proof
Apply [L1] separately to and . There are subspaces of dimensions such that every nonzero vector in has Rayleigh quotient for at most and every nonzero vector in has Rayleigh quotient for at most ; likewise there are subspaces of dimensions such that every nonzero vector in them has Rayleigh quotient at least respectively.
If , then [L2] gives . Every nonzero in that intersection satisfies and , hence . Therefore by the min-over-subspaces form of [L1] for .
If , then [L2] gives . Every nonzero in that intersection satisfies and , hence . Therefore by the max-over-subspaces form of [L1] for .
The Gershgorin disks of an endomorphism with respect to an ordered basis
Definition
Let be a finite-dimensional complex vector space, let be linear, and let be an ordered basis. Write
For each , the -th Gershgorin disk of with respect to is
The union is the Gershgorin region of in the basis .
Every eigenvalue lies in some Gershgorin disk
Statement
Let be a linear endomorphism of a finite-dimensional complex vector space, and let be an ordered basis of . Every eigenvalue of lies in at least one Gershgorin disk .
Facts & Assumptions
Given: A finite-dimensional complex vector space , a linear endomorphism , an ordered basis , and the matrix .
An eigenvalue has a nonzero eigenvector with (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism).
The columns of are the coordinates of in the basis (Coordinate columns and matrices of linear maps relative to ordered bases).
Proof
Let be an eigenvalue. By [L1], choose a nonzero eigenvector , and write its coordinate column as . Choose with .
The -th row of the equation is , so . Taking absolute values and using the maximality of yields . Because , dividing by gives , so .
5 · Examples, counterexamples and false statements
None yet.
Sources
- Sheldon Axler, Linear Algebra Done Right, fourth edition
- Nicholas Hu, The Schur decomposition
- Meinolf Geck, On the Jordan-Chevalley decomposition of a matrix
- Joo Heon Yoo, The Jordan-Chevalley decomposition
- MIT 18.409, Lecture 3: Courant-Fischer and Rayleigh quotients
- Christoph Helmberg et al., An interlacing property of the signless Laplacian of threshold graphs