The Cayley–Hamilton theorem is a fundamental result in linear algebra stating that every square matrix satisfies its own characteristic polynomial. If is an matrix and
then
Here denotes the identity matrix, and the right-hand side is the zero matrix. The theorem expresses every sufficiently high power of as a linear combination of lower powers, making it central to the study of linear operators, polynomial identities, and matrix functions.
Statement and interpretation
The theorem holds for square matrices over any field, including the real numbers, complex numbers, and finite fields. More generally, it holds for matrices over any commutative ring with identity.
For a scalar polynomial
evaluation at a matrix means
The constant term must therefore be interpreted as a scalar multiple of , not as a scalar added directly to a matrix.
The characteristic polynomial is defined using the determinant. Its leading coefficient is , while
where is the trace.
There is also a basis-independent formulation. If is a linear map on a finite-dimensional vector space, then
The polynomial is computed from the matrix of in any basis. It is independent of that choice because similar matrices have the same characteristic polynomial.
Examples
A two-dimensional identity
For
the characteristic polynomial is
The theorem gives
or equivalently,
For example, let
Since and ,
Direct calculation gives
Thus .
Multiplying this identity by further powers of produces
Every matrix entry in the sequence consequently satisfies the same scalar recurrence relation.
A matrix with repeated eigenvalues
Consider
Its characteristic polynomial is , and the theorem gives , even though .
This example illustrates why the theorem is not merely a statement about eigenvalues. A polynomial that vanishes at every eigenvalue need not vanish at the matrix: the polynomial vanishes at the only eigenvalue of , but itself is nonzero.
Proof using the adjugate identity
A standard proof uses the adjugate matrix, the transpose of the matrix of cofactors. This proof works over any commutative ring with identity and does not require eigenvalues or division.
For an matrix , write
where each is a matrix over the coefficient ring. The adjugate identity gives
Comparing coefficients of powers of yields
and
Multiply the equation indexed by on the left by , and multiply on the left by . Adding all these equations, including the constant-term equation, gives
Every term cancels with an adjacent term.
A tempting shortcut is to “put ” directly into . Without a carefully defined evaluation procedure, that argument confuses scalar polynomial evaluation with a determinant expression involving matrix-valued substitutions. The coefficient proof avoids this problem.
Relationship to the minimal polynomial
Over a field , the minimal polynomial is the unique monic polynomial of least positive degree satisfying
Every polynomial that annihilates is divisible by . Indeed, polynomial division gives
If , then ; the minimality of forces .
The Cayley–Hamilton theorem therefore implies
The characteristic polynomial need not be the annihilating polynomial of smallest degree. For example, for the identity matrix,
The minimal polynomial also characterizes diagonalizability: a matrix is diagonalizable over precisely when its minimal polynomial splits over into distinct linear factors. This condition is stronger than the Cayley–Hamilton identity, which holds whether or not the matrix is diagonalizable.
Consequences and applications
Reduction of powers and polynomials
Rearranging the characteristic identity gives
Repeated use of this relation reduces every nonnegative power of to a linear combination of
More generally, if polynomial division gives
then
Using the minimal polynomial instead can reduce the required degree further.
The algebra
is consequently spanned by . Its dimension is exactly , because the powers below that degree are linearly independent.
Inverses
If is invertible, then over a field. Multiplication of the characteristic identity by gives
Thus the inverse is a polynomial in .
For a invertible matrix, this becomes
Over a commutative ring, the same formula applies when is a unit. Merely being nonzero is insufficient there.
Matrix functions and differential equations
For real or complex matrices, the matrix exponential is defined by the convergent power series
Because all powers of lie in a finite-dimensional span, this exponential can be represented as
where .
This representation is useful in solving constant-coefficient ordinary differential equations of the form
The scalar coefficient functions encode the exponential and, where required by repeated factors of the minimal polynomial, polynomial dependence on time.
Linear recurrences
For fixed vectors , define
Multiplying the characteristic identity by , then by these vectors, yields
This connects matrix iteration with linear recurrences, including those arising from transition matrices and finite-state systems.
Historical development
The theorem is named after Arthur Cayley and William Rowan Hamilton. Hamilton obtained a related identity through his work on quaternions. Cayley stated the general matrix theorem in his 1858 memoir on matrix theory and verified low-dimensional cases, rather than supplying the general proof now customary in textbooks.
Its development formed part of the nineteenth-century emergence of matrices as algebraic objects in their own right, rather than merely arrays of coefficients used to solve equations.
Scope and computational limitations
The finite-dimensional hypothesis is essential. An operator on an infinite-dimensional vector space need not satisfy any nonzero polynomial identity. For example, on the space of polynomials , multiplication by defines an operator for which
for every nonzero polynomial . Thus has no nonzero annihilating polynomial.
The commutativity assumption on the coefficient ring is also important. For matrices with entries in a noncommutative ring, the ordinary determinant and characteristic polynomial do not generally retain the properties used in the proof.
Although the theorem gives exact formulas for powers, inverses, and matrix functions, it does not by itself provide the best numerical algorithms. Computing characteristic coefficients and combining large matrix powers can introduce substantial rounding error and cancellation in floating-point arithmetic. Practical numerical linear algebra therefore generally uses methods tailored to the desired computation, such as matrix factorizations for solving linear systems and specialized algorithms for matrix exponentials.