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.
Diagonalisation and the Minimal Polynomial
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- 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
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
An endomorphism of a finite-dimensional vector space has eigenvalues, eigenspaces and a characteristic polynomial whose root set is its spectrum, together with algebraic and geometric multiplicities, the geometric one never the larger; eigenvectors for distinct eigenvalues are linearly independent, polynomials may be evaluated at an endomorphism, and the published Cayley–Hamilton theorem shows the characteristic polynomial annihilates it. Over a field, is a principal ideal domain and a unique factorisation domain carrying Bézout's identity and monic greatest common divisors. A polynomial splits when it is a product of linear factors, the quotient by an irreducible adjoins a root, and the evaluation kernel of an algebraic element is generated by its minimal polynomial.
The page defines diagonalisability and the annihilator ideal of an endomorphism, proves that ideal is nonzero and principal, and normalises its generator to the minimal polynomial; representation and similarity invariance, invariance under field extension, , the description of the roots of over an extension field as eigenvalues, and equality of the irreducible factor sets of and follow. Invariance of polynomial kernels and images supports the coprime-kernel lemma, primary decomposition, primary projections as polynomials in the endomorphism, and the generalised-eigenspace decomposition when splits. From these come the eigenspace direct-sum criterion, the split-characteristic-polynomial and squarefree-minimal-polynomial criteria for diagonalisability, the consequences for idempotents and invariant restrictions, and the simultaneous diagonalisation of a pairwise commuting family of diagonalisable endomorphisms.
3 · Logical flowchart
4 · Definitions, theorems and proofs
A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation
Definition
Let be an endomorphism of a finite-dimensional vector space over a field . The endomorphism is diagonalisable over if has a basis consisting of eigenvectors of (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
Equivalently, is diagonalisable if some ordered basis makes its matrix diagonal (Coordinate columns and matrices of linear maps relative to ordered bases). The unique endomorphism of the zero space is diagonalisable: its empty ordered basis is a basis of eigenvectors and its matrix is diagonal.
The annihilator set ; once existence is proved, its unique monic generator is the minimal polynomial
Definition
Let be an endomorphism of a finite-dimensional vector space over . Its annihilator set is
where polynomial evaluation at is that of Polynomial evaluation at an endomorphism: .
Once The annihilator ideal is nonzero and has a unique monic generator; if and only if ↗ proves that this set is a nonzero principal ideal, the minimal polynomial of , denoted , is its unique monic generator (The ideal generated by a subset and principal ideals, Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree). Thus existence is not built into the definition. On the zero space, , so and .
The annihilator ideal is nonzero and has a unique monic generator; if and only if
Statement
For every endomorphism of a finite-dimensional -vector space, is a nonzero ideal of and has a unique monic generator . For every ,
For the zero space, .
Facts & Assumptions
Given: An endomorphism of a finite-dimensional vector space over a field , and the annihilator set of The annihilator set ; once existence is proved, its unique monic generator is the minimal polynomial.
For every field , every ideal of is principal (For every field , is a principal ideal domain).
Cayley–Hamilton states for every finite-dimensional endomorphism (Cayley-Hamilton: every finite-dimensional endomorphism satisfies its characteristic polynomial, ).
For the polynomial is monic of degree , and when ( is monic of degree ; for its coefficient is and its constant coefficient is , while ); and is by definition for any ordered basis , independently of the choice (The basis-independent characteristic polynomial of an endomorphism of a finite-dimensional space, including in dimension zero).
Every nonzero polynomial has a leading coefficient and is monic exactly when that coefficient is (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).
Proof
The zero polynomial lies in . If , then ; and if and , distributivity of the finite polynomial sums and associativity of composition give . Hence is an ideal.
By [L2], . Fix an ordered basis of the -dimensional ; by [L3], with , so is monic of degree and in particular nonzero. Thus the ideal is nonzero, including when , where .
If and are monic generators of this nonzero ideal, then and for some polynomials . Degrees force to be nonzero constants, and monicity forces both constants to be ; hence .
By [L1], write with . Multiplying by the inverse of its leading coefficient gives a monic generator by [L4], and step 1.3 shows that this monic generator is unique.
Finally, means , which is equivalent to for some , that is, . When , step 1.2 gives , so its monic generator is .
The minimal polynomial is unchanged by choosing a matrix representation or replacing a matrix by a similar one
Statement
Let be an endomorphism of a finite-dimensional vector space and let in an ordered basis . Then and have the same minimal polynomial. More generally, similar square matrices have the same minimal polynomial.
Facts & Assumptions
Given: An endomorphism , an ordered basis , its matrix , and square matrices with .
Similar matrices are exactly matrix representations of one endomorphism in different ordered bases (Similarity is an equivalence relation, and two matrices represent the same endomorphism in two bases exactly when they are similar).
The minimal polynomial is the unique monic generator of the annihilator ideal (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
The matrix of a linear map has as its columns the coordinate columns of the images of the domain basis vectors (Coordinate columns and matrices of linear maps relative to ordered bases).
Proof
By induction on , [L1] gives for every ; taking the same finite linear combination on both sides yields for every .
A linear map is zero exactly when its matrix in a basis is zero, so step 1.1 and [L4] give if and only if . The annihilator ideals coincide, hence their unique monic generators coincide by [L3].
If , induction gives , and therefore . Thus exactly when , so [L3] again gives . This also follows from [L2].
For a matrix over a field, extending the scalar field does not change its minimal polynomial
Statement
Let be a field extension and let . Whether is viewed over or over , its minimal polynomial is the same element of . This includes , when both minimal polynomials are .
Facts & Assumptions
Given: A field extension and a matrix .
A field extension identifies with a subfield of (Field extensions, generated subrings , generated subfields , and simple extensions).
A finite list is linearly independent when its only vanishing finite linear combination has all coefficients zero (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent).
The minimal polynomial is the least-degree monic annihilator, equivalently the unique monic generator of all annihilating polynomials (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Proof
Every polynomial over that annihilates still annihilates it over . Hence the -minimal polynomial divides the -minimal polynomial and has no larger degree.
Conversely, let be a nonzero annihilator of . Choose a maximal -linearly independent sublist from the finite list of nonzero coefficients ; maximality makes it span all the . Write with .
The equality holds entrywise. Since every entry of each inner matrix lies in and the are -independent, every matrix is zero. At least one corresponding polynomial is nonzero and has degree at most .
Applying step 2.1 to the -minimal polynomial gives a nonzero -annihilator of no larger degree. Thus the two minimal polynomials have equal degree; step 1.1 and monicity then force equality. For , [L3] gives over either field.
The minimal polynomial divides the characteristic polynomial,
Statement
For every endomorphism of a finite-dimensional vector space,
Facts & Assumptions
Given: A finite-dimensional endomorphism with minimal polynomial and characteristic polynomial (The basis-independent characteristic polynomial of an endomorphism of a finite-dimensional space, including in dimension zero).
Cayley–Hamilton states (Cayley-Hamilton: every finite-dimensional endomorphism satisfies its characteristic polynomial, ).
A polynomial annihilates if and only if it is divisible by (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Proof
By [L1], annihilates .
Therefore [L2] gives . In dimension zero both polynomials are , and the same argument applies.
Over every extension field, a scalar is an eigenvalue of the extended matrix exactly when it is a root of the minimal polynomial
Statement
Let , let be a field extension, and let . Then is an eigenvalue of the matrix acting on if and only if
where is the minimal polynomial over . For , both sets are empty.
Facts & Assumptions
Given: A field extension , a matrix , and .
Extending the scalar field does not change the minimal polynomial of (For a matrix over a field, extending the scalar field does not change its minimal polynomial).
The minimal polynomial divides the characteristic polynomial (The minimal polynomial divides the characteristic polynomial, ).
Over any field, a scalar is an eigenvalue exactly when it is a root of the characteristic polynomial (For every finite-dimensional space, is exactly the set of roots in of ).
Polynomial evaluation is (Polynomial evaluation at an endomorphism: ).
Proof
Suppose for some nonzero . Induction gives , so [L4] gives for every . Taking and using [L1] yields , hence .
Conversely, if , then [L2] gives . The determinant formula for is unchanged after embedding in , so [L3] applied over says is an eigenvalue of on .
When , by [L1], so it has no roots, while the zero space has no nonzero eigenvector.
The minimal and characteristic polynomials have exactly the same monic irreducible factors
Statement
Let be an endomorphism of a finite-dimensional vector space over . A monic irreducible polynomial in divides if and only if it divides . Thus and have exactly the same monic irreducible factors, though generally with different exponents.
Facts & Assumptions
Given: A finite-dimensional endomorphism and a monic irreducible polynomial .
The minimal polynomial divides the characteristic polynomial (The minimal polynomial divides the characteristic polynomial, ).
For monic irreducible , the quotient is a field extension containing with ( for monic irreducible is a field extension containing the root with unique reduced representatives).
Extending scalars from to leaves the minimal polynomial unchanged (For a matrix over a field, extending the scalar field does not change its minimal polynomial).
A scalar is an eigenvalue exactly when it is a root of the characteristic polynomial (For every finite-dimensional space, is exactly the set of roots in of ).
If is algebraic over , the kernel of evaluation at is generated by its unique monic irreducible minimal polynomial, and exactly when that polynomial divides (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Polynomial evaluation at an endomorphism is for (Polynomial evaluation at an endomorphism: ).
An endomorphism and its matrix in any ordered basis have the same minimal polynomial; in particular, this polynomial is invariant under changing the basis (The minimal polynomial is unchanged by choosing a matrix representation or replacing a matrix by a similar one).
In any ordered basis, the characteristic polynomial of an endomorphism is the characteristic polynomial of its representing matrix, independently of the chosen basis (The basis-independent characteristic polynomial of an endomorphism of a finite-dimensional space, including in dimension zero).
Proof
If , then [L1] immediately gives .
Conversely suppose . Choose an ordered basis of , let be the matrix of , and form and as in [L2]. Since , also ; by [L8] this is the characteristic polynomial of , whose determinant formula is unchanged after scalar extension. Thus [L4] applied to the resulting endomorphism of gives a nonzero -eigenvector with eigenvalue .
By [L7], has minimal polynomial , and [L3] says its scalar extension has the same minimal polynomial. Applying [L6] to the eigenvector from step 1.2 gives .
The monic irreducible minimal polynomial of divides because , and it is nonconstant; irreducibility of makes it equal to . Now [L5] and step 2.1 give .
Steps 1.1 and 3.1 prove both directions. In the zero-dimensional case , so neither has an irreducible factor.
For every polynomial , both and are -invariant
Statement
Let be an endomorphism and . Both and are invariant under .
Facts & Assumptions
Given: An endomorphism and a polynomial .
Polynomial evaluation is , with and (Polynomial evaluation at an endomorphism: ).
Proof
By [L1] and associativity of composition, .
If , then , so .
If , write ; then by step 1.1, so .
The minimal polynomial of a restriction to an invariant subspace divides the original minimal polynomial
Statement
Let be a -invariant subspace of a finite-dimensional vector space. Then the restriction satisfies
Facts & Assumptions
Given: A finite-dimensional endomorphism and a -invariant subspace .
A polynomial annihilates an endomorphism exactly when it is divisible by that endomorphism's minimal polynomial (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Proof
Invariance makes an endomorphism of , and for every polynomial one has by induction on powers.
Since , step 1.1 gives . Applying [L1] to yields . This includes , where .
If and , then
Statement
Let be an endomorphism and let satisfy and . Then
Facts & Assumptions
Given: An endomorphism and coprime polynomials with .
If , Bézout's identity supplies with (Bézout identity and the Euclidean algorithm for polynomials over a field, The monic greatest common divisor of two polynomials over a field).
For two subspaces, means and (Internal direct sum : the sum is everything and each summand meets the sum of the others only in ).
Polynomial evaluation sends to , with (Polynomial evaluation at an endomorphism: ).
Proof
Choose as in [L1]. Evaluating the identity gives .
For , write . The first summand lies in and the second in because polynomial evaluations commute and . Thus the two kernels span .
If lies in both kernels, step 1.1 gives . Hence their intersection is zero, and [L2] proves the direct sum. Unit factors and the zero space satisfy the same calculation.
Primary components and generalised eigenspaces
Definition
Let be an endomorphism. For an irreducible polynomial and an integer , the subspace
is the -primary component of when is the corresponding factor of .
Here uses polynomial evaluation at an endomorphism (Polynomial evaluation at an endomorphism: ).
For , the generalised eigenspace of exponent is
Its first term is the ordinary eigenspace (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism). These kernels are -invariant by For every polynomial , both and are -invariant.
Primary decomposition: the irreducible-power factors of split into their invariant kernels
Statement
Let be an endomorphism of a finite-dimensional vector space over , and factor its minimal polynomial in the UFD as
where the are distinct monic irreducibles and . Then the subspaces are -invariant and
Moreover, the minimal polynomial of is exactly . If , then and this is the empty direct sum.
Facts & Assumptions
Given: A finite-dimensional endomorphism and the displayed irreducible factorisation of .
Every polynomial ring over a field is a unique factorisation domain (For every field , is a unique factorisation domain).
If coprime satisfy , then (If and , then ).
A polynomial annihilates an endomorphism exactly when it is divisible by its minimal polynomial (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Proof
By [L1], the distinct powers are pairwise coprime. Since , repeated application of [L2] gives .
Each summand is -invariant because commutes with . The restriction is annihilated by , so [L3] gives .
Suppose for some that is a proper divisor of . Put . On , the first factor annihilates; on with , the factor annihilates. Step 1.1 therefore gives .
The polynomial has smaller degree than and so cannot be divisible by , contradicting [L3]. Hence by monicity. If , then , [L3] gives , and , which is precisely the empty direct sum.
Each projection in the primary decomposition is a polynomial in the endomorphism
Statement
In the primary decomposition associated with , the projection along the other primary components is a polynomial in . More precisely, if and , then
Facts & Assumptions
Given: The primary decomposition and the polynomials in the Statement.
The irreducible-power factors of give the direct sum (Primary decomposition: the irreducible-power factors of split into their invariant kernels).
Coprime polynomials satisfy a Bézout identity (Bézout identity and the Euclidean algorithm for polynomials over a field).
Polynomial evaluation sends to the endomorphism (Polynomial evaluation at an endomorphism: ).
Proof
The polynomials and are coprime, so choose with by [L2], and set using [L3].
On the evaluated Bézout identity gives . On for , the polynomial is divisible by , so .
By the unique decomposition in [L1], the operator described in step 2.1 is exactly projection onto along the sum of the other components.
If the minimal polynomial splits, is the direct sum of the stabilised generalised eigenspaces
Statement
Let be an endomorphism of a finite-dimensional vector space over an arbitrary field ; finite-dimensionality is what makes available at all, the minimal polynomial being defined only in that case. Suppose its minimal polynomial splits over as
with distinct and . Then
For every , , so these are the stabilised generalised eigenspaces. The zero space corresponds to the empty product and empty direct sum.
Facts & Assumptions
Given: The displayed split factorisation of over .
A nonzero polynomial splits over when it is a product of linear factors in , with repetitions allowed (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
For an endomorphism of a finite-dimensional space, the irreducible-power factors of its minimal polynomial give a direct sum of their invariant kernels, and each restriction has exactly the corresponding factor as minimal polynomial (Primary decomposition: the irreducible-power factors of split into their invariant kernels).
Coprime polynomials satisfy a Bézout identity (Bézout identity and the Euclidean algorithm for polynomials over a field).
The generalised eigenspace of exponent is (Primary components and generalised eigenspaces ).
Proof
By [L1], the irreducible factors are the distinct linear polynomials . Applying [L2] gives the displayed direct sum, and [L4] identifies its -th summand with .
Fix and . The kernel of contains the -th summand. On every other primary summand, is coprime to ; evaluating a Bézout identity from [L3] shows is invertible there. Hence its kernel contains no vector from the other summands.
Thus the kernel at every is exactly . If the factorisation is empty, [L2] gives .
An endomorphism is diagonalisable exactly when for some finite list of distinct scalars
Statement
An endomorphism of a finite-dimensional -vector space is diagonalisable if and only if there are distinct scalars such that
For , take the empty list of scalars.
Facts & Assumptions
Given: A finite-dimensional endomorphism .
Diagonalisability means that has a basis of eigenvectors (A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation).
An eigenspace is (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism).
means together with for every (Internal direct sum : the sum is everything and each summand meets the sum of the others only in ).
Every subspace of a finite-dimensional vector space is finite-dimensional and has a basis (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
Proof
Suppose is diagonalisable and fix an eigenbasis. Only finitely many eigenvalues occur among its finitely many vectors; group the basis vectors by those distinct eigenvalues. If is expanded in the eigenbasis, comparing the coefficients in forces every coefficient at a basis vector with eigenvalue different from to vanish. Thus the group carrying is a basis of . The groups exhaust the eigenbasis, so the eigenspaces sum to ; and a nonzero lying in the sum of the other eigenspaces would have one eigenbasis expansion supported on the -group and another supported off it, contradicting uniqueness of coordinates in a basis. Both conditions of [L3] therefore hold.
Conversely, suppose the displayed direct sum holds. Choose a basis of each eigenspace using [L4] and concatenate the finite lists. The first condition of [L3] makes the concatenation spanning. It is independent: in a vanishing combination, group the terms by eigenspace, so each group sums to a vector of its and one such vector equals minus the sum of the others; the second condition of [L3] forces every group to sum to , and independence inside each chosen basis then kills every coefficient. So it is a basis of eigenvectors and [L1] makes diagonalisable.
The two constructions prove both implications. When , the empty basis and empty direct sum satisfy them.
An endomorphism is diagonalisable if and only if its characteristic polynomial splits and every eigenvalue's geometric multiplicity equals its algebraic multiplicity
Statement
Let be an endomorphism of a finite-dimensional vector space over . Then is diagonalisable if and only if splits over and, for every eigenvalue ,
The assertion includes the zero-dimensional case, where and the multiplicity condition is vacuous.
Facts & Assumptions
Given: A finite-dimensional endomorphism .
The algebraic multiplicity is the exponent of in , and the geometric multiplicity is (Algebraic multiplicity as the exponent of in , and geometric multiplicity as ).
An endomorphism is diagonalisable exactly when its distinct eigenspaces have direct sum (An endomorphism is diagonalisable exactly when for some finite list of distinct scalars ).
Eigenvectors belonging to distinct eigenvalues are linearly independent (Eigenvectors belonging to pairwise distinct eigenvalues are linearly independent).
A split polynomial is a product of linear factors, with repetitions allowed (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
In any ordered basis, is the characteristic polynomial of the representing matrix, independently of the chosen basis (The basis-independent characteristic polynomial of an endomorphism of a finite-dimensional space, including in dimension zero).
The characteristic polynomial of an endomorphism on an -dimensional space is monic of degree , and it is for ( is monic of degree ; for its coefficient is and its constant coefficient is , while ).
For , the determinant of a triangular matrix in over a commutative ring is the product of its diagonal entries (The determinant of a triangular matrix is the product of its diagonal entries).
For an endomorphism of a finite-dimensional space, (For every finite-dimensional space, is exactly the set of roots in of ).
Proof
Suppose is diagonalisable and , and choose an eigenbasis. Its matrix is diagonal, so is triangular of positive size and [L5] and [L7] show that is the product of over the diagonal entries. For each , the basis vectors carrying that diagonal entry form a basis of ; hence their number is both multiplicities in [L1].
Conversely, suppose splits and the multiplicities agree. By [L8] the roots of in are exactly the eigenvalues of , so by [L4] the sum of the algebraic multiplicities of the eigenvalues is the degree of , and [L6] identifies that degree with . Hence the sum of the dimensions of the distinct eigenspaces is .
Choose a basis of each eigenspace. By [L3] their concatenation is independent, and step 1.2 says it has vectors, so it is a basis. Therefore [L2] makes diagonalisable.
Steps 1.1 and 2.1 prove the equivalence when . If , the empty basis is an eigenbasis, so is diagonalisable by [L2]; [L6] gives , which splits as an empty product by [L4]; and has no eigenvalue, so the multiplicity condition holds vacuously. Both sides therefore hold, which proves the equivalence in every finite dimension.
An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors
Statement
An endomorphism of a finite-dimensional vector space over is diagonalisable if and only if
for a finite list of distinct scalars . For the zero space this is the empty product .
Facts & Assumptions
Given: A finite-dimensional endomorphism .
A polynomial annihilates exactly when it is divisible by (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
If , then (Polynomial evaluation at an endomorphism: ).
For a polynomial over a field, exactly when divides (Factor theorem over a commutative ring).
Irreducible-power factors of give the primary direct-sum decomposition (Primary decomposition: the irreducible-power factors of split into their invariant kernels).
Diagonalisability is equivalent to being a direct sum of eigenspaces (An endomorphism is diagonalisable exactly when for some finite list of distinct scalars ).
Proof
Suppose is diagonalisable, and let be its distinct eigenvalues. On an eigenbasis the polynomial vanishes entrywise, so and [L1] gives .
Conversely, suppose is the displayed product of distinct linear factors. In [L4] every exponent is one, so its primary summands are . Thus is their direct sum, and [L5] makes diagonalisable.
For each , choose a nonzero eigenvector for . Formula [L2] and induction give ; the left side is zero by [L1], so . By [L3], every distinct factor of divides . Together with step 1.1 and monicity, this gives .
Steps 2.1 and 1.2 prove both directions. When , the empty basis gives by [L1].
A characteristic polynomial that splits into distinct linear factors forces diagonalisability
Statement
If the characteristic polynomial of a finite-dimensional endomorphism splits over into distinct linear factors, then the endomorphism is diagonalisable over .
Facts & Assumptions
Given: An endomorphism whose characteristic polynomial is a product of distinct linear factors over .
The minimal polynomial divides the characteristic polynomial (The minimal polynomial divides the characteristic polynomial, ).
An endomorphism is diagonalisable exactly when its minimal polynomial is a product of distinct linear factors (An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors).
Splitting means factorisation into linear factors over the stated field, with repetitions allowed (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
The polynomial ring over a field is a unique factorisation domain (For every field , is a unique factorisation domain).
Proof
By [L1], is a monic divisor of the split squarefree polynomial . Unique factorisation from [L4] and the meaning of splitting in [L3] therefore make a product of a subset of the same distinct linear factors.
Apply [L2] to step 1.1. The zero-dimensional case has and is included.
Every idempotent endomorphism is diagonalisable and is projection onto its image along its kernel
Statement
If an endomorphism of a finite-dimensional vector space satisfies , then it is diagonalisable and
Under this decomposition, is projection onto along .
Facts & Assumptions
Given: An idempotent endomorphism , so .
For an endomorphism of a finite-dimensional space, a polynomial annihilates exactly when it is divisible by (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
For an endomorphism of a finite-dimensional space, having a product of distinct linear factors as minimal polynomial is equivalent to diagonalisability (An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors).
For two subspaces, a direct sum is a spanning sum with zero intersection (Internal direct sum : the sum is everything and each summand meets the sum of the others only in ).
The polynomial ring over a field is a unique factorisation domain (For every field , is a unique factorisation domain).
Proof
The identity says annihilates , so [L1] gives . By unique factorisation [L4], this monic divisor is a product of a subset of the two distinct irreducibles and ; [L2] therefore makes diagonalisable.
Every has , where and . Hence the image and kernel span .
If , write and compute . Thus [L3] and step 1.2 give the direct sum, and is identity on its image and zero on its kernel. The cases and are included.
The restriction of a diagonalisable endomorphism to an invariant subspace is diagonalisable
Statement
If is diagonalisable and is -invariant, then the restriction is diagonalisable.
Facts & Assumptions
Given: A diagonalisable endomorphism and a -invariant subspace .
The minimal polynomial of divides (The minimal polynomial of a restriction to an invariant subspace divides the original minimal polynomial).
Diagonalisability is equivalent to the minimal polynomial being a product of distinct linear factors (An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors).
A polynomial splits over when it factors into linear factors over (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
The polynomial ring over a field is a unique factorisation domain (For every field , is a unique factorisation domain).
Proof
By [L2], is split and squarefree. By [L1], is a monic divisor of it, so unique factorisation [L4] and the meaning of splitting in [L3] make the restriction polynomial split and squarefree as well.
Apply the reverse implication of [L2] to . This includes , whose minimal polynomial is .
Simultaneous diagonalisability: one basis that diagonalises every endomorphism in a family
Definition
A family of endomorphisms of a finite-dimensional vector space is simultaneously diagonalisable if there is one ordered basis of in which the matrix of every is diagonal. Equivalently, has a basis consisting of vectors that are eigenvectors for every member of , matching the one-operator definition in A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation.
The empty family is simultaneously diagonalisable in every finite-dimensional space: any ordered basis works. On the zero space the empty ordered basis works for every family.
Commuting endomorphisms preserve each other's eigenspaces
Statement
If endomorphisms commute, then for every scalar .
Facts & Assumptions
Given: Endomorphisms with , a scalar , and .
The eigenspace is , including the zero vector (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism).
Proof
Since , commutation gives .
Therefore by [L1], whether or not is zero.
A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise
Statement
Let be a family of diagonalisable endomorphisms of a finite-dimensional vector space. Then is simultaneously diagonalisable if and only if its members commute pairwise.
Facts & Assumptions
Given: A family of diagonalisable endomorphisms of a finite-dimensional space .
Commuting endomorphisms preserve each other's eigenspaces (Commuting endomorphisms preserve each other's eigenspaces).
The restriction of a diagonalisable endomorphism to an invariant subspace is diagonalisable (The restriction of a diagonalisable endomorphism to an invariant subspace is diagonalisable).
The space is finite-dimensional, with dimension ( and for finite-dimensional ).
is the intersection of all subspaces containing , hence the smallest such subspace (Linear combination of a finite list, and the span as the smallest linear subspace containing ); and , the set of finite linear combinations of elements of ( is exactly the set of linear combinations of finite lists of elements of , and ).
A diagonalisable endomorphism's distinct eigenspaces have direct sum equal to the whole space (An endomorphism is diagonalisable exactly when for some finite list of distinct scalars ).
Simultaneous diagonalisability means that one basis diagonalises every member of the family (Simultaneous diagonalisability: one basis that diagonalises every endomorphism in a family).
Proof
First suppose is finite and pairwise commuting. Induct on its size. For the empty family any basis works. For a nonempty family, choose one member . Its eigenspaces have direct sum by [L5]; by [L1] every remaining member preserves each eigenspace, and by [L2] every restriction is diagonalisable. Applying the induction hypothesis within each eigenspace and concatenating the resulting bases gives one common eigenbasis.
For an arbitrary pairwise commuting family, [L3] makes finite-dimensional. Choose a finite basis of ; by [L4], each basis vector is a finite linear combination of members of . The union of the finitely many supports is a finite subfamily spanning .
Conversely, if one basis diagonalises every member of as in [L6], then every pair is represented by diagonal matrices, which commute. The represented endomorphisms therefore commute.
Step 1.1 gives a common eigenbasis for . Every member of lies in its span, so it is represented by a linear combination of diagonal matrices in that basis and is diagonal too. Hence [L6] makes simultaneously diagonalisable.
Steps 2.1 and 1.3 prove both directions, including empty families and the zero space.
If two commuting endomorphisms are diagonalisable, then every finite linear combination of products of their powers is diagonalisable; in particular, their sum and product are diagonalisable
Statement
Let be commuting diagonalisable endomorphisms. Every endomorphism of the form
with and is diagonalisable. In particular, and are diagonalisable.
Facts & Assumptions
Given: Commuting diagonalisable endomorphisms and the displayed finite polynomial expression.
A pairwise commuting family of diagonalisable endomorphisms has a common eigenbasis (A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise).
Proof
By [L1], choose a basis in which both and are diagonal. Every power, product of powers, and finite linear combination in the Statement remains diagonal in that same basis.
Thus every displayed expression is diagonalisable. Taking the expressions and gives the stated special cases; the empty sum and zero space cause no exception.
The algebra generated by an endomorphism is isomorphic to
Statement
For an endomorphism of a finite-dimensional -vector space, the evaluation map induces an -algebra isomorphism
Facts & Assumptions
Given: An endomorphism and polynomial evaluation .
Polynomial evaluation sends to (Polynomial evaluation at an endomorphism: ).
Its annihilating polynomials form the ideal (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
The first isomorphism theorem for rings gives (First isomorphism theorem for rings: ).
Proof
The finite-sum definition in [L1] gives , , and , so evaluation is an -algebra homomorphism. Its image is by definition, and [L2] identifies its kernel with .
Apply [L3] to step 1.1. On the zero space , and both and the zero endomorphism algebra are the one-element ring.
5 · Examples, counterexamples and false statements
None yet.
Sources
Standard references
Recommended treatments; not extraction sources.
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §§5A–5B
- Keith Conrad, The Minimal Polynomial and Some Applications, §§4–5
- Keith Conrad, The Minimal Polynomial and Some Applications, §4
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §5B
- Keith Conrad, The Minimal Polynomial and Some Applications, §4, Theorem 4.4
- Keith Conrad, The Minimal Polynomial and Some Applications, §4, Theorem 4.3
- Keith Conrad, Potential Diagonalizability, Theorem 4(1)
- Keith Conrad, The Minimal Polynomial and Some Applications, Corollary 4.10
- Sheldon Axler, Linear Algebra Done Right, 4th ed., Theorem 8.30
- Keith Conrad, The Minimal Polynomial and Some Applications, Theorem 4.7
- Anthony W. Knapp, Basic Algebra, 2nd ed., Ch. V, §5
- Keith Conrad, The Minimal Polynomial and Some Applications, §5, Lemma 5.1
- Anthony W. Knapp, Basic Algebra, 2nd ed., Ch. V, §5, proof of Theorem 5.19
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §§8A–8B
- Anthony W. Knapp, Basic Algebra, 2nd ed., Ch. V, §5, Theorem 5.19
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §8B, Theorem 8.22 (complex-field special case)
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §5D
- Keith Conrad, The Minimal Polynomial and Some Applications, Theorem 4.11
- Anthony W. Knapp, Basic Algebra, 2nd ed., Ch. V, §3, Theorem 5.14
- Keith Conrad, The Minimal Polynomial and Some Applications, Corollary 4.14
- Keith Conrad, The Minimal Polynomial and Some Applications, §5
- Keith Conrad, The Minimal Polynomial and Some Applications, Theorem 5.2 and Corollary 5.4
- Keith Conrad, The Minimal Polynomial and Some Applications, Corollary 5.5
- Keith Conrad, The Minimal Polynomial and Some Applications, closing observation in §4