# [Linear Algebra] Proof check. Nilpotent$\Rightarrow Spec\Rightarrow$ Characteristic Polynomial $\Rightarrow$ Nilpotent

Let $N$ be a linear operator over a finite-dimensional vector space $V$, over an algebraically closed field $K$. Show that the following are equivalent:

(1) $N$ is nilpotent.

(2) $Spec(N) = \{0\}$.

(3) The characteristic polynomial of $N$ is $c_N(x) = x^n$, where $n = dim(V)$.

My attempt:

We will show that $(1)\Rightarrow (2)\Rightarrow (3)\Rightarrow (1)$

$(1)\Rightarrow (2)$

$N$ is nilpotent, so $N^n=0$ for some $n$. Now let $v$ be an eigenvector: $Nv=λv$ for some scalar $λ$. Now we get

$0=N^{n}v=λ^{n}v ⇒ λ=0$.

* I've shown by induction that $N^{n}v=λ^{n}v$, just before. $K$ being algebraically closed was used here.

$(2)\Rightarrow (3)$

Knowing that all the eigenvalues of $N$ are 0 implies that the only root of the char. pol. is 0. Wich then tells us that the characteristic polynomial of $N$ is $c_N(x) = x^n$.

Is this too loose? I feel like I'm missing somehing here.

$(3)\Rightarrow (1)$

Knowing the char. pol., by the Cayley-Hamilton theorem, $N^n=0$.

Part of a worksheet for my Advanced Linear Algebra class. Is my proof correct? How would I be able to improve it? Any questions about notation or definitions just let me know.

* I've shown by induction that $N^{n}v=λ^{n}v$, just before. $K$ being algebraically closed was used here.

$(2)\Rightarrow (3)$

Knowing that all the eigenvalues of $N$ are 0 implies that the only root of the char. pol. is 0. Wich then tells us that the characteristic polynomial of $N$ is $c_N(x) = x^n$.

Is this too loose? I feel like I'm missing somehing here.

$(3)\Rightarrow (1)$

Knowing the char. pol., by the Cayley-Hamilton theorem, $N^n=0$.

Part of a worksheet for my Advanced Linear Algebra class. Is my proof correct? How would I be able to improve it? Any questions about notation or definitions just let me know.

Ssvnormandysr1

211

## Answer

**Answers can be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

Alessandro Iraci

1.6K

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.

- answered
- 452 views
- $4.00

### Related Questions

- Find eigenvalues and eigenvectors of $\begin{pmatrix} 1 & 6 & 0 \\ 0& 2 & 1 \\ 0 & 1 & 2 \end{pmatrix} $
- Find $x$ so that $\begin{pmatrix} 1 & 0 & c \\ 0 & a & -b \\ -\frac{1}{a} & x & x^2 \end{pmatrix}$ is invertible
- Prove that $V={(𝑥_1,𝑥_2,⋯,𝑥_n) \in ℝ^n ∣ 𝑥_1+𝑥_2+...+𝑥_{𝑛−1}−2𝑥_𝑛=0}\}$ is a subspace of $\R^n$.
- Consider the function, prove that it's bilinear, symmetric, and positive definite
- Eigenvalues and eigenvectors of $\begin{bmatrix} 3 & 2 & 4 \\ 2 & 0 & 2 \\ 4 & 2 & 3 \end{bmatrix} $
- Show that the $5\times 5$ matrix is not invertable
- Determine and compute the elementary matrices: Linear Algebra
- Elementary row reduction for an $n\times n$ matrix