Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Classify up to similarity all 3 x 3 complex matrices $A$ such that $A^n$ = $I$.

share|improve this question
5  
Hint: Jordan decomposition. –  Aaron Mazel-Gee Dec 9 '10 at 11:41
2  
@Aaron Dear Aaron, you should post this as an answer. Then people will be less tempted to completely do the homework for Josh in another answer. And since this should actually suffice for Josh to do the exercise, he will be able to accept your answer or ask for further hints in the comments underneath it. –  Alex B. Dec 9 '10 at 12:46
    
Alex, you're right. I've been hesitant to post answers like this because it feels like I'm whoring for points. But I guess comments can get you points too... –  Aaron Mazel-Gee Dec 27 '10 at 9:03

1 Answer 1

up vote 8 down vote accepted

If you define $p=X^n-1\in\mathbb C[X]$, then $p(A)=0$. This tells you that the minimal polinomial $m_A$ of $A$ divides $p$ and, in particular, that $m_A$ has all its roots simple, because the same is true of $p$.

It follows that $A$ is diagonalizable, so, up to similarity, you can suppose that it is diagonal.

Can you see which are the diagonal matrices $A$ which satisfy the condition $A^n=I$?

NB: This argument does not depend on your knowing about Jordan canonical forms.

share|improve this answer
    
Thanks That is precisely my problem. I don't know how/what to conclude. –  Josh Dec 9 '10 at 14:11
5  
@Josh: Which are the $1\times 1$ diagonal matrices such that $A^5=I$? Make a list. When you are done: Which are the $2\times 2$ diagonal matrices such that $A^5=I$? Make a list ... If you keep going, I assure you that before you get to $10\times 10$ matrices you'll know the general answer. I, for one, will not tell you the answer to this :) –  Mariano Suárez-Alvarez Dec 9 '10 at 14:37

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.