Motivation
A multiplication table describes a finite group completely, but becomes unmanageable quickly. An action replaces the table with a controlled way to move objects. Counting orbits can then reveal element orders, normal subgroups, and restrictions on the whole group. The central technique is simple: count the same finite set after partitioning it into pieces whose sizes are forced by a subgroup.
The quotient and Lagrange arguments from the preceding chapter are prerequisites. All sets and groups used in counting arguments below are finite. The prime is fixed in each argument; a -group means a group of order a power of , including order one.
Definitions
Definition 2.1.1
(Actions, orbits, and stabilizers)
A left action of on a set assigns with and . The orbit of is . The stabilizer is . The fixed-point set consists of points fixed by every element of .
Each acts by a bijection with inverse the action of . Orbits partition : the relation is reflexive, symmetric, and transitive. The stabilizer is a subgroup, since two elements fixing have a product and inverses fixing it. An action is faithful if the only group element fixing every point is ; this differs from requiring every point to have trivial stabilizer.
For conjugation, on , the stabilizer is the centralizer . The one-point orbits are exactly the elements of the center . For a subgroup , its normalizer is . It is the stabilizer of for the action on subgroups by conjugation.
Write with . A Sylow -subgroup is a subgroup of order , and denotes the number of such subgroups. This definition does not itself guarantee existence. We prove existence before using any property that presupposes it.
Theorems
Theorem 2.1.2
(Orbit–stabilizer and the fixed-point congruence)
For a finite group acting on a finite set, . If is a -group, then . In particular, conjugation gives the class equation
where the represent the noncentral conjugacy classes. A nontrivial finite -group has nontrivial center.
Concept lensStructural
An orbit as the information retained by a coset
The orbit map gives the same answer for two group elements exactly when they lie in the same left coset of . Thus an orbit can be identified with as a set carrying an action, even when is not normal. This viewpoint explains why orbit–stabilizer is a coset count while the orbit itself need not be a quotient group.
Theorem 2.1.3
(Cauchy's theorem and the Sylow theorems)
If , then has an element of order . For with , Sylow -subgroups exist. Every -subgroup is contained in a conjugate of any chosen Sylow -subgroup. All Sylow -subgroups are conjugate, and and .
Proof sketch or proof idea
Proof
(Orbits are coset spaces)
Consider . This formula must not depend on the representative . For ,
The last equivalence is the criterion for equality of left cosets. It proves both that is well defined and that it is injective. Every element of has the form , so is also onto.
Each coset has elements, since is a bijection from to , and the cosets partition . There are therefore cosets, and the bijection gives the formula. No quotient group is being constructed: need not be normal.
In a -group action, every orbit size divides a power of . Non-singleton orbits therefore have size divisible by ; singleton orbits are the global fixed points. Summing orbit sizes gives the congruence. For conjugation, this gives the class equation. If is a power of , the center size is divisible by and contains , so it is at least .
The -group hypothesis cannot be weakened to divisibility of by : orbit sizes are divisors of , and only for a -group are all of them powers of .
Counterexample mode
The fixed-point congruence needs a $p$-group
Claim: whenever divides , a finite -set satisfies . Let act on by permuting, and take , which divides . Every point is moved by some transposition, so and , while . Since , the claim fails. The single orbit has size , which is not divisible by ; this is exactly the non-singleton orbit that a -group could not produce. The congruence is correct for actions of -groups, which is how it is applied below: to a cyclic group of order , to a Sylow subgroup and to a -subgroup.
Cauchy by rotating tuples
Proof
(Fixed tuples under rotation)
Consider
The first entries determine the last, so is divisible by . Cyclic rotation preserves : from we obtain . Rotation defines an action of the cyclic group of order . Its fixed tuples are exactly with . The fixed-point congruence says their number is divisible by . One is the all-identity tuple, so there is at least one other. Its entry has order dividing , hence exactly . No commutativity assumption on was used.
Existence of Sylow subgroups
Proof
(Induction through the center or a centralizer)
We use induction on , with the order-one case immediate, and allow , when suffices. Suppose . If , Cauchy's theorem in supplies a central subgroup of order . It is normal. The smaller quotient has a subgroup of order by induction. Its preimage has order , because each quotient fiber has elements.
If , reduce the class equation modulo . Since , at least one noncentral class has size not divisible by ; otherwise the equation would force . Its centralizer is a proper subgroup, since is noncentral. Moreover its order contains the full power , by . Induction within this smaller group provides the required subgroup of order . These two cases complete the existence proof.
Containment, conjugacy, and counting
Proof
(Three actions for three statements)
Fix a Sylow subgroup , and let any -subgroup act by left multiplication on . Since is not divisible by , the fixed-point congruence gives a fixed coset . Being fixed means for every , or . Thus . When itself has order , inclusion becomes equality, proving conjugacy.
The conjugation orbit of now contains all Sylow subgroups, so . Because , Lagrange gives , proving .
Finally let act on the set of Sylow subgroups by conjugation. A fixed subgroup is normalized by . Then is a subgroup: the condition allows factors to be reordered to check closure and inverses. Its order is , a power of , so it cannot exceed by Lagrange. Since it contains both and , it follows that . Conversely fixes itself. There is exactly one fixed point, and the congruence gives . This completes every assertion in the theorem.
Proof X-ray
Which action proves which Sylow statement
Each Sylow statement comes from choosing the right action and applying the fixed-point congruence once. Existence uses the class equation instead: either divides the center, and Cauchy supplies a central subgroup to quotient by, or some noncentral class has size prime to , and then its centralizer is a smaller group whose order still contains . Containment is the key move. The -subgroup acts on the left cosets of , and forces a fixed coset ; translating “fixed” gives . Conjugacy is the special case . The divisibility is orbit–stabilizer for the conjugation orbit of , together with . The congruence needs one more idea: a Sylow subgroup fixed by is normalized by , so is a -subgroup containing , and maximality of forces . The hypothesis is used twice: to find the fixed coset, and to know that is the largest possible order of a -subgroup.
Actions as homomorphisms and Cayley's theorem
The set of bijections , under composition, is the symmetric group . An action defines a homomorphism by . The action axiom gives the homomorphism law point by point. Conversely, a homomorphism to this symmetric group defines an action by evaluation. Its kernel is the intersection of all stabilizers, since an element acts as the identity function exactly when it fixes every point.
Theorem 2.1.4
(Cayley's theorem)
Every group is isomorphic to a subgroup of . In particular, a group of order is isomorphic to a subgroup of .
Proof
(Left multiplication is faithful)
For the left-multiplication action on itself, an element fixing the identity must be the identity. Thus the action is faithful, and embeds into .
If , it realizes as a subgroup of . It does not say that every group of order is the entire symmetric group, whose order is . The distinction between an injective map and a surjective one is crucial here.
For the action on , the kernel is . Indeed, fixes every coset exactly when for every . This intersection, called the core of , is the largest normal subgroup of contained in . It is normal as an action kernel. Any normal subgroup contained in is contained in every conjugate of , proving maximality. Thus a nonnormal subgroup still yields a useful homomorphism, although it does not define a quotient group by itself.
A proper subgroup of a p-group has a larger normalizer
Proposition 2.1.5
(Normalizers grow in -groups)
Let be a finite -group and a proper subgroup of . Then is a proper subgroup of . Consequently every maximal proper subgroup of is normal of index .
Proof
(Counting fixed cosets of a proper subgroup)
Let be a finite -group and a proper subgroup. Let act on by left multiplication. A coset is fixed precisely when . These subgroups have the same finite size, so containment means equality; the fixed cosets are exactly those represented by . Therefore there are fixed points.
The set has size a positive power of , because is proper. The fixed-point congruence shows that is divisible by . It is also positive, since itself is fixed. Hence the normalizer strictly contains . This conclusion is stronger than knowing the center is nontrivial, but follows from the same counting argument. It applies to every proper subgroup, including one that is not initially known to be normal.
As a useful consequence, a maximal proper subgroup of a finite -group is normal: maximality and the larger normalizer force . The quotient has no nontrivial proper subgroup by correspondence. Cauchy's theorem then forces its order to be , since a higher power would have a proper subgroup of order . Thus every maximal subgroup has index . This is a structural deduction with each hypothesis used explicitly.
Worked examples
Worked example 2.1.6
(A group of order twenty-one has a normal subgroup)
If , then divides three and is one modulo seven. Only is possible, so the subgroup of order seven is normal: conjugation preserves it because it is unique. For the subgroups of order three, divides seven and is one modulo three, giving or seven. This arithmetic alone does not determine which occurs, and does not prove that every group of order twenty-one is cyclic.
Worked example 2.1.7
(Groups of order squared are abelian)
For , the center has order or . If it has order , then is abelian. If it has order , the quotient has prime order, hence is cyclic. The exercise on central subgroups with cyclic quotient, at the end of the preceding chapter's unit on quotients, then forces abelian, contradicting a center of order only . Thus in all cases is abelian. This argument does not yet classify the abelian group as cyclic or a product.
Worked example 2.1.8
(Burnside's orbit count on binary triangles)
For a finite -set, count pairs with . Summing over gives ; summing over one orbit gives , because stabilizers in an orbit have the same size. Therefore the number of orbits is . For rotations of three labeled positions with binary colors, the identity fixes all eight colorings, and each nonidentity rotation fixes exactly the two constant colorings. Hence there are rotation classes. Reflections are not included in this chosen action.
Common mistakes
Common mistake
(A fixed point is fixed by the whole group)
A fixed point is a point fixed by the entire acting group; being fixed by one nonidentity element is weaker. Distinguish the centralizer of an element from the normalizer of a subgroup. Their stabilizer interpretations help identify the right object: the first is a stabilizer for conjugation on elements, the second for conjugation on subgroups.
Common mistake
(Sylow subgroups need not be normal)
A Sylow subgroup is normal exactly when it is the unique Sylow subgroup for that prime, since all its conjugates are Sylow subgroups and conjugacy exhausts them. In , the subgroups , and are three Sylow -subgroups, consistent with and , and none is normal. Divisibility and congruence restrictions may leave several possibilities; report the remaining alternatives instead of choosing one without proof.
Common mistake
(Acting on cosets does not require normality)
An action on left cosets exists for every subgroup, including nonnormal ones; only multiplication of the cosets themselves requires normality. The proofs of orbit–stabilizer and of Sylow containment both use such actions for subgroups that need not be normal.
Summary
Orbit–stabilizer translates motion into subgroup indices. Fixed-point congruences extract divisibility information, yielding Cauchy and nontrivial centers. The class equation proves Sylow existence; coset actions give containment and conjugacy; conjugation on the Sylow subgroups gives their number. These are complementary uses of one counting method, with each action and its fixed points specified explicitly.
Exercises
Quick check
(Show that the stabilizer of is . Deduce that stabilizer sizes are constant on an orbit.)
Solution · Answer
An element fixes exactly when fixes , by applying to the action equation. This is equivalent to . Conjugation is a bijection, so the stabilizers have equal sizes.
Quick check
(In a group of order forty-five, prove that the Sylow five-subgroup is normal. List the possibilities for the number of Sylow three-subgroups.)
Solution · Answer
divides nine and is one modulo five. The divisors leave only one, giving normality. The number divides five and is one modulo three; among , only one works. Thus the Sylow three-subgroup is also normal; listing candidates before the congruence must not leave five as a final possibility.
Quick check
(Prove that any group of order fifteen is cyclic. You may use the Sylow theorems just proved.)
Solution · Answer
Here , , and , , so both subgroups are unique and normal, of orders five and three. Their intersection is trivial by Lagrange. For , the commutator lies in by normality of and in by normality of , hence is identity. Choose generators . Since they commute, implies , so both five and three divide . Thus has order fifteen and generates .
Quick check
(Count binary colorings of the four vertices of a square up to rotation only. State the fixed-coloring count for each rotation.)
Solution · Answer
The identity fixes colorings. Each quarter-turn fixes two, since all vertices form one cycle. The half-turn has two vertex cycles and fixes . The average is . Including reflections would require a different group and an additional fixed-point calculation.