Group Actions and Orbits

The concept of a group action transforms abstract algebraic structures into tangible engines of symmetry, revealing hidden patterns within complex sets. Whether you're counting distinct colorings of a cube or analyzing the internal structure of a finite group, understanding how groups act on sets is a fundamental and powerful tool. This framework connects group theory to combinatorics, geometry, and physics, with the orbit-stabilizer theorem serving as the crucial bridge between local symmetry and global configuration.

Defining a Group Action

At its heart, a group action is a formal way to describe the symmetries of an object or set. Formally, an action of a group $G$ on a set $X$ is a function $G\times X\to X$, denoted by $(g,x)\mapsto g\cdot x$, that satisfies two axioms:

1. Identity: $e\cdot x=x$ for all $x\in X$, where $e$ is the identity element of $G$.
2. Compatibility: $g\cdot (h\cdot x)=(gh)\cdot x$ for all $g,h\in G$ and $x\in X$.

This means each group element $g$ defines a permutation (a bijective rearrangement) of the set $X$, and the operation of the group corresponds to the composition of these permutations. A classic example is the dihedral group $D_n$, the group of symmetries of a regular $n$-gon. This group acts on the set of the polygon's vertices: a rotation or reflection moves vertices to other vertex positions.

Orbits and Stabilizers

Once a group acts on a set, two fundamental concepts partition and dissect the action: orbits and stabilizers.

The orbit of an element $x\in X$ is the set of all places it can be moved to by the group action: $$G\cdot x=\{g\cdot x\mid g\in G\}.$$ Orbits form a partition of $X$; every element is in exactly one orbit. If a group can move any element to any other, there is only one orbit, and the action is called transitive. In our $D_n$ example, the action on vertices is transitive because any vertex can be mapped to any other vertex by some rotation.

In contrast, the stabilizer of $x$ focuses on the symmetry that leaves $x$ fixed. It is the subgroup of $G$ that doesn't move $x$: $$G_x=\{g\in G\mid g\cdot x=x\}.$$ For a vertex of a square under the $D_4$ action, the stabilizer consists of the identity and the reflection across the line through that vertex and the square's center.

The Orbit-Stabilizer Theorem

Orbits and stabilizers are not independent; they are linked by a powerful quantitative relationship. The orbit-stabilizer theorem states that for a finite group $G$ acting on a set $X$, the size of the orbit of an element $x$ is equal to the index of its stabilizer in the group: $$|G\cdot x|=[G:G_x]=\frac{|G|}{|G_x|}.$$

Proof: Consider the map $\varphi :G\to G\cdot x$ defined by $\varphi (g)=g\cdot x$. This map is clearly onto the orbit. The key observation is that two group elements $g$ and $h$ send $x$ to the same place ($g\cdot x=h\cdot x$) if and only if $h^{-1}g\in G_x$, which is equivalent to $g$ and $h$ being in the same left coset of $G_x$. Therefore, $\varphi$ induces a well-defined bijection between the set of left cosets $G/G_x$ and the orbit $G\cdot x$. Since the number of left cosets is the index $[G:G_x]$, the theorem follows.

This theorem is profound: it tells you that the number of distinct places an object can go (the size of its orbit) is inversely proportional to the amount of symmetry it has (the size of its stabilizer).

Burnside's Lemma for Combinatorial Enumeration

A direct, brilliant application of the orbit-stabilizer theorem is Burnside's lemma (often attributed to Frobenius). It solves a common enumeration problem: Given a group $G$ acting on a set $X$ of configurations (like colorings of an object), how many distinct configurations are there under the action? Two configurations are considered the same if one can be transformed into the other by an element of $G$.

The distinct configurations are precisely the orbits of the action. Burnside's lemma counts them: $$\text{Number of orbits}=\frac{1}{|G|}\sum _{g\in G}|X^g|,$$ where $X^g=\{x\in X\mid g\cdot x=x\}$ is the set of elements fixed by $g$.

Proof Sketch: Count the set $S=\{(g,x)\in G\times X\mid g\cdot x=x\}$ in two ways. First, sum over $g\in G$: you get ${\sum }_{g\in G}|X^g|$. Second, sum over $x\in X$: by the orbit-stabilizer theorem, each $x$ contributes $|G_x|=|G|/|G\cdot x|$. Summing over $x$ in a fixed orbit of size $k$ gives $k\cdot (|G|/k)=|G|$. Thus, each orbit contributes exactly $|G|$ to the total count of $S$. Therefore, $|S|=|G|\times (\text{Number of orbits})$. Equating the two counts gives the lemma.

Example: To count distinct colorings of a cube's faces with $n$ colors, $G$ is the rotation group of the cube (size 24). For each type of rotation (identity, face rotation, edge rotation, etc.), you count how many colorings are fixed by that rotation, average over the group, and obtain the number of distinct orbits (colorings).

Conjugacy Classes and the Class Equation

Groups also act on themselves via conjugation: $g\cdot x=gx{g}^{-1}$. The orbits of this action are called conjugacy classes. The stabilizer of an element $x$ is its centralizer: $C_G(x)=\{g\in G\mid gx{g}^{-1}=x\}$.

Applying the orbit-stabilizer theorem to this action yields $|\text{Conjugacy class of }x|=[G:C_G(x)]$. This tells you that the size of a conjugacy class divides the order of the group.

Summing these orbit sizes over all elements leads to the class equation, a vital tool for analyzing group structure: $$|G|=|Z(G)|+\sum _i[G:C_G(x_i)],$$ where $Z(G)$ is the center of the group (elements whose conjugacy class has size 1), and the sum is over representatives of distinct conjugacy classes with more than one element. This equation has deep consequences, such as proving that any group of prime power order has a non-trivial center.

Common Pitfalls

1. Confusing the set being acted upon: A group can act on many different sets (itself, cosets, subsets). Always be clear what $X$ is. For example, the orbit of a subgroup under conjugation is its set of conjugate subgroups, not a conjugacy class of elements.
2. Misapplying Burnside's lemma: The most common error is to forget that $G$ must be the full symmetry group of the physical object in your counting problem. Using the wrong group (e.g., the dihedral group instead of just the rotation group for a bracelet that can be flipped over) will give an incorrect count of distinct patterns.
3. Overlooking fixed points in proofs: When using the class equation, a frequent oversight is not properly accounting for the center $Z(G)$. Remember, the center consists precisely of those elements whose centralizer is the whole group, making their conjugacy class size 1. They are the "fixed points" of the conjugation action on the group.
4. Assuming stabilizers are normal: The stabilizer $G_x$ of a point is not necessarily a normal subgroup of $G$. It is a subgroup, but normality only holds if the stabilizers of all points in the same orbit are the same, which corresponds to the action being free on that orbit.

Summary

• A group action $G\times X\to X$ encodes how a group's elements permute a set, with the orbit $G\cdot x$ describing all reachable positions of an element and the stabilizer $G_x$ describing the symmetries fixing it.
• The orbit-stabilizer theorem, $|G\cdot x|=|G|/|G_x|$, provides a fundamental and inverse relationship between the size of an orbit and the size of its corresponding stabilizer subgroup.
• Burnside's lemma, $\text{Orbits}=\frac{1}{|G|}{\sum }_g|X^g|$, is a powerful tool for combinatorial enumeration, allowing you to count distinct configurations under symmetry by averaging the number of fixed points of each group element.
• The action of a group on itself by conjugation defines conjugacy classes, and the orbit-stabilizer theorem for this action leads to the class equation, $|G|=|Z(G)|+\sum [G:C_G(x_i)]$, a key equation for proving structural theorems in finite group theory.