# What is cayley–hamilton theorem?

**Answer # 1 #**

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 p A ( λ ) = det ( λ I n − A ) {\displaystyle p_{A}(\lambda )=\det(\lambda I_{n}-A)} , where det is the determinant operation and λ is a variable for a scalar element of the base ring. Since the entries of the matrix ( λ I n − A ) {\displaystyle (\lambda I_{n}-A)} are (linear or constant) polynomials in λ, the determinant is also a degree-n monic polynomial in λ, p A ( λ ) = λ n + c n − 1 λ n − 1 + ⋯ + c 1 λ + c 0 . {\displaystyle p_{A}(\lambda )=\lambda ^{n}+c_{n-1}\lambda ^{n-1}+\cdots +c_{1}\lambda +c_{0}~.} One can create an analogous polynomial p A ( A ) {\displaystyle p_{A}(A)} in the matrix A instead of the scalar variable λ, defined as p A ( A ) = A n + c n − 1 A n − 1 + ⋯ + c 1 A + c 0 I n . {\displaystyle p_{A}(A)=A^{n}+c_{n-1}A^{n-1}+\cdots +c_{1}A+c_{0}I_{n}~.} The Cayley–Hamilton theorem states that this polynomial expression is equal to the zero matrix, which is to say that p A ( A ) = 0 {\displaystyle p_{A}(A)=\mathbf {0} } . 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.

A special case of the theorem was first proved by Hamilton in 1853 in terms of inverses of linear functions of quaternions. This corresponds to the special case of certain 4 × 4 real or 2 × 2 complex matrices. Cayley in 1858 stated the result for 3 × 3 and smaller matrices, but only published a proof for the 2 × 2 case. 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”. The general case was first proved by Ferdinand Frobenius in 1878.

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.

As a concrete example, let

Its characteristic polynomial is given by

The Cayley–Hamilton theorem claims that, if we define

then

We can verify by computation that indeed,

For a generic 2 × 2 matrix,

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

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

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

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:

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

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

Likewise, the characteristic polynomial can be written as

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,

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,

Hence, by virtue of the Mercator series,

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,

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

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

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

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

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

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,

where, now, the determinant is cn−4,

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.

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 A = ( 1 2 3 4 ) {\displaystyle A={\begin{pmatrix}1&2\\3&4\end{pmatrix}}} the theorem gives

Then, to calculate A4, observe

Likewise,

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.

Given an analytic function

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

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

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

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

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

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

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

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 = (3et − e3t)/2 and c1 = (e3t − et)/2. Thus, it follows that

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

As a further example, when considering

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 e−it = c0 − ic1; the solution of which gives, c0 = (eit + e−it)/2 = cos t and c1 = (eit − e−it)/2i = sin t. Thus, for this case,

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,

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

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

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), O(4, 2) and SU(2, 2), as well as GL(n, R). 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.

The Cayley–Hamilton theorem is an effective tool for computing the minimal polynomial of algebraic integers. For example, given a finite extension Q [ α 1 , … , α k ] {\displaystyle \mathbb {Q} } of Q {\displaystyle \mathbb {Q} } and an algebraic integer α ∈ Q [ α 1 , … , α k ] {\displaystyle \alpha \in \mathbb {Q} } which is a non-zero linear combination of the α 1 n 1 ⋯ α k n k {\displaystyle \alpha _{1}^{n_{1}}\cdots \alpha _{k}^{n_{k}}} we can compute the minimal polynomial of α {\displaystyle \alpha } by finding a matrix representing the Q {\displaystyle \mathbb {Q} } -linear transformation

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

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

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

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

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 A⋅v = λv, then

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.

Consider now the function e : M n → M n {\displaystyle e\colon M_{n}\to M_{n}} which maps n × n matrices to n × n matrices given by the formula e ( A ) = p A ( A ) {\displaystyle e(A)=p_{A}(A)} , i.e. which takes a matrix A {\displaystyle A} 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 D {\displaystyle D} of diagonalizable complex square matrices of a given size is dense in the set of all such square matrices (for a matrix to be diagonalizable it suffices for instance that its characteristic polynomial not have any multiple roots). Now viewed as a function e : C n 2 → C n 2 {\displaystyle e\colon \mathbb {C} ^{n^{2}}\to \mathbb {C} ^{n^{2}}} (since matrices have n 2 {\displaystyle n^{2}} 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

e ( D ) = { ( 0 ⋯ 0 ⋮ ⋱ ⋮ 0 ⋯ 0 ) } {\displaystyle e(D)=\left\{{\begin{pmatrix}0&\cdots &0\\\vdots &\ddots &\vdots \\0&\cdots &0\end{pmatrix}}\right\}}

and since the set D {\displaystyle D} 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 Q {\displaystyle \mathbb {Q} } - or R {\displaystyle \mathbb {R} } -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.

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,

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.

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

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

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

(The way the entries of B are defined makes clear that no powers higher than t n−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 t i 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:

Writing

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 t i is the same on both sides; it follows that the constant matrices with coefficient t i in both expressions must be equal. Writing these equations then for i from n down to 0, one finds

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

A n B n − 1 + ∑ i = 1 n − 1 ( A i B i − 1 − A i + 1 B i ) − A B 0 = A n + c n − 1 A n − 1 + ⋯ + c 1 A + c 0 I n . {\textstyle A^{n}B_{n-1}+\sum \limits _{i=1}^{n-1}\left(A^{i}B_{i-1}-A^{i+1}B_{i}\right)-AB_{0}=A^{n}+c_{n-1}A^{n-1}+\cdots +c_{1}A+c_{0}I_{n}.}

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

This completes the proof.

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.

Let M ( n , R ) {\displaystyle M(n,R)} 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 t I n − A {\displaystyle tI_{n}-A} or its adjugate B in the first proof, are elements of M ( n , R [ t ] ) {\displaystyle M(n,R)} .

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

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

Thus, the identity

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

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 → M, which replaces each t i 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 M t i N t j = ( M ⋅ N ) t i + j {\displaystyle Mt^{i}Nt^{j}=(M\cdot N)t^{i+j}} 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: I n {\displaystyle I_{n}} , A, and the coefficients B i {\displaystyle B_{i}} 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 I n {\displaystyle I_{n}} , and A, but one has to show that it contains the matrices B i {\displaystyle B_{i}} . To do this, one combines the two fundamental relations for adjugates, writing out the adjugate B as a polynomial:

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

This completes the proof.

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 Int − A, 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 P Q + r = P Q ′ + r ′ {\displaystyle PQ+r=PQ'+r'} as P ( Q − Q ′ ) = r ′ − r {\displaystyle P(Q-Q')=r'-r} and observe that since P is monic, P(Q−Q′) cannot have a degree less than that of P, unless Q = Q′.

But the dividend p(t)In and divisor Int − A used here both lie in the subring (R), where R 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).

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

in other words, to apply the evaluation map

which is a ring homomorphism, giving

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, and not necessarily commutative. In particular the constant term B0 = adj(−A) lies in R. 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 B n − 1 , … , B 1 , B 0 {\displaystyle B_{n-1},\ldots ,B_{1},B_{0}} as polynomials in A, which leads to the identity

valid for all n × n matrices, where

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

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 t I n − A {\displaystyle tI_{n}-A} 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 A i , j {\displaystyle A_{i,j}} 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 A i , j {\displaystyle A_{i,j}} is realised as A i , j I n {\displaystyle A_{i,j}I_{n}} , 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 e 1 , … , e n {\displaystyle e_{1},\ldots ,e_{n}} , 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 A i , j {\displaystyle A_{i,j}} ; similarly I n {\displaystyle I_{n}} 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 φ I n − A {\displaystyle \varphi I_{n}-A} 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 det ( φ I n − A ) {\displaystyle \det(\varphi I_{n}-A)} 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

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

where E ∈ V n {\displaystyle E\in V^{n}} 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

one recognizes the transpose of the matrix φ I n − A {\displaystyle \varphi I_{n}-A} 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 φ I n − A tr {\displaystyle \varphi I_{n}-A^{\operatorname {tr} }} , which is defined in the matrix ring M(n, R), giving

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

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).

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

and substitute A for λ, obtaining

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 det ( λ I n − A ) {\displaystyle \det(\lambda I_{n}-A)} , the variable λ actually occurs at the diagonal entries of the matrix λ I n − A {\displaystyle \lambda I_{n}-A} . To illustrate, consider the characteristic polynomial in the previous example again:

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

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

then the determinant is indeed zero, but the expanded matrix in question does not evaluate to A I n − A {\displaystyle AI_{n}-A} ; nor can its determinant (a scalar) be compared to p(A) (a matrix). So the argument that p ( A ) = det ( A I n − A ) = 0 {\displaystyle p(A)=\det(AI_{n}-A)=0} 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 q ( λ ) = perm ( λ I n − A ) {\displaystyle q(\lambda )=\operatorname {perm} (\lambda I_{n}-A)} , 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

So, for the matrix A in the previous example,

Yet one can verify that

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

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

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

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

The Cayley-Hamilton theorem also holds for matrices over the quaternions, a noncommutative ring.

**Answer # 2 #**

p(x) = det(xIn – A)

Where the determinant operation is ‘det’ and for the scalar element of the base ring, the variable is taken as x. As the entries of the matrix are (linear or constant) polynomials in x, the determinant is also an n-th order monic polynomial in x.

Also, read:

The Cayley–Hamilton theorem states that substituting the matrix A for x in polynomial, p(x) = det(xIn – A), results in the zero matrices, such as:

p(A) = 0

It states that a ‘n x n’ matrix A is demolished by its characteristic polynomial det(tI – A), which is monic polynomial of degree n. The powers of A, found by substitution from powers of x, are defined by recurrent matrix multiplication; the constant term of p(x) provides a multiple of the power A0, where power is described as the identity matrix.

The theorem allows An to be articulated as a linear combination of the lower matrix powers of A. If the ring is a field, the Cayley–Hamilton theorem is equal to the declaration that the smallest polynomial of a square matrix divided by its characteristic polynomial.

For 1 x 1 matrix A(a1,1) the characteristic polynomial is given by \(\begin{array}{l}p(\lambda )=\lambda – a\end{array} \)

So, p(A) = (a) – (a1,1) = 0 is obvious.

2.) 2 x 2 Matrices

Let us look this through an example

\(\begin{array}{l}A = \begin{pmatrix} 1 & 2\\ 3 & 4 \end{pmatrix}\end{array} \)

\(\begin{array}{l}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{array} \)

The Cayley-Hamilton claims that if, we define

\(\begin{array}{l}p(X) = X^{2}-5X-2I_{2}\end{array} \)

then,

We can verify this result by computation

For a generic 2 x 2 matrix,

\(\begin{array}{l}A=\begin{pmatrix} a & b\\ c & d \end{pmatrix}\end{array} \)

The resultant polynomial is given by:

So the Cayley-Hamilton theorem states that

\(\begin{array}{l}p(A)=A^{2}-(a+d)A+(ad-bc)I_{2}=\begin{pmatrix} 0 & 0\\ 0 & 0 \end{pmatrix}\end{array} \)