This sheet introduces the Sylow theorems—one of the most powerful tools in finite group theory. They provide a partial converse to Lagrange's theorem and give deep structural information about finite groups.

Commentary. Lagrange's theorem tells us that the order of any subgroup divides the order of the group. The converse is false in general: a group of order 12 need not have a subgroup of order 6 (as A4A_4 demonstrates). The Sylow theorems rescue this situation for subgroups of prime power order. They guarantee existence (Sylow I), conjugacy (Sylow II), and counting (Sylow III) of maximal prime-power subgroups.

Prerequisites. This sheet uses the following results from Sheet 5:

  • Orbit-Stabilizer Theorem (Theorem 5.14)
  • Cauchy's Theorem (Theorem 5.42)
  • Group action on subgroups by conjugation (moved from Sheet 5 to here, see Definition 6.7-6.9)

p-Groups#

Definition 6.1. Let pp be a prime. A pp-group is a group in which every element has order a power of pp.

Theorem 6.2. A finite group is a pp-group iff its order is a power of pp.

Theorem 6.3. If GG is a finite pp-group, then Z(G)≠{e}Z(G) \neq \{e\}.

Definition 6.4. Let GG be a finite group and pp a prime. A subgroup P≤GP \leq G is a Sylow pp-subgroup if PP is a maximal pp-subgroup of GG, i.e., if ∣P∣=pn|P| = p^n where pnp^n is the highest power of pp dividing ∣G∣|G|.


Lemma 1: p-Group Action on Finite Sets#

Theorem 6.5 (p-Group Action Lemma). Let GG be a finite pp-group acting on a finite set XX. Then:∣X∣≡∣XG∣(modp),|X| \equiv |X^G| \pmod{p},where XG={x∈X∣g⋅x=x for all g∈G}X^G = \{x \in X \mid g \cdot x = x \text{ for all } g \in G\} is the set of fixed points.

Corollary 6.6. If GG is a finite pp-group acting on a finite set XX and pp does not divide ∣X∣|X|, then GG has a fixed point in XX.

Exercise 6.7. Prove Theorem 6.5 using the Orbit-Stabilizer theorem.

Exercise 6.8. Let GG be a pp-group acting on itself by conjugation. Show that ∣G∣≡∣Z(G)∣(modp)|G| \equiv |Z(G)| \pmod{p}. Deduce that Z(G)≠{e}Z(G) \neq \{e\}.


Lemma 2: The Normalizer#

Definition 6.9. Let H≤GH \leq G. The normalizer of HH in GG is:NG(H)={g∈G∣gHg−1=H}.N_G(H) = \{g \in G \mid gHg^{-1} = H\}.

Theorem 6.10. NG(H)N_G(H) is a subgroup of GG containing HH.

Theorem 6.11. H◃NG(H)H \triangleleft N_G(H), and NG(H)N_G(H) is the largest subgroup of GG in which HH is normal.

Definition 6.12. Let GG act on the set of all subgroups of GG by conjugation:g⋅H=gHg−1.g \cdot H = gHg^{-1}.

Theorem 6.13. The stabilizer of HH under this action is the normalizer:(GH)=NG(H).(G_H) = N_G(H).

The orbit of HH is the set of all subgroups conjugate to HH.

Corollary 6.14. The number of distinct conjugates of HH in GG is (G:NG(H))(G : N_G(H)).

Exercise 6.15. Prove Theorem 6.10.

Exercise 6.16. Let H≤GH \leq G. Prove that H◃GH \triangleleft G iff NG(H)=GN_G(H) = G.


Lemma 3: Normalizer Index Lemma#

Theorem 6.17 (Normalizer Index Lemma). Let HH be a pp-subgroup of a finite group GG. Then:(G:H)≡(NG(H):H)(modp).(G : H) \equiv (N_G(H) : H) \pmod{p}.

Proof Idea. Let GG act on the set of left cosets of HH by left multiplication. By Theorem 6.5, ∣X∣≡∣XG∣(modp)|X| \equiv |X^G| \pmod{p}. The fixed points are exactly the cosets contained in NG(H)N_G(H). Hence (G:H)≡(NG(H):H)(modp)(G : H) \equiv (N_G(H) : H) \pmod{p}.∎

Corollary 6.18. If pp divides (G:H)(G : H), then NG(H)≠HN_G(H) \neq H.

Exercise 6.19. Prove Theorem 6.17 by filling in the details of the proof idea above.


Sylow I: Existence#

Theorem 6.20 (Sylow I). Let GG be a finite group and let pp be a prime. If pkp^k divides ∣G∣|G|, then GG has a subgroup of order pkp^k. In particular, Sylow pp-subgroups exist.

Corollary 6.21. Every finite group of order pnmp^n m (with gcd⁡(p,m)=1\gcd(p, m) = 1) has a subgroup of order pnp^n.

Proof Idea. By Cauchy's theorem (Sheet 5, Theorem 5.44), GG has a subgroup of order pp. Suppose HH has order pip^i with i<ni < n. Then pp divides (G:H)(G : H). By Corollary 6.18, NG(H)≠HN_G(H) \neq H. Thus pp divides (NG(H):H)(N_G(H) : H). By Cauchy's theorem, NG(H)/HN_G(H)/H has a subgroup of order pp, whose preimage in NG(H)N_G(H) is a subgroup of order pi+1p^{i+1}. By induction, a subgroup of order pnp^n exists.∎

Exercise 6.22. Show that every group of order 12 has a subgroup of order 3 and a subgroup of order 4.

Exercise 6.23. Show that every group of order 30 has a subgroup of order 5.


Lemma 4: Sylow Subgroups Are Conjugate#

Theorem 6.24 (Conjugacy Lemma). Let PP be a Sylow pp-subgroup of GG, and let QQ be any pp-subgroup of GG. Then QQ is contained in some conjugate of PP.

Proof Idea. Let QQ act on the set of left cosets of PP by left multiplication. Since pp does not divide (G:P)(G : P), by Corollary 6.6 QQ has a fixed point. Thus Q≤gPg−1Q \leq gPg^{-1} for some gg.∎

Corollary 6.25. If QQ is also a Sylow pp-subgroup, then Q=gPg−1Q = gPg^{-1} for some gg.


Sylow II: Conjugacy#

Theorem 6.26 (Sylow II). All Sylow pp-subgroups of a group GG are conjugate. That is, if PP and QQ are Sylow pp-subgroups, then there exists g∈Gg \in G such that:Q=gPg−1.Q = gPg^{-1}.

Corollary 6.27. A Sylow pp-subgroup is normal iff it is the unique Sylow pp-subgroup of GG.

Corollary 6.28. Every pp-subgroup of GG is contained in some Sylow pp-subgroup.

Exercise 6.29. Let GG have order 15. Show that the Sylow 5-subgroup is normal.

Exercise 6.30. Let PP be a Sylow pp-subgroup of GG. Prove that P◃GP \triangleleft G iff PP is the only Sylow pp-subgroup of GG.


Lemma 5: Counting Sylow Subgroups#

Theorem 6.31 (Counting Lemma). Let PP be a Sylow pp-subgroup of GG. The number of Sylow pp-subgroups of GG is (G:NG(P))(G : N_G(P)).

Proof. By Corollary 6.14, the number of conjugates of PP is (G:NG(P))(G : N_G(P)). By Sylow II, all Sylow pp-subgroups are exactly the conjugates of PP.∎


Sylow III: Counting#

Theorem 6.32 (Sylow III). Let GG be a finite group and pp a prime. If ∣G∣=pnm|G| = p^n m with gcd⁡(p,m)=1\gcd(p, m) = 1, let np(G)n_p(G) denote the number of Sylow pp-subgroups of GG. Then:

  1. np(G)≡1(modp)n_p(G) \equiv 1 \pmod{p}.
  2. np(G)n_p(G) divides mm.

Proof of (1). Let PP be a Sylow pp-subgroup, and let PP act by conjugation on the set of all Sylow pp-subgroups. The only fixed point is PP itself. By Theorem 6.5, np(G)≡1(modp)n_p(G) \equiv 1 \pmod{p}.∎

Proof of (2). By Theorem 6.31, np(G)=(G:NG(P))n_p(G) = (G : N_G(P)), which divides ∣G∣|G|. Since P≤NG(P)P \leq N_G(P), pnp^n divides ∣NG(P)∣|N_G(P)|. Thus (G:NG(P))(G : N_G(P)) divides mm.∎

Corollary 6.33. If pp is the smallest prime dividing ∣G∣|G| and p2∤∣G∣p^2 \nmid |G|, then the Sylow pp-subgroup is normal.

Example 6.34. For ∣G∣=30=2⋅3⋅5|G| = 30 = 2 \cdot 3 \cdot 5:

  • n5≡1(mod5)n_5 \equiv 1 \pmod{5} and n5∣6n_5 \mid 6, so n5=1n_5 = 1 or 66.
  • n3≡1(mod3)n_3 \equiv 1 \pmod{3} and n3∣10n_3 \mid 10, so n3=1n_3 = 1 or 1010.
  • n2≡1(mod2)n_2 \equiv 1 \pmod{2} and n2∣15n_2 \mid 15, so n2=1,3,5,15n_2 = 1, 3, 5, 15.

Exercise 6.35. Compute n2n_2, n3n_3, and n5n_5 for a group of order 60.

Exercise 6.36. Show that every group of order 35 is cyclic.


Applications of Sylow Theorems#

Theorem 6.37. If ∣G∣=pq|G| = pq where p<qp < q are primes, then GG has a normal Sylow qq-subgroup. Moreover, if p∤q−1p \nmid q - 1, then GG is cyclic.

Theorem 6.38. There is no simple group of order pqpq where p,qp, q are primes.

Theorem 6.39. There is no simple group of order pnp^n for n≥1n \geq 1.

Theorem 6.40. There is no simple group of order p2qp^2 q for distinct primes p,qp, q in certain cases (e.g., p>qp > q and p≢1(modq)p \not\equiv 1 \pmod{q}).

Example 6.41. No group of order 12 is simple: n3≡1(mod3)n_3 \equiv 1 \pmod{3} and n3∣4n_3 \mid 4, so n3=1n_3 = 1 or 44. If n3=1n_3 = 1, the Sylow 3-subgroup is normal. If n3=4n_3 = 4, then the four Sylow 3-subgroups each contain 2 elements of order 3, giving 8 elements of order 3. The remaining elements include the identity and a Sylow 2-subgroup of order 4, which must be normal.

Exercise 6.42. Prove that there is no simple group of order 56.

Exercise 6.43. Prove that every group of order 45 is abelian.

Exercise 6.44. Show that every group of order 100 has a nontrivial normal subgroup.


Classification of Groups of Small Order#

Theorem 6.45. Up to isomorphism, the only groups of order pp (prime) are Zp\mathbb{Z}_p.

Theorem 6.46. Up to isomorphism, the only groups of order p2p^2 are Zp2\mathbb{Z}_{p^2} and Zp×Zp\mathbb{Z}_p \times \mathbb{Z}_p.

Theorem 6.47. Up to isomorphism, the groups of order 2p2p (where pp is an odd prime) are Z2p\mathbb{Z}_{2p} and DpD_p.

Exercise 6.48. Classify all groups of order 6.

Exercise 6.49. Classify all groups of order 10.

Exercise 6.50. Let GG be a group of order 21. Show that either G≅Z21G \cong \mathbb{Z}_{21} or G≅Z7⋊Z3G \cong \mathbb{Z}_7 \rtimes \mathbb{Z}_3 (the nonabelian semidirect product).


The Sylow Theorems and Normal Subgroups#

Theorem 6.51. If PP is a Sylow pp-subgroup of GG, then:∣G:NG(P)∣=np(G).|G : N_G(P)| = n_p(G).

Theorem 6.52. P◃GP \triangleleft G iff np(G)=1n_p(G) = 1.

Theorem 6.53. If PP is a Sylow pp-subgroup of GG, then NG(NG(P))=NG(P)N_G(N_G(P)) = N_G(P).

Exercise 6.54. Let GG be a group of order pnmp^n m with gcd⁡(p,m)=1\gcd(p, m) = 1. Prove that np(G)=1n_p(G) = 1 iff the Sylow pp-subgroup is characteristic (i.e., fixed by all automorphisms of GG).

Exercise 6.55. Let PP be a Sylow pp-subgroup of GG. Show that if P≤H≤GP \leq H \leq G, then PP is a Sylow pp-subgroup of HH.


Summary#

We have introduced:

  • pp-groups and their basic properties
  • Lemma 1: pp-group action on finite sets: ∣X∣≡∣XG∣(modp)|X| \equiv |X^G| \pmod{p}
  • Lemma 2: The normalizer NG(H)N_G(H) and group action on subgroups
  • Lemma 3: Normalizer index lemma: (G:H)≡(NG(H):H)(modp)(G : H) \equiv (N_G(H) : H) \pmod{p}
  • Sylow I: Existence of Sylow pp-subgroups
  • Lemma 4: Sylow subgroups are conjugate
  • Sylow II: Conjugacy of Sylow pp-subgroups
  • Lemma 5: Counting Sylow subgroups via normalizer
  • Sylow III: Counting Sylow pp-subgroups (np≡1(modp)n_p \equiv 1 \pmod{p}, np∣mn_p \mid m)
  • Applications: groups of order pqpq, p2p^2, 2p2p
  • Classification results for small orders
  • The connection between Sylow subgroups and normal subgroups

Next: Sheet 7 — Introduction to Rings