Nilpotent Matrix A = {{{021,002,000}}}: What is its index?

  • Thread starter Thread starter Bob Ho
  • Start date Start date
  • Tags Tags
    Index
Bob Ho
Messages
18
Reaction score
0

Homework Statement


A square(nxn) matrix is called nilpotent of index k if A\neq0, A^2\neq0,...A^(k-1)\neq0, But A^k=0 for some positive integer K

Verify that A={{{021,002,000}}} is nilpotent. What is its index? Show that for this matrix (I-A)-1= I + A + A^2




The Attempt at a Solution



I am unsure how different values of k affects the matrix... but For the equation (I-A)-1= I + A + A^2, I found the inverse of (I-A) which was {{{125,012,001}}}, which then gave me A^2 as {{{004,000,001}}}.
 
Last edited:
Physics news on Phys.org
You got the inverse of (I-A) ok. I'm assuming by A2 you mean A^2 (i.e. A squared, A times A). That didn't come out right. To find the index of A just keep computing successive powers A until you get zero. What is the index? To show (I-A)^(-1)=(I+A+A^2) you just want to show (I-A)*(I+A+A^2)=I. To do that you don't even need the numerical value of A once you've found it's index.
 
Thanks alot! I figured out A^3=0 so I am assuming the nilpotent matrix is of index 3.
I'm not sure how you managed to get the equation "(I-A)*(I+A+A^2)=I." I just did I=(I-A)^-1 -A - A^2. Would that also be suitable?
 
You've got the index too. So A^3=0. If C^(-1)=D then that just means C*D=I. So to check if (I-A)^(-1)=(I+A+A^2) just check whether (I-A)*(I+A+A^2)=I. That's where I got it. To check that just multiply that expression out. Remembering A^3=0.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top