Visualize how groups act on sets, and the orbit-stabilizer theorem
A group action of G on a set X assigns to each group element g a bijection of X, compatibly with the group operation. Group actions provide the bridge between abstract groups and concrete symmetries of objects. Every representation is a linear group action, but group actions on finite sets are the most intuitive starting point.
The orbit of a point x is the set of all points reachable from x by applying group elements. The stabilizer of x is the subgroup that fixes x.
The orbit-stabilizer theorem says |G| = |Orbit(x)| times |Stabilizer(x)| for any point x. Explore how D4 acts on different parts of the square -- vertices, edges, diagonals, and the center -- and see how orbit size and stabilizer size trade off.
The orbit-stabilizer theorem says |G| = |Orbit(x)| * |Stabilizer(x)| for any x. Bigger orbits mean smaller stabilizers and vice versa.
Key insight: More symmetric points have larger stabilizers and smaller orbits. The center of the square is the most symmetric point (stabilizer = all of D4), while vertices are the least symmetric (stabilizer has 2 elements).
When a group acts on a finite set, we get a permutation representationby letting the group permute the standard basis vectors. The matrix has exactly one 1 in each row and column. The trace counts fixed points.
The permutation representation sends each permutation to its corresponding permutation matrix. The character (trace) counts fixed points.
Key insight: The character of a permutation representation counts fixed points. This connects representation theory to combinatorics and leads directly to Burnside's lemma.
How many distinct necklaces can you make with n beads and k colors, if two necklaces that differ only by rotation are considered the same? Burnside's lemma gives the answer: average the number of fixed colorings over all group elements.
Burnside's lemma counts the number of distinct objects under a group action. Here we count necklaces up to rotational symmetry (cyclic group Z/n).
Key insight: Burnside's lemma is the trace of the permutation representation divided by the group order. It is one of the most useful counting tools in combinatorics, and it comes directly from representation theory.