Prooving the Cayley-Hamilton Theorem

  • Thread starter Thread starter Vuldoraq
  • Start date Start date
  • Tags Tags
    Theorem
Vuldoraq
Messages
265
Reaction score
1
Proving the Cayley-Hamilton Theorem

Hey all,

I'm revising for my linear algebra exam, which is next week, and I got up to the Cayley-Hamilton theorem, but I am stuck on the final leap in the proof. Here is what I understand so far,

Theorem:

Every matrix is a zero of it's characteristic equation[P_{A}(\lambda)=det(A-\lambda I)],

For \\\\\\\\\\\\\ A \in M_{n}(k) P_{A}(A)=0


Proof:

<br /> Let\ P_{A}(\lambda)=det(A-\lambda I)=\lambda^{n}+a_{n-1}\lambda^{n-1}+\ldots+a_{1}\lambda+a_{0}

and consider,

\phi(\lambda)=adj(A-\lambda I)=B_{n-1}\lambda^{n-1}+ldots+B_{1}\lambda+B_{0}

where B_{i} \in M_{n}(k)

Given that for any C \in M_{n}(k); \\ C*adj(C)=det(C)*I.

So by letting C=A-\lambda I we have,

(A- \lambda I)*\phi(\lambda)=det(A-\lambda I)I=P_{A}(\lambda)I

Expanding we have,

(A- \lambda I)*(B_{n-1}\lambda^{n-1}+ldots+B_{1}\lambda+B_{0})=(\lambda^{n}+a_{n-1}\lambda^{n-1}+ldots+a_{1}\lambda+a_{0})*I

The next step has me in tears, my book says compare coefficients and add but I can't see how you would compare these? Please can anyone help me to complete this?
 
Last edited:
Physics news on Phys.org
Multiply the LHS and then compare for each ##i=0,\ldots,n## the coefficients of ##\lambda^i##. E.g. for ##i=n## we get ##- B_{n-1}=I##, for ##i=n-1## we have ##AB_{n-1}-B_{n-2}=a_{n-1}I##. With ##B_{n-1}=-I## from the previous step, we get ##B_{n-2}=-A-a_{n-1}I## and so on.
 
  • Like
Likes Vuldoraq
Thanks for the reply @fresh_42! I was quite surprised to see one after 11 years, but it's appreciated.

Totally forgot this forum existed, will see if I can brush up on my physics and maths and get more involved.
 
In fact Cayley Hamilton follows immediately from the next to last equation in post # 1, viewed as an equation between polynomials with matrix coefficients, if you know the non commutative root/factor theorem, namely that the fact (A-t) is a (left) factor of P(t) implies that t=A is a (left root, hence also a) root of P(t). This proof occurs in Fundamental Concepts of higher algebra, by A. Adrian Albert, p.84.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top