How to count all the orthogonal transformations?

skrat
Messages
740
Reaction score
8

Homework Statement


Find an orthogonal transformation ##\mathbb{R}^{3}\rightarrow \mathbb{R}^{3}## that map plane ##x+y+z=0## into ##x-y-2z=0## and vector ##v_{1}=(1,-1,0)## into ##(1,1,0)##. Count all of them!

Homework Equations


##A_{S}=PA_{0}B^{-1}##

The Attempt at a Solution


So basis ##B=\begin{bmatrix}
1 & 1 & 1\\
1& -1 & 1\\
1& 0& 2
\end{bmatrix}## and ##P=\begin{bmatrix}
1 & 1 & 1\\
-1& 1 & -1\\
-2& 0& 1
\end{bmatrix}## where the last vector in both basis is a vector product of ##n_{1} \times v_{1}##

##A_{0}=diag(1,1,1)## and ##A_{S}=PA_{0}B^{-1}##

Now, how do I count them? What do they represent - meaning, how do they differ from this one? O.o please help.
 
Physics news on Phys.org
So whatever I do, ##det(A_{0})=1## has to stay the same, where ##A_{0}=diag(1,1,1)##. Meanin I could also use ##A_{0}=diag(-1,-1,1)## or ##A_{0}=diag(-1,1,-1)## or ##A_{0}=diag(1,-1,-1)##, right?

To sum up, there are 4 orthogonal transformations that do that?
 
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