The Sylow Theorems (Full Version)
The Sylow theorems describe the structure of -subgroups of finite groups, providing the most powerful general tool for analyzing the structure of finite groups.
Statement
Let be a finite group with where and .
- (Existence) has a subgroup of order (a Sylow -subgroup).
- (Conjugacy) Any two Sylow -subgroups are conjugate in .
- (Counting) The number of Sylow -subgroups satisfies and .
Proof of Existence
We use the action of on subsets. Consider , with acting by left multiplication: . We have . By a counting argument, (where is the -adic valuation), so .
The orbits partition : . Since , some orbit has . The stabilizer of is , and .
Since acts on by left multiplication (faithfully restricted to ), . From and : . Combined with : . So is a Sylow -subgroup.
Applications
Groups of order 15: . and : . and : . So both Sylow subgroups are normal, .
Groups of order 12: and . Analysis of cases yields exactly 5 groups: .
For many small orders, the Sylow theorems alone suffice to classify all groups. When , the Sylow -subgroup is normal, constraining the group structure. The Sylow theorems are often the first tool applied when studying the structure of an unknown finite group.