2013-04-25 10:38:30 8 Comments

I need to prove that if $\phi : V \rightarrow V$ is nilpotent, then its only eigenvalue is 0.

I know how to prove that this for a nilpotent matrix, but I'm not sure in the case of an operator. How would I be able to relate $\phi$ to a matrix?

**Note:** A nilpotent operator $\phi$ has been defined as $\phi^{n} = 0$, for some $n \geq 1$

### Related Questions

#### Sponsored Content

#### 3 Answered Questions

### [SOLVED] Eigenvalue of linear operator iff eigenvalue of matrix representation.

**2013-08-08 00:36:08****John Daley****979**View**3**Score**3**Answer- Tags: linear-algebra

#### 1 Answered Questions

### [SOLVED] Prove that the only eigenvalue of a unipotent matrix is 1.

**2018-08-26 00:38:44****Atsina****143**View**0**Score**1**Answer- Tags: linear-algebra proof-verification proof-explanation matrix-decomposition

#### 0 Answered Questions

### Prove that the operator is nilpotent

**2018-04-16 09:27:49****FunnyBuzer****54**View**2**Score**0**Answer- Tags: linear-algebra operator-algebras nilpotence

#### 2 Answered Questions

### [SOLVED] Proving a nilpotent matrix has only 0 as eigenvalues

**2017-11-09 05:42:29****B.Li****210**View**0**Score**2**Answer- Tags: linear-algebra eigenvalues-eigenvectors

#### 1 Answered Questions

### [SOLVED] If $0$ is the only eigenvalue of a linear operator, is the operator nilpotent

**2017-04-05 14:12:12****user12802****381**View**2**Score**1**Answer- Tags: linear-algebra linear-transformations nilpotence

#### 1 Answered Questions

### [SOLVED] Proving an operator is nilpotent

**2016-11-28 21:06:21****la flaca****151**View**4**Score**1**Answer- Tags: linear-algebra nilpotence

#### 1 Answered Questions

### [SOLVED] Every $n\times n$ matrix is the sum of a diagonalizable matrix and a nilpotent matrix.

**2015-02-20 14:43:46****user187039****3094**View**10**Score**1**Answer- Tags: linear-algebra matrices matrix-decomposition

#### 1 Answered Questions

### [SOLVED] Prove that the only nilpotent operator is 0?

**2015-03-23 14:59:44****Maxime Fagnan****73**View**0**Score**1**Answer- Tags: abstract-algebra matrices eigenvalues-eigenvectors

#### 2 Answered Questions

### [SOLVED] Prove that S is diagonal

**2014-09-16 21:56:25****ItsMe****75**View**1**Score**2**Answer- Tags: linear-algebra eigenvalues-eigenvectors diagonalization

#### 0 Answered Questions

### Prove matrix is nilpotent, find its invariants and Jordan form

**2014-04-30 03:30:35****Hildegarde****676**View**0**Score**0**Answer- Tags: matrices jordan-normal-form

## 2 comments

## @Somaye 2013-04-25 12:10:07

Suppose that $\phi$ has another eigenvalue $\lambda \ne 0$ so that $\phi(x)=\lambda x $ ($x$ is an eigenvector corresponding to $\lambda$)

Then, $ \phi^n (x)= \phi^{(n-1)}(\phi(x))=\phi^{(n-1)}(\lambda x)=\lambda \phi^{n-1}(x)=\cdots=\lambda ^{n}x\ne 0$.

We have a contradiction, so $\phi$ can't have another eigenvalue except $0$.

## @Rhys 2013-04-25 10:41:16

$\phi$ is nilpotent, so $\phi^n = 0$ for some $n$. Now let $v$ be an eigenvector: $\phi v = \lambda v$ for some scalar $\lambda$. Now we get $$ 0 = \phi^n v = \lambda^n v ~\Rightarrow~ \lambda=0 ~. $$

Note that this works in the infinite-dimensional case as well; there is no need to relate $\phi$ to a matrix.

Edit: As suggested in the comments, we can also show that $0$ isalwaysan eigenvalue; in other words, $\phi$ always has at least one eigenvector. Take any $v \neq 0$; we know that $\phi^n v = 0$, so let $k$ be the smallest integer such that $\phi^k v \neq 0$. Then $\phi(\phi^k v) = 0$, so $\phi^k v$ is an eigenvector of $\phi$, with eigenvalue $0$.## @wj32 2013-04-25 10:48:29

For completeness, we might want to show that $0$ is actually an eigenvalue. If $v$ is injective then $\phi v \ne 0$ for every $v \ne 0$. If we choose any nonzero $v$ then $\phi^n v \ne 0$, which is a contradiction. Therefore $\ker\phi \ne \{0\}$, and any element of $\ker\phi$ is obviously an eigenvector with eigenvalue $0$.

## @Rhys 2013-04-25 10:58:08

Yes, I probably should have added that part; I will do so, with a different wording.