Mathematics
Permutation Groups and the Orbit-Stabilizer Theorem
Quick fact
The orbit-stabilizer theorem states that for a group G acting on a set X, for any element x, |G| = |Orbit(x)| × |Stabilizer(x)|. This simple formula lets us compute the size of enormous geometric symmetry groups without listing them.
Why this is interesting
Think of a Rubik's cube. Every twist rearranges the stickers—that's a permutation. But did you know that the number of possible arrangements you can reach is exactly the size of a certain group? The orbit-stabilizer theorem is the key that counts them.
Read the full explanation
Understanding Permutation Groups and the Orbit-Stabilizer Theorem
Imagine a set of objects, like the vertices of a square. A permutation is just a rearrangement of these objects. A permutation group is a collection of such rearrangements that is closed under composition—doing one then another, and also including the 'do nothing' rearrangement and inverses. Now, when we let a permutation group act on a set, each element can be moved around. The orbit of a point is the set of all places it can go, and the stabilizer is the set of permutations that leave it fixed. The orbit-stabilizer theorem tells us that the total number of permutations in the group is exactly the orbit size times the stabilizer size. For instance, for a square, the symmetry group has 8 permutations. The orbit of a corner has 4 elements (the four corners), and the stabilizer of a corner has 2 rotations (0° and 180°). Indeed, 8 = 4 × 2. This theorem is beautiful because it connects the global size of a group to the local behavior on a point.
A deeper explanation
The proof of the orbit-stabilizer theorem is a beautiful example of counting via equivalence classes. For a fixed element x, consider the map from G to the orbit of x by sending each permutation g to g·x. This map is onto the orbit. The fibers of this map are exactly the left cosets of the stabilizer Stab(x) in G. Specifically, two permutations send x to the same image if and only if they differ by an element of the stabilizer. Thus, the orbit is in bijection with the set of cosets of Stab(x), and by Lagrange's theorem, the number of cosets is |G| / |Stab(x)|. Therefore, |Orbit(x)| = |G| / |Stab(x)|, or equivalently |G| = |Orbit(x)| × |Stab(x)|. This theorem matters because it is a fundamental counting tool that lets us deduce group orders from actions, and it forms the foundation for Burnside's lemma, which counts orbits under group actions.