Blog Archive

Saturday, July 20, 2024

Cayley–Hamilton theorem

The aim of this essay is to prove the Cayley–Hamilton theorem naturally.

Definition. Let Mn×n(R) be the matrix ring over R and Mn×n(R)[T] be the polynomial ring over Mn×n(R).

For pA(T)In=det⁡(TIn−A)In∈Mn×n(R)[T], we have the following decomposition:

(1)(TIn−A)adj(TIn−A)=pA(T)In=adj(TIn−A)(TIn−A)

Let adj(TIn−A)=∑i=0nBiTi.

But the evaluation map at A is not a ring homomorphism in Mn×n(R)[T], since this is a non-commutative ring.

For example, the identity

(2)(IT+A)2=I·T2+2A·T+A2

is true in Mn×n(R)[T], but what if you evaluate this identity at B such that AB−BA≠O​?

Another example is, Let R[T] be a polynomial ring and R is not commutative. Consider f(T)=AT,g(T)=BT, by definition, fg(T)=ABT2. But evC(f)evC(g)=ACBC≠ABC2 in general. However, if C∈Z(R), the evaluation map will be a ring homomorphism. Let us prove it.

Proposition. Let R[T] be a polynomial ring and R is not commutative. Let α∈Z(R), denote the evaluation map at α by evα. Then evα is a ring homomorphism.

Proof. Let f(T)=∑i=0naiTi,g(T)=∑j=0mbjTj. Then fg(T)=∑k=0n+m(∑i+j=kaibj)Tk.

Now consider evα(fg) and evα(f)evα(g)​.

We have evα(fg)=∑k=0n+m(∑i+j=kaibj)αk, and evα(f)evα(g)=(∑i=0naiαi)(∑j=0mbjαj)=∑k=0n+m(∑i+j=kaibj)αk since α∈Z(R). Hence evα(fg)=evα(f)evα(g) ◻​

Now, we want to find a proper ring such that evA is a ring homomorphism and prove Cayley–Hamilton theorem directly.

The proper choice is Z(A)[T]. Since A in the centre of Z[A] by definition.

Easy to see that A,In∈Z(A). Now we need to prove each Bi∈Z(A)​.

This follows from (In−A)∑i=0nBiTi=∑i=0nBiTi(In−A)⟹A∑i=0nBiTi=∑i=0nBiTiA⟹ABi=BiA.

Hence we have:

(3)pA(A)=evA(pA(T))=evA((TIn−A)adj(TIn−A))=evA(TIn−A)evA(adj(TIn−A))=O

 

No comments:

Post a Comment

Popular Posts