Nilpotent operator or not given characteristic polynomial?

fishshoe
Messages
15
Reaction score
0
Hey, I'm working on a proof for a research-related assignment. I posted it under homework, but it's a little abstract and I was hoping someone on this forum might have some advice:

Homework Statement


Suppose T:V \rightarrow V has characteristic polynomial p_{T}(t) = (-1)^{n}t^n.
(a) Are all such operators nilpotent? Prove or give a counterexample.
(b) Does the nature of the ground field \textbf{F} matter in answering this question?

Homework Equations


Nilpotent operators have a characteristic polynomial of the form in the problem statement, and \lambda=0 is the only eigenvalue over any field \textbf{F}.


The Attempt at a Solution


I originally thought that any linear transformation with the given characteristic polynomial would therefore have a block upper or lower triangular form with zeros on the diagonals, and therefore be nilpotent. But I'm confused by part (b), and the more I think about it, I'm not sure how to rule out that another more complex matrix representation of a non-nilpotent transformation might have the same form. And I have no idea how the choice of the field affects it. The very fact that they asked part (b) makes me think it does depend on the field, but I can't figure out why.
 
Physics news on Phys.org
Are you familiar with the Cayley-Hamilton theorem?
 
Yeah - I hadn't thought about using that for a proof, but it would show that
(-1)^{n}T^n = 0 \Rightarrow T^n = 0
so T is nilpotent.

So what does this part (b) mean? T^n = 0 means T is nilpotent no matter if the field is complex or reals, right? Is it just a mean-hearted distraction? Am I missing something here?
 
You're not missing anything: the field F doesn't affect this argument at all.
 
so a teacher asking us to know what we are talking about is mean spirited? ouch,
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top