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

  • Thread starter Thread starter damabo
  • Start date Start date
  • Tags Tags
    Isomorphism
Click For Summary
SUMMARY

The discussion focuses on proving that the linear transformation L_A: ℝ^n -> ℝ^n defined by L_A(X) = A.X, where A is an orthogonal matrix, is an isomorphism. It is established that an orthogonal matrix satisfies A^T = A^{-1}, which ensures that L_A is both injective and surjective. The injectivity is demonstrated by showing that if X_1 ≠ X_2, then A.X_1 ≠ A.X_2, preserving length and distance. The surjectivity can be confirmed using the rank-nullity theorem, as the kernel of A is {0}.

PREREQUISITES
  • Understanding of linear transformations and their properties
  • Knowledge of orthogonal matrices and their characteristics
  • Familiarity with the concepts of injective and surjective functions
  • Proficiency in applying the rank-nullity theorem
NEXT STEPS
  • Study the properties of orthogonal matrices in depth
  • Learn about the rank-nullity theorem and its applications in linear algebra
  • Explore examples of bijective linear transformations
  • Investigate the implications of isomorphisms in vector spaces
USEFUL FOR

Students and educators in linear algebra, mathematicians interested in transformations, and anyone studying the properties of orthogonal matrices and isomorphisms in vector spaces.

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.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
Replies
15
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
8
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
5K
  • · Replies 4 ·
Replies
4
Views
3K