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.
Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
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
- Diagonalisation and the Minimal Polynomial
- 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
- 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
This page first builds the quotient-vector-space machinery missing from the published linear-map page: well-defined operations and projection, lifted bases, the universal property, the first isomorphism theorem, and restriction and quotient operators on invariant subspaces. It then characterises upper triangular form by complete invariant flags, proves that an operator is triangularisable exactly when its minimal or characteristic polynomial splits, and treats simultaneous triangularisation, nilpotent operators, stabilised kernels and images, and Jordan-string bases.
The second half constructs Jordan canonical form from the generalised
eigenspace decomposition and proves its uniqueness rather than merely asserting
it. For each eigenvalue, the ranks of the powers of T-lambda I recover the
number of blocks of every size, which yields the similarity classification.
The page closes with cyclic subspaces and vector annihilators, a primary-
component proof that some vector realises the minimal polynomial, the criterion
that a cyclic vector exists exactly when the minimal and characteristic
polynomials agree, and the polynomial description of the commutant of a cyclic
operator.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The quotient vector space and its canonical projection
Definition
Let be a vector space over a field and let be a linear subspace of (Vector space over a field, Linear subspace of a vector space). For , the coset of represented by is The quotient set is . Its addition and scalar multiplication are The resulting vector space is the quotient vector space of by . The canonical projection is The independence of the displayed operations from their representatives, the vector-space axioms, and the linearity and kernel of are established in Coset equality, well-defined quotient operations, and the canonical projection with kernel ↗.
Remarks
Quotient spaces enter this development because the reverse triangularisation argument descends an operator from to the quotient by an invariant eigenline . The quotient removes that line while retaining the induced linear action needed for induction.
Coset equality, well-defined quotient operations, and the canonical projection with kernel
Statement
Let be a vector space over and let . For the cosets of The quotient vector space and its canonical projection satisfy The operations on in The quotient vector space and its canonical projection are independent of the chosen representatives and make a vector space over . The canonical projection is a surjective linear map and
Facts & Assumptions
Given: A vector space over , a linear subspace , and the cosets and operations displayed in The quotient vector space and its canonical projection.
For the coset of represented by is , and the proposed operations are and (The quotient vector space and its canonical projection).
A linear subspace of satisfies (W1) , (W2) implies , and (W3) and imply (Linear subspace of a vector space).
A map is linear when it preserves all linear combinations: (Linear map between vector spaces over the same field).
Proof
Suppose . By (W1) of [L2] we have , so , giving with and hence . Conversely suppose . For , and by (W2), so ; since by (W3), the same argument gives . Hence exactly when .
Let and . By step 1.1, and , so by (W2) and by (W3). Applying step 1.1 in the converse direction gives and , so both quotient operations are independent of representatives.
The vector-space identities in follow by applying the corresponding identities in to representatives, with zero coset and inverse ; moreover by [L1] and [L3], every coset is by definition, and by step 1.1 exactly when , so is linear and surjective with .
A quotient basis lifts to a basis adapted to
Statement
Let be finite-dimensional, let , let be an ordered basis of , and let be an ordered basis of . Then is an ordered basis of . Consequently,
Facts & Assumptions
Given: The spaces, bases, and representatives in the Statement.
The canonical projection is linear and surjective with kernel (Coset equality, well-defined quotient operations, and the canonical projection with kernel ).
A basis is a linearly independent spanning family, with the empty family a basis exactly for the zero space (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
The dimension of a finite-dimensional vector space is the size of any finite basis, and the zero space has dimension (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
Proof
If , applying gives ; independence of the quotient basis forces every , and independence of the basis of then forces every .
For , expand ; then and is a combination of the , so the displayed independent family spans and is a basis; counting its members gives , including , , and .
Universal property of the quotient vector space
Statement
Let be linear and let satisfy . There is a unique linear map such that It is given by .
Facts & Assumptions
Given: A linear map and a subspace .
exactly when , the operations on make it a vector space over , and the canonical projection is a surjective linear map with (Coset equality, well-defined quotient operations, and the canonical projection with kernel ).
For a linear map , its kernel is (Kernel and image of a linear map).
The quotient operations are and , and the canonical projection is (The quotient vector space and its canonical projection).
Proof
Define ; if , then by [L1], so by [L2] and the linearity of , giving , and is well defined; the operation formulas of [L3] then give , so is linear.
The definition gives , hence ; if also satisfies , then every coset is and , so , including the cases and .
First isomorphism theorem for vector spaces: is isomorphic to
Statement
For every linear map , the formula defines a linear isomorphism .
Facts & Assumptions
Given: A linear map .
A linear map whose kernel contains a subspace factors uniquely through by (Universal property of the quotient vector space).
The image of a linear map is a linear subspace, and a linear map is injective exactly when its kernel is the zero subspace (The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial).
Proof
Apply [L1] with and codomain restricted to to obtain the linear map ; it is surjective by the definition of .
Its kernel consists of cosets with , hence only the zero coset ; [L2] makes injective, so it is an isomorphism, including the zero map and the zero-space case.
Remarks
For finite-dimensional , taking dimensions in this isomorphism gives , the equality recorded independently as Rank-nullity: . This is an agreement record, not a premise in the proof above.
Invariant subspaces, restrictions, and induced quotient operators
Definition
Let be an endomorphism. A linear subspace is -invariant when . For such a , the restriction of to is The operator induced by on the quotient is the map where is the quotient of The quotient vector space and its canonical projection. Its well-definedness, linearity, and relation to the canonical projection are proved in Invariance makes the induced quotient operator well defined and linear, with ↗.
Invariance makes the induced quotient operator well defined and linear, with
Statement
Let be linear and let be -invariant. Then is a well-defined linear endomorphism of , and the canonical projection satisfies
Facts & Assumptions
Given: An endomorphism and a -invariant subspace .
-invariance means , and the proposed induced map is (Invariant subspaces, restrictions, and induced quotient operators).
exactly when ; the operations on are independent of the chosen representatives and make a vector space over ; and is a surjective linear map with (Coset equality, well-defined quotient operations, and the canonical projection with kernel ).
The quotient operations are and , and the canonical projection is (The quotient vector space and its canonical projection).
Proof
If , then , so and therefore ; thus is well defined.
For scalars , the operations of [L3] give , so by [L1] and the linearity of , , and is linear; also proves ; the same calculation covers , , and .
Polynomial evaluation commutes with restriction and invariant quotients
Statement
Let be an endomorphism of a finite-dimensional vector space and let be -invariant. For every , Consequently, the minimal polynomials of and both divide .
Facts & Assumptions
Given: A finite-dimensional -vector space , an endomorphism , a -invariant subspace , and .
The induced quotient endomorphism is linear and satisfies (Invariance makes the induced quotient operator well defined and linear, with ).
Polynomial evaluation is , with and only finitely many nonzero coefficients (Polynomial evaluation at an endomorphism: ).
For a finite-dimensional endomorphism , exactly when divides , and on the zero space (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
For an invariant , maps to itself and (Invariant subspaces, restrictions, and induced quotient operators).
Proof
Induction on gives and , beginning with the identity at and using [L1] at the successor step; summing with the coefficients of yields both displayed identities.
Taking makes , so step 1.1 gives and ; [L3] then gives and , including , , and .
For invariant ,
Statement
Let be an endomorphism of a finite-dimensional vector space, and let be -invariant. Then where is the endomorphism induced on .
Facts & Assumptions
Given: A finite-dimensional -vector space , an endomorphism , and a -invariant subspace .
Invariance defines the restriction and the quotient formula (Invariant subspaces, restrictions, and induced quotient operators).
A basis of followed by representatives of a basis of is a basis of (A quotient basis lifts to a basis adapted to ).
A block upper-triangular matrix with diagonal blocks has characteristic polynomial , including zero-sized blocks (The characteristic polynomial of a block upper- or lower-triangular matrix is the product of the characteristic polynomials of its diagonal blocks).
The characteristic polynomial of an endomorphism is the basis-independent characteristic polynomial of any representing matrix, and it is on the zero space (The basis-independent characteristic polynomial of an endomorphism of a finite-dimensional space, including in dimension zero).
The formula is well defined and linear (Invariance makes the induced quotient operator well defined and linear, with ).
Proof
Choose an ordered basis of , a basis of , and representatives of the latter; [L2] gives an adapted basis of , in which invariance makes the matrix of block upper triangular, with upper-left block representing and lower-right block representing the well-defined operator .
Applying [L3] to that matrix and then [L4] to identify its diagonal-block polynomials gives ; if , , or , the missing block has characteristic polynomial , so the same identity remains valid.
Triangularisable endomorphisms and simultaneous triangularisability
Definition
Let be a finite-dimensional vector space over . An endomorphism is triangularisable over when some ordered basis makes upper triangular (Coordinate columns and matrices of linear maps relative to ordered bases).
A family of endomorphisms of is simultaneously triangularisable over when one ordered basis makes upper triangular for every . The empty family is simultaneously triangularisable in every ordered basis, including the empty basis of the zero space.
Complete invariant flags are equivalent to upper-triangular matrices
Statement
Let be an ordered basis of , and put , with . Then is upper triangular if and only if every is -invariant. Equivalently, upper-triangular bases are exactly the bases adapted to complete invariant flags
Facts & Assumptions
Given: An endomorphism and an ordered basis .
Triangularisability means that the matrix of in some ordered basis is upper triangular (Triangularisable endomorphisms and simultaneous triangularisability).
A subspace is -invariant when (Invariant subspaces, restrictions, and induced quotient operators).
The -th matrix column is the coordinate column of in the ordered basis (Coordinate columns and matrices of linear maps relative to ordered bases).
Proof
If the matrix is upper triangular, its -th column has no nonzero entry below row , so ; linearity then gives for every .
Conversely, if every is invariant, then , so the -th matrix column has zero entries below row and the matrix is upper triangular; the statements include the empty flag for and the flag in dimension one.
is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits
Statement
Let be an endomorphism of a finite-dimensional vector space over . The following are equivalent:
- is triangularisable over ;
- the minimal polynomial is a product of linear factors in ;
- the characteristic polynomial is a product of linear factors in .
For , both polynomials are , the empty product, and the empty basis triangularises .
Facts & Assumptions
Given: A finite-dimensional -vector space and an endomorphism .
An ordered basis gives an upper-triangular matrix exactly when its initial spans form a complete invariant flag (Complete invariant flags are equivalent to upper-triangular matrices).
For a -invariant subspace , (For invariant , ).
A monic irreducible polynomial divides if and only if it divides (The minimal and characteristic polynomials have exactly the same monic irreducible factors).
The eigenvalues of over are exactly the roots in of (For every finite-dimensional space, is exactly the set of roots in of ).
A basis of a subspace followed by representatives of a quotient basis is a basis of the whole space (A quotient basis lifts to a basis adapted to ).
Proof
If is triangularisable, then is upper triangular and its determinant is the product of its diagonal entries , so splits; by [L3], splits exactly when splits.
If , the empty basis and the polynomial give all three conditions.
Assume , that splits, and that the reverse implication holds in smaller dimensions; choose a root of , then [L4] supplies a nonzero eigenvector , and is a one-dimensional invariant subspace.
By [L2], , so splits; the induction hypothesis triangularises on , and [L5] lifts its triangular basis after to a basis whose initial spans are -invariant, so [L1] triangularises .
Step 1.1 gives , while steps 1.2-2.1 give in every finite dimension, completing all three equivalences.
Every finite-dimensional endomorphism over an algebraically closed field is triangularisable
Statement
Let be algebraically closed. Every endomorphism of a finite-dimensional -vector space is triangularisable over .
Facts & Assumptions
Given: An algebraically closed field , a finite-dimensional -vector space , and an endomorphism .
An endomorphism is triangularisable exactly when its characteristic polynomial splits into linear factors over its base field ( is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits).
In an algebraically closed field, every nonconstant polynomial has a root in the field (An algebraically closed field: every nonconstant polynomial has a root in the field).
If over a commutative ring, then divides (Factor theorem over a commutative ring).
Proof
A monic polynomial of degree is , hence is the empty product of linear factors.
Let be monic of positive degree and assume every monic polynomial of smaller degree splits; [L2] gives a root , and [L3] writes with monic of degree one less, so the induction hypothesis makes , and therefore , split.
Apply steps 1.1-1.2 to the monic polynomial ; it splits over , so [L1] triangularises , with covered by the degree-zero base case.
A commuting split family is simultaneously triangularisable
Statement
Let be a family of pairwise commuting endomorphisms of a finite-dimensional -vector space . If splits over for every , then is simultaneously triangularisable. The family may be empty.
Facts & Assumptions
Given: A finite-dimensional -vector space and a pairwise commuting family such that every splits over .
An endomorphism whose characteristic polynomial splits is triangularisable ( is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits).
If is invariant under , then (For invariant , ).
A basis is upper triangular for an operator exactly when its initial spans form an invariant flag (Complete invariant flags are equivalent to upper-triangular matrices).
Invariance makes every quotient operator well defined and linear (Invariance makes the induced quotient operator well defined and linear, with ).
A quotient basis lifts after a basis of the subspace to an adapted basis of the whole space (A quotient basis lifts to a basis adapted to ).
Proof
If , the empty basis simultaneously triangularises every family.
Assume and the theorem in smaller dimensions; if is empty or all its members are scalar, any basis works, while otherwise choose a nonscalar , use [L1] to obtain a nonzero proper eigenspace , observe that every preserves because , and use [L2] plus induction on to obtain a common eigenvector .
Put ; it is invariant under every , the induced quotient operators commute by direct evaluation on cosets, and [L2] shows each quotient characteristic polynomial splits, so induction gives a common triangular basis of .
Lift that quotient basis after by [L5]; its initial spans are invariant for every by the quotient construction, so [L3] makes every representing matrix upper triangular in the same basis, and this also covers the empty and all-scalar branches.
Nilpotent endomorphisms and their nilpotency index
Definition
An endomorphism is nilpotent if for some positive integer . Its nilpotency index is the least positive integer such that ; this least exponent exists by the well-ordering principle (The well-ordering principle).
The unique endomorphism of the zero space is nilpotent. With the same least-positive-exponent convention, its nilpotency index is because its identity and zero endomorphisms coincide.
Characterisations of a nilpotent endomorphism
Statement
Let be an endomorphism of a nonzero -dimensional vector space over . The following are equivalent:
- is nilpotent;
- for some ;
- ;
- some ordered basis gives a strictly upper-triangular matrix.
In that case is the nilpotency index.
The nonzero hypothesis is needed for condition 2. On the zero space the unique endomorphism is nilpotent with nilpotency index , and while the empty matrix is strictly upper triangular; so conditions 1, 3 and 4 hold there, but condition 2 fails, since no integer satisfies . The exponent of is then not the nilpotency index .
Facts & Assumptions
Given: An endomorphism of a finite-dimensional -vector space , with .
A polynomial annihilates an endomorphism exactly when its minimal polynomial divides ; on the zero space the minimal polynomial is (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
The minimal and characteristic polynomials have exactly the same monic irreducible factors (The minimal and characteristic polynomials have exactly the same monic irreducible factors).
An endomorphism is triangularisable exactly when its characteristic polynomial splits ( is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits).
The characteristic polynomial is monic of degree , and it is when ( is monic of degree ; for its coefficient is and its constant coefficient is , while ).
Every endomorphism satisfies its characteristic polynomial (Cayley-Hamilton: every finite-dimensional endomorphism satisfies its characteristic polynomial, ).
Proof
Suppose . By [L1], for some positive exactly when , which is exactly when for some positive ; [L5] then bounds the least such by once .
If , [L2] says that is the only irreducible factor of , and [L4] forces ; conversely and [L5] give .
If is nilpotent, step 1.2 makes split, so [L3] gives an upper-triangular matrix; its diagonal entries are roots of , hence are all zero, making it strictly upper triangular. Conversely, the th power of a strictly upper-triangular matrix is zero.
For , [L1] and [L4] give , the unique empty matrix is strictly upper triangular, and the convention in Nilpotent endomorphisms and their nilpotency index gives index , so conditions 1, 3 and 4 hold; condition 2 asks for with and no such integer exists, and the exponent of differs from the index , which is why the equivalence is stated for . Together with steps 1.1-2.1 this proves every asserted case.
Kernel and rank sequences of powers stabilise once equality occurs
Statement
Let be an endomorphism of a finite-dimensional vector space . For every , so the nullities weakly increase and the ranks weakly decrease. If for some —equivalently, if —then for every ,
Facts & Assumptions
Given: An endomorphism of a finite-dimensional vector space .
The kernel and image of a linear map are and (Kernel and image of a linear map).
Rank and nullity are the dimensions of the image and kernel (Rank and nullity of a linear map with finite-dimensional domain).
For an endomorphism of , (Rank-nullity: ).
Proof
If , then , and every equals ; hence the displayed kernel and image inclusions hold, and [L2] turns them into the asserted dimension inequalities.
Assume . The equality is the base case.
By [L3], equality of the two consecutive kernel dimensions is equivalent to equality of the two consecutive ranks; together with the inclusions in step 1.1, either dimension equality is equivalent to equality of the corresponding subspaces.
If and , then , so ; the reverse inclusion is in step 1.1, completing the induction on .
Applying [L3] to every shows that the later images all have the same dimension as ; the nested image inclusions from step 1.1 therefore make them equal, completing the claim.
A stabilised power splits the space into its kernel and image
Statement
Let be an endomorphism of a finite-dimensional vector space . If and , then
Facts & Assumptions
Given: An endomorphism of a finite-dimensional vector space and with .
Once consecutive kernels agree at , every later kernel equals (Kernel and rank sequences of powers stabilise once equality occurs).
Rank-nullity gives for an endomorphism (Rank-nullity: ).
For two subspaces, exactly when and (Internal direct sum : the sum is everything and each summand meets the sum of the others only in ).
Proof
If , write ; then , so [L1] gives and hence .
By [L2] applied to , the dimensions of and sum to ; with the zero intersection from step 1.1, their sum is therefore all of .
Fact [L3] now gives the asserted internal direct sum, including and .
Jordan blocks, Jordan strings, and their endpoints
Definition
For and , the Jordan block is the matrix with on the diagonal, on the superdiagonal, and elsewhere.
Let be an endomorphism. A Jordan string of length for at is an ordered list satisfying Its initial vector is and its terminal vector is . The initial vector is required to be nonzero; consequently every vector in the string is nonzero. In the ordered basis , the restriction of to the string's span has matrix under the coordinate-column convention (Coordinate columns and matrices of linear maps relative to ordered bases).
A Jordan string for a nilpotent endomorphism means a string at .
Independent initial vectors make a family of nilpotent Jordan strings independent
Statement
Let be an endomorphism and let be finitely many Jordan strings for at . If their initial vectors are linearly independent, then the union of all vectors in the strings is linearly independent. The empty family is allowed.
Facts & Assumptions
Given: A finite family of nilpotent Jordan strings whose initial vectors are linearly independent.
In each string, and for (Jordan blocks, Jordan strings, and their endpoints).
A finite family is linearly independent when its only vanishing finite linear combination has every coefficient zero (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent).
Proof
Induct on a natural number bounding all the string lengths, taking for the empty family, which has no strings and no maximum length. At the family is empty and the assertion is immediate, the empty union being independent by [L2].
Assume the result for families whose lengths are bounded by , and let the present family have lengths bounded by with some string of length exactly . In a relation , applying and using [L1] gives .
Independence of the initial vectors forces every coefficient to vanish. Removing the terminal vectors at position leaves a relation among truncated strings of maximum length at most , so the induction hypothesis makes all remaining coefficients zero; [L2] gives independence of the whole union.
Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings
Statement
Every nilpotent endomorphism of a finite-dimensional vector space has an ordered basis that is the concatenation of Jordan strings for at . For , this is the empty basis and the empty family of strings.
Facts & Assumptions
Given: A nilpotent endomorphism of a finite-dimensional vector space .
Jordan strings with linearly independent initial vectors have linearly independent union (Independent initial vectors make a family of nilpotent Jordan strings independent).
Rank-nullity gives (Rank-nullity: ).
In a finite-dimensional vector space, every linearly independent subset extends to a basis without a choice principle; a subspace of the same dimension as the whole space equals it (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
Proof
If , extend the empty independent set to a basis of by [L3]; every basis vector is then a length-one Jordan string. This includes .
Put . If , its restriction is nilpotent and : equality would make the restriction surjective, hence all its powers surjective, contradicting nilpotence on nonzero . The induction hypothesis therefore gives a Jordan-string basis of .
For every , choose with ; adjoining it extends the th string by one. The vectors form a basis of , because in the Jordan-string basis of the kernel of consists exactly of the initial-vector combinations.
Use the finite-dimensional extension clause [L3] to extend the independent family to a basis of ; regard each added vector as a length-one string. The initial vectors of all resulting strings are independent, so [L1] makes their union independent.
The union has vectors inherited from the strings in , one lift for each old string, and minus that same number of added kernel vectors; hence it has vectors by [L2]. Its span therefore has dimension , so [L3] makes it all of .
Thus the union is a basis of Jordan strings, completing the induction.
Power ranks determine every nilpotent Jordan-block multiplicity
Statement
Let be nilpotent on a finite-dimensional vector space. Put and for , so and . For every , and Thus either the nullities or the ranks of all powers determine the multiset of nilpotent Jordan blocks. On the zero space all sequences are zero and the block multiset is empty.
Facts & Assumptions
Given: A nilpotent endomorphism of a finite-dimensional vector space.
There is a basis in which is a direct sum of nilpotent Jordan blocks (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).
For every , and ; and if for some — equivalently — then and for every (Kernel and rank sequences of powers stabilise once equality occurs).
Nullity and rank are the dimensions of the kernel and image (Rank and nullity of a linear map with finite-dimensional domain).
Rank-nullity gives for every endomorphism of (Rank-nullity: ).
Proof
On a block , ; its contribution to is therefore exactly when , and otherwise. Summing across the block basis from [L1] gives the first nullity formula.
Subtracting the number of blocks of size at least from the number of blocks of size at least gives blocks of exact size .
Fact [L4] gives for every , so replacing each in steps 1.1-2.1 gives the two rank formulas. For the tail, first dispose of : there the block multiset is empty, every and is zero, and both formulas read . So assume , in which case the basis of [L1] has at least one block and a largest block size exists; step 1.1 gives for every block and every , so and for all . In particular , which is the hypothesis of [L2], and [L2] then gives the stabilised tail beyond the largest block.
These formulas recover every block multiplicity, including size one and the endpoint after the largest block; when each quantity and each recovered multiplicity is zero.
Nilpotent similarity is classified by the ranks of all powers
Statement
Let and be nilpotent endomorphisms of finite-dimensional vector spaces and over the same field , where similar means that some -linear isomorphism satisfies . Then and are similar if and only if The equality includes equality of the dimensions.
The common field is a hypothesis, not a convenience: rank sequences are integers and can agree across different fields, while similarity cannot. The zero endomorphisms of the one-dimensional spaces over and over have rank at and rank for every , and there is no linear isomorphism between them at all.
Facts & Assumptions
Given: Finite-dimensional nilpotent endomorphisms and over the same field.
The ranks of all powers determine every nilpotent Jordan-block multiplicity (Power ranks determine every nilpotent Jordan-block multiplicity).
Similarity is change of basis for one endomorphism and is an equivalence relation (Similarity is an equivalence relation, and two matrices represent the same endomorphism in two bases exactly when they are similar).
Proof
If and are similar, conjugating gives ; an invertible change of coordinates preserves image dimension, so their ranks agree for every .
Conversely, equality of all power ranks makes the two Jordan-block multisets equal by [L1]. Choose Jordan-string bases of and of realising those multisets; since the multisets agree, both bases have the same length and and have the same block diagonal matrix in them. Because and are spaces over the same field , sending the th vector of to the th vector of defines an -linear isomorphism , and matching the block matrices entry by entry gives , hence ; [L2] identifies this with similarity.
Steps 1.1 and 1.2 establish both directions, with the empty block multiset covering zero-dimensional spaces.
Split characteristic polynomials decompose into generalised eigenspaces of the algebraic multiplicities
Statement
Let be an endomorphism of a finite-dimensional -vector space whose characteristic polynomial splits over . If is the exponent of in , then where ranges over the eigenvalues. Each is -invariant, is nilpotent of index , and Consequently is the algebraic multiplicity of in . For , the sum and eigenvalue set are empty.
Facts & Assumptions
Given: A finite-dimensional endomorphism whose characteristic polynomial splits over .
The minimal and characteristic polynomials have the same monic irreducible factors (The minimal and characteristic polynomials have exactly the same monic irreducible factors).
If splits with distinct and , then , and for every , (If the minimal polynomial splits, is the direct sum of the stabilised generalised eigenspaces).
Writing with the distinct monic irreducibles, the subspaces are -invariant, , and the minimal polynomial of is exactly (Primary decomposition: the irreducible-power factors of split into their invariant kernels).
Characteristic polynomials multiply across an invariant subspace and its quotient (For invariant , ).
For an endomorphism of a nonzero -dimensional space, nilpotency is equivalent to for some and to , and in that case is the nilpotency index (Characterisations of a nilpotent endomorphism).
Proof
Fact [L1] makes split over , so its distinct monic irreducible factors are the with an eigenvalue and . Fact [L2] gives the displayed invariant direct sum, and [L3] applied to the same factorisation gives that each has minimal polynomial exactly .
Fix an eigenvalue . Since is an eigenvalue, , and because ; hence is nonzero and [L5] applies to it. On , has minimal polynomial by step 1.1, so [L5] makes nilpotent of index and gives . Translating the scalar variable yields .
Repeated use of [L4] on the invariant direct sum multiplies these restricted characteristic polynomials to obtain , so the exponent is exactly the algebraic multiplicity. The empty product gives the zero-space case.
Jordan bases and Jordan canonical forms over the base field
Definition
A Jordan basis over for an endomorphism is an ordered basis obtained by concatenating Jordan strings for , all with eigenvalues in (Jordan blocks, Jordan strings, and their endpoints). The matrix of in such a basis is block diagonal with blocks and is called a Jordan canonical form of over .
The adjective “canonical” records the block multiset, not a prescribed order of blocks: permuting the strings usually changes the literal block diagonal matrix. On the zero space the empty basis and empty block matrix form the Jordan basis and Jordan form.
Jordan form over the base field exists exactly when the characteristic polynomial splits
Statement
An endomorphism of a finite-dimensional -vector space has a Jordan canonical form over if and only if its characteristic polynomial splits into linear factors over . This includes the zero space, where the characteristic polynomial is and the Jordan form is empty.
Facts & Assumptions
Given: An endomorphism of a finite-dimensional -vector space .
If splits, is the direct sum of invariant generalised eigenspaces , and is nilpotent (Split characteristic polynomials decompose into generalised eigenspaces of the algebraic multiplicities).
Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).
The characteristic polynomial of a block triangular matrix is the product of the characteristic polynomials of its diagonal blocks, including empty blocks (The characteristic polynomial of a block upper- or lower-triangular matrix is the product of the characteristic polynomials of its diagonal blocks).
Proof
Suppose splits. For every from [L1], apply [L2] to ; its nilpotent strings are Jordan strings for at , and concatenating their bases across the direct sum gives a Jordan basis of .
Conversely, if has a Jordan basis, its matrix is block diagonal with blocks for ; [L3] gives , which splits over .
Steps 1.1 and 1.2 prove both directions; the empty direct sum and empty product prove the zero-space case.
Every finite-dimensional endomorphism over an algebraically closed field has Jordan form
Statement
Every endomorphism of a finite-dimensional vector space over an algebraically closed field has a Jordan canonical form over that field, including the endomorphism of the zero space.
Facts & Assumptions
Given: A finite-dimensional vector space over an algebraically closed field and an endomorphism .
Every nonconstant polynomial over an algebraically closed field has a root in that field (An algebraically closed field: every nonconstant polynomial has a root in the field).
If is a root of , then for some (Factor theorem over a commutative ring).
An endomorphism has Jordan form over exactly when its characteristic polynomial splits over (Jordan form over the base field exists exactly when the characteristic polynomial splits).
Proof
If , then and [L3] gives the empty Jordan form.
The induction is on the degree of an arbitrary nonzero polynomial over , not only of a characteristic polynomial, since the factor produced below need not itself be one. If the degree is positive, [L1] supplies a root and [L2] writes with smaller; the induction hypothesis applies to in that strengthened form and factors it into linear factors, so splits.
Fact [L3] now gives a Jordan canonical form for , completing the induction.
Ranks of shifted powers determine Jordan form up to block order
Statement
Let have split characteristic polynomial. For each eigenvalue , put Then for every , the number of Jordan blocks for of size exactly is Consequently the ranks of all shifted powers determine the Jordan form uniquely up to permutation of its blocks. On the zero space the rank data and block multiset are empty.
Facts & Assumptions
Given: A finite-dimensional endomorphism whose characteristic polynomial splits.
The space is the direct sum of generalised eigenspaces , and is nilpotent (Split characteristic polynomials decompose into generalised eigenspaces of the algebraic multiplicities).
For a nilpotent operator, is the number of blocks of size exactly (Power ranks determine every nilpotent Jordan-block multiplicity).
Rank is the dimension of the image (Rank and nullity of a linear map with finite-dimensional domain).
An internal direct sum gives unique componentwise decompositions (Internal direct sum : the sum is everything and each summand meets the sum of the others only in ).
Proof
Fix an eigenvalue . On , . On with , it is , which is invertible because the finite geometric series in is an inverse up to the nonzero scalar .
By the direct sum in [L1] and uniqueness in [L4], for every the rank on the non- summands is their constant total dimension , while the rank on is ; hence .
The constant cancels from the second difference, and [L2] then gives the displayed exact-size block count. Varying and recovers the entire block multiset.
By the definition of Jordan form, a block multiset determines the block diagonal matrix up to block order; for there are no eigenvalues or blocks.
For split operators, Jordan blocks read off eigenspace multiplicities and both canonical polynomials
Statement
Let be an endomorphism whose characteristic polynomial splits. For each eigenvalue , its algebraic multiplicity is the sum of the sizes of the -Jordan blocks, its geometric multiplicity is the number of those blocks, and the exponent of in is the size of the largest such block. Thus For , both products are empty and equal .
Facts & Assumptions
Given: A finite-dimensional endomorphism with split characteristic polynomial and Jordan block sizes .
The Jordan block multiset is determined up to order (Ranks of shifted powers determine Jordan form up to block order).
A scalar is an eigenvalue when contains a nonzero vector, and that kernel is its eigenspace (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism).
A polynomial annihilates exactly when it is divisible by , with on the zero space (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Proof
A block contributes copies of to the characteristic polynomial and one independent initial vector to ; blocks at other eigenvalues contribute no kernel because their shifted blocks are invertible. This proves the algebraic- and geometric-multiplicity claims.
On , vanishes exactly when . If with , then is invertible by a finite geometric-series inverse for its nonzero scalar part; hence annihilates that block exactly when . Applying this to every block and using [L3] gives the displayed minimal polynomial.
Multiplying the block contributions gives the characteristic-polynomial formula, and the empty block list gives on the zero space.
Split matrices are similar exactly when their Jordan block multisets agree
Statement
Let have characteristic polynomials that split over . Then and are similar if and only if their Jordan canonical forms have the same multiset of Jordan blocks. The blocks may occur in different orders.
Facts & Assumptions
Given: Matrices with split characteristic polynomials.
A split characteristic polynomial is equivalent to existence of Jordan form over the base field (Jordan form over the base field exists exactly when the characteristic polynomial splits).
The ranks of shifted powers determine Jordan form uniquely up to block order (Ranks of shifted powers determine Jordan form up to block order).
Similarity models two ordered-basis matrices of one endomorphism and is an equivalence relation (Similarity is an equivalence relation, and two matrices represent the same endomorphism in two bases exactly when they are similar).
Proof
If and are similar, [L3] realises them as matrices of one endomorphism in two bases; [L1] supplies Jordan forms and [L2] makes their block multisets equal.
Conversely, enumerate the common block multiset once; after permuting blocks, both block diagonal matrices equal the matrix from that enumeration, and each block permutation is conjugation by a permutation matrix. Each of and is therefore similar to that common matrix, so the equivalence-relation clause in [L3] makes similar to .
Steps 1.1 and 1.2 prove both directions, including .
Cyclic subspaces, cyclic vectors, and vector annihilators
Definition
Let be an endomorphism and . The -cyclic subspace generated by is It is the smallest -invariant subspace containing . The vector is a cyclic vector for when , and is cyclic when it has a cyclic vector.
The annihilator ideal of is When is finite-dimensional this ideal is nonzero and has a unique monic generator, whose existence is proved in The vector annihilator is the unique monic generator of and divides the minimal polynomial ↗; that generator is the vector annihilator . For , the ideal is all of and .
Finite dimensionality is not a convenience: it is what forces the ideal to be nonzero, and without it the ideal can vanish. On with and , every nonzero gives , so and there is no monic generator. It is not necessary, however: for on any and any , , so and .
The vector annihilator is the unique monic generator of and divides the minimal polynomial
Statement
For an endomorphism of a finite-dimensional vector space and , is a nonzero ideal of . It has a unique monic generator , and Moreover . In particular .
Facts & Assumptions
Given: A finite-dimensional endomorphism and a vector .
The annihilator ideal is (Cyclic subspaces, cyclic vectors, and vector annihilators).
The minimal polynomial satisfies (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Every ideal of is principal (For every field , is a principal ideal domain).
Proof
Linearity of polynomial evaluation shows that [L1] is closed under addition and under multiplication by arbitrary polynomials, so it is an ideal; it is nonzero because [L2] puts in it.
By [L3] the ideal is for a nonzero polynomial ; scaling by the inverse of its leading coefficient gives a monic generator , and two monic generators of one ideal are associates and hence equal.
Membership in is exactly divisibility by , proving the displayed equivalence. Since belongs to the ideal, ; if , the ideal contains and its monic generator is .
A vector annihilator gives a power basis and its companion matrix
Statement
Let . Then is an ordered basis of . In this basis the restriction has the companion matrix with ones on the subdiagonal and last column . If , then , , and both the basis and matrix are empty.
Facts & Assumptions
Given: An endomorphism , a vector , and its monic vector annihilator of degree .
For an endomorphism of a finite-dimensional vector space, has a unique monic generator and exactly when (The vector annihilator is the unique monic generator of and divides the minimal polynomial).
Division by monic writes each uniquely as with or (Division algorithm for polynomials over a field).
The cyclic subspace is (Cyclic subspaces, cyclic vectors, and vector annihilators).
Matrix columns are the coordinates of the images of ordered basis vectors (Coordinate columns and matrices of linear maps relative to ordered bases).
Proof
By [L2], because ; [L3] therefore shows that span .
A linear relation among those powers gives a polynomial of degree below with ; [L1] says , so . Thus the list is independent and hence a basis.
The first basis vectors shift to the next ones, while gives ; [L4] yields the stated companion matrix.
If , monicity makes , so [L1] gives and [L3] gives the zero cyclic subspace; the empty basis and matrix then establish the endpoint case.
Some vector has vector annihilator equal to the minimal polynomial
Statement
For every endomorphism of a finite-dimensional vector space , there is such that . If , take and both polynomials are .
Facts & Assumptions
Given: A finite-dimensional endomorphism .
If is its factorisation into distinct monic irreducible powers, then with , and has minimal polynomial exactly (Primary decomposition: the irreducible-power factors of split into their invariant kernels).
The vector annihilator is a monic divisor of the operator's minimal polynomial and detects exactly the polynomials that annihilate the vector (The vector annihilator is the unique monic generator of and divides the minimal polynomial).
The ring is a unique factorisation domain (For every field , is a unique factorisation domain).
Proof
For each nonempty primary summand in [L1], choose with ; such a vector exists because otherwise would annihilate , contrary to its exact minimal polynomial.
By [L2], divides ; [L3] makes it a power of , and step 1.1 rules out every exponent below . Hence .
Put . Directness in [L1] gives exactly when for every , which by step 2.1 is exactly when every divides ; pairwise coprimality and [L3] make this equivalent to . Thus [L2] gives .
If , [L1] is the empty direct sum and the published minimal-polynomial convention gives ; taking gives by [L2].
A cyclic vector exists exactly when the minimal and characteristic polynomials agree
Statement
An endomorphism of a finite-dimensional vector space has a cyclic vector if and only if . On the zero space, is cyclic and .
Facts & Assumptions
Given: An endomorphism of an -dimensional vector space .
If has degree , then is a basis of (A vector annihilator gives a power basis and its companion matrix).
Some vector satisfies (Some vector has vector annihilator equal to the minimal polynomial).
The characteristic polynomial is monic of degree , and is for ( is monic of degree ; for its coefficient is and its constant coefficient is , while ).
A polynomial annihilates exactly when it is divisible by (The annihilator ideal is nonzero and has a unique monic generator; if and only if ), and (Cayley-Hamilton: every finite-dimensional endomorphism satisfies its characteristic polynomial, ).
A finite-dimensional subspace with the same dimension as its ambient space equals that space (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
Proof
Suppose is cyclic. A polynomial annihilates exactly when it annihilates every , because polynomial evaluations commute and these vectors span ; hence . By [L1], .
Conversely, suppose and choose as in [L2]. Then [L1] gives ; since is a subspace of , [L5] gives , so is cyclic.
Fact [L4] gives , while [L3] makes both monic and step 1.1 gives equal degree; therefore .
When , [L2] chooses , [L3] and [L4] give both polynomials as , and its cyclic subspace is ; thus steps 1.1-2.1 cover every case and both directions.
The commutant of a cyclic endomorphism consists of its polynomials
Statement
Let be a cyclic endomorphism of a finite-dimensional vector space. An endomorphism commutes with if and only if for some . Thus the commutant of is .
Facts & Assumptions
Given: A cyclic endomorphism with cyclic vector and an endomorphism .
Cyclicity means (Cyclic subspaces, cyclic vectors, and vector annihilators).
The powers form a basis of , where (A vector annihilator gives a power basis and its companion matrix).
Polynomial evaluation is (Polynomial evaluation at an endomorphism: ).
Proof
Suppose . By [L1], , so [L2] supplies with .
For every , commutation gives ; the power basis in [L2] therefore makes on all of .
Conversely every commutes with term by term in [L3]. This proves both directions, including the zero space where the only endomorphism is the zero map.
5 · Examples, counterexamples and false statements
None yet.
Sources
Standard references
Recommended treatments; not extraction sources.
- S. Axler, Linear Algebra Done Right, 4th ed., Section 3E
- S. Axler, Linear Algebra Done Right, 4th ed., Results 3.101-3.104
- S. Axler, Linear Algebra Done Right, 4th ed., Result 3.105
- Cornell Math 4330, Quotient Spaces, Theorem 2
- Cornell Math 4330, Quotient Spaces, Exercise QuoSpace 5
- S. Axler, Linear Algebra Done Right, 4th ed., Results 3.106-3.107
- K. Hoffman and R. Kunze, Linear Algebra, 2nd ed., Section 6.4
- Cornell Math 4330, Quotient Spaces, Exercise QuoSpace 7
- S. Axler, Linear Algebra Done Right, 4th ed., Results 5.38-5.39
- S. Axler, Linear Algebra Done Right, 4th ed., Result 5.39
- S. Axler, Linear Algebra Done Right, 4th ed., Result 5.44
- K. Hoffman and R. Kunze, Linear Algebra, 2nd ed., Theorem 5 in Section 6.4
- S. Axler, Linear Algebra Done Right, 4th ed., Result 5.47
- S. Axler, Linear Algebra Done Right, 4th ed., Section 5C
- S. Axler, Linear Algebra Done Right, 4th ed., Section 8B
- S. Axler, Linear Algebra Done Right, 4th ed., Results 8.17-8.18
- S. Axler, Linear Algebra Done Right, 4th ed., Results 8.1-8.3
- S. Axler, Linear Algebra Done Right, 4th ed., Result 8.4
- S. Axler, Linear Algebra Done Right, 4th ed., Section 8C
- S. Treil, Linear Algebra Done Wrong, Chapter 9, Section 4
- S. Treil, Linear Algebra Done Wrong, Chapter 9, Theorem 4.1
- S. Treil, Linear Algebra Done Wrong, Chapter 9, Theorem 4.2
- S. Treil, Linear Algebra Done Wrong, Chapter 9, Sections 4.3-4.4
- S. Axler, Linear Algebra Done Right, 4th ed., Section 8A
- S. Treil, Linear Algebra Done Wrong, Chapter 9, Sections 4-5
- S. Axler, Linear Algebra Done Right, 4th ed., Results 8.42-8.46
- S. Treil, Linear Algebra Done Wrong, Chapter 9, Section 5
- K. Hoffman and R. Kunze, Linear Algebra, 2nd ed., Section 7.1
- K. Hoffman and R. Kunze, Linear Algebra, 2nd ed., Theorems 1-2 in Section 7.1