Prove l*conj(l)=1 for Orthogonal Matrix A

  • Thread starter Thread starter phrygian
  • Start date Start date
  • Tags Tags
    Matrix Orthogonal
phrygian
Messages
77
Reaction score
0

Homework Statement



Let l be an eigenvalue of an orthogonal matrix A, where l = r + is. Prove that l * conj(l) = r^2 + s^2 = 1.

Homework Equations





The Attempt at a Solution



I am really confused on where to go with this one.

I have Ax = A I x = A A^T A x = l^3 x

and Ax = l x so l x = l^3 x

l = l^3

l^2 = 1
l = 1 or -1

But I can't really figure out what to do from here, am I even on the right track?

Thanks for the help
 
Physics news on Phys.org
Hi, i am just studying linear algebra (the final is coming next week, so stressed!).

I think the question about l*conjugate(l) = r^2+s^2 = 1 just mean the length of l is 1

But i think if Matrix with complex entries, say M, is orthogonal means M is unitary. So the length of every eigenvalue is 1

since unitary matrix won't change vector's langth so its eigenvalues' length is always 1
 
fanxiu said:
But i think if Matrix with complex entries, say M, is orthogonal means M is unitary. So the length of every eigenvalue is 1

since unitary matrix won't change vector's langth so its eigenvalues' length is always 1
phrygian cannot use this fact; he/she has to prove it.

phrygian, the cube route isn't really going to help here. You went one step too far.

You know that \mathbf A \vec x = \lambda \vec x. The conjugate transpose of the right-hand side is (\lambda \vec x)^* = \vec x^*\lambda^*. What is the matrix product of this conjugate transpose with \lambda \vec x?
 
Is there a way to do this without using conjugate transposes? The book has a hint that says first show that ||Ax|| = ||x|| for any vector x, but i just can't seem to get past that first step
 
What is the precise definition of "orthogonal" matrix? Some texts use that a matrix, Q, is orthogonal if and only if <Qu, v>= <u, Qv> for all vector u and v (< u, v> is the inner product). From that it is not too hard to show that ||Qv||= ||v||.
 
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...
Back
Top