Prove that a matrix with only zero eigenvalues must be nilpotent.
How will I be able to prove this?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityProve that a matrix with only zero eigenvalues must be nilpotent.
How will I be able to prove this?
We have to assume that we are considering complex matrices. Over the reals the assertion is not true, as the example $$ \begin{bmatrix}0&0&0\\0&0&1\\0&-1&0 \end{bmatrix} $$ shows.
Over $\mathbb C$, one can do the Schur decomposition, where $A=VTV^*$, with $V$ unitary and $T$ upper triangular. Since the diagonal of $T$ has to contain the eigenvalues of $A$, it has be zero. And it is an easy exercise that if $T$ is an $n\times n$ upper triangular with diagonal zero, then $T^n=0$. So $A^n=(VTV^*)^n=VT^nV^*=0$, and $A$ is nilpotent.
Hint: $A = P^{-1}DP$ where $D$ is upper triangular. What are the diagonal entries of $D$? If $A$ is $n\times n$, what is $A^n$?
Hint: Look at the characteristic polynomial, then use Cayley-Hamilton.
Cayley-Hamilton theorem says a linear transformation (equivalently, of course, its matrix) satisfies its own characteristic polynomial. What is the characteristic polynomial of a matrix with only zero eigenvalues?
If you have learned schur triangularization (or decomposition), note that matrices with all eigenvalues as zero are unitarily similar to "strictly" Upper Triangular matrices. Now see that strictly upper triangular matrices are always nilpotent. Now look at the converse.