Cayley–Hamilton theorem

Cayley–Hamilton theorem
Herbert Beraud (1845–1896) · Public domain · source
Name	Cayley–Hamilton theorem
Field	Linear algebra
Proved	1853
Author	Arthur Cayley; William Rowan Hamilton

Cayley–Hamilton theorem The Cayley–Hamilton theorem asserts that every square matrix over a commutative ring satisfies its own characteristic polynomial. The result plays a central role in linear algebra, matrix theory, control theory and differential equations, and connects to the work of Arthur Cayley, William Rowan Hamilton, James Joseph Sylvester, Camille Jordan and Ferdinand Frobenius.

Statement

The theorem states that for an n×n matrix A with entries in a commutative ring R, the characteristic polynomial p_A(λ) = det(λI − A) annihilates A: p_A(A) = 0. This formulation links to the determinant construction introduced by Carl Friedrich Gauss and the eigenvalue concepts developed by Joseph-Louis Lagrange, Augustin-Louis Cauchy and Karl Weierstrass. In modern presentations the statement is often cast using the companion matrix related to work of Émile Picard and the minimal polynomial concept investigated by Richard Dedekind and Leopold Kronecker.

Proofs

Numerous proofs exist, ranging from linear algebraic to ring-theoretic and representation-theoretic approaches. An elementary proof uses adjugate matrices and the identity A·adj(λI − A) = det(λI − A)I, techniques that trace to Gottfried Wilhelm Leibniz and Jacques Philippe Marie Binet. Another common proof employs the Jordan normal form found in Camille Jordan’s work, reducing the statement to blockwise verification for nilpotent Jordan blocks, a route informed by Georg Frobenius and Issai Schur. Ring-theoretic proofs apply formal polynomial functional calculus over commutative rings as in the methods of Emmy Noether and Emil Artin, while proofs using exterior algebra and wedge products draw on ideas by Hermann Grassmann. Category-theoretic and module-theoretic perspectives connect to the structure theorem for finitely generated modules over principal ideal domains, developed by David Hilbert and Emil Artin.

Examples and applications

The theorem yields explicit matrix identities and computational tools: expressing powers of matrices via lower-degree polynomials links to characteristic polynomial computations used in algorithms by John von Neumann and Alan Turing. In control theory and linear systems, Cayley–Hamilton underlies state-transition matrix formulae appearing in work by Rudolf Kalman and Harry Nyquist. Applications to differential equations exploit matrix exponentials and Putzer’s algorithm, methods influenced by S. D. Poisson and George D. Birkhoff. In algebraic combinatorics and graph theory the theorem informs the relation between adjacency matrices and characteristic polynomials, topics studied by Arthur Cayley and Frank Harary. Computational linear algebra leverages the theorem for minimal polynomial computation and rational canonical form as developed by Erling Følner and F. R. Gantmacher.

Generalizations and related results

Generalizations include versions for matrices over noncommutative rings with scalar extension constraints, areas explored by I. M. Gelfand and Israel Gelfand in noncommutative algebra, and operator-theoretic analogues for bounded linear operators on Banach spaces linked to Stefan Banach and John von Neumann. The theorem relates to the Frobenius normal form and rational canonical form discovered by Frobenius and Camille Jordan, and to spectral mapping theorems in functional analysis from Banach and Stone. Connections extend to invariant theory studied by David Hilbert and to identities in Lie algebra representation theory as in the work of Élie Cartan and Hermann Weyl.

Historical context

The result was first announced in correspondence by Arthur Cayley in the 19th century and was later given proofs and expansions by William Rowan Hamilton and James Joseph Sylvester. Subsequent formalizations and general treatments were contributed by Camille Jordan, Ferdinand Frobenius, Issai Schur, Emmy Noether, and Emil Artin, situating the theorem within the evolving framework of abstract algebra and linear operators developed across the 19th and 20th centuries. The theorem’s influence spans mathematical developments associated with Évariste Galois-era algebra, the foundation of matrix theory by Cayley and Sylvester, and the operator theory traditions advanced by David Hilbert and John von Neumann.

Category:Linear algebra