Groups were introduced to describe symmetry, and symmetry means that a group acts on something: permutations act on labels, rotations act on the vertices of a polygon, and every group acts on itself by multiplication and by conjugation. A group action makes this precise. The central counting tool is the orbit–stabilizer theorem, which is the coset-counting argument of Lagrange's theorem applied to the set being acted on. This unit uses subgroups, cosets and Lagrange's theorem from Subgroups, cyclic groups and cosets, and it generalizes the counting of conjugates in Conjugacy and centralizers.
Definitions
Definition 10.1.1
(Group action)
Let be a group and a set. A (left) action of on is a rule assigning to each and an element such that
Each then induces a map of to itself, and this map is a bijection with inverse , because and likewise in the other order. Hence an action is the same thing as a homomorphism , the group of bijections of . The action is called faithful when this homomorphism is injective; in general its kernel is .
Standard examples:
- acts on by .
- acts on itself by left multiplication, .
- acts on itself by conjugation, . Indeed and .
- acts by conjugation on the set of its subgroups, .
Definition 10.1.2
(Orbit, stabilizer and fixed point)
For define the orbit and the stabilizer
The action is transitive if for some (equivalently every) . A point is fixed if , and denotes the set of fixed points.
For conjugation on , the orbit of is its conjugacy class and the stabilizer is the centralizer . For conjugation on subgroups, the orbit of is the set of conjugate subgroups and the stabilizer is the normalizer .
Two basic facts
Proposition 10.1.3
(Stabilizers are subgroups)
For every , the stabilizer is a subgroup of .
Proof
(Closure under products and inverses)
. If then , so . If then .
Proposition 10.1.4
(Orbits partition the set)
The orbits of on partition . Consequently, if is finite and are representatives of the distinct orbits, then .
Proof
(Orbits are equivalence classes)
Write if for some . Reflexivity uses , symmetry uses , and transitivity uses . The equivalence classes are the orbits.
The orbit–stabilizer theorem
Theorem 10.1.5
(Orbit–stabilizer theorem)
Let act on and let . The map
is a well-defined bijection from the set of left cosets of onto the orbit of . In particular , and when is finite,
Proof
(A bijection from cosets onto the orbit)
Well defined: if then with , so . Injective: if then , so , that is . Surjective: every element of has the form and equals . Hence , and for finite Lagrange's theorem gives .
Proof X-ray
Where the coset enters
This is the argument behind the class-size count, in general form. The left coset appears because a change with in the stabilizer acts on first through , which does nothing. Well-definedness uses the action axiom and . The key move in injectivity is to combine two equal images into the single statement , which turns an equality in into membership in a subgroup of . Surjectivity is automatic because the orbit is defined as the image. Only the last line uses finiteness of , through Lagrange's theorem. Nothing here requires to be normal: we count cosets and never multiply them.
Corollary 10.1.6
(Consequences of the counting formula)
Let be finite and act on . Then every orbit size divides . Moreover, if then , so points in one orbit have conjugate stabilizers of equal order.
Proof
(Divisibility and conjugate stabilizers)
Divisibility is . For the second claim, iff iff (apply the bijection ) iff iff iff .
The conjugation actions recover earlier counts: and the number of conjugates of equals .
Fixed points of -group actions
Proposition 10.1.7
(Fixed-point congruence for -groups)
Let be a prime, let be a group of order () and let act on a finite set . Then .
Proof
(Count orbits by their sizes)
An orbit has size exactly when its point is fixed. Every other orbit has size a divisor of larger than , hence divisible by . Summing orbit sizes, .
Counterexample mode
The congruence needs a $p$-group
Claim: if divides , then . Take acting on and . The action is transitive, so and , but . The proof breaks exactly where it should: the single orbit has size , which is larger than but not divisible by : it divides , yet is not a power of . The repair is the hypothesis that is a power of .
Worked examples
Worked example 10.1.8
(Symmetries of a square)
Let of order act on the vertices of a square, labeled cyclically. Let be the rotation and the reflection in the diagonal through vertices and . The orbit of is , of size . The stabilizer of contains and . By the theorem , so exactly; no further computation is needed to exclude other elements.
Now let act on the two diagonals and . The orbit of is since swaps them, so the stabilizer has order . It is : each of these four maps to itself, and the theorem says there can be no more.
Worked example 10.1.9
(Conjugation in )
Let act on itself by conjugation and take . Its orbit is the set of all transpositions, which has elements. Hence . Directly, an element commuting with must preserve the set , so it either fixes or swaps and acts on in either of two ways, giving the four elements . The two computations agree.
The explorer below lists the left cosets for several actions of and and shows that is constant on each coset and different across cosets, so , and that stabilizers along an orbit are conjugate.
Worked example 10.1.10
(A fixed point forced by size)
A group of order acts on a set with . By the fixed-point congruence, , so . In particular has at least one fixed point.
Common mistakes and subtle points
Common mistake
(The order of the action axiom)
The identity must hold in that order. A rule with is a right action; for a left action defined by a formula, check the order of composition.
Common mistake
(Stabilizers are subgroups of , and not normal in general)
is a subgroup of , not a subset of , and in general it is not normal. Different points of one orbit have conjugate but possibly different stabilizers.
Common mistake
(Orbit–stabilizer concerns one point, not all of )
The formula needs the stabilizer of a single point. It does not say that equals times anything. Also, the orbit of is a subset of while counts cosets in : the theorem says these two numbers are equal, not that the sets are equal.
Exercises
Exercise 10.1.11
(Let act on and let . Prove that .)
FoundationProof
Solution(3)
- 1
Translate membership in
For , means .
- 2
Cancel using its inverse
Key step
Because: The map is a bijection of , so applying it loses no information.
- 3
Read off the subgroup
∎The right-hand condition says , that is . Hence .
Exercise 10.1.12
(A group of order acts on a set with . Prove that has a fixed point.)
CoreProof
Solution(4)
- 1
Restrict the orbit sizes
The orbit sizes lie in , and since only can occur.
Because: Each orbit size is an index, so it divides .
- 2
Assume there is no fixed point
Then all orbits have size or , so with integers .
- 3
Rule out every value of
If , then , impossible. If , then , impossible. If , then .
- 4
Conclude
∎The assumption is contradictory, so some orbit has size , and its point is fixed.
Exercise 10.1.13
( acts on the set of -element subsets of by . Find , show that the action is transitive, and find the order of the stabilizer of .)
Core
Solution(3)
- 1
Count the set
.
- 2
Show transitivity
Given pairs and , any permutation sending and maps one to the other. So there is a single orbit.
Because: Any two pairs can be matched elementwise by a permutation.
- 3
Apply orbit–stabilizer
. Directly, must preserve and , giving permutations.
Exercise 10.1.14
(Find the number of elements of the conjugacy class of in .)
Core
Solution(3)
- 1
Identify the class with an orbit
The class of has size .
Because: Under conjugation the orbit of is its conjugacy class and the stabilizer is .
- 2
Determine the centralizer
Key step
An element of the centralizer satisfies , that is . The image may be any of the four points, and then are forced as the successive points of the cycle. So , and .
- 3
Divide
The class has elements; these are the six -cycles of .