Every matrix satisfies its own characteristic equation; consequently every power series in collapses to a polynomial of degree .
Statement
Cayley-Hamilton Theorem
- Every matrix satisfies its own char. eq’n:
- i.e.
- where , etc.
- and are the coefs. in the char. poly that defines the eigenvalues
- Equivalently:
- i.e. is a linear combination of up to
Higher Powers of A
- Hence
- can also be written as a linear combination of (substitute for from above)
- By induction we have:
- For any , can be written as a linear combination of ,
Finite Series for the Matrix Exponential
- Recall: for every , can be written as a linear combination of
- This applies to each term in the series for the matrix exponential , so that
- The can be found from
- each is a linear combination of terms, eigenvalues of
- This way of seeing that is built from the is less useful computationally, but quite helpful in certain theoretical arguments (compare the Laplace approach)
Possible slip in notes
- The handwritten Vandermonde system labels the unknowns (and the first entry on the right as ); written here with the indices to match the finite sum