Characteristic polynomial for nilpotent matrix.

[anastasis]

Homework Statement

How do I show that the cp is p(x)=x^n, dimA=n?

Homework Equations

A^k=0 for some k (obviously need to show k=n); p(A)=0

The Attempt at a Solution

p(A)=0 <=> A^n + ... + det(A)=0

 

[anastasis]

How do I show that the cp of A is p(x)=x^n, dimA=n?

 

[slider142]

This is a trivial consequence of Cayley-Hamilton.

 

[anastasis]

i see that p(A)=0 and that p(A)=A^n +...+det(A) BUT I'm still a bit confused by some details. A is nilpotent <=> A^k=0 ... must show k=n for one thing.

 

[slider142]

i see that p(A)=0 and that p(A)=A^n +...+det(A) BUT I'm still a bit confused by some details. A is nilpotent <=> A^k=0 ... must show k=n for one thing.

Suppose p(A) is not xⁿ. Then it is some nontrivial (not xⁿ) polynomial of degree n, which implies A satisfies said polynomial. Show that this leads to a contradiction.

 

[HallsofIvy]

Suppose $\lambda$ is an eigenvalue of A: that is, $Av= \lambda v$ for some non-zero vector v. Then $A^2v= \lamba Av= \lambda^2 v$ and, continuing like that $A^n v= \lambda^n v$= 0[/itex]. Actually, that proves that all eigenvalues are 0 but what you need is that all eigenvalues satisfy $\lambda^n= 0$.

 

[HallsofIvy]

This was also posted under "Mathematics- Abstract and Linear Algebra". I have merged the threads here.

 

[trambolin]

I am almost always tempted to correct the theorem statement as

"... satisfies the matrix version of the characteristic polynomial"

since the right hand side zeros of the the two cases are different objects. But it is a technical puristic bla bla. I know!