Group Actions and Sylow Theorems - Applications
The Sylow theorems provide powerful constraints on the structure of finite groups, enabling classification results and non-existence proofs.
Let be a finite group with where is prime and . Let be the number of Sylow -subgroups. Then:
- Existence: Sylow -subgroups exist (of order )
- Conjugacy: All Sylow -subgroups are conjugate
- Counting: and
These theorems transform the question "what subgroups must exist?" into concrete divisibility constraints that can often determine group structure completely.
Suppose is simple with . For Sylow 5-subgroups:
- and
- So
If , the unique Sylow 5-subgroup is normal, contradicting simplicity.
If , we have 6 subgroups of order 5, contributing elements of order 5. Similarly analyzing Sylow 3-subgroups forces , contributing 20 more elements. But , a contradiction!
Therefore, no simple group of order 30 exists.
Every group of order (where is prime) is abelian. Moreover, there are exactly two such groups up to isomorphism: and .
This follows from the class equation: . Since each term is a power of and , we must have . If , the quotient has order , hence is cyclic, which forces to be abelian (contradicting ). Thus .
The Sylow theorems enable a systematic approach to finite group theory. For small orders, we can often enumerate all possible groups by:
- Decomposing into prime powers
- Determining possible values of for each prime
- Using semi direct products when unique Sylow subgroups don't exist
Combined with the classification of finite simple groups, the Sylow theorems provide a nearly complete understanding of finite group structure.