The Sylow theorems are fundamental results in group theory describing the subgroups of a finite group whose orders are powers of a given prime. They guarantee the existence of subgroups containing the largest prime-power factor of the group’s order, show that all such subgroups are conjugate, and constrain how many there can be. Named after the Norwegian mathematician Ludwig Sylow, who published them in 1872, the theorems are central tools for analyzing the structure of finite groups.
Definitions and notation
Let be a finite group with order
where is prime and . The order of a finite group is its number of elements.
A -subgroup of is a subgroup whose order is a power of . A Sylow -subgroup is a subgroup of order , where is the largest power of dividing .
By Lagrange’s theorem, every subgroup order divides , so no -subgroup can have order larger than . The Sylow theorems additionally imply that a -subgroup maximal under inclusion is a Sylow -subgroup: “maximal” here means that it is not properly contained in another -subgroup, not necessarily that it is a maximal subgroup of .
The set of Sylow -subgroups is commonly written
and its size is denoted by . If does not divide , then , and the trivial subgroup is the unique Sylow -subgroup.
Statements of the theorems
The numbering varies between textbooks, but the standard results comprise existence, containment and conjugacy, and counting.
First theorem: existence
For every prime dividing , the group has a subgroup of order .
A standard strengthening states that has a subgroup of order for every integer with . This also uses the fact that a finite group of prime-power order has subgroups of every order dividing its order.
Second theorem: containment and conjugacy
Every -subgroup of is contained in some Sylow -subgroup.
Moreover, any two Sylow -subgroups and are conjugate: there exists such that
Thus all Sylow -subgroups are isomorphic, although they need not be equal. Conjugacy is stronger than abstract isomorphism because it relates the subgroups through an operation within the ambient group.
Third theorem: counting
The number satisfies
There is also an exact formula:
where
is the normalizer of any Sylow -subgroup , and brackets denote subgroup index.
The congruence and divisibility conditions sharply restrict the possibilities for , but they do not always determine it uniquely.
Proof through group actions
Group actions provide a unified approach to the theorems. Two basic facts are used repeatedly:
The size of an orbit equals the index of the stabilizer of a point.
If a finite -group acts on a finite set , every orbit has prime-power size. Consequently,
where is the set of points fixed by every element of the acting group .
Existence
Let be the set of subsets of having exactly elements. Then
This number is not divisible by . One way to see this is to compare coefficients in the polynomial congruence
which gives
Let act on by left multiplication. Since is not divisible by , at least one orbit has size not divisible by . Choose a subset in such an orbit and let be its stabilizer.
The orbit–stabilizer formula implies that is not divisible by , so divides . On the other hand, left multiplication by acts freely on the elements of : if , then is the identity. Therefore is a union of -orbits of size , so divides .
These two divisibility statements force
Containment and conjugacy
Fix a Sylow -subgroup , and let be any -subgroup. Let act by left multiplication on the set of left cosets .
There are such cosets, and . Since every orbit has prime-power size, at least one orbit has size one. Thus some coset is fixed by all of , meaning
Equivalently,
so .
If itself has order , this containment is equality, proving conjugacy.
Counting
Conjugation gives a transitive action of on . The stabilizer of is , so
Since ,
and hence .
To prove the congruence, let itself act by conjugation on . Its only fixed point is . Indeed, if normalizes a Sylow subgroup , then is a subgroup with order
a power of . Since no -subgroup can have order greater than , this forces .
Every other orbit has size divisible by , so
Structural consequences
Uniqueness and normality
A Sylow -subgroup is a normal subgroup if and only if it is the unique Sylow -subgroup:
If is normal, all its conjugates equal , and conjugacy accounts for every Sylow -subgroup. Conversely, uniqueness forces every conjugate of to equal .
This criterion is one of the most frequent applications of the theorems: arithmetic restrictions on can establish normality without an explicit description of the subgroup.
Cauchy’s theorem and the limits of a converse to Lagrange
The existence theorem implies Cauchy’s theorem: if , then contains an element of order .
The Sylow theorems give a partial converse to Lagrange’s theorem, but not a full one. A finite group need not have a subgroup of every order dividing its order. For example, the alternating group , of order , has no subgroup of order , although it has subgroups of orders , , and .
Groups with all Sylow subgroups normal
If every Sylow subgroup of a finite group is normal, then the group is the internal direct product of its Sylow subgroups.
For distinct primes and , normal Sylow subgroups and have trivial intersection. For and , the element belongs to both subgroups, so it is the identity. Thus distinct Sylow subgroups commute elementwise.
This does not force the whole group to be abelian, because individual Sylow subgroups may themselves be nonabelian.
Examples
The symmetric group on three letters
The symmetric group has order .
For ,
so . Its unique Sylow -subgroup is
For ,
so the arithmetic permits or . In , the three transpositions generate three distinct subgroups of order , giving . They are conjugate but not normal.
A group of order fifteen
Suppose . Then
which forces . Similarly,
which forces .
Both Sylow subgroups are normal, so
where denotes a cyclic group of order . Thus every group of order is cyclic.
A group of order forty-five
If , then
Only is possible. Every group of order therefore has a normal subgroup of order .
Applications and limitations
The Sylow theorems are basic tools in the classification of groups of small order. They help locate normal subgroups, restrict possible subgroup configurations, and rule out simplicity. A simple group has no nontrivial proper normal subgroup, so a forced unique Sylow subgroup can immediately exclude simplicity.
When uniqueness does not follow directly, counting elements in different Sylow subgroups or examining the action on their set can yield further restrictions. Conjugation on , for example, defines a homomorphism
connecting subgroup counts with permutation representations.
The theorems do not determine the internal structure of a Sylow subgroup or specify completely how Sylow subgroups interact. Nor are the two numerical conditions on a general existence criterion for a group with a proposed subgroup count. They are necessary restrictions for a given finite group, rather than a complete classification procedure.