Abstract Algebra · Undergraduate
The Sylow Theorems: Counting p-Subgroups
Quick answer
Lagrange's theorem says subgroup orders divide |G|; the Sylow theorems give a partial converse. Write |G| = pᵏm with p not dividing m. Then G has subgroups of order pᵏ, called Sylow p-subgroups; any two are conjugate; and their number nₚ divides m and satisfies nₚ ≡ 1 (mod p). Often these conditions force nₚ = 1, which makes the Sylow subgroup normal. That is how one shows every group of order 15 is cyclic and no group of order 20 is simple.
What you'll learn
- Find the order of a Sylow p-subgroup
- List the possible values of nₚ
- Show a Sylow subgroup is normal when nₚ = 1
- Use Sylow counting to classify groups of small order
Three theorems
Let with prime and . A Sylow -subgroup is a subgroup of order .
- Existence. has a Sylow -subgroup.
- Conjugacy. Any two Sylow -subgroups are conjugate: for some .
- Counting. The number of Sylow -subgroups satisfies
Since conjugates of a Sylow subgroup are Sylow subgroups, means the one Sylow -subgroup is normal.
Why nₚ divides m
acts on its Sylow -subgroups by conjugation, and by conjugacy there is a single orbit. The orbit–stabilizer theorem makes the index of the stabilizer, which contains , so divides . The count comes from letting itself act: every orbit other than has size a positive power of .
Worked examples
Common mistakes
Practice problems
-
Find the order of a Sylow -subgroup of a group of order .
Answer
Full solution
.
-
Find the order of a Sylow -subgroup of a group of order .
Answer
Full solution
.
-
Find for a group of order .
Answer
Full solution
and ; .
-
How many Sylow -subgroups does have?
Answer
Full solution
The subgroups , and .
-
How many elements of order does have?
Answer
Full solution
subgroups of order , each with elements of order .
-
A group of order has . How many elements of order does it have?
Answer
Full solution
. That leaves elements, exactly enough for one Sylow -subgroup.
-
Is every group of order cyclic?
Answer
Yes
Full solution
See Example 1.
-
A student says a group of order can have , since divides . Find the smallest possible greater than .
Answer
Full solution
must also be . Of the divisors , only and qualify.
Frequently asked questions
What is a Sylow p-subgroup?
If |G| = pᵏm with p not dividing m, a Sylow p-subgroup is a subgroup of order pᵏ, the largest power of p dividing |G|.
What do the Sylow theorems say?
Sylow p-subgroups exist, any two are conjugate, and their number nₚ divides m and is congruent to 1 mod p.
Why does nₚ = 1 make the subgroup normal?
Conjugating a Sylow p-subgroup gives another Sylow p-subgroup. If there is only one, every conjugate equals it, so it is normal.
Why is every group of order 15 cyclic?
n₃ divides 5 and is 1 mod 3, so n₃ = 1; n₅ divides 3 and is 1 mod 5, so n₅ = 1. Both subgroups are normal and share only the identity, so G ≅ ℤ₃ × ℤ₅ ≅ ℤ₁₅.