Jump to content

Nilpotent / Diagonalizable matrices

Featured Replies

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

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.

  • Author

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...

What about eigenvalues?

Archived

This topic is now archived and is closed to further replies.

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.

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.