How can you find the inverse of a polynomial with a nilpotent operator?

  • Thread starter Thread starter johnson123
  • Start date Start date
  • Tags Tags
    Operator
johnson123
Messages
16
Reaction score
0

Homework Statement



If T is a nilpotent transformation from V -> V, V - finite dimensional vector space.

show that a_{0}+a_{1}T+\cdots+a_{k}T^{k} is invertible. a_{0} nonzero.

Im having trouble finding the inverse, I know for 1+T+\cdots+T^{m-1}

the inverse is (1-T),where T^{m}=0. I also tried a_{0}^{-1}T^{m-1}
but this gives me T^{m-1}
 
Last edited:
Physics news on Phys.org
Write that as -a0*I=a_1*T+a_2*T^2+...+a_k*T^k. Is that enough of a hint? If not notice the right side has a common factor.
 
I see that it shows T to be invertible but how does it show that the original polynomial

is invertible?
 
johnson123 said:
I see that it shows T to be invertible but how does it show that the original polynomial

is invertible?

Good point. I was solving the wrong problem.
 
johnson123 said:
I also tried a_{0}^{-1}T^{k-1}
but this gives me T^{k-1}
Okay, so you figured to annihilate all of the terms of your polynomial except the T^{k-1} term. What else can you annihilate?
 
I think you are going to have a hard time expressing an answer in closed form in terms of the a_i's. But think of it this way. If P is your polynomial, then P=a0+Q where Q is the rest of the terms. Can you show Q is nilpotent? Does that suggest how to invert a0+Q?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top