Third Sylow Theorem

Third Sylow Theorem

Introduction

The Third Sylow Theorem provides detailed information about the number of Sylow p-subgroups in a finite group. It gives precise constraints on this number, making it a powerful tool for group classification.

Statement

Third Sylow Theorem (Number): Let np be the number of Sylow p-subgroups of G. Then:

Let G be a finite group of order |G|=pnm, where p is a prime and p does not divide m.

Proof Sketch

The proof uses group actions:

  1. Define the action: Let G act on the set of all its Sylow p-subgroups by conjugation.

  2. Transitivity: By the Second Sylow Theorem, this action is transitive, so there is only one orbit.

  3. Count the orbit: The size of this orbit is np.

  4. Modular constraint: Restrict the action to a single Sylow p-subgroup P and count fixed points to get np1(modp).

Key Steps

Examples

Example 1: Groups of Order 12

Let G be a group of order 12. We have 12=223.

Sylow 2-subgroups: n2 must divide 3 and n21(mod2). So n2=1 or n2=3.

Sylow 3-subgroups: n3 must divide 4 and n31(mod3). So n3=1 or n3=4.

Example 2: Groups of Order 30

Let G be a group of order 30. We have 30=235.

Sylow 2-subgroups: n2 must divide 15 and n21(mod2). So n2=1,3,5,15.

Sylow 3-subgroups: n3 must divide 10 and n31(mod3). So n3=1 or n3=10.

Sylow 5-subgroups: n5 must divide 6 and n51(mod5). So n5=1 or n5=6.

Example 3: Groups of Order 15

A group of order 15 must have n3=1 and n5=1. The unique Sylow 3-subgroup and Sylow 5-subgroup are both normal, and it can be shown that the group must be the cyclic group Z15.

Applications

Application 1: Group Classification

The Third Sylow Theorem is crucial for classifying groups of a given order by constraining the number of Sylow subgroups.

Application 2: Simplicity Tests

If np=1 for some prime p, the unique Sylow p-subgroup is normal, so the group is not simple.

Application 3: Structure Analysis

The constraints on np help determine the possible structure of finite groups.

Consequences

Divisibility Constraints

The theorem provides strong constraints on the number of Sylow subgroups, which are essential for group classification.

Normalizer Information

The relationship np=[G:NG(P)] connects the number of Sylow subgroups to the structure of normalizers.