Isomorphism of L_A: Orthogonal Matrix, ℝ^n -> ℝ^n

  • Thread starter Thread starter damabo
  • Start date Start date
  • Tags Tags
    Isomorphism
damabo
Messages
53
Reaction score
0

Homework Statement



if L_A: ℝ^n -> ℝ^n : X-> A.X is a linear transformation, and A is an orthogonal matrix, show that L_A is an isomorphism.
also given is that (ℝ,ℝ^n,+,[.,.]) , the standard Euclidian space which has inproduct [X,Y]= X^T.Y

Homework Equations



ortogonal matrix, so A^T=A^{-1}
isomorphism = bijective and linear (so what is left to show is bijective)

The Attempt at a Solution



don't know where to start
 
Physics news on Phys.org
damabo said:

Homework Statement



if L_A: ℝ^n -> ℝ^n : X-> A.X is a linear transformation, and A is an orthogonal matrix, show that L_A is an isomorphism.
also given is that (ℝ,ℝ^n,+,[.,.]) , the standard Euclidian space which has inproduct [X,Y]= X^T.Y

Homework Equations



ortogonal matrix, so A^T=A^-1
isomorphism = bijective and linear (so what is left to show is bijective)


The Attempt at a Solution



don't know where to start

Well, what's the definition of bijective?
 
surjective and injective ofcourse:
injective:
I must show that if X_1 != X_2 then A.X_1 ≠A.X_2.
So choose X_1,X_2 \in ℝ^n. because [AX_1,AX_2]=X_1^T.A^T.A.X_2 = X_1^T.X_2=[X_1,X_2], length, distance and orthogonality will be preserved. so A.X_1 ≠A.X_2.
surjective:
I must show that for every Y \in ℝ^n : A.X=Yfor some X \in ℝ^n
Choose Y in ℝ^n. Is there an X in ℝ^n such that A.X=Y? I'm not sure what to do here.
 
damabo said:
surjective and injective ofcourse:
injective:
I must show that if X_1 != X_2 then A.X_1 ≠A.X_2.
So choose X_1,X_2 \in ℝ^n. because [AX_1,AX_2]=X_1^T.A^T.A.X_2 = X_1^T.X_2=[X_1,X_2], length, distance and orthogonality will be preserved. so A.X_1 ≠A.X_2.
surjective:
I must show that for every Y \in ℝ^n : A.X=Yfor some X \in ℝ^n
Choose Y in ℝ^n. Is there an X in ℝ^n such that A.X=Y? I'm not sure what to do here.

You've shown A is injective, so you know the kernel of A is {0}. Use the rank-nullity theorem.
 
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