Orthogonal matrix and eigenvalues

wormbox
Messages
3
Reaction score
0
a) Let M be a 3 by 3 orthogonal matrix and let det(M)=1. Show that M has 1 as an eigenvalue. Hint: prove that det(M-I)=0.

I think I'm supposed to begin from the fact that

det(M)=1=det(I)=det(MTM) and from there reach det(M-I)=0 which of course would mean that there's an eigenvalue of 1 as det(M-tI)=0 for any eigenvalue t.

I mean:

det(M)=1=det(I)=det(MTM) => hard work => det(M-1I)=0 => t=1

b) Let M be a 3 by 3 orthogonal matrix and let det(M)=1. Show that either M=I or the eigenvalue 1 is of rank 1. Hint: M is diagonalizable.

I guess I know how to show the case where M=I:
det(M)=1=det(I)=det(PTP)=det(PTIP)=det(PTMP) => M=I.

But that doesn't cover the fact that the rank of the eigenvalue could be 1.
 
Physics news on Phys.org
What is the definition of the "rank" of an eigenvalue?
 
I'm sorry. I probably meant order, not rank.

det(M-tI)=(-1)^3(t-\lambda _1)(t-\lambda _2)(t-\lambda _3)

and only one of the eigenvalues would be 1?

For the a) I've managed to get the following. I don't know if I'm supposed to apply the fact that I'm dealing with 3 x 3 matrix so that det(-M)=(-1)³det(M)...

\begin{array}{l}<br /> det(M)=1=det(I)\ \ \ |\cdot det(M^T-I) \Rightarrow \\<br /> det(M)det(M^T-I)=det(I)det(M^T-I) \\<br /> det(I-M)=det(M^T-I) \\<br /> -det(M-I)=det(M^T-I) \\<br /> det(M-I)=det(I-M^T) \end{array}
 
Last edited:
Since M is diagonalizable, let's work in a basis where it is diagonal. M is orthogonal, which means the transpose of M times M equals I (in any basis). What does this tell us about each eigenvalue?
 
Now I've got the right word: multiplicity of an eigenvalue, not order or rank.

How about part a)? How to proceed, or am I even on the right track?

Avodyne said:
What does this tell us about each eigenvalue?
I can only say that I don't know or understand. I could guess that because of what you said about the basises of an orthogonal matrix, then an orthogonal matrix has only linearly independent eigenvectors, which in turn would mean that all the eigenvalues are distinct.
 
wormbox said:
Now I've got the right word: multiplicity of an eigenvalue, not order or rank.

How about part a)? How to proceed, or am I even on the right track?


I can only say that I don't know or understand. I could guess that because of what you said about the basises of an orthogonal matrix, then an orthogonal matrix has only linearly independent eigenvectors, which in turn would mean that all the eigenvalues are distinct.

The eigenvalues are roots of a real polynomial. That means the eigenvalues are either real or come in complex conjugate pairs. Does that help?
 
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...

Similar threads

Back
Top