Classifying Complex Matrices with Cubed Identity: What Does Similarity Mean?

  • Thread starter Thread starter CoachZ
  • Start date Start date
CoachZ
Messages
26
Reaction score
0
The question posed is "Classify up to similarity all 3 x 3 complex matrices A s.t. A^{3} = I. I think the biggest problem I'm having is understanding what exactly this is asking me to do. The part that says "Classify up to similarity" is really throwing me off, so if someone could tell me what that implies, it would be very helpful!

Maybe it deals with equivalence classes, or something like that?
 
Physics news on Phys.org
CoachZ said:
… The part that says "Classify up to similarity" is really throwing me off, so if someone could tell me what that implies, it would be very helpful!

Maybe it deals with equivalence classes, or something like that?

Hi CoachZ! :smile:

Yes, it's putting two matrices in the same equivalence class if they are similar.
 
It means, can you find a set of complex 3x3 matrices s.t. A^3 = I, such that none of them are similar to each other, and any other such 3x3 matrix is similar to one of the matrices in your set?

Hint: what can you say about eigenvalues of A?
 
hamster143 said:
It means, can you find a set of complex 3x3 matrices s.t. A^3 = I, such that none of them are similar to each other, and any other such 3x3 matrix is similar to one of the matrices in your set?

Hint: what can you say about eigenvalues of A?

I think that I'm a little confused, because if A^3 = I, then the eigenvalues for A would simply be the eigenvalues for I, which is just 1,1,1, since I is a diagonal matrix. Therefore, the characteristic polynomial of such A must be in the form (x-1)^3, right? Is there a way to compose matrices from characteristic polys?
 
CoachZ said:
I think that I'm a little confused, because if A^3 = I, then the eigenvalues for A would simply be the eigenvalues for I,

No, the eigenvalues must have cube equal to 1, but there are complex numbers other than 1 itself with that property...

Therefore, the characteristic polynomial of such A must be in the form (x-1)^3, right?

No, for example the characteristic polynomial could be x^3-1 .

Is there a way to compose matrices from characteristic polys?

One would assume the textbook would have such information before asking this question.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top