What is Cayley–Hamilton theorem?

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.

Example of Cayley-Hamilton Theorem

1.) 1 x 1 Matrices

For 1 x 1 matrix A(a1,1) the characteristic polynomial is given by 

�(�)=�–�

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

2.) 2 x 2 Matrices

Let us look this through an example

�=(1234)

�(�)=���(��2−�)=���(�−1−2−3�−4)=(�−1)(�−4)−(−2)(−3)=�2−5�−2

The Cayley-Hamilton claims that if, we define

�(�)=�2−5�−2�2

then,

�(�)=�2−5�−2�2=(0000)

We can verify this result by computation

�2−5�−2�2=(7101522)−(5101520)−(2002)=(0000)

For a generic 2 x 2 matrix,

�=(����)

The resultant polynomial is given by:

�(�)=�2−(�+�)�+(��−��)

So the Cayley-Hamilton theorem states that

�(�)=�2−(�+�)�+(��−��)�2=(0000)

it is always the case, which is evident by working out on  A2.

Comments