Cayley–Hamilton theorem

From HandWiki
Short description: Every square matrix over a commutative ring satisfies its own characteristic equation
Arthur Cayley, F.R.S. (1821–1895) is widely regarded as Britain's leading pure mathematician of the 19th century. Cayley in 1848 went to Dublin to attend lectures on quaternions by Hamilton, their discoverer. Later Cayley impressed him by being the second to publish work on them.[1] Cayley proved the theorem for matrices of dimension 3 and less, publishing proof for the two-dimensional case.[2][3] As for n × n matrices, Cayley stated “..., I have not thought it necessary to undertake the labor of a formal proof of the theorem in the general case of a matrix of any degree”.
William Rowan Hamilton (1805–1865), Irish physicist, astronomer, and mathematician, first foreign member of the American National Academy of Sciences. While maintaining an opposing position about how geometry should be studied, Hamilton always remained on the best terms with Cayley.[1]

Hamilton proved that for a linear function of quaternions there exists a certain equation, depending on the linear function, that is satisfied by the linear function itself.[4][5][6]

In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix over a commutative ring (such as the real or complex numbers or the integers) satisfies its own characteristic equation.

If A is a given n × n matrix and In  is the n × n identity matrix, then the characteristic polynomial of A is defined as[7] [math]\displaystyle{ p_A(\lambda)=\det(\lambda I_n-A) }[/math], where det is the determinant operation and λ is a variable for a scalar element of the base ring. Since the entries of the matrix [math]\displaystyle{ (\lambda I_n-A) }[/math] are (linear or constant) polynomials in λ, the determinant is also a degree-n monic polynomial in λ, [math]\displaystyle{ p_A(\lambda) = \lambda^n + c_{n-1}\lambda^{n-1} + \cdots + c_1\lambda + c_0~. }[/math] One can create an analogous polynomial [math]\displaystyle{ p_A(A) }[/math] in the matrix A instead of the scalar variable λ, defined as [math]\displaystyle{ p_A(A) = A^n + c_{n-1}A^{n-1} + \cdots + c_1A + c_0I_n~. }[/math] The Cayley–Hamilton theorem states that this polynomial expression is equal to the zero matrix, which is to say that [math]\displaystyle{ p_A(A) = \mathbf 0 }[/math]. The theorem allows An to be expressed as a linear combination of the lower matrix powers of A. When the ring is a field, the Cayley–Hamilton theorem is equivalent to the statement that the minimal polynomial of a square matrix divides its characteristic polynomial. The theorem was first proven in 1853[8] in terms of inverses of linear functions of quaternions, a non-commutative ring, by Hamilton.[4][5][6] This corresponds to the special case of certain 4 × 4 real or 2 × 2 complex matrices. The theorem holds for general quaternionic matrices.[9][nb 1] Cayley in 1858 stated it for 3 × 3 and smaller matrices, but only published a proof for the 2 × 2 case.[2] The general case was first proved by Ferdinand Frobenius in 1878.[10]


1 × 1 matrices

For a 1 × 1 matrix A = (a), the characteristic polynomial is given by p(λ) = λ − a, and so p(A) = (a) − a(1) = 0 is trivial.

2 × 2 matrices

As a concrete example, let

[math]\displaystyle{ A = \begin{pmatrix}1&2\\3&4\end{pmatrix}. }[/math]

Its characteristic polynomial is given by

[math]\displaystyle{ \begin{align} p(\lambda) &= \det(\lambda I_2-A) = \det\!\begin{pmatrix}\lambda-1&-2\\-3&\lambda-4\end{pmatrix} \\ &=(\lambda-1)(\lambda-4)-(-2)(-3)=\lambda^2-5\lambda-2. \end{align} }[/math]

The Cayley–Hamilton theorem claims that, if we define

[math]\displaystyle{ p(X)=X^2-5X-2I_2, }[/math]


[math]\displaystyle{ p(A)=A^2-5A-2I_2 = \begin{pmatrix}0&0\\0&0\\\end{pmatrix}. }[/math]

We can verify by computation that indeed,

[math]\displaystyle{ A^2-5A-2I_2 = \begin{pmatrix}7&10\\15&22\\\end{pmatrix}-\begin{pmatrix}5&10\\15&20\\\end{pmatrix}-\begin{pmatrix}2&0\\0&2\\\end{pmatrix}=\begin{pmatrix}0&0\\0&0\\\end{pmatrix}. }[/math]

For a generic 2 × 2 matrix,

[math]\displaystyle{ A=\begin{pmatrix}a&b\\c&d\\\end{pmatrix} , }[/math]

the characteristic polynomial is given by p(λ) = λ2 − (a + d)λ + (ad − bc), so the Cayley–Hamilton theorem states that

[math]\displaystyle{ p(A)=A^2-(a+d)A+(ad-bc)I_2=\begin{pmatrix}0&0\\0&0\\\end{pmatrix}; }[/math]

which is indeed always the case, evident by working out the entries of A2.


[math]\displaystyle{ A^2-(a+d)A+(ad-bc)I_2 }[/math]

[math]\displaystyle{ =\begin{pmatrix}a^2+bc&ab+bd\\ac+cd&bc+d^2\\\end{pmatrix}-\begin{pmatrix}a(a+d)&b(a+d)\\c(a+d)&d(a+d)\\\end{pmatrix}+(ad-bc)I_2 }[/math]

[math]\displaystyle{ =\begin{pmatrix}bc-ad&0\\0&bc-ad\\\end{pmatrix}+(ad-bc)I_2 }[/math]

[math]\displaystyle{ =\begin{pmatrix}0&0\\0&0\\\end{pmatrix} }[/math]


Determinant and inverse matrix

For a general n × n invertible matrix A, i.e., one with nonzero determinant, A−1 can thus be written as an (n − 1)-th order polynomial expression in A: As indicated, the Cayley–Hamilton theorem amounts to the identity

[math]\displaystyle{ p(A)=A^n+c_{n-1}A^{n-1}+\cdots+c_1A+(-1)^n\det(A)I_n =0. }[/math]

The coefficients ci are given by the elementary symmetric polynomials of the eigenvalues of A. Using Newton identities, the elementary symmetric polynomials can in turn be expressed in terms of power sum symmetric polynomials of the eigenvalues:

[math]\displaystyle{ s_k = \sum_{i=1}^n \lambda_i^k = \operatorname{tr}(A^k), }[/math]

where tr(Ak) is the trace of the matrix Ak. Thus, we can express ci in terms of the trace of powers of A.

In general, the formula for the coefficients ci is given in terms of complete exponential Bell polynomials as[nb 2]

[math]\displaystyle{ c_{n-k} = \frac{(-1)^{k}}{k!} B_k(s_1, -1! s_2, 2! s_3, \ldots, (-1)^{k-1}(k-1)! s_k). }[/math]

In particular, the determinant of A equals (−1)nc0. Thus, the determinant can be written as the trace identity:

[math]\displaystyle{ \det(A) = \frac{1}{n!} B_n(s_1, -1! s_2, 2! s_3, \ldots, (-1)^{n-1}(n-1)! s_n). }[/math]

Likewise, the characteristic polynomial can be written as

[math]\displaystyle{ -(-1)^n\det(A)I_n = A(A^{n-1}+c_{n-1}A^{n-2}+\cdots+c_{1}I_n), }[/math]

and, by multiplying both sides by A−1 (note −(−1)n = (−1)n−1), one is led to an expression for the inverse of A as a trace identity,

[math]\displaystyle{ \begin{align} A^{-1} & = \frac{(-1)^{n-1}}{\det A}(A^{n-1}+c_{n-1}A^{n-2}+\cdots+c_{1}I_n), \\[5pt] & = \frac{1}{\det A}\sum_{k=0}^{n-1} (-1)^{n+k-1}\frac{A^{n-k-1}}{k!} B_k(s_1, -1! s_2, 2! s_3, \ldots, (-1)^{k-1}(k-1)! s_k). \end{align} }[/math]

Another method for obtaining these coefficients ck for a general n × n matrix, provided no root be zero, relies on the following alternative expression for the determinant,

[math]\displaystyle{ p(\lambda)= \det (\lambda I_n -A) = \lambda^n \exp (\operatorname{tr} (\log (I_n - A/\lambda))). }[/math]

Hence, by virtue of the Mercator series,

[math]\displaystyle{ p(\lambda)= \lambda^n \exp \left( -\operatorname{tr} \sum_{m=1}^\infty {({A\over\lambda})^m \over m} \right), }[/math]

where the exponential only needs be expanded to order λn, since p(λ) is of order n, the net negative powers of λ automatically vanishing by the C–H theorem. (Again, this requires a ring containing the rational numbers.) Differentiation of this expression with respect to λ allows one to express the coefficients of the characteristic polynomial for general n as determinants of m × m matrices,[nb 3]

[math]\displaystyle{ c_{n-m} = \frac{(-1)^m}{m!} \begin{vmatrix} \operatorname{tr}A & m-1 &0&\cdots\\ \operatorname{tr}A^2 &\operatorname{tr}A& m-2 &\cdots\\ \vdots & \vdots & & & \vdots \\ \operatorname{tr}A^{m-1} &\operatorname{tr}A^{m-2}& \cdots & \cdots & 1 \\ \operatorname{tr}A^m &\operatorname{tr}A^{m-1}& \cdots & \cdots & \operatorname{tr}A \end{vmatrix} ~. }[/math]

For instance, the first few Bell polynomials are B0 = 1, B1(x1) = x1, B2(x1, x2) = x21 + x2, and B3(x1, x2, x3) = x31 + 3 x1x2 + x3.

Using these to specify the coefficients ci of the characteristic polynomial of a 2 × 2 matrix yields

[math]\displaystyle{ \begin{align} c_2 = B_0 = 1, \\[4pt] c_1 = \frac{-1}{1!} B_1(s_1) = - s_1 = - \operatorname{tr}(A), \\[4pt] c_0 = \frac{1}{2!} B_2(s_1, -1! s_2) = \frac{1}{2}(s_1^2 - s_2) = \frac{1}{2}((\operatorname{tr}(A))^2 - \operatorname{tr}(A^2)). \end{align} }[/math]

The coefficient c0 gives the determinant of the 2 × 2 matrix, c1 minus its trace, while its inverse is given by

[math]\displaystyle{ A^{-1} = \frac{-1}{\det A}(A + c_1 I_2) = \frac{-2(A - \operatorname{tr}(A) I_2)}{(\operatorname{tr}(A))^2 - \operatorname{tr}(A^2)}. }[/math]

It is apparent from the general formula for cnk, expressed in terms of Bell polynomials, that the expressions

[math]\displaystyle{ -\operatorname{tr}(A)\quad \text{and} \quad \tfrac 1 2 (\operatorname{tr}(A)^2 - \operatorname{tr}(A^2)) }[/math]

always give the coefficients cn−1 of λn−1 and cn−2 of λn−2 in the characteristic polynomial of any n × n matrix, respectively. So, for a 3 × 3 matrix A, the statement of the Cayley–Hamilton theorem can also be written as

[math]\displaystyle{ A^3- (\operatorname{tr}A)A^2+\frac{1}{2}\left((\operatorname{tr}A)^2-\operatorname{tr}(A^2)\right)A-\det(A)I_3=O, }[/math]

where the right-hand side designates a 3 × 3 matrix with all entries reduced to zero. Likewise, this determinant in the n = 3 case, is now

[math]\displaystyle{ \begin{align} \det(A) &= \frac{1}{3!} B_3(s_1, -1! s_2, 2! s_3) = \frac{1}{6}(s_1^3 + 3 s_1 (-s_2) + 2 s_3) \\[5pt] &= \tfrac{1}{6} \left ( (\operatorname{tr}A)^3-3\operatorname{tr}(A^2)(\operatorname{tr}A)+2\operatorname{tr}(A^3) \right ). \end{align} }[/math]

This expression gives the negative of coefficient cn−3 of λn−3 in the general case, as seen below.

Similarly, one can write for a 4 × 4 matrix A,

[math]\displaystyle{ A^4-(\operatorname{tr}A)A^3 + \tfrac{1}{2}\bigl((\operatorname{tr}A)^2-\operatorname{tr}(A^2)\bigr)A^2 - \tfrac{1}{6}\bigl( (\operatorname{tr}A)^3-3\operatorname{tr}(A^2)(\operatorname{tr}A)+2\operatorname{tr}(A^3)\bigr)A + \det(A)I_4 = O, }[/math]

where, now, the determinant is cn−4,

[math]\displaystyle{ \tfrac{1}{24}\! \left( (\operatorname{tr}A)^4-6 \operatorname{tr}(A^2)(\operatorname{tr}A)^2+3(\operatorname{tr}(A^2))^2+8\operatorname{tr}(A^3)\operatorname{tr}(A) -6\operatorname{tr}(A^4) \right), }[/math]

and so on for larger matrices. The increasingly complex expressions for the coefficients ck is deducible from Newton's identities or the Faddeev–LeVerrier algorithm.

n-th power of matrix

The Cayley–Hamilton theorem always provides a relationship between the powers of A (though not always the simplest one), which allows one to simplify expressions involving such powers, and evaluate them without having to compute the power An or any higher powers of A.

As an example, for [math]\displaystyle{ A = \begin{pmatrix}1&2\\3&4\end{pmatrix} }[/math] the theorem gives

[math]\displaystyle{ A^2=5A+2I_2\, . }[/math]

Then, to calculate A4, observe

[math]\displaystyle{ A^3=(5A+2I_2)A=5A^2+2A=5(5A+2I_2)+2A=27A+10I_2, }[/math]
[math]\displaystyle{ A^4=A^3A=(27A+10I_2)A=27A^2+10A=27(5A+2I_2)+10A=145A+54I_2\, . }[/math]


[math]\displaystyle{ A^{-1}=\frac{A-5I_2}{2}~. }[/math]
[math]\displaystyle{ A^{-2}=A^{-1}A^{-1}=\frac{A^2-10A+25I_2}{4}=\frac{(5A+2I_2)-10A+25I_2}{4}=\frac{-5A+27I_2}{4}~. }[/math]

Notice that we have been able to write the matrix power as the sum of two terms. In fact, matrix power of any order k can be written as a matrix polynomial of degree at most n − 1, where n is the size of a square matrix. This is an instance where Cayley–Hamilton theorem can be used to express a matrix function, which we will discuss below systematically.

Matrix functions

Given an analytic function

[math]\displaystyle{ f(x) = \sum_{k=0}^\infty a_k x^k }[/math]

and the characteristic polynomial p(x) of degree n of an n × n matrix A, the function can be expressed using long division as

[math]\displaystyle{ f(x) = q(x) p(x) + r(x), }[/math]

where q(x) is some quotient polynomial and r(x) is a remainder polynomial such that 0 ≤ deg r(x) < n.

By the Cayley–Hamilton theorem, replacing x by the matrix A gives p(A) = 0, so one has

[math]\displaystyle{ f(A) = r(A). }[/math]

Thus, the analytic function of the matrix A can be expressed as a matrix polynomial of degree less than n.

Let the remainder polynomial be

[math]\displaystyle{ r(x) = c_0 + c_1 x + \cdots + c_{n-1} x^{n-1}. }[/math]

Since p(λ) = 0, evaluating the function f(x) at the n eigenvalues of A yields

[math]\displaystyle{ f(\lambda_i) = r(\lambda_i) = c_0 + c_1 \lambda_i + \cdots + c_{n-1} \lambda_i^{n-1}, \qquad \text{for } i=1,2,...,n. }[/math]

This amounts to a system of n linear equations, which can be solved to determine the coefficients ci. Thus, one has

[math]\displaystyle{ f(A) = \sum_{k=0}^{n-1} c_k A^k. }[/math]

When the eigenvalues are repeated, that is λi = λj for some i ≠ j, two or more equations are identical; and hence the linear equations cannot be solved uniquely. For such cases, for an eigenvalue λ with multiplicity m, the first m – 1 derivatives of p(x) vanish at the eigenvalue. This leads to the extra m – 1 linearly independent solutions

[math]\displaystyle{ \frac{\mathrm{d}^k f(x)}{\mathrm{d}x^k}\Big|_{x=\lambda} = \frac{\mathrm{d}^k r(x)}{\mathrm{d}x^k}\Big|_{x=\lambda}\qquad \text{for } k = 1, 2, \ldots, m-1, }[/math]

which, combined with others, yield the required n equations to solve for ci.

Finding a polynomial that passes through the points (λi,  f (λi)) is essentially an interpolation problem, and can be solved using Lagrange or Newton interpolation techniques, leading to Sylvester's formula.

For example, suppose the task is to find the polynomial representation of

[math]\displaystyle{ f(A) = e^{At} \qquad \mathrm{where} \qquad A = \begin{pmatrix}1&2\\0&3\end{pmatrix}. }[/math]

The characteristic polynomial is p(x) = (x − 1)(x − 3) = x2 − 4x + 3, and the eigenvalues are λ = 1, 3. Let r(x) = c0 + c1x. Evaluating f(λ) = r(λ) at the eigenvalues, one obtains two linear equations, et = c0 + c1 and e3t = c0 + 3c1.

Solving the equations yields c0 = (3ete3t)/2 and c1 = (e3tet)/2. Thus, it follows that

[math]\displaystyle{ e^{At} = c_0 I_2 + c_1 A = \begin{pmatrix}c_0 + c_1 & 2 c_1\\ 0 & c_0 + 3 c_1\end{pmatrix} = \begin{pmatrix}e^{t} & e^{3t} - e^{t} \\ 0 & e^{3t}\end{pmatrix}. }[/math]

If, instead, the function were f(A) = sin At, then the coefficients would have been c0 = (3 sin t − sin 3t)/2 and c1 = (sin 3t − sin t)/2; hence

[math]\displaystyle{ \sin(At) = c_0 I_2 + c_1 A = \begin{pmatrix}\sin t & \sin 3t - \sin t \\ 0 & \sin 3t\end{pmatrix}. }[/math]

As a further example, when considering

[math]\displaystyle{ f(A) = e^{At} \qquad \mathrm{where} \qquad A = \begin{pmatrix}0 & 1\\-1 & 0\end{pmatrix}, }[/math]

then the characteristic polynomial is p(x) = x2 + 1, and the eigenvalues are λ = ±i.

As before, evaluating the function at the eigenvalues gives us the linear equations eit = c0 + i c1 and eit = c0ic1; the solution of which gives, c0 = (eit + eit)/2 = cos t and c1 = (eiteit)/2i = sin t. Thus, for this case,

[math]\displaystyle{ e^{At} = (\cos t) I_2 + (\sin t) A = \begin{pmatrix}\cos t & \sin t\\ -\sin t & \cos t \end{pmatrix}, }[/math]

which is a rotation matrix.

Standard examples of such usage is the exponential map from the Lie algebra of a matrix Lie group into the group. It is given by a matrix exponential,

[math]\displaystyle{ \exp: \mathfrak g \rightarrow G; \qquad tX \mapsto e^{tX} = \sum_{n=0}^\infty \frac{t^nX^n}{n!} = I + tX + \frac{t^2X^2}{2} + \cdots, t \in \mathbb R, X \in \mathfrak g . }[/math]

Such expressions have long been known for SU(2),

[math]\displaystyle{ e^{i(\theta/2)(\hat n \cdot \sigma)} = I_2 \cos \theta/2 + i(\hat n \cdot \sigma) \sin \theta/2, }[/math]

where the σ are the Pauli matrices and for SO(3),

[math]\displaystyle{ e^{i\theta(\hat n \cdot \mathbf J)} = I_3 + i(\hat n \cdot \mathbf J) \sin \theta + (\hat n \cdot \mathbf J)^2 (\cos \theta - 1), }[/math]

which is Rodrigues' rotation formula. For the notation, see 3D rotation group#A note on Lie algebras.

More recently, expressions have appeared for other groups, like the Lorentz group SO(3, 1),[11] O(4, 2)[12] and SU(2, 2),[13] as well as GL(n, R).[14] The group O(4, 2) is the conformal group of spacetime, SU(2, 2) its simply connected cover (to be precise, the simply connected cover of the connected component SO+(4, 2) of O(4, 2)). The expressions obtained apply to the standard representation of these groups. They require knowledge of (some of) the eigenvalues of the matrix to exponentiate. For SU(2) (and hence for SO(3)), closed expressions have been obtained for all irreducible representations, i.e. of any spin.[15]

Ferdinand Georg Frobenius (1849–1917), German mathematician. His main interests were elliptic functions, differential equations, and later group theory.
In 1878 he gave the first full proof of the Cayley–Hamilton theorem.[10]

Algebraic number theory

The Cayley–Hamilton theorem is an effective tool for computing the minimal polynomial of algebraic integers. For example, given a finite extension [math]\displaystyle{ \mathbb{Q}[\alpha_1,\ldots,\alpha_k] }[/math] of [math]\displaystyle{ \mathbb{Q} }[/math] and an algebraic integer [math]\displaystyle{ \alpha \in \mathbb{Q}[\alpha_1,\ldots,\alpha_k] }[/math] which is a non-zero linear combination of the [math]\displaystyle{ \alpha_1^{n_1}\cdots\alpha_k^{n_k} }[/math] we can compute the minimal polynomial of [math]\displaystyle{ \alpha }[/math] by finding a matrix representing the [math]\displaystyle{ \mathbb{Q} }[/math]-linear transformation

[math]\displaystyle{ \cdot \alpha : \mathbb{Q}[\alpha_1,\ldots,\alpha_k] \to \mathbb{Q}[\alpha_1,\ldots,\alpha_k] }[/math]

If we call this transformation matrix [math]\displaystyle{ A }[/math], then we can find the minimal polynomial by applying the Cayley–Hamilton theorem to [math]\displaystyle{ A }[/math].[16]


The Cayley–Hamilton theorem is an immediate consequence of the existence of the Jordan normal form for matrices over algebraically closed fields, see Jordan normal form § Cayley–Hamilton theorem. In this section, direct proofs are presented.

As the examples above show, obtaining the statement of the Cayley–Hamilton theorem for an n × n matrix

[math]\displaystyle{ A = (a_{ij})_{i,j=1}^n }[/math]

requires two steps: first the coefficients ci of the characteristic polynomial are determined by development as a polynomial in t of the determinant

[math]\displaystyle{ \begin{align} p(t) & = \det(t I_n - A) = \begin{vmatrix}t-a_{1,1}&-a_{1,2}&\cdots&-a_{1,n} \\ -a_{2,1}&t-a_{2,2}&\cdots&-a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ -a_{n,1}&-a_{n,2}& \cdots& t-a_{n,n} \end{vmatrix} \\[5pt] & = t^n+c_{n-1}t^{n-1}+\cdots+c_1t+c_0, \end{align} }[/math]

and then these coefficients are used in a linear combination of powers of A that is equated to the n × n zero matrix:

[math]\displaystyle{ A^n+c_{n-1}A^{n-1} + \cdots + c_1 A + c_0 I_n = \begin{pmatrix} 0 & \cdots & 0 \\ \vdots & \ddots & \vdots \\ 0 & \cdots & 0 \end{pmatrix}. }[/math]

The left-hand side can be worked out to an n × n matrix whose entries are (enormous) polynomial expressions in the set of entries ai,j of A, so the Cayley–Hamilton theorem states that each of these n2 expressions equals 0. For any fixed value of n, these identities can be obtained by tedious but straightforward algebraic manipulations. None of these computations, however, can show why the Cayley–Hamilton theorem should be valid for matrices of all possible sizes n, so a uniform proof for all n is needed.


If a vector v of size n is an eigenvector of A with eigenvalue λ, in other words if Av = λv, then

[math]\displaystyle{ \begin{align} p(A)\cdot v & = A^n\cdot v+c_{n-1}A^{n-1}\cdot v+\cdots+c_1A\cdot v+c_0I_n\cdot v \\[6pt] & = \lambda^nv+c_{n-1}\lambda^{n-1}v+\cdots+c_1\lambda v+c_0 v=p(\lambda)v, \end{align} }[/math]

which is the zero vector since p(λ) = 0 (the eigenvalues of A are precisely the roots of p(t)). This holds for all possible eigenvalues λ, so the two matrices equated by the theorem certainly give the same (null) result when applied to any eigenvector. Now if A admits a basis of eigenvectors, in other words if A is diagonalizable, then the Cayley–Hamilton theorem must hold for A, since two matrices that give the same values when applied to each element of a basis must be equal.

[math]\displaystyle{ A=XDX^{-1}, \quad D=\operatorname{diag}(\lambda_i), \quad i=1,2,...,n }[/math]
[math]\displaystyle{ p_A(\lambda)=|\lambda I-A|=\prod_{i=1}^n (\lambda-\lambda_i)\equiv \sum_{k=0}^n c_k\lambda^k }[/math]
[math]\displaystyle{ p_A(A)=\sum c_k A^k=X p_A(D)X^{-1}=X C X^{-1} }[/math]
[math]\displaystyle{ C_{ii}=\sum_{k=0}^n c_k\lambda_i^k=\prod_{j=1}^n(\lambda_i-\lambda_j)=0, \qquad C_{i,j\neq i}=0 }[/math]
[math]\displaystyle{ \therefore p_A(A)=XCX^{-1}=O . }[/math]

Consider now the function [math]\displaystyle{ e\colon M_n \to M_n }[/math] which maps n × n matrices to n × n matrices given by the formula [math]\displaystyle{ e(A)=p_A(A) }[/math], i.e. which takes a matrix [math]\displaystyle{ A }[/math] and plugs it into its own characteristic polynomial. Not all matrices are diagonalizable, but for matrices with complex coefficients many of them are: the set [math]\displaystyle{ D }[/math] of diagonalizable complex square matrices of a given size is dense in the set of all such square matrices[17] (for a matrix to be diagonalizable it suffices for instance that its characteristic polynomial not have any multiple roots). Now viewed as a function [math]\displaystyle{ e\colon \C^{n^2}\to \C ^{n^{2}} }[/math](since matrices have [math]\displaystyle{ n^2 }[/math]entries) we see that this function is continuous. This is true because the entries of the image of a matrix are given by polynomials in the entries of the matrix. Since

[math]\displaystyle{ e(D) = \left\{\begin{pmatrix} 0 & \cdots & 0 \\ \vdots & \ddots & \vdots \\ 0 & \cdots & 0 \end{pmatrix}\right\} }[/math]

and since the set [math]\displaystyle{ D }[/math] is dense, by continuity this function must map the entire set of n × n matrices to the zero matrix. Therefore, the Cayley–Hamilton theorem is true for complex numbers, and must therefore also hold for [math]\displaystyle{ \Q }[/math]- or [math]\displaystyle{ \R }[/math]-valued matrices.

While this provides a valid proof, the argument is not very satisfactory, since the identities represented by the theorem do not in any way depend on the nature of the matrix (diagonalizable or not), nor on the kind of entries allowed (for matrices with real entries the diagonalizable ones do not form a dense set, and it seems strange one would have to consider complex matrices to see that the Cayley–Hamilton theorem holds for them). We shall therefore now consider only arguments that prove the theorem directly for any matrix using algebraic manipulations only; these also have the benefit of working for matrices with entries in any commutative ring.

There is a great variety of such proofs of the Cayley–Hamilton theorem, of which several will be given here. They vary in the amount of abstract algebraic notions required to understand the proof. The simplest proofs use just those notions needed to formulate the theorem (matrices, polynomials with numeric entries, determinants), but involve technical computations that render somewhat mysterious the fact that they lead precisely to the correct conclusion. It is possible to avoid such details, but at the price of involving more subtle algebraic notions: polynomials with coefficients in a non-commutative ring, or matrices with unusual kinds of entries.

Adjugate matrices

All proofs below use the notion of the adjugate matrix adj(M) of an n × n matrix M, the transpose of its cofactor matrix. This is a matrix whose coefficients are given by polynomial expressions in the coefficients of M (in fact, by certain (n − 1) × (n − 1) determinants), in such a way that the following fundamental relations hold,

[math]\displaystyle{ \operatorname{adj}(M)\cdot M=\det(M)I_n=M\cdot\operatorname{adj}(M)~. }[/math]

These relations are a direct consequence of the basic properties of determinants: evaluation of the (i, j) entry of the matrix product on the left gives the expansion by column j of the determinant of the matrix obtained from M by replacing column i by a copy of column j, which is det(M) if i = j and zero otherwise; the matrix product on the right is similar, but for expansions by rows.

Being a consequence of just algebraic expression manipulation, these relations are valid for matrices with entries in any commutative ring (commutativity must be assumed for determinants to be defined in the first place). This is important to note here, because these relations will be applied below for matrices with non-numeric entries such as polynomials.

A direct algebraic proof

This proof uses just the kind of objects needed to formulate the Cayley–Hamilton theorem: matrices with polynomials as entries. The matrix t InA whose determinant is the characteristic polynomial of A is such a matrix, and since polynomials form a commutative ring, it has an adjugate

[math]\displaystyle{ B=\operatorname{adj}(tI_n-A). }[/math]

Then, according to the right-hand fundamental relation of the adjugate, one has

[math]\displaystyle{ (t I_n - A)B = \det(t I_n - A) I_n = p(t) I_n. }[/math]

Since B is also a matrix with polynomials in t as entries, one can, for each i, collect the coefficients of ti in each entry to form a matrix Bi of numbers, such that one has

[math]\displaystyle{ B = \sum_{i = 0}^{n - 1} t^i B_i. }[/math]

(The way the entries of B are defined makes clear that no powers higher than tn−1 occur). While this looks like a polynomial with matrices as coefficients, we shall not consider such a notion; it is just a way to write a matrix with polynomial entries as a linear combination of n constant matrices, and the coefficient ti has been written to the left of the matrix to stress this point of view.

Now, one can expand the matrix product in our equation by bilinearity:

[math]\displaystyle{ \begin{align} p(t) I_n &= (t I_n - A)B \\ &=(t I_n - A)\sum_{i = 0}^{n - 1} t^i B_i \\ &=\sum_{i = 0}^{n - 1} tI_n\cdot t^i B_i - \sum_{i = 0}^{n - 1} A\cdot t^i B_i \\ &=\sum_{i = 0}^{n - 1} t^{i + 1} B_i- \sum_{i = 0}^{n - 1} t^i AB_i \\ &=t^n B_{n - 1} + \sum_{i = 1}^{n - 1} t^i(B_{i - 1} - AB_i) - AB_0. \end{align} }[/math]


[math]\displaystyle{ p(t)I_n=t^nI_n+t^{n-1}c_{n-1}I_n+\cdots+tc_1I_n+c_0I_n, }[/math]

one obtains an equality of two matrices with polynomial entries, written as linear combinations of constant matrices with powers of t as coefficients.

Such an equality can hold only if in any matrix position the entry that is multiplied by a given power ti is the same on both sides; it follows that the constant matrices with coefficient ti in both expressions must be equal. Writing these equations then for i from n down to 0, one finds

[math]\displaystyle{ B_{n - 1} = I_n, \qquad B_{i - 1} - AB_i = c_i I_n\quad \text{for }1 \leq i \leq n-1, \qquad -A B_0 = c_0 I_n. }[/math]

Finally, multiply the equation of the coefficients of ti from the left by Ai, and sum up:

[math]\displaystyle{ A^n B_{n-1} + \sum\limits_{i=1}^{n-1}\left( A^i B_{i-1} - A^{i+1}B_i\right) -A B_0 = A^n+c_{n-1}A^{n-1}+\cdots+c_1A+c_0I_n. }[/math]

The left-hand sides form a telescoping sum and cancel completely; the right-hand sides add up to [math]\displaystyle{ p(A) }[/math]:

[math]\displaystyle{ 0 = p(A). }[/math]

This completes the proof.

A proof using polynomials with matrix coefficients

This proof is similar to the first one, but tries to give meaning to the notion of polynomial with matrix coefficients that was suggested by the expressions occurring in that proof. This requires considerable care, since it is somewhat unusual to consider polynomials with coefficients in a non-commutative ring, and not all reasoning that is valid for commutative polynomials can be applied in this setting.

Notably, while arithmetic of polynomials over a commutative ring models the arithmetic of polynomial functions, this is not the case over a non-commutative ring (in fact there is no obvious notion of polynomial function in this case that is closed under multiplication). So when considering polynomials in t with matrix coefficients, the variable t must not be thought of as an "unknown", but as a formal symbol that is to be manipulated according to given rules; in particular one cannot just set t to a specific value.

[math]\displaystyle{ (f+g)(x) = \sum_i \left (f_i+g_i \right )x^i = \sum_i{f_i x^i} + \sum_i{g_i x^i} = f(x) + g(x). }[/math]

Let [math]\displaystyle{ M(n,R) }[/math] be the ring of n × n matrices with entries in some ring R (such as the real or complex numbers) that has A as an element. Matrices with as coefficients polynomials in t, such as [math]\displaystyle{ tI_n - A }[/math] or its adjugate B in the first proof, are elements of [math]\displaystyle{ M(n,R[t]) }[/math].

By collecting like powers of t, such matrices can be written as "polynomials" in t with constant matrices as coefficients; write [math]\displaystyle{ M(n,R)[t] }[/math] for the set of such polynomials. Since this set is in bijection with [math]\displaystyle{ M(n,R[t]) }[/math], one defines arithmetic operations on it correspondingly, in particular multiplication is given by

[math]\displaystyle{ \left( \sum_iM_it^i \right)\!\!\left( \sum_jN_jt^j \right) = \sum_{i,j}(M_i N_j)t^{i+j}, }[/math]

respecting the order of the coefficient matrices from the two operands; obviously this gives a non-commutative multiplication.

Thus, the identity

[math]\displaystyle{ (t I_n - A)B = p(t) I_n. }[/math]

from the first proof can be viewed as one involving a multiplication of elements in [math]\displaystyle{ M(n,R)[t] }[/math] .

At this point, it is tempting to simply set t equal to the matrix A, which makes the first factor on the left equal to the zero matrix, and the right hand side equal to p(A); however, this is not an allowed operation when coefficients do not commute. It is possible to define a "right-evaluation map" evA : M[t ] → M, which replaces each ti by the matrix power Ai of A, where one stipulates that the power is always to be multiplied on the right to the corresponding coefficient. But this map is not a ring homomorphism: the right-evaluation of a product differs in general from the product of the right-evaluations. This is so because multiplication of polynomials with matrix coefficients does not model multiplication of expressions containing unknowns: a product [math]\displaystyle{ Mt^i Nt^j = (M\cdot N)t^{i+j} }[/math] is defined assuming that t commutes with N, but this may fail if t is replaced by the matrix A.

One can work around this difficulty in the particular situation at hand, since the above right-evaluation map does become a ring homomorphism if the matrix A is in the center of the ring of coefficients, so that it commutes with all the coefficients of the polynomials (the argument proving this is straightforward, exactly because commuting t with coefficients is now justified after evaluation).

Now, A is not always in the center of M, but we may replace M with a smaller ring provided it contains all the coefficients of the polynomials in question: [math]\displaystyle{ I_n }[/math], A, and the coefficients [math]\displaystyle{ B_i }[/math] of the polynomial B. The obvious choice for such a subring is the centralizer Z of A, the subring of all matrices that commute with A; by definition A is in the center of Z.

This centralizer obviously contains [math]\displaystyle{ I_n }[/math], and A, but one has to show that it contains the matrices [math]\displaystyle{ B_i }[/math]. To do this, one combines the two fundamental relations for adjugates, writing out the adjugate B as a polynomial:

[math]\displaystyle{ \begin{align} \left(\sum_{i = 0}^m B_i t^i\right)\!(t I_n - A) &= (tI_n - A) \sum_{i = 0}^m B_i t^i \\ \sum_{i = 0}^m B_i t^{i + 1} - \sum_{i = 0}^m B_i A t^i &= \sum_{i = 0}^m B_i t^{i + 1} - \sum_{i = 0}^m A B_i t^i \\ \sum_{i = 0}^m B_i A t^i &= \sum_{i = 0}^m A B_i t^i . \end{align} }[/math]

Equating the coefficients shows that for each i, we have ABi = BiA as desired. Having found the proper setting in which evA is indeed a homomorphism of rings, one can complete the proof as suggested above:

[math]\displaystyle{ \begin{align} \operatorname{ev}_A\left(p(t)I_n\right) &= \operatorname{ev}_A((tI_n-A)B) \\[5pt] p(A) &= \operatorname{ev}_A(tI_n - A)\cdot \operatorname{ev}_A(B) \\[5pt] p(A) &= (AI_n-A) \cdot \operatorname{ev}_A(B) = O\cdot\operatorname{ev}_A(B)=O. \end{align} }[/math]

This completes the proof.

A synthesis of the first two proofs

In the first proof, one was able to determine the coefficients Bi of B based on the right-hand fundamental relation for the adjugate only. In fact the first n equations derived can be interpreted as determining the quotient B of the Euclidean division of the polynomial p(t)In on the left by the monic polynomial IntA, while the final equation expresses the fact that the remainder is zero. This division is performed in the ring of polynomials with matrix coefficients. Indeed, even over a non-commutative ring, Euclidean division by a monic polynomial P is defined, and always produces a unique quotient and remainder with the same degree condition as in the commutative case, provided it is specified at which side one wishes P to be a factor (here that is to the left).

To see that quotient and remainder are unique (which is the important part of the statement here), it suffices to write [math]\displaystyle{ PQ+r = PQ'+r' }[/math] as [math]\displaystyle{ P(Q-Q') = r'-r }[/math] and observe that since P is monic, P(QQ′) cannot have a degree less than that of P, unless Q = Q.

But the dividend p(t)In and divisor IntA used here both lie in the subring (R[A])[t], where R[A] is the subring of the matrix ring M(n, R) generated by A: the R-linear span of all powers of A. Therefore, the Euclidean division can in fact be performed within that commutative polynomial ring, and of course it then gives the same quotient B and remainder 0 as in the larger ring; in particular this shows that B in fact lies in (R[A])[t].

But, in this commutative setting, it is valid to set t to A in the equation

[math]\displaystyle{ p(t)I_n=(tI_n-A)B; }[/math]

in other words, to apply the evaluation map

[math]\displaystyle{ \operatorname{ev}_A:(R[A])[t]\to R[A] }[/math]

which is a ring homomorphism, giving

[math]\displaystyle{ p(A)=0\cdot\operatorname{ev}_A(B)=0 }[/math]

just like in the second proof, as desired.

In addition to proving the theorem, the above argument tells us that the coefficients Bi of B are polynomials in A, while from the second proof we only knew that they lie in the centralizer Z of A; in general Z is a larger subring than R[A], and not necessarily commutative. In particular the constant term B0 = adj(−A) lies in R[A]. Since A is an arbitrary square matrix, this proves that adj(A) can always be expressed as a polynomial in A (with coefficients that depend on A).

In fact, the equations found in the first proof allow successively expressing [math]\displaystyle{ B_{n-1}, \ldots, B_1, B_0 }[/math] as polynomials in A, which leads to the identity

[math]\displaystyle{ \operatorname{adj}(-A)=\sum_{i=1}^nc_iA^{i-1}, }[/math]

valid for all n × n matrices, where

[math]\displaystyle{ p(t)=t^n+c_{n-1}t^{n-1}+\cdots+c_1t+c_0 }[/math]

is the characteristic polynomial of A.

Note that this identity also implies the statement of the Cayley–Hamilton theorem: one may move adj(−A) to the right hand side, multiply the resulting equation (on the left or on the right) by A, and use the fact that

[math]\displaystyle{ -A\cdot \operatorname{adj}(-A) = \operatorname{adj}(-A)\cdot (-A) = \det(-A)I_n = c_0I_n. }[/math]

A proof using matrices of endomorphisms

As was mentioned above, the matrix p(A) in statement of the theorem is obtained by first evaluating the determinant and then substituting the matrix A for t; doing that substitution into the matrix [math]\displaystyle{ tI_n-A }[/math] before evaluating the determinant is not meaningful. Nevertheless, it is possible to give an interpretation where p(A) is obtained directly as the value of a certain determinant, but this requires a more complicated setting, one of matrices over a ring in which one can interpret both the entries [math]\displaystyle{ A_{i,j} }[/math] of A, and all of A itself. One could take for this the ring M(n, R) of n × n matrices over R, where the entry [math]\displaystyle{ A_{i,j} }[/math] is realised as [math]\displaystyle{ A_{i,j}I_n }[/math], and A as itself. But considering matrices with matrices as entries might cause confusion with block matrices, which is not intended, as that gives the wrong notion of determinant (recall that the determinant of a matrix is defined as a sum of products of its entries, and in the case of a block matrix this is generally not the same as the corresponding sum of products of its blocks!). It is clearer to distinguish A from the endomorphism φ of an n-dimensional vector space V (or free R-module if R is not a field) defined by it in a basis [math]\displaystyle{ e_1, \ldots, e_n }[/math], and to take matrices over the ring End(V) of all such endomorphisms. Then φ ∈ End(V) is a possible matrix entry, while A designates the element of M(n, End(V)) whose i, j entry is endomorphism of scalar multiplication by [math]\displaystyle{ A_{i,j} }[/math]; similarly [math]\displaystyle{ I_n }[/math] will be interpreted as element of M(n, End(V)). However, since End(V) is not a commutative ring, no determinant is defined on M(n, End(V)); this can only be done for matrices over a commutative subring of End(V). Now the entries of the matrix [math]\displaystyle{ \varphi I_n-A }[/math] all lie in the subring R[φ] generated by the identity and φ, which is commutative. Then a determinant map M(n, R[φ]) → R[φ] is defined, and [math]\displaystyle{ \det(\varphi I_n-A) }[/math] evaluates to the value p(φ) of the characteristic polynomial of A at φ (this holds independently of the relation between A and φ); the Cayley–Hamilton theorem states that p(φ) is the null endomorphism.

In this form, the following proof can be obtained from that of (Atiyah & MacDonald 1969, Prop. 2.4) (which in fact is the more general statement related to the Nakayama lemma; one takes for the ideal in that proposition the whole ring R). The fact that A is the matrix of φ in the basis e1, ..., en means that

[math]\displaystyle{ \varphi(e_i) = \sum_{j = 1}^n A_{j,i} e_j \quad\text{for }i=1,\ldots,n. }[/math]

One can interpret these as n components of one equation in Vn, whose members can be written using the matrix-vector product M(n, End(V)) × VnVn that is defined as usual, but with individual entries ψ ∈ End(V) and v in V being "multiplied" by forming [math]\displaystyle{ \psi(v) }[/math]; this gives:

[math]\displaystyle{ \varphi I_n \cdot E= A^\operatorname{tr}\cdot E, }[/math]

where [math]\displaystyle{ E\in V^n }[/math] is the element whose component i is ei (in other words it is the basis e1, ..., en of V written as a column of vectors). Writing this equation as

[math]\displaystyle{ (\varphi I_n-A^\operatorname{tr})\cdot E = 0\in V^n }[/math]

one recognizes the transpose of the matrix [math]\displaystyle{ \varphi I_n-A }[/math] considered above, and its determinant (as element of M(n, R[φ])) is also p(φ). To derive from this equation that p(φ) = 0 ∈ End(V), one left-multiplies by the adjugate matrix of [math]\displaystyle{ \varphi I_n-A^\operatorname{tr} }[/math], which is defined in the matrix ring M(n, R[φ]), giving

[math]\displaystyle{ \begin{align} 0&=\operatorname{adj}(\varphi I_n-A^\operatorname{tr})\cdot((\varphi I_n-A^\operatorname{tr})\cdot E)\\ &= (\operatorname{adj}(\varphi I_n-A^\operatorname{tr})\cdot(\varphi I_n-A^\operatorname{tr}))\cdot E\\ &= (\det(\varphi I_n-A^\operatorname{tr})I_n)\cdot E\\ &= (p(\varphi)I_n)\cdot E; \end{align} }[/math]

the associativity of matrix-matrix and matrix-vector multiplication used in the first step is a purely formal property of those operations, independent of the nature of the entries. Now component i of this equation says that p(φ)(ei) = 0 ∈ V; thus p(φ) vanishes on all ei, and since these elements generate V it follows that p(φ) = 0 ∈ End(V), completing the proof.

One additional fact that follows from this proof is that the matrix A whose characteristic polynomial is taken need not be identical to the value φ substituted into that polynomial; it suffices that φ be an endomorphism of V satisfying the initial equations

[math]\displaystyle{ \varphi(e_i) = \sum_j A_{j,i} e_j }[/math]

for some sequence of elements e1, ..., en that generate V (which space might have smaller dimension than n, or in case the ring R is not a field it might not be a free module at all).

A bogus "proof": p(A) = det(AIn − A) = det(A − A) = 0

One persistent elementary but incorrect argument[18] for the theorem is to "simply" take the definition

[math]\displaystyle{ p(\lambda) = \det(\lambda I_n - A) }[/math]

and substitute A for λ, obtaining

[math]\displaystyle{ p(A)=\det(A I_n - A) = \det(A - A) = \det(\mathbf{0}) = 0. }[/math]

There are many ways to see why this argument is wrong. First, in the Cayley–Hamilton theorem, p(A) is an n × n matrix. However, the right hand side of the above equation is the value of a determinant, which is a scalar. So they cannot be equated unless n = 1 (i.e. A is just a scalar). Second, in the expression [math]\displaystyle{ \det(\lambda I_n - A) }[/math], the variable λ actually occurs at the diagonal entries of the matrix [math]\displaystyle{ \lambda I_n - A }[/math]. To illustrate, consider the characteristic polynomial in the previous example again:

[math]\displaystyle{ \det\!\begin{pmatrix}\lambda-1&-2\\-3&\lambda-4\end{pmatrix}. }[/math]

If one substitutes the entire matrix A for λ in those positions, one obtains

[math]\displaystyle{ \det\!\begin{pmatrix} \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} - 1 & -2 \\ -3 &\begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} - 4\end{pmatrix}, }[/math]

in which the "matrix" expression is simply not a valid one. Note, however, that if scalar multiples of identity matrices instead of scalars are subtracted in the above, i.e. if the substitution is performed as

[math]\displaystyle{ \det\!\begin{pmatrix} \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} - I_2 & -2I_2 \\ -3I_2 &\begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} - 4I_2 \end{pmatrix}, }[/math]

then the determinant is indeed zero, but the expanded matrix in question does not evaluate to [math]\displaystyle{ A I_n-A }[/math]; nor can its determinant (a scalar) be compared to p(A) (a matrix). So the argument that [math]\displaystyle{ p(A) = \det(AI_n-A) = 0 }[/math] still does not apply.

Actually, if such an argument holds, it should also hold when other multilinear forms instead of determinant is used. For instance, if we consider the permanent function and define [math]\displaystyle{ q(\lambda) = \operatorname{perm}(\lambda I_n - A) }[/math], then by the same argument, we should be able to "prove" that q(A) = 0. But this statement is demonstrably wrong: in the 2-dimensional case, for instance, the permanent of a matrix is given by

[math]\displaystyle{ \operatorname{perm}\!\begin{pmatrix} a & b \\ c & d \end{pmatrix} = ad + bc. }[/math]

So, for the matrix A in the previous example,

[math]\displaystyle{ \begin{align} q(\lambda) & = \operatorname{perm}(\lambda I_2 - A) = \operatorname{perm}\!\begin{pmatrix} \lambda - 1 & -2 \\ -3 & \lambda-4 \end{pmatrix} \\[6pt] & = (\lambda - 1)(\lambda - 4) + (-2)(-3) = \lambda^2 - 5\lambda + 10. \end{align} }[/math]

Yet one can verify that

[math]\displaystyle{ q(A) = A^2-5A+10I_2=12I_2\not=0. }[/math]

One of the proofs for Cayley–Hamilton theorem above bears some similarity to the argument that [math]\displaystyle{ p(A)=\det(AI_n-A)=0 }[/math]. By introducing a matrix with non-numeric coefficients, one can actually let A live inside a matrix entry, but then [math]\displaystyle{ A I_n }[/math] is not equal to A, and the conclusion is reached differently.

Proofs using methods of abstract algebra

Basic properties of Hasse–Schmidt derivations on the exterior algebra [math]\displaystyle{ A = \bigwedge M }[/math] of some B-module M (supposed to be free and of finite rank) have been used by (Gatto Salehyan) to prove the Cayley–Hamilton theorem. See also (Gatto Scherbak).

Abstraction and generalizations

The above proofs show that the Cayley–Hamilton theorem holds for matrices with entries in any commutative ring R, and that p(φ) = 0 will hold whenever φ is an endomorphism of an R-module generated by elements e1,...,en that satisfies

[math]\displaystyle{ \varphi(e_j)=\sum a_{ij}e_i, \qquad j =1, \ldots, n. }[/math]

This more general version of the theorem is the source of the celebrated Nakayama lemma in commutative algebra and algebraic geometry.

See also


  1. Due to the non-commutative nature of the multiplication operation for quaternions and related constructions, care needs to be taken with definitions, most notably in this context, for the determinant. The theorem holds as well for the slightly less well-behaved split-quaternions, see (Alagös Oral). The rings of quaternions and split-quaternions can both be represented by certain 2 × 2 complex matrices. (When restricted to unit norm, these are the groups SU(2) and SU(1,1) respectively.) Therefore it is not surprising that the theorem holds.
    There is no such matrix representation for the octonions, since the multiplication operation is not associative in this case. However, a modified Cayley–Hamilton theorem still holds for the octonions, see (Tian 2000).
  2. An explicit expression for these coefficients is
    [math]\displaystyle{ c_i = \sum_{ k_1,k_2,\ldots ,k_n}\prod_{l=1}^{n} \frac{(-1)^{k_l+1}}{l^{k_l} k_l!}\operatorname{tr}(A^l)^{k_l}, }[/math]
    where the sum is taken over the sets of all integer partitions kl ≥ 0 satisfying the equation
    [math]\displaystyle{ \sum_{l=1}^{n}lk_{l} = n-i. }[/math]
  3. See, e.g., p. 54 of Brown 1994, which solves Jacobi's formula,
    [math]\displaystyle{ \partial p(\lambda) /\partial \lambda= p(\lambda) \sum^\infty _{m=0}\lambda ^{-(m+1)} \operatorname{tr}A^m = p(\lambda) ~ \operatorname{tr} \frac{I}{\lambda I -A}\equiv\operatorname{tr} B~, }[/math]
    where B is the adjugate matrix of the next section. There also exists an equivalent, related recursive algorithm introduced by Urbain Le Verrier and Dmitry Konstantinovich Faddeev—the Faddeev–LeVerrier algorithm, which reads
    [math]\displaystyle{ \begin{align} M_0 &\equiv O & c_n &= 1 \qquad &(k=0) \\[5pt] M_k &\equiv AM_{k-1} -\frac{1}{k-1}(\operatorname{tr}(AM_{k-1})) I \qquad \qquad & c_{n-k} &= -\frac 1 k \operatorname{tr}(AM_k) \qquad &k=1,\ldots ,n ~. \end{align} }[/math]
    (see, e.g., p 88 of Gantmacher 1960.) Observe A−1 = −Mn /c0 as the recursion terminates. See the algebraic proof in the following section, which relies on the modes of the adjugate, BkMnk . Specifically, [math]\displaystyle{ (\lambda I-A) B = I p(\lambda) }[/math] and the above derivative of p when one traces it yields
    [math]\displaystyle{ \lambda p' -n p =\operatorname{tr} (AB)~, }[/math] (Hou 1998), and the above recursions, in turn.



External links