Canonical: https://knowlpedia.com/linear-algebra/cayley-hamilton-theorem/

# Cayley–Hamilton theorem

A square matrix satisfies its own characteristic polynomial.

**Cayley–Hamilton theorem:** Let \(T:V\to V\) be a [linear operator](https://knowlpedia.com/linear-algebra/linear-operator/) on a finite-dimensional vector space \(V\). Let \(p_T(t)\) be the [characteristic polynomial](https://knowlpedia.com/linear-algebra/characteristic-polynomial/) of \(T\). Then
\[
p_T(T)=0,
\]
meaning that substituting \(T\) into its own characteristic polynomial yields the zero operator on \(V\).

## Equivalent characterizations

Equivalently, if \(A\) is an \(n\times n\) matrix and \(p_A(t)=\det(tI-A)\) (defined using the [determinant](https://knowlpedia.com/linear-algebra/determinant/)), then \(p_A(A)=0\).

## Remarks

One consequence is that the [minimal polynomial](https://knowlpedia.com/linear-algebra/minimal-polynomial/) divides the characteristic polynomial, linking algebraic identities of \(T\) to its [eigenvalues](https://knowlpedia.com/linear-algebra/eigenvalue/).
