Jump to content

Recommended Posts

Posted

Hey guys

I have this question i've been trying to solve for too long:

 

Let A be an nxn matrix, rankA=1 , and n>1 .

Prove that A is either nilpotent or diagonalizable.

 

I have no clue how to even get started with that... though i attempted too much...

 

Anyone can help?

 

Thanks a lot

Posted

Start with some definitions. What is a nilpotent matrix, and a diagonalizable matrix? What are some key characteristics of such matrices? Finally, what does rank mean?

 

Note: We do not do your homework for you at this site. We help you do your own homework. You need to show some work. You can't just ask for help.

Posted

yeah i know... and i tried, and i failed.. that's why i'm asking.

anyway, let's see...

a matrix is said to be nilpotent if there is some 'k' such that A^k = 0.

diagonalizable matrix is such one that is similar to a diagonal matrix.

and i can't get anything helpful from the rank 1 thing...

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.