Dimension of the group O(n,R) - How to calc?

Click For Summary
SUMMARY

The dimension of the orthogonal group O(n,R) is calculated as n(n-1)/2. This is derived from the number of constraints imposed by the orthogonality condition AA^T = I, which initially presents n^2 constraints, but reduces to n(n+1)/2 due to symmetry. The resulting freedom, or parameters needed to define an orthogonal transformation in Rn, is thus n^2 - n(n+1)/2. Additionally, an inductive approach confirms this dimension by considering the selection of orthogonal unit vectors in higher-dimensional spaces.

PREREQUISITES
  • Understanding of orthogonal transformations
  • Familiarity with matrix operations and properties
  • Knowledge of linear algebra concepts, particularly dimensions and constraints
  • Basic understanding of induction and geometric interpretations in mathematics
NEXT STEPS
  • Study the properties of orthogonal matrices in linear algebra
  • Explore the geometric interpretation of orthogonal transformations
  • Learn about the inductive proof techniques in mathematics
  • Investigate the applications of the orthogonal group O(n,R) in various fields
USEFUL FOR

Mathematicians, students of linear algebra, and anyone interested in the properties and applications of orthogonal transformations in Rn.

JuanC97
Messages
48
Reaction score
0
Hi, I want to find the number of parameters needed to define an orthogonal transformation in Rn.
As I suppose, this equals the dimension of the orthogonal group O(n,R) - but, correct me if I'm wrong.

I haven't been able to figure out how to do this yet. If it helps, I know that an orthogonal matix should have n(n+1)/2 "free components".
That said, I'd appreciate any hint from this point.
 
Physics news on Phys.org
An orthogonal tranformation ##A## satisfies ##AA^T = I##. Those are initially ##n^2## constraints, but some coincide since the matrix ##AA^T## always is symmetric even if the matrix is orthogonal. So the amount of constraints consist of an upper diagonal matrix, which has ##\frac{n(n+1)}{2}## entries.

The amount of freedom is then ##n^2 - \frac{n(n+1)}{2} = \frac{n(n-1)}{2}##, which is the dimension.
 
  • Like
Likes   Reactions: JuanC97
micromass said:
An orthogonal tranformation ##A## satisfies ##AA^T = I##. Those are initially ##n^2## constraints, but some coincide since the matrix ##AA^T## always is symmetric even if the matrix is orthogonal. So the amount of constraints consist of an upper diagonal matrix, which has ##\frac{n(n+1)}{2}## entries.

The amount of freedom is then ##n^2 - \frac{n(n+1)}{2} = \frac{n(n-1)}{2}##, which is the dimension.

Thanks, very concise.
 
you can also use induction and geometry. such a matrix consists of n orthogonal unit length columns. so just ask how many ways there are to choose these. If n = 1, only two choices exist of unit vectors, so the dimension is zero. then to go from n to n+1, we begin by choosing a unit vector in n+1 space, i.e. a point on the n dimensional sphere in n+1 space. so the inductive step giving the answer fore n+1 space, just adds n to the answer for n space, so just add n to n(n-1)/2 and you get (n+1)n/2.
 
  • Like
Likes   Reactions: jim mcnamara

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 17 ·
Replies
17
Views
7K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K