Jordan canonical form and minimal polynomial
Anchor (Master): Apostol Calculus Vol. 2 Ch. 4 §4.20; Axler — Linear Algebra Done Right Ch. 8; Hoffman-Kunze — Linear Algebra Ch. 6–7; Lang — Algebra Ch. III §10 + Ch. XIV §2
Intuition [Beginner]
Some linear maps are pure stretching. Pick the right axes and the map multiplies each axis by its own number; the matrix in those axes is diagonal, with the stretch factors on the diagonal. This is the simplest possible behaviour, and it is what eigenvectors and eigenvalues record 01.01.08.
Not every map is pure stretching. The map that sends the arrow to and leaves alone has only one direction it stretches — the horizontal one — and along the vertical direction it shears, sliding everything sideways. No choice of axes makes the matrix diagonal. There is one stretching direction, and the map mixes the other direction with it.
The Jordan canonical form is the next-best matrix. Where the map is pure stretching, the diagonal entries record the stretch factors. Where the map shears, the matrix records a stretch factor on the diagonal together with a just above the diagonal that names the shear. Every linear map on a finite-dimensional complex vector space looks like this — pure stretches glued together with stretch-plus-shear pieces — once you choose the right basis. The pieces are the Jordan blocks.
Visual [Beginner]
The picture shows a four-by-four matrix in Jordan canonical form. Two Jordan blocks sit along the diagonal: a three-by-three block with the number on the diagonal and s on the superdiagonal, and a one-by-one block holding the number . To the right is a Jordan chain — three arrows pointing successively from to to and finally to , each labelled by the nilpotent shift. The chain is the basis in which the three-by-three block acts.
The two block sizes tell the whole story. The block of size at eigenvalue means there is one chain of length — one direction the map stretches by , plus two more directions glued to it by shears. The block of size at eigenvalue means there is one ordinary eigenvector with eigenvalue , and nothing further glued to it.
Worked example [Beginner]
Take the three-by-three matrix
Compute the characteristic polynomial by expanding , so the only eigenvalue is , with algebraic multiplicity . Find the eigenvectors: solve . The matrix is the nilpotent shift, sending to . The kernel is , a one-dimensional eigenspace spanned by .
So the matrix has one eigenvalue, , with one eigendirection along . The matrix is not diagonalisable because the eigenspace has dimension instead of .
Build the Jordan chain. Start with the eigenvector . Look for with . Solving gives . Look for with . Solving gives . The three vectors are a basis of the space, and in this basis is its own Jordan canonical form: a single Jordan block of size at the eigenvalue .
What this tells us. A matrix can be a single Jordan block already, with no work to do. The defect from diagonal — the size of the largest Jordan block minus — measures how far the map is from being pure stretching. For this matrix, the defect is : there is one stretching direction, and two further directions glued on by shears.
Check your understanding [Beginner]
Formal definition [Intermediate+]
Let be a field, a finite-dimensional -vector space, and a linear operator. The minimal polynomial and the Jordan canonical form record the entire similarity class of .
Jordan block. For and , the Jordan block of size at is the matrix
with on every diagonal entry, on every entry of the superdiagonal, and elsewhere. Equivalently where is the nilpotent shift with s on the superdiagonal; satisfies and . The matrix has characteristic polynomial and minimal polynomial , eigenvalue with algebraic multiplicity and geometric multiplicity (the eigenspace is the span of the first standard basis vector).
Minimal polynomial. The set of polynomials with is an ideal of , the kernel of the algebra evaluation map at . Since is a principal ideal domain and is finite-dimensional over , the ideal is non-zero and has a unique monic generator. This monic generator is the minimal polynomial of . Equivalently, is the unique monic polynomial of smallest positive degree satisfying , and every polynomial with is a multiple of in [textbooks-extra Calculus Vol.2 - Multi-Variable Calculus and Linear Algebra with Applications (Tom Apostol).pdf].
Relation to the characteristic polynomial. The Cayley-Hamilton identity from 01.01.08 gives , hence lies in the kernel ideal and in . The two polynomials have the same roots: every root of is a root of by divisibility, and every eigenvalue of satisfies because with gives , forcing . The multiplicities differ in general: the multiplicity of in is the size of the largest Jordan block of at , while the multiplicity in is the algebraic multiplicity of (the sum of the sizes of all Jordan blocks at ).
Diagonalisability criterion. The operator is diagonalisable iff factors as a product of distinct linear factors in — equivalently iff is square-free and splits over . The forward direction: a diagonalisable with eigenvalues satisfies on each eigenspace, hence on , so , which is square-free. The reverse direction is the content of the primary-decomposition argument in the key theorem below.
Generalised eigenspace. For and , the generalised eigenspace of at of order is the kernel . The kernels form an ascending chain , which stabilises at some index called the index of . The stable subspace is the (full) generalised eigenspace at ; its dimension equals the algebraic multiplicity of when contains every root of , and the index equals the size of the largest Jordan block of at .
Segre characteristic. Suppose is in Jordan canonical form with Jordan blocks at the eigenvalue of sizes . The decreasing partition of the algebraic multiplicity of is the Segre characteristic of at . The Segre characteristic determines the similarity class of on the generalised eigenspace , and the Segre characteristics across the eigenvalues collectively determine the similarity class of on .
Counterexamples to common slips
- The minimal polynomial divides the characteristic polynomial but is not always equal to it. For the identity matrix , but . Equality holds precisely for cyclic operators (those admitting a single vector whose -orbit spans ).
- Algebraic multiplicity of in is the total number of entries on the Jordan-form diagonal; geometric multiplicity is the number of Jordan blocks at ; index is the size of the largest Jordan block at . These three numbers are independent in general and only coincide when each Jordan block at has size (the diagonalisable case at ).
- The Jordan canonical form classification requires the ground field to contain every eigenvalue. Over , the planar rotation by an angle other than or has no real Jordan form because its eigenvalues are non-real complex numbers; the classification over uses real Jordan blocks with two-by-two rotational pieces in place of complex-conjugate eigenvalue pairs.
- The Segre characteristic is the decreasing partition of the algebraic multiplicity; the dual conjugate partition records the dimensions of the successive kernels , and is sometimes used in place of the Segre data. The two partitions encode the same information by Young-diagram conjugation.
Key theorem with proof [Intermediate+]
Theorem (existence and uniqueness of Jordan canonical form). Let be a linear operator on a finite-dimensional vector space over an algebraically closed field . There exists a basis of in which the matrix of is block-diagonal,
with each a Jordan block. The block data — the multiset of pairs — is uniquely determined by up to reordering. [Axler, S. — Linear Algebra Done Right (3rd ed.)]
Proof. The argument has three steps: a primary decomposition that splits into generalised eigenspaces, a nilpotent-operator classification on each generalised eigenspace, and a counting argument that secures uniqueness.
Step 1: Primary decomposition. Factor the characteristic polynomial over (possible because is algebraically closed) as with the distinct eigenvalues and their algebraic multiplicities. The polynomials are pairwise coprime in because the roots are distinct. By the Chinese remainder theorem applied to , the quotient ring decomposes as . The -module structure on defined by letting act as has annihilator by Cayley-Hamilton, so is a module over . The Chinese remainder isomorphism induces a -module decomposition
Each is -invariant (the operator and commute, so preserves the kernel), and on the restricted operator is nilpotent of index at most because vanishes on by construction.
Step 2: Jordan basis for a nilpotent operator. Fix and let with nilpotent operator on , of index (so but ). Form the kernel chain . The aim is to produce a basis of consisting of Jordan chains: sequences with and .
Build the basis top-down. Pick a basis of the top quotient ; lift these basis elements to vectors . By construction, and , so each generates a Jordan chain of length . The collected chains contribute vectors at each level of the kernel filtration. Pass to the next quotient ; the images of form a linearly independent subset of this quotient (because the were chosen linearly independent modulo and induces an injection on each successive quotient), which extend to a basis with new vectors . Each generates a Jordan chain of length . Continue inductively down the kernel filtration, at each step extending the previously-built chains by new top elements.
The collected Jordan chains form a basis of because at each level of the filtration the chains contribute a basis of . In this basis the matrix of is block-diagonal with nilpotent-shift blocks of various sizes , and the matrix of is block-diagonal with Jordan blocks . Assembling over gives the full block-diagonal Jordan form for on .
Step 3: Uniqueness. The block sizes at a fixed eigenvalue are recovered from the dimensions of the kernel-filtration quotients by a counting identity. Let for ; this is the number of independent Jordan chains at of length at least . The number of Jordan blocks at of size exactly is . Both and are intrinsic invariants of — they depend only on the operator, not on the basis used to exhibit it — so the multiset of block sizes at is intrinsic. Across the eigenvalues, the multiset of pairs is therefore an invariant of the similarity class of .
Corollary (similarity classification over ). Two matrices in are similar iff they have the same Jordan canonical form up to permutation of blocks. This is the complete conjugacy classification of by conjugation, with parameter space the disjoint union over partitions of conjugacy classes labelled by Segre-characteristic data.
Bridge. The Jordan canonical form theorem is the load-bearing structural result of finite-dimensional linear algebra. The proof packages four ideas; each gives a separate downstream synthesis.
First synthesis. The primary decomposition is the linear-algebra incarnation of the Chinese remainder theorem in . The same decomposition reappears as the primary decomposition of finitely generated modules over a PID: every such module decomposes as a direct sum of cyclic modules with irreducible. Over the irreducibles are linear and the decomposition recovers Jordan form; over a general field the irreducibles can have higher degree and the decomposition recovers the rational canonical form via companion matrices.
Second synthesis. The classification of nilpotent operators by partitions — Jordan chains organised into Young-diagram-shaped data — is the linear-algebra core of the representation theory of the symmetric group: nilpotent conjugacy classes in are parametrised by partitions of , exactly as irreducible representations of are. The bridge between the two parametrisations is the Springer correspondence, which sends a nilpotent orbit to an irreducible -representation via the cohomology of Springer fibres.
Third synthesis. The Jordan form gives explicit functional calculus on operators. For any holomorphic function defined on a neighbourhood of the spectrum, acts on each Jordan block as , with the nilpotent shift. This computes the matrix exponential , the matrix logarithm, the resolvent as a Laurent series at each , and the holomorphic functional calculus for bounded operators on a Banach space; in the bounded-operator setting the Jordan-form identity is replaced by the Riesz functional calculus .
Fourth synthesis. The Jordan canonical form is the parameter for the GIT quotient under conjugation. The geometric invariant theory of this action is the prototype of more elaborate quotient constructions in algebraic geometry and representation theory: closures of nilpotent orbits become singular projective varieties (Springer's resolution of the nilpotent cone), and the Jordan partition is the dimension data parametrising the strata. The whole package of moduli, orbits, and stratifications stems from the partition-of- classification at the heart of Jordan form.
Exercises [Intermediate+]
Lean formalization [Intermediate+]
Mathlib packages the minimal polynomial of an endomorphism as minpoly K T, the divisibility minpoly K A ∣ Matrix.charpoly A through Matrix.aeval_self_charpoly together with minpoly.dvd, the generalised eigenspaces as Module.End.generalizedEigenspace, and the primary-decomposition theorem that generalised eigenspaces sum to the whole module over an algebraically closed field as Module.End.iSup_generalizedEigenspace_eq_top. The companion file Codex.Foundations.LinearAlgebra.JordanForm records the statements used above.
This unit is marked lean_status: partial because Mathlib supplies every constituent ingredient — the minimal polynomial, the divisibility theorem, the generalised eigenspaces, the primary-decomposition theorem — but no single named Matrix.jordanForm result packaging the block-diagonal form with Segre-characteristic uniqueness data. The corresponding statement in the companion module is left as a sorry-gated alias pending that packaging.
Advanced results [Master]
Rational canonical form. Over an arbitrary field (not necessarily algebraically closed), every linear operator on a finite-dimensional -vector space is similar to a block-diagonal matrix of companion matrices. The companion matrix of a monic polynomial is
with characteristic and minimal polynomial both equal to . The rational canonical form of is the block-diagonal matrix with in — the invariant factors of , uniquely determined. Over an algebraically closed field each factors as a product of pieces, recovering the Jordan blocks via . The rational canonical form is therefore the field-of-definition-agnostic version of the Jordan form; the Smith normal form for matrices over (below) produces it algorithmically [Frobenius, F. G. — Theorie der linearen Formen mit ganzen Coefficienten].
Smith normal form. For a matrix over a principal ideal domain , there exist invertible matrices and such that is a diagonal matrix with in . The are the elementary divisors (also called invariant factors) of , uniquely determined up to units. For this is the structure theorem for finitely generated abelian groups: an abelian group presented by an integer matrix decomposes as with and the Smith elementary divisors. For applied to on , the Smith form produces the rational canonical form: the elementary divisors of are the invariant factors of [Smith, H. J. S. — On systems of linear indeterminate equations and congruences].
Module-theoretic packaging. A linear operator on a finite-dimensional -vector space is the same datum as a finitely generated module structure on over : the polynomial acts as , the scalars act as scalar multiplication, and is finitely generated because it is finite-dimensional over . The structure theorem for finitely generated modules over a PID applied to gives
with the invariant factors. Equivalently, using primary decomposition,
with monic irreducible. Over the irreducibles are linear, , and the summand is isomorphic as a -module to the cyclic -module generated by the top of a Jordan chain of length at ; the matrix of on in the basis is exactly the Jordan block . The Jordan form, the rational canonical form, and the elementary-divisor decomposition are three equivalent encodings of the same structure-theorem output, viewed at three different levels of abstraction [Lang, S. — Algebra (3rd ed., revised)].
Holomorphic functional calculus. For holomorphic on a neighbourhood of the spectrum of , the operator is defined unambiguously by the Jordan-form formula
Applied block-by-block and reassembled, this defines for the Jordan decomposition. The matrix exponential used to solve linear ODEs is the case : on a Jordan block, , producing the polynomial-in--times-exponential mode shapes that characterise solutions of constant-coefficient linear ODEs.
Conjugacy classes of . The Jordan canonical form is the complete parameter for the conjugation action . The orbit space — the adjoint quotient — is parametrised by Jordan-form data: pairs where are distinct eigenvalues and is the Segre partition at , with the global constraint . Over , conjugacy classes are not closed in the Zariski topology: closures of unipotent orbits contain other unipotent orbits and form the nilpotent cone, a singular projective variety whose stratification by Jordan type is studied in geometric representation theory (Springer correspondence, Lusztig's perverse-sheaf parametrisation of nilpotent orbits). The GIT quotient — the affine quotient by conjugation, defined as of the ring of conjugation-invariant polynomials — is isomorphic to , parametrising matrices by the coefficients of their characteristic polynomial.
Connection to dynamical systems. The Jordan canonical form is the linear-algebra core of stability analysis. For a linear discrete-time system on , the iterates are , and is computed block-by-block on the Jordan form: . The orbit tends to iff every eigenvalue satisfies ; it remains bounded iff for every eigenvalue and Jordan blocks at eigenvalues on the unit circle have size ; it diverges iff some eigenvalue has or some Jordan block at an eigenvalue on the unit circle has size . The continuous-time system has analogous dichotomies controlled by the real parts of the eigenvalues.
Synthesis. First synthesis — Jordan form as the complete invariant of similarity over : every coordinate-free property of an operator over an algebraically closed field is recovered from its Jordan-form data; the characteristic polynomial, the minimal polynomial, the trace, the determinant, the rank of every polynomial in , the dimension of every generalised eigenspace, the index of nilpotency on each generalised eigenspace, the answer to "is diagonalisable", "is semisimple", "is nilpotent" — all read off from the Jordan-form Segre-characteristic data.
Second synthesis — the unification through -module structure: the Jordan canonical form, the rational canonical form, and the elementary-divisor decomposition are three packagings of the same fact. A linear operator on a finite-dimensional -vector space is the same datum as a finitely generated torsion -module; the structure theorem for finitely generated modules over a PID classifies these modules by invariant factors or by primary decomposition; the matrix expressions of these classifications in suitable bases are exactly the three canonical forms. The choice of basis is the choice of presentation.
Third synthesis — function calculus and dynamics: the Jordan form computes for any holomorphic on a neighbourhood of the spectrum, via the derivative-formula on each Jordan block. The matrix exponential, the resolvent, and the Riesz functional calculus on bounded operators on a Banach space all factor through the finite-dimensional Jordan case as the building-block computation. The dynamical behaviour of linear evolution — stability, oscillation, growth — is therefore encoded in the Jordan-form data of the generator.
Fourth synthesis — geometric and arithmetic generalisations: the Jordan form is the prototype for more elaborate classifications. The Springer correspondence parametrises irreducible representations of the symmetric group by Jordan-type data on the nilpotent cone of ; the Lusztig–Spaltenstein parametrisation extends this to nilpotent orbits in semisimple Lie algebras. Smith normal form for -matrices is the integer analogue, classifying finitely generated abelian groups. Frobenius eigenvalues on -adic étale cohomology — Galois Jordan forms — encode the same partition data in number-theoretic context. The Jordan-Segre partition reappears wherever a single linear operator carries the structural data of a more elaborate object.
Full proof set [Master]
Existence of primary decomposition. Let be a linear operator on a finite-dimensional vector space over a field with factoring as a product of distinct linear factors over an algebraic closure ; assume the eigenvalues lie in (so or the eigenvalues all happen to be defined over ). The polynomials are pairwise coprime: for because they have disjoint root sets. By Bezout's lemma in , for each there exist polynomials with . Set ; then is divisible by for every , and by a Chinese-remainder-theorem manipulation.
Substitute in place of . The relation holds because by Cayley-Hamilton. Set . The image of is contained in because is divisible by for every , hence factors through projections onto each for , which are annihilated by only on — running the argument cleanly: , and is divisible by , so . Hence . The identity gives . The sum is direct because the form a system of orthogonal idempotents: is divisible by every when (because the product contains every ), hence by , hence is . The are projections onto the , and the decomposition is a direct sum.
Restriction is nilpotent on each generalised eigenspace. On , the operator is nilpotent by definition: vanishes on . The index of nilpotency on — the smallest with identically zero on — is the multiplicity of in the minimal polynomial and equals the size of the largest Jordan block of at .
Jordan basis for a nilpotent operator (full construction). Let be a nilpotent operator on a finite-dimensional vector space, with and . The kernel filtration is , where . The successive quotients are linked by : for each , the operator sends to and induces a -linear injection (injection because with means , i.e., , i.e., ).
Set ; the injections give . The Young diagram with boxes in row (from the top) is the conjugate partition to the Segre partition.
Build the basis top-down. Pick a basis of the top quotient , and lift to vectors . Each generates a Jordan chain of length , with because and because .
Descend to the next level. The vectors lie in and their images in are linearly independent (by the injectivity of ). Extend to a basis of , and lift the new vectors to . Each generates a Jordan chain of length .
Continue inductively for . At each level , the previously-built chains contribute vectors to via the images, all linearly independent in the quotient; extend to a basis with new tops at level . Each new top generates a Jordan chain of length .
The total construction produces Jordan chains of length exactly , for . The chains together form a basis of , and in this basis has the block-diagonal matrix with copies of the size- nilpotent shift. Translating by on a generalised eigenspace gives the Jordan block decomposition of on .
Uniqueness via kernel-filtration dimensions. The numbers are intrinsic invariants of the operator , independent of the choice of basis. The number of Jordan blocks of size is therefore intrinsic. Assembling over the eigenvalues , the multiset of pairs of Jordan-block sizes and corresponding eigenvalues is intrinsic to . Two operators with the same Jordan-form data are similar (the bases constructed above conjugate one to the other), and two operators with different Jordan-form data are not similar (because the data is intrinsic to similarity).
Diagonalisability iff square-free (full proof). Suppose is a product of distinct linear factors. The Lagrange interpolation polynomials satisfy and . From the identity , applying at gives , so . From , every decomposes as with each summand an eigenvector. The decomposition is direct (eigenvectors for distinct eigenvalues are linearly independent), so and is diagonalisable. Conversely, if is diagonalisable, the polynomial annihilates , so , and since shares the roots of and is square-free of degree , .
Connections [Master]
Eigenvalue, eigenvector, characteristic polynomial
01.01.08— supplies the spectral framework on which the Jordan canonical form is built. The characteristic polynomial from01.01.08is the polynomial whose root multiset, with Segre-characteristic refinements, is the Jordan-form data. The Cayley-Hamilton identity from the Master tier of01.01.08underlies the minimal-polynomial development of this unit, and the primary decomposition refines the eigendecomposition of01.01.08for non-diagonalisable operators. The Jordan form is the structural completion of the spectral picture begun in01.01.08.Determinant: axiomatic + expansion + properties
01.01.07— supplies the multiplicativity that makes the characteristic polynomial — hence the entire Jordan-form data — a similarity invariant, and the explicit Leibniz / cofactor formulae used to compute characteristic polynomials in concrete examples. The block-diagonal nature of the Jordan form makes its characteristic polynomial straightforward to compute: for . The block-diagonal determinant identity is itself a consequence of the multiplicativity axioms of01.01.07.Inner-product space: orthogonality, Gram-Schmidt, spectral theorem
01.01.09pending — refines the Jordan canonical form for self-adjoint operators on a finite-dimensional inner-product space. Every self-adjoint operator is diagonalisable (so has Jordan form with only size- blocks) and its eigenvalues are real; the spectral theorem of01.01.09pending is the inner-product-space sharpening of the diagonalisability criterion of this unit. The non-self-adjoint, non-diagonalisable operators on an inner-product space — those with Jordan blocks of size — fail the spectral theorem but admit a generalised polar decomposition and Schur upper-triangular form, an inner-product-space relative of the Jordan canonical form.Matrix exponential and constant-coefficient linear ODE systems
02.06.03pending — the matrix exponential used to solve is computed block-by-block on the Jordan form of : on a Jordan block , the exponential is , producing the characteristic mode shapes . The Jordan canonical form is the linear-algebra core of the constant-coefficient ODE theory, and the explicit polynomial-in- growth rates of solutions are read off directly from the block sizes.Bounded and unbounded operators on Hilbert space
02.11.03— the infinite-dimensional generalisation in which the Jordan canonical form is replaced by the spectral measure of a self-adjoint operator (Stone-von Neumann) and the holomorphic functional calculus of bounded operators on a Banach space (Riesz). The Jordan-form derivative-on-each-block formula generalises to the contour-integral formula for bounded operators with spectrum enclosed by ; the finite-dimensional Jordan-form formula is the residue-sum case.Structure theorem for finitely generated modules over a PID and rational canonical form [01.02.*] — the Jordan canonical form is the algebraically-closed-field instance of the structure theorem for finitely generated modules over a PID applied to . The same theorem applied to gives the structure theorem for finitely generated abelian groups; applied to over a non-algebraically-closed field gives the rational canonical form via companion matrices of invariant factors. The unification through the PID structure theorem is the conceptual completion of the Jordan-form picture, situating it as a single instance of a general module-theoretic classification.
Historical & philosophical context [Master]
The classification problem for linear operators up to similarity originated in the study of bilinear and quadratic forms in the nineteenth century. Karl Weierstrass, in Zur Theorie der bilinearen und quadratischen Formen (Monatsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin, 1868, 311–338), introduced the elementary divisor theory, classifying pencils of forms over by polynomial invariants — the elementary divisors of the matrix in modern language — and obtained what would now be called the Jordan canonical form for when is nondegenerate, two years before Jordan's own treatment [Weierstrass, K. — Zur Theorie der bilinearen und quadratischen Formen]. The earlier work of Henry John Stephen Smith, On systems of linear indeterminate equations and congruences (Philosophical Transactions of the Royal Society 151, 1861, 293–326), gave the analogue for matrices over the integers: every -matrix is equivalent under integer-invertible row and column operations to a diagonal matrix with successive entries dividing the next — the Smith normal form — proving the structure theorem for finitely generated abelian groups in the same stroke [Smith, H. J. S. — On systems of linear indeterminate equations and congruences].
Camille Jordan, in Traité des substitutions et des équations algébriques (Gauthier-Villars, Paris, 1870, Livre II, Note D), gave the canonical-form decomposition that bears his name, in the context of substitutions of variables in polynomial equations and the structure of finite groups [Jordan, C. — Traité des substitutions et des équations algébriques]. Ferdinand Georg Frobenius, in Theorie der linearen Formen mit ganzen Coefficienten (Journal für die reine und angewandte Mathematik 86, 1879, 146–208) and subsequent papers, developed the systematic theory of invariant factors of a linear substitution, giving what is now called the rational canonical form by companion matrices of invariant factors over an arbitrary field [Frobenius, F. G. — Theorie der linearen Formen mit ganzen Coefficienten]. The three threads — Weierstrass elementary divisors over , Smith normal form over , Jordan canonical form over , Frobenius rational canonical form over a general field — were unified in the twentieth century by the structure theorem for finitely generated modules over a principal ideal domain, in the form codified in Serge Lang's Algebra (Addison-Wesley, 1965, Ch. III §10 and Ch. XIV §2).
The vocabulary eigenvalue and the systematic treatment of generalised eigenspaces date to the early-twentieth-century reformulation of linear algebra in the language of operator theory, driven by Hilbert's work on integral equations (1904–1910) and the formalisation of finite-dimensional spectral theory in the textbooks of Schreier-Sperner (Vorlesungen über Matrizen, 1932) and Halmos (Finite-Dimensional Vector Spaces, 1942, drawing on von Neumann's lecture notes). The module-theoretic packaging — a linear operator on a finite-dim vector space is a finitely-generated torsion module over — is implicit in van der Waerden's Moderne Algebra (Springer, Berlin, 1930–1931) and explicit in Bourbaki's Algèbre (Hermann, 1942 onward, Ch. VII on the structure theorem). The Jordan canonical form, the rational canonical form, and the Smith normal form are now standard packaged together as instances of the structure theorem for finitely generated modules over a PID, with the three forms corresponding to three choices of summand presentation: invariant factors, elementary divisors over (Jordan), or elementary divisors over a general field (rational).
Bibliography [Master]
Nineteenth-century origins.
- Weierstrass, K., "Zur Theorie der bilinearen und quadratischen Formen", Monatsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin, 1868, 311–338.
- Smith, H. J. S., "On systems of linear indeterminate equations and congruences", Philosophical Transactions of the Royal Society of London 151 (1861), 293–326.
- Jordan, C., Traité des substitutions et des équations algébriques, Gauthier-Villars, Paris, 1870.
- Frobenius, F. G., "Theorie der linearen Formen mit ganzen Coefficienten", Journal für die reine und angewandte Mathematik 86 (1879), 146–208.
- Frobenius, F. G., "Über lineare Substitutionen und bilineare Formen", Journal für die reine und angewandte Mathematik 84 (1878), 1–63.
Twentieth-century systematisation.
- Schreier, O. & Sperner, E., Einführung in die analytische Geometrie und Algebra, Vol. II (Vorlesungen über Matrizen), Teubner, Leipzig, 1932.
- van der Waerden, B. L., Moderne Algebra, two volumes, Springer, Berlin, 1930–1931.
- Halmos, P. R., Finite-Dimensional Vector Spaces, Annals of Mathematics Studies 7, Princeton University Press, 1942.
- Bourbaki, N., Algèbre, Ch. VII (Modules sur les anneaux principaux), Hermann, Paris, 1952.
Modern textbook treatments.
- Apostol, T. M., Calculus, Vol. 2: Multi-Variable Calculus and Linear Algebra with Applications, 2nd ed., John Wiley & Sons, 1969, Ch. 4 §4.20.
- Hoffman, K. & Kunze, R., Linear Algebra, 2nd ed., Prentice-Hall, 1971, Ch. 6–7.
- Lang, S., Algebra, 3rd ed. revised, Graduate Texts in Mathematics 211, Springer, 2002, Ch. III §10 and Ch. XIV §2.
- Axler, S., Linear Algebra Done Right, 3rd ed., Springer, 2015, Ch. 8.
Geometric representation theory follow-ups.
- Springer, T. A., "Trigonometric sums, Green functions of finite groups and representations of Weyl groups", Inventiones Mathematicae 36 (1976), 173–207.
- Lusztig, G., "Green polynomials and singularities of unipotent classes", Advances in Mathematics 42 (1981), 169–178.