23
$\begingroup$

The statement of the Cayley-Hamilton Theorem is fairly straight-forward.
I now know how to find characteristic polynomials from a given matrix (or at least a matrix with certain properties that I am unaware of!).
I know that the eigenvalues of the matrix are roots of the polynomial.
But what does having such a polynomial mean? Wikipedia says that the characteristic polynomial "...encodes several important properties of the matrix...", but once we have switched to "matrix form" of the equation, what can we conclude?

In other words, what does the Theorem do for us, besides allowing us to say, "Hey, I know a matrix solution to this polynomial"?? Is there an abstraction of this in abstract algebra (rings, fields, etc.)?

Thanks for your time.


  • 0
    @Qiaochu: I would accept a short, *un* reasonable answer! But seriously, thanks $f$or your input. I'll make sure that I'm skilled with this tool hence$f$orth.2011-05-03

4 Answers 4

27

It's simple to see that every matrix $n\times n$ has to be a zero of some polynomial of degree at most $n^2$, simply because the space of $n\times n$ matrices has dimension $n^2$. The Cayley-Hamilton Theorem says that you can find such a polynomial of much smaller degree.

Another way to see this is as follows: For each fixed vector $v$, the vectors $v$, $Av$, ..., $A^n v$ cannot be linearly independent and so there is a polynomial $p$ of degree at most $n$ such that $p(A)v=0$. However, this polynomial depends on $v$. The Cayley-Hamilton Theorem gives you a polynomial that works for all vectors $v$.

Finally, for applications, having a polynomial $p$ such that $p(A)=0$ allows you to compute all powers of $A$ as a linear combination of $I$, $A$, ..., $A^{n-1}$. Indeed, assuming $p$ monic, you can write $p(X)=X^n+q(X)$ with $q$ of degree less than $n$. So $A^n = -q(A)$. Then $A^{n+1}=-A q(A)$. If $A^n$ appears in $A q(A)$, replace it by $-q(A)$. Do the same for $A^{n+2} = A \cdot A^{n+1}$, etc. For a concrete example, see http://en.wikipedia.org/wiki/Cayley-Hamilton_theorem#Illustration_for_specific_dimensions_and_practical_applications.

  • 0
    What about $e^{At}$?2017-09-16
11

First of all, the Cayley-Hamilton Theorem is a somewhat surprising result on its own. As for uses, it does not immediately give rise to many important statements, but it pops up in the proofs of other results occasionally. It is often involved in proving the Jordan canonical form, and I have also seen it used it to prove the main result regarding Kummer extensions in Galois theory. In particular, if a matrix vanishes on some polynomial, then its eigenvalues are a subset of the roots of the polynomial.

  • 1
    I don't think you need the Cayley-Hamilton for proving the existence of Jordan canonical forms: if your minimal (or characteristic) polynomial splits into linear factors, the space is a direct sum of kernels of the occurring powers of those factors (as I [explained here](http://math.stackexchange.com/a/96501/18880)), which suffices. Also if $Q(A)=0$ and $\lambda$ is eigenvalue it is obvious that $\lambda$ is root of $Q$; just compute $0=Q(A)v=Q(\lambda)v$ for a corresponding eigenvector.2013-05-21
11

Let $K$ be an algebraically closed field. Let $V$ be a vector space over $K$ of dimension $n$. Let $u\colon V \rightarrow V$ be a $K$-linear map. Let $K[X]$ be the polynomial ring with one variable. $V$ can be regarded as a $K[X]$-module as follows. Let $f(X) \in K[X], x \in V$. We define $f(X)x$ as $f(u)(x)$. It is easy to see that $V$ is a finitely generated torsion $K[X]$-module. Hence $V$ has a composition series: $V = V_0 \supset V_1 \supset\cdots \supset V_{r-1} \supset V_r = 0$. Since each $V_i/V_{i+1}$ is a simple $K[X]$-module, it is isomorphic to $K[X]/(X - \alpha_i)$, where $\alpha_i \in K$. It is easy to see that $f(X) = \prod_i (X - \alpha_i)$ is the characteristic polynomial of $u$. It is also easy to see that $f(X)V = 0$. This is the Cayley-Hamilton theorem.

Now let's consider the following analogy of the above argument. Let $G$ be a finitely generated torsion $\mathbb{Z}$-module, i.e. a finite abelian group. $G$ has a composition series: $G = G_0 \supset G_1 \supset\cdots \supset G_{r-1} \supset G_r = 0$. Each $G_i/G_{i+1}$ is isomorphic to $\mathbb{Z}/p_i\mathbb{Z}$, where $p_i$ is a prime number. It is easy to see that $|G|= \prod_i p_i$. It is also easy to see that $|G|G = 0$.

Therefore, in our analogy, $|G|$ corresponds to a characteristic polynomial and $|G|G = 0$ corresponds to the Cayley-Hamilton theorem.

  • 0
    $|G|G=0$ is of course Lagrange's theorem.2013-07-20
4

I would interpret the Wikipedia quote as a reference to the trace and determinant of the matrix showing up (up to sign) as the next-to-leading and constant term, respectively, of the polynomial. The other coefficients of the polynomial also have interpretations as matrix invariants, but not as familiar as trace and determinant.

  • 2
    There is other important information in the characteristic polynomial beyond its coefficients: It's irreducible factors correspond to irreducible factors of the minimal polynomial/polynomials whose powers occur in the rational canonical form, for example.2011-05-03