How Many Parameters Define O(N) and SO(N) Groups?

In summary, the number of group parameters for O(N) and SO(N) is given by \frac{N(N-1)}{2}, as there are n^2 scalar equations in O^T O = 1, and the symmetry of the equations results in n + (n -1) + (n - 2) + ... + 2 + 1 = n(n + 1)/2 constraint equations. This is not affected by the determinant conditions, and while it can be shown for specific examples, it is difficult to prove in the general case for N.
  • #1
Norman
897
4
A little intro: This is for a whirlwind intro to Group Theory as part of another class (QFT) in which we are not proving anything, simply introducing definitions and theorems. We are not using a textbook, simply some notes the professor has written up for this intro and the notes are very incomplete. They also do not give any proof or explanation. So here is the problem:

Show that the number of group parameters for [tex] O(N) [/tex] and [tex] SO(N) [/tex] are [tex] \frac{N(N-1)}{2} [/tex]

Does this make sense as the solution:

We have [tex] n^2 [/tex] parameters. For [tex] O(N) [/tex] we have the condition that [tex] O^T O = 1[/tex]. This condition places [tex] \frac{n(n+1)}{2} [/tex] constraints on the parameters. This leaves [tex] n^2 - \frac{n(n+1)}{2} = \frac{n(n-1)}{2} [/tex]

Since [tex] O(N) [/tex] has [tex] detO(N) = \pm 1[/tex] and [tex] SO(N) [/tex] has [tex] detSO(N)=+1[/tex], simply picking the sign of the determinent doesn't force any additional constraint on the parameters.

I can only show this statement: "This condition places [tex] \frac{n(n+1)}{2} [/tex] constraints on the parameters." for specific examples, like N=2 and 3. I can see how it is extended to higher orders, but I cannot prove it in the general case for N. Any ideas? Also, any good books on Group Theory and Lie Algebras for Physicists?
Thanks,
Ryan
 
Physics news on Phys.org
  • #2
The matrix equation O^T O = 1 gives n^2 scalar equations - one for each element of the identity matrix. By symmetry, the equations for the elements below the main diagonal are the same as the equations above the main diagonal, so the number of constraint equations is the the number of elements on the main diagonal, n, plus the number of elements above the main diagonal, say x. x equals the total number of elements in the matrix minus the number of elements on the diagonal, all divided by 2, i.e., x = (n^2 - n)/2.

Cosequently, the number of contraint equations is

n + x = n(n + 1)/2.

Another way to calculate this is using an arithmetic series. The number of constraint equation for the top row of the identity matrix is n. The number of constraint equations for the second row of the identity matrix is n - 1, the number of elements in this row starting with the main diagonal and moving right, etc. So the total number of constraint equations is

n + (n -1) + (n - 2) + ... + 2 + 1 = n(n + 1)/2.

Regards,
George
 
  • #3


Yes, your solution makes sense. You have correctly identified the constraints imposed by the condition O^T O = 1 for O(N) and SO(N) groups, and you have correctly calculated the number of remaining parameters for each group.

To prove this in the general case for N, you can use the fact that the matrix O(N) can be written as a product of N(N-1)/2 independent rotations and reflections, each of which contributes one parameter. This can be shown using the fact that the determinant of O(N) is equal to the product of the determinants of these individual rotations and reflections.

As for books on Group Theory and Lie Algebras for physicists, some popular choices are "Group Theory in a Nutshell for Physicists" by A. Zee and "Lie Algebras in Particle Physics" by H. Georgi. However, there are many other good resources available, so it's best to explore and find what works best for you.
 
  • #4


Yes, your solution makes sense. The idea is that for O(N) and SO(N), we have n^2 parameters but the condition O^T O = 1 places constraints on these parameters. This reduces the number of independent parameters to n^2 - \frac{n(n+1)}{2} = \frac{n(n-1)}{2}. This is because the condition O^T O = 1 means that we only need to specify the upper or lower triangular elements of the matrix, and the diagonal elements are determined by the other elements. This results in n(n+1)/2 constraints.

As for proving it in the general case for N, you can use mathematical induction. Start with the base case N = 2 and show that it holds. Then assume it holds for N = k and show that it also holds for N = k+1. This will prove it for all N.

As for books on Group Theory and Lie Algebras for physicists, some good options are "Lie Algebras in Particle Physics" by Howard Georgi and "Group Theory in Physics" by Wu-Ki Tung. These books cover the basics of group theory and its applications in physics.
 

1. What is group theory?

Group theory is a branch of mathematics that deals with the study of symmetry and the properties of mathematical objects called groups. Groups are sets of elements with a defined operation that satisfies certain axioms, such as closure, associativity, and identity.

2. What are some real-world applications of group theory?

Group theory has many applications in various fields, including physics, chemistry, computer science, and cryptography. For example, it is used to study the symmetries of molecules in chemistry, to understand the behavior of particles in physics, and to develop secure encryption algorithms in computer science.

3. What are the basic properties of a group?

A group has four basic properties: closure, associativity, identity, and inverse. Closure means that the result of the operation between any two elements in the group is also an element of the group. Associativity means that the order of operations does not matter. Identity refers to the existence of an element that, when combined with any other element, results in that element. Inverse means that every element in the group has an element that, when combined with it, results in the identity element.

4. Can you give an example of a group?

Yes, the set of integers with the operation of addition is an example of a group. It satisfies all four properties of a group: closure (the sum of any two integers is also an integer), associativity (the order of addition does not matter), identity (the number 0 serves as the identity element), and inverse (the inverse of any integer is its negative).

5. What is the order of a group?

The order of a group is the number of elements in the group. It is denoted by |G|, where G is the group. The order of a group is an important property as it helps determine the structure and properties of the group.

Similar threads

  • Introductory Physics Homework Help
Replies
1
Views
794
  • Introductory Physics Homework Help
Replies
3
Views
150
  • Introductory Physics Homework Help
Replies
7
Views
76
  • Precalculus Mathematics Homework Help
Replies
10
Views
1K
  • Differential Geometry
Replies
11
Views
2K
Replies
27
Views
939
  • Introductory Physics Homework Help
Replies
2
Views
633
  • Linear and Abstract Algebra
Replies
4
Views
1K
Replies
4
Views
1K
Replies
3
Views
2K
Back
Top