Sylow’s theorems

Three theorems giving a partial converse to Lagrange’s theorem: while Lagrange tells us only what subgroup orders are forbidden, Sylow tells us which prime-power orders are guaranteed and exactly how many subgroups of each kind there are.

Setup

Let be a finite group and a prime. Write with . A Sylow -subgroup of is any subgroup of order - i.e. the largest possible -subgroup.

The Three Theorems

First Sylow Theorem

has at least one Sylow -subgroup.

Second Sylow Theorem

Any two Sylow -subgroups are conjugate in . Equivalently, every -subgroup of is contained in some Sylow -subgroup.

Third Sylow Theorem

Let be the number of Sylow -subgroups. Then:

  1. ;
  2. .

Why They Matter

  • Existence (First): every prime divisor of guarantees a maximal -subgroup.
  • Uniqueness up to conjugation (Second): Sylow -subgroups are structurally interchangeable.
  • Counting (Third): is constrained to a finite list of values; often pins it to .

When , the unique Sylow -subgroup is normal (no other conjugates). This is the most common entry point for classification arguments.

Standard Application: Order Groups Are Often Cyclic

If with primes and , then and , both Sylow subgroups are normal, their intersection is trivial (Lagrange), their product is , so is the Internal direct product . Examples: orders .

When a non-cyclic example may exist (e.g. order allows ).

Proof Strategy

  • First Sylow: act on the set of -subsets by left multiplication; use Orbit-Stabiliser and a binomial-coefficient -adic argument.
  • Second / Third: act on cosets / on the set of all Sylow -subgroups by conjugation.

See lecture 17 for full statements and worked examples.

Generalises Cauchy’s theorem

Cauchy: subgroup of order . Sylow First: subgroup of order (the maximum power of in ).