The Cayley-Hamilton Theorem says every square matrix satisfies its own characteristic polynomial. In Linear Algebra and Differential Equations, that means you can replace high matrix powers with lower ones and use the result in system-solving.
The Cayley-Hamilton Theorem says a square matrix satisfies the polynomial you get from its characteristic equation. If p(\u03bb) is the characteristic polynomial of A, then p(A) is the zero matrix.
That sounds abstract, but the move is very concrete. First you find det(A - \u03bbI), which gives a polynomial in \u03bb. Then you treat the matrix A like the input and plug it into that same polynomial. The theorem says the combination of matrix powers and scalar terms collapses to 0.
For example, if a 2 x 2 matrix has characteristic polynomial \u03bb^2 - 5\u03bb + 6, then the theorem gives A^2 - 5A + 6I = 0. Rearranging lets you write A^2 in terms of A and I. That is the big payoff: once a matrix satisfies a polynomial relation, higher powers stop being mysterious.
In Linear Algebra and Differential Equations, this shows up when you need to simplify matrix expressions or solve systems x' = Ax. Instead of multiplying A over and over, you can use the polynomial relation to reduce powers that appear in formulas like e^(At) or in repeated matrix computations. This is why the theorem comes up again in eigenvalue methods for differential equations.
A common mistake is thinking Cayley-Hamilton only works for diagonalizable matrices or only for 2 x 2 examples. It works for every square matrix. The catch is just that the polynomial can get harder to compute by hand as the matrix gets larger, so the theorem is often used as a simplification tool after you already know the characteristic polynomial.
This theorem connects the algebra side of the course to the differential equations side. Once you know a matrix satisfies its own characteristic polynomial, you can turn a hard matrix power into a lower-order expression, which makes computation and proof work much cleaner.
That matters in eigenvalue-based methods for systems of differential equations, where you often build solutions from matrices, eigenvalues, and exponentials. If you are simplifying a matrix exponential or checking whether a matrix expression can be reduced, Cayley-Hamilton gives you a rule that turns repeated multiplication into a manageable identity.
It also deepens your understanding of why eigenvalues matter. The characteristic polynomial is not just a formula for finding eigenvalues, it actually controls how the matrix behaves algebraically. In that sense, the theorem links the polynomial, the matrix, and the system behavior into one idea.
You will see it most often when a problem asks you to verify an identity, reduce a power like A^4, or connect eigenvalues to the structure of a differential equation system. It is one of those results that saves time, but more importantly, it explains why matrix methods work the way they do.
Keep studying Linear Algebra and Differential Equations Unit 5
Visual cheatsheet
view galleryCharacteristic Polynomial
This is the starting point for Cayley-Hamilton. You compute the characteristic polynomial of a square matrix first, then substitute the matrix itself into that polynomial. If you do not have the polynomial, you cannot use the theorem. In practice, this makes the characteristic polynomial both a root-finding tool and an algebraic identity for the matrix.
Eigenvalues
Eigenvalues are the roots of the characteristic polynomial, so they are built into the theorem from the beginning. Cayley-Hamilton does not replace eigenvalues, but it shows that the same polynomial that reveals eigenvalues also governs matrix powers. That is why eigenvalue methods for systems of differential equations often rely on characteristic polynomial calculations.
Diagonalization
Diagonalization is another way to simplify matrix powers, but it works only when a matrix has enough eigenvectors. Cayley-Hamilton is broader because it applies to every square matrix, even when diagonalization fails. If a matrix is diagonalizable, both ideas can simplify computations, but they do it in different ways.
Jordan Form
Jordan form comes up when a matrix is not diagonalizable, and Cayley-Hamilton still applies in that case. The theorem helps explain why repeated matrix powers can still be reduced even when you cannot diagonalize cleanly. In advanced work, Jordan form and Cayley-Hamilton often appear together in matrix exponential problems.
A quiz or problem set item usually asks you to find the characteristic polynomial of a matrix and then use Cayley-Hamilton to reduce a power or verify an identity. You might be given A^3, A^4, or even a matrix exponential setup and asked to rewrite everything in terms of I and A. The main move is to compute p(A) = 0 correctly, then rearrange it to isolate the power you need.
In differential equations, the theorem can appear when you are solving x' = Ax and need to simplify matrix expressions connected to e^(At). If the problem gives you the characteristic polynomial, you may be expected to use it directly without recomputing every matrix product. A common grading issue is sign mistakes when expanding det(A - \u03bbI), so check the polynomial before substituting A back in.
Diagonalization rewrites a matrix in a simpler basis, usually to make powers and exponentials easier to compute. Cayley-Hamilton is different because it gives a polynomial identity that every square matrix satisfies, even when the matrix cannot be diagonalized. If a matrix is diagonalizable, you might use either idea, but they are not the same method.
The Cayley-Hamilton Theorem says a square matrix satisfies its own characteristic polynomial.
After you find det(A - \u03bbI), you can plug the matrix A into that polynomial and get the zero matrix.
The theorem is useful because it reduces high powers of a matrix into lower powers and the identity matrix.
It shows up in linear algebra and differential equations when you simplify matrix expressions or work with systems x' = Ax.
You do not need the matrix to be diagonalizable for the theorem to work.
It says every square matrix satisfies its own characteristic polynomial. In practice, that means if p(\u03bb) is the characteristic polynomial of A, then p(A) = 0. In this course, that identity is useful for reducing matrix powers and working with system solutions.
First find the characteristic polynomial by computing det(A - \u03bbI). Then replace \u03bb with A in that polynomial and set the result equal to the zero matrix. The resulting equation lets you solve for a higher power like A^2 or A^3 in terms of lower powers.
No. Diagonalization rewrites a matrix in a basis where it becomes a diagonal matrix, which makes powers easy to compute. Cayley-Hamilton is a polynomial identity that works for every square matrix, including ones that cannot be diagonalized.
It shows up when you solve systems x' = Ax and need to simplify matrix expressions, especially powers of A or formulas related to e^(At). The theorem gives an algebraic shortcut that connects the system matrix to its characteristic polynomial and eigenvalues.