Eigenvalues and Cayley–Hamilton
Characteristic and minimal polynomial, the eigenvalues of , and how a relation such as tells you almost everything about the matrix.
What to know by heart
For with eigenvalues (with multiplicity):
- Eigenvalues of a polynomial. For every polynomial , the eigenvalues of are , with multiplicity. Proof: triangularise, ; then and is triangular with diagonal . In particular .
- Cayley–Hamilton. . For : .
- Minimal polynomial : the monic polynomial of least degree with . It divides every with (hence also ) and has the same roots as , possibly with smaller multiplicities.
- Diagonalisation. is diagonalisable over if and only if has simple roots. Consequently: if for some with simple roots, is diagonalisable.
- and have the same characteristic polynomial, for square .
When to use it
- The statement gives a polynomial relation, e.g. or . Every eigenvalue is a root of the polynomial: here or . Since the roots are simple, is diagonalisable. Then , and count how many times each eigenvalue occurs.
- Large powers. To find , divide by (or ): with . Then . The coefficients of come from substituting the eigenvalues for .
- Determinants of the form . E.g. .
- Inversion. If , Cayley–Hamilton writes as a polynomial in .
Pitfalls
- The eigenvalues of are not when do not commute. With and , both and have only the eigenvalue , but has eigenvalues . For commuting matrices, see the sheet on nilpotent and commuting matrices.
- does not mean every root of is an eigenvalue. satisfies , but is not an eigenvalue of it.
- Real matrix, complex eigenvalues. has no real eigenvalues. Work over and come back to at the end. The non-real eigenvalues of a real matrix come in conjugate pairs.
- The "proof" is wrong. In the is a number; you cannot substitute a matrix before computing the determinant. If you need it in a solution, quote the theorem; don't "prove" it this way.
Further reading
- Axler, Linear Algebra Done Right, 4th ed., §5A (Invariant Subspaces)
- Axler, Linear Algebra Done Right, 4th ed., §5D (Diagonalizable Operators)
- Gelca & Andreescu, Putnam and Beyond, §2.3.6 (Linear Transformations, Eigenvalues, Eigenvectors)
- Gelca & Andreescu, Putnam and Beyond, §2.3.7 (The Cayley–Hamilton and Perron–Frobenius Theorems)
- Axler, Linear Algebra Done Right, 4th ed., §5B (The Minimal Polynomial)
Contest problems using these tools
No problems with these tools yet.