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

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

Homework Help Overview

The discussion revolves around the linear transformation L_A: ℝ^n -> ℝ^n defined by L_A(X) = A.X, where A is an orthogonal matrix. Participants are tasked with demonstrating that L_A is an isomorphism, which requires showing that it is both linear and bijective within the context of standard Euclidean space.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss the definitions of bijective, injective, and surjective functions. They explore the implications of A being an orthogonal matrix, particularly in relation to preserving lengths and distances. Questions arise about how to demonstrate surjectivity and the existence of an X for a given Y in ℝ^n.

Discussion Status

Some participants have made progress in establishing injectivity by arguing that if X_1 ≠ X_2, then A.X_1 ≠ A.X_2. However, there remains uncertainty regarding the surjectivity aspect, with participants seeking guidance on how to find an appropriate X for a given Y. The discussion is ongoing, with hints provided about utilizing the rank-nullity theorem.

Contextual Notes

Participants are working under the constraints of demonstrating properties of linear transformations and orthogonal matrices without providing complete solutions. The focus is on understanding the definitions and implications of the concepts involved.

damabo
Messages
53
Reaction score
0

Homework Statement



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

Homework Equations



ortogonal matrix, so [itex]A^T=A^{-1}[/itex]
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 [itex]L_A: ℝ^n -> ℝ^n : X-> A.X[/itex] is a linear transformation, and A is an orthogonal matrix, show that L_A is an isomorphism.
also given is that [itex](ℝ,ℝ^n,+,[.,.])[/itex] , the standard Euclidian space which has inproduct [X,Y]= X^T.Y

Homework Equations



ortogonal matrix, so [itex]A^T=A^-1[/itex]
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 [itex]X_1 != X_2[/itex] then [itex]A.X_1 ≠A.X_2.[/itex]
So choose [itex]X_1,X_2 \in ℝ^n[/itex]. because [itex][AX_1,AX_2]=X_1^T.A^T.A.X_2 = X_1^T.X_2=[X_1,X_2][/itex], length, distance and orthogonality will be preserved. so [itex]A.X_1 ≠A.X_2[/itex].
surjective:
I must show that for every [itex]Y \in ℝ^n : A.X=Y[/itex]for some [itex]X \in ℝ^n[/itex]
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 [itex]X_1 != X_2[/itex] then [itex]A.X_1 ≠A.X_2.[/itex]
So choose [itex]X_1,X_2 \in ℝ^n[/itex]. because [itex][AX_1,AX_2]=X_1^T.A^T.A.X_2 = X_1^T.X_2=[X_1,X_2][/itex], length, distance and orthogonality will be preserved. so [itex]A.X_1 ≠A.X_2[/itex].
surjective:
I must show that for every [itex]Y \in ℝ^n : A.X=Y[/itex]for some [itex]X \in ℝ^n[/itex]
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
3K
  • · 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