Introduction to Group Theory: Definition and Examples

1. The Physicist's Motivation for Group Theory

Before diving into formal definitions, it's crucial to understand why group theory is indispensable in physics. At its heart, it is the mathematical language of symmetry. When we say a system has a symmetry, we mean it remains unchanged under some transformation. For example, the laws of physics are the same today as they were yesterday (time-translation symmetry), and they are the same here as on the other side of the galaxy (space-translation symmetry).

These symmetries are not just aesthetic; they have deep physical consequences. As you may know from classical and quantum mechanics, continuous symmetries lead directly to conservation laws via Noether's theorem. But the utility of symmetry goes much further. The properties of elementary particles, such as mass, spin, and charge, can be understood as "labels" that characterize how these particles behave under various symmetry transformations (like rotations and Lorentz boosts). Group theory provides the framework to systematically classify these labels and predict the spectrum of possible particles and their interactions.

To begin, let's watch an excerpt from a lecture by Prof. Robert de Mello Koch, who motivates the study of group theory from the perspective of a particle physicist.

2. From Transformations to Group Axioms

Prof. Koch's discussion leads us to a key idea: we can study the set of all possible transformations that leave some property of a system invariant. Let's consider the general properties of these transformations. If you can perform one transformation and then another, the combined result is often another valid transformation in the set. There is usually a "do nothing" transformation. And for any transformation, there is often an "undo" transformation that gets you back to where you started.

These simple observations are the intuitive basis for the mathematical definition of a group. The following segment of the same lecture formalizes this intuition by examining the properties of composing transformations.

As the video explains, a group is a set of elements combined with an operation that satisfies four specific rules. Let's state them formally.

A group is a set $G$ together with a binary operation $\circ :G\times G\to G$ (which we often write as multiplication, e.g., $g_1\circ g_2=g_1{g}_2$) that satisfies the following four axioms:

1. Closure: For any two elements $a,b\in G$, their product $a\circ b$ is also an element of $G$.
2. Associativity: For any three elements $a,b,c\in G$, the equation $(a\circ b)\circ c=a\circ (b\circ c)$ holds. The order of operations doesn't matter.
3. Identity Element: There exists a unique element $e\in G$, called the identity, such that for every element $a\in G$, $e\circ a=a\circ e=a$.
4. Inverse Element: For each element $a\in G$, there exists a unique element $a^{-1}\in G$, called the inverse of $a$, such that $a\circ a^{-1}=a^{-1}\circ a=e$.

If, in addition, the operation is commutative (i.e., $a\circ b=b\circ a$ for all $a,b\in G$), the group is called Abelian. Otherwise, it is non-Abelian.

For a concise textual reference on these axioms, you can consult the following notes.

3. Verifying the Axioms: Physical Examples

The power of this abstract definition lies in its broad applicability. We will now verify these axioms for three distinct types of groups that are fundamental in physics.

Example 1: The Rotation Group SO(2)

Consider the set of all rotations of a vector in a two-dimensional plane about the origin. This forms a group called the Special Orthogonal group in 2D, or SO(2).

Let's walk through the verification as outlined in the notes:

• Set $G$: The set of all counter-clockwise rotations $R(\varphi )$ about the origin, where $\varphi$ is the angle of rotation. We can identify rotations that differ by multiples of $2\pi$, so we can take $\varphi \in [0,2\pi )$.
• Operation $\circ$: Composition of rotations. Applying $R({\varphi }_1)$ and then $R({\varphi }_2)$ is written as $R({\varphi }_2)\circ R({\varphi }_1)$.
• Verification:
  1. Closure: A rotation by ${\varphi }_1$ followed by a rotation by ${\varphi }_2$ is equivalent to a single rotation by ${\varphi }_1+{\varphi }_2$. Since $R({\varphi }_1+{\varphi }_2)$ is also a rotation, the set is closed.
  2. Associativity: $(R({\varphi }_3)\circ R({\varphi }_2))\circ R({\varphi }_1)=R({\varphi }_2+{\varphi }_3)\circ R({\varphi }_1)=R({\varphi }_1+{\varphi }_2+{\varphi }_3)$. Similarly, $R({\varphi }_3)\circ (R({\varphi }_2)\circ R({\varphi }_1))=R({\varphi }_3)\circ R({\varphi }_1+{\varphi }_2)=R({\varphi }_1+{\varphi }_2+{\varphi }_3)$. It is associative.
  3. Identity: The rotation by angle $\varphi =0$, $R(0)$, leaves every vector unchanged. It is the identity element.
  4. Inverse: For any rotation $R(\varphi )$, the rotation $R(-\varphi )$ (or equivalently, $R(2\pi -\varphi )$) rotates vectors back to their original position. So, $R(\varphi {)}^{-1}=R(-\varphi )$.

Since $R({\varphi }_1)\circ R({\varphi }_2)=R({\varphi }_1+{\varphi }_2)=R({\varphi }_2+{\varphi }_1)=R({\varphi }_2)\circ R({\varphi }_1)$, this group is Abelian. SO(2) is an example of a continuous group or Lie group, a concept we will explore in depth later in the course.

Example 2: The Symmetric Group $S_N$

Now let's consider a very different type of symmetry: the permutation of discrete objects. The set of all possible permutations of $N$ distinct objects forms the Symmetric Group, $S_N$.

This next video provides a more formal, mathematical look at permutation groups. It systematically verifies that the set of permutations on a set, with the operation of function composition, satisfies all the group axioms.

Let's summarize the key points for $S_N$:

• Set $G$: The set of all $N!$ permutations of $N$ distinct objects.
• Operation $\circ$: Function composition (applying one permutation after another).
• Verification:
  1. Closure: Composing two permutations (bijections from a set to itself) results in another valid permutation.
  2. Associativity: Function composition is inherently associative.
  3. Identity: The identity permutation, which leaves all objects in their original positions.
  4. Inverse: Since permutations are bijections, each has a well-defined inverse function that is also a permutation.

For $N>2$, the group $S_N$ is non-Abelian. For instance, in $S_3$, swapping objects 1 and 2, and then 2 and 3, is not the same as swapping 2 and 3 first, and then 1 and 2. These finite, discrete groups are crucial for understanding the exchange statistics of identical particles in quantum mechanics.

Example 3: Matrix Groups

Many symmetry transformations in physics, such as rotations, Lorentz boosts, and internal transformations in quantum field theory, are represented by matrices. The sets of these matrices often form groups, with matrix multiplication as the group operation. Your background in linear algebra will be very useful here.

Let's verify the axioms for the Special Unitary Group SU(2). This group is of paramount importance in quantum mechanics, describing the spin of fundamental particles and forming the basis of electroweak theory.

• Set $G$: The set of all $2\times 2$ complex matrices $U$ that are unitary ($U^{†}U=I$, where $I$ is the identity matrix and $U^{†}$ is the conjugate transpose of $U$) and have unit determinant ($\det (U)=1$).
• Operation $\circ$: Standard matrix multiplication.
• Verification:
  1. Closure: Let $U_1,U_2\in \text{SU(2)}$. We must check if their product $U_1{U}_2$ is also in SU(2).
     • Unitarity: $(U_1{U}_2{)}^{†}(U_1{U}_2)=U_2^{†}{U}_1^{†}{U}_1{U}_2=U_2^{†}I{U}_2=U_2^{†}{U}_2=I$. The product is unitary.
     • Unit Determinant: $\det (U_1{U}_2)=\det (U_1)\det (U_2)=1\cdot 1=1$. The product has a determinant of 1.
       So, the set is closed.
  2. Associativity: Matrix multiplication is always associative.
  3. Identity: The $2\times 2$ identity matrix $I=\left(\begin{array}{cc}1& 0\\ 0& 1\end{array}\right)$ is in SU(2), since $I^{†}I=I$ and $\det (I)=1$.
  4. Inverse: For any $U\in \text{SU(2)}$, its inverse is $U^{-1}=U^{†}$. We must check if $U^{†}$ is also in SU(2).
     • Unitarity: $(U^{†}{)}^{†}{U}^{†}=U{U}^{†}=I$. (Since $U^{†}U=I$, $U$ is invertible and $U^{-1}=U^{†}$, so $U{U}^{†}=I$). $U^{†}$ is unitary.
     • Unit Determinant: $\det (U^{†})=(\det (U){)}^{\ast }=1^{\ast }=1$. $U^{†}$ has a determinant of 1.
       So, the inverse $U^{†}$ is in SU(2).

All four axioms are satisfied. SU(2) is a group. It is also a non-Abelian Lie group, and its properties are intimately tied to the algebra of angular momentum operators in quantum mechanics.

The world of matrix groups is vast and includes many others you will encounter, such as:

• U(N): Unitary matrices (describe general transformations in quantum mechanics).
• O(N), SO(N): Orthogonal and special orthogonal matrices (rotations in N-dimensional real space).
• SL(N,C): Complex matrices with determinant 1.
• The Lorentz Group O(1,3): Transformations preserving the Minkowski spacetime interval in special relativity.
• The Poincaré Group: Lorentz transformations plus spacetime translations.

Conclusion

In this lesson, we have laid the formal groundwork for our study of symmetry in physics. We began with the physical motivation for studying transformations and their invariants, which led us to the abstract definition of a group.

The key takeaways are:

• A group is a set with a binary operation satisfying four axioms: closure, associativity, identity, and inverse.
• This structure mathematically formalizes the concept of symmetry.
• We verified these axioms for three critical examples in physics:
  • SO(2): The continuous, Abelian group of rotations in a plane.
  • $S_N$: The discrete group of permutations, which is non-Abelian for $N>2$.
  • SU(2): A continuous, non-Abelian matrix group fundamental to quantum mechanics.

You now have the foundational definition needed to speak the language of symmetry. In the next lesson, we will delve deeper into the structure of groups by introducing the concept of subgroups—smaller groups that live inside a larger group. This will lead us to a powerful classification tool known as Lagrange's theorem.