Why is the special orthogonal group considered the rotation group?

tensor33
Messages
52
Reaction score
0
I understand that the special orthogonal group consists of matrices x such that x\cdot x=I and detx=1 where I is the identity matrix and det x means the determinant of x. I get why the matrices following the rule x\cdot x=I are matrices involved with rotations because they preserve the dot products of vectors. The part I don't get is why the matrices involved with rotation must have determinant 1.
 
Physics news on Phys.org
A pure rotation should not dilate or shrink any volume. The determinant of a linear operator is the scale factor by which the volume element increases. Hence, the determinant of a rotation operator must be 1.
 
tensor33 said:
I understand that the special orthogonal group consists of matrices x such that x\cdot x=I and detx=1 where I is the identity matrix and det x means the determinant of x. I get why the matrices following the rule x\cdot x=I are matrices involved with rotations because they preserve the dot products of vectors. The part I don't get is why the matrices involved with rotation must have determinant 1.

Did you mean x\cdot x^T=I??

Muphrid said:
A pure rotation should not dilate or shrink any volume. The determinant of a linear operator is the scale factor by which the volume element increases. Hence, the determinant of a rotation operator must be 1.

That doesn't really explain why the determinant can't be -1, which is what the OP is asking.
The reason is that rotations preserves the orientation of a basis. If we have a right-handed basis, then rotations of this will be right-handed as well.
As an example of an orthogonal matrix that does not preserve the orientation, you can probably take a reflection.
 
tensor33 said:
I understand that the special orthogonal group consists of matrices x such that x\cdot x=I and detx=1 where I is the identity matrix and det x means the determinant of x. I get why the matrices following the rule x\cdot x=I are matrices involved with rotations because they preserve the dot products of vectors. The part I don't get is why the matrices involved with rotation must have determinant 1.
To prove that rotations have determinant 1, you must first define the term "rotation". It's perfectly OK to just take "R is said to be a rotation if R is a member of SO(3)" as the definition, but then there's nothing to prove. Another option is "R is said to be a rotation if R is a member of the largest connected subgroup of O(3)". Then your task would be to prove that the largest connected subgroup is SO(3).

(I actually prefer the terminology that calls members of O(3) rotations, and members of SO(3) proper rotations).
 
micromass said:
Did you mean x\cdot x^T=I??

Ya, I forgot the transpose part.

Thanks to all those who replied, I'm pretty sure I get it now.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top