# Sylow theorems

In mathematics, specifically in the field of finite group theory, the **Sylow theorems** are a collection of theorems named after the Norwegian mathematician Ludwig Sylow ([[#Template:Harvid|1872]]) that give detailed information about the number of subgroups of fixed order that a given finite group contains. The Sylow theorems form a fundamental part of finite group theory and have very important applications in the classification of finite simple groups.

For a prime number *p*, a **Sylow p-subgroup** (sometimes

**) of a group**

*p*-Sylow subgroup*G*is a maximal

*p*-subgroup of

*G*, i.e., a subgroup of

*G*that is a

*p*-group (so that the order of any group element is a power of

*p*), and that is not a proper subgroup of any other

*p*-subgroup of

*G*. The set of all Sylow

*p*-subgroups for a given prime

*p*is sometimes written Syl

_{p}(

*G*).

The Sylow theorems assert a partial converse to Lagrange's theorem. While Lagrange's theorem states that for any finite group *G* the order (number of elements) of every subgroup of *G* divides the order of *G*, the Sylow theorems state that for any prime factor *p* of the order of a finite group *G*, there exists a Sylow *p*-subgroup of *G*. The order of a Sylow *p*-subgroup of a finite group *G* is *p ^{n}*, where

*n*is the multiplicity of

*p*in the order of

*G*, and any subgroup of order

*p*is a Sylow

^{n}*p*-subgroup of

*G*. The Sylow

*p*-subgroups of a group (for a given prime

*p*) are conjugate to each other. The number of Sylow

*p*-subgroups of a group for a given prime

*p*is congruent to 1 mod

*p*.

## Contents

## Theorems

Collections of subgroups that are each maximal in one sense or another are common in group theory. The surprising result here is that in the case of Syl_{p}(*G*), all members are actually isomorphic to each other and have the largest possible order: if |*G*| = *p ^{n}m* with

*n*> 0 where

*p*does not divide

*m*, then any Sylow

*p*-subgroup

*P*has order |

*P*| =

*p*. That is,

^{n}*P*is a

*p*-group and gcd(|

*G*:

*P*|,

*p*) = 1. These properties can be exploited to further analyze the structure of

*G*.

The following theorems were first proposed and proven by Ludwig Sylow in 1872, and published in *Mathematische Annalen*.

**Theorem 1**: For any prime factor *p* with multiplicity *n* of the order of a finite group *G*, there exists a Sylow *p*-subgroup of *G*, of order *p ^{n}*.

The following weaker version of theorem 1 was first proved by Cauchy, and is known as Cauchy's theorem.

**Corollary**: Given a finite group *G* and a prime number *p* dividing the order of *G*, then there exists an element (and hence a subgroup) of order *p* in *G*.^{[1]}

**Theorem 2**: Given a finite group *G* and a prime number *p*, all Sylow *p*-subgroups of *G* are conjugate to each other, i.e. if *H* and *K* are Sylow *p*-subgroups of *G*, then there exists an element *g* in *G* with *g*^{−1}*Hg* = *K*.

**Theorem 3**: Let *p* be a prime factor with multiplicity *n* of the order of a finite group *G*, so that the order of *G* can be written as *p ^{n}m*, where

*n*> 0 and

*p*does not divide

*m*. Let

*n*be the number of Sylow

_{p}*p*-subgroups of

*G*. Then the following hold:

*n*divides_{p}*m*, which is the index of the Sylow*p*-subgroup in*G*.*n*≡ 1 mod_{p}*p*.*n*= |_{p}*G*:*N*(_{G}*P*)|, where*P*is any Sylow*p*-subgroup of*G*and*N*denotes the normalizer._{G}

### Consequences

The Sylow theorems imply that for a prime number *p* every Sylow *p*-subgroup is of the same order, *p ^{n}*. Conversely, if a subgroup has order

*p*, then it is a Sylow

^{n}*p*-subgroup, and so is isomorphic to every other Sylow

*p*-subgroup. Due to the maximality condition, if

*H*is any

*p*-subgroup of

*G*, then

*H*is a subgroup of a

*p*-subgroup of order

*p*.

^{n}A very important consequence of Theorem 3 is that the condition *n _{p}* = 1 is equivalent to saying that the Sylow

*p*-subgroup of

*G*is a normal subgroup (there are groups that have normal subgroups but no normal Sylow subgroups, such as

*S*

_{4}).

### Sylow theorems for infinite groups

There is an analogue of the Sylow theorems for infinite groups. We define a Sylow *p*-subgroup in an infinite group to be a *p*-subgroup (that is, every element in it has *p*-power order) that is maximal for inclusion among all *p*-subgroups in the group. Such subgroups exist by Zorn's lemma.

**Theorem**: If *K* is a Sylow *p*-subgroup of *G*, and *n _{p}* = |Cl(

*K*)| is finite, then every Sylow

*p*-subgroup is conjugate to

*K*, and

*n*≡ 1 mod

_{p}*p*, where Cl(

*K*) denotes the conjugacy class of

*K*.

## Examples

A simple illustration of Sylow subgroups and the Sylow theorems are the dihedral group of the *n*-gon, *D*_{2n}. For *n* odd, 2 = 2^{1} is the highest power of 2 dividing the order, and thus subgroups of order 2 are Sylow subgroups. These are the groups generated by a reflection, of which there are *n,* and they are all conjugate under rotations; geometrically the axes of symmetry pass through a vertex and a side.

By contrast, if *n* is even, then 4 divides the order of the group, and the subgroups of order 2 are no longer Sylow subgroups, and in fact they fall into two conjugacy classes, geometrically according to whether they pass through two vertices or two faces. These are related by an outer automorphism, which can be represented by rotation through π/*n*, half the minimal rotation in the dihedral group.

## Example applications

Since Sylows theorem ensures the existence of p-subgroups of a finite group, its worthwhile to study groups of prime power order more closely. Most of the examples use Sylows theorem to prove that a group of a particular order is not simple. For groups of small order, the congruence condition of Sylow's theorem is often sufficient to force the existence of a normal subgroup.
Example-1: Groups of order pq, p and q primes with p<q.
Example-2: Group of order 30, groups of order 20, groups of order p^{2}q, p and q distinct primes are some of the applications.
Example-3: (Groups of order 60): If o(G)=60 and G has more than one Sylow 5-subgroups, then G is simple.

### Cyclic group orders

Some numbers *n* are such that every group of order *n* is cyclic. One can show that *n* = 15 is such a number using the Sylow theorems: Let *G* be a group of order 15 = 3 · 5 and *n*_{3} be the number of Sylow 3-subgroups. Then *n*_{3} | 5 and *n*_{3} ≡ 1 (mod 3). The only value satisfying these constraints is 1; therefore, there is only one subgroup of order 3, and it must be normal (since it has no distinct conjugates). Similarly, *n*_{5} must divide 3, and *n*_{5} must equal 1 (mod 5); thus it must also have a single normal subgroup of order 5. Since 3 and 5 are coprime, the intersection of these two subgroups is trivial, and so *G* must be the internal direct product of groups of order *3* and *5*, that is the cyclic group of order 15. Thus, there is only one group of order 15 (up to isomorphism).

### Small groups are not simple

A more complex example involves the order of the smallest simple group that is not cyclic. Burnside's *p ^{a} q^{b}* theorem states that if the order of a group is the product of one or two prime powers, then it is solvable, and so the group is not simple, or is of prime order and is cyclic. This rules out every group up to order 30 (= 2 · 3 · 5).

If *G* is simple, and |*G*| = 30, then *n*_{3} must divide 10 ( = 2 · 5), and *n*_{3} must equal 1 (mod 3). Therefore *n*_{3} = 10, since neither 4 nor 7 divides 10, and if *n*_{3} = 1 then, as above, *G* would have a normal subgroup of order 3, and could not be simple. *G* then has 10 distinct cyclic subgroups of order 3, each of which has 2 elements of order 3 (plus the identity). This means *G* has at least 20 distinct elements of order 3.

As well, *n*_{5} = 6, since *n*_{5} must divide 6 ( = 2 · 3), and *n*_{5} must equal 1 (mod 5). So *G* also has 24 distinct elements of order 5. But the order of *G* is only 30, so a simple group of order 30 cannot exist.

Next, suppose |*G*| = 42 = 2 · 3 · 7. Here *n*_{7} must divide 6 ( = 2 · 3) and *n*_{7} must equal 1 (mod 7), so *n*_{7} = 1. So, as before, *G* can not be simple.

On the other hand for |*G*| = 60 = 2^{2} · 3 · 5, then *n*_{3} = 10 and *n*_{5} = 6 is perfectly possible. And in fact, the smallest simple non-cyclic group is A_{5}, the alternating group over 5 elements. It has order 60, and has 24 cyclic permutations of order 5, and 20 of order 3.

### Wilson's theorem

Part of Wilson's theorem states that

for every prime *p*. One may easily prove this theorem by Sylow's third theorem. Indeed,
observe that the number *n _{p}* of Sylow's

*p*-subgroups in the symmetric group

*S*is (p-2)!. On the other hand, n

_{p}_{p}≡ 1 mod p. Hence, (p-2)! ≡ 1 mod p. So, (p-1)! ≡ -1 mod p.

### Fusion results

Frattini's argument shows that a Sylow subgroup of a normal subgroup provides a factorization of a finite group. A slight generalization known as **Burnside's fusion theorem** states that if *G* is a finite group with Sylow *p*-subgroup *P* and two subsets *A* and *B* normalized by *P*, then *A* and *B* are *G*-conjugate if and only if they are *N _{G}*(

*P*)-conjugate. The proof is a simple application of Sylow's theorem: If

*B*=

*A*, then the normalizer of

^{g}*B*contains not only

*P*but also

*P*(since

^{g}*P*is contained in the normalizer of

^{g}*A*). By Sylow's theorem

^{g}*P*and

*P*are conjugate not only in

^{g}*G*, but in the normalizer of

*B*. Hence

*gh*

^{−1}normalizes

*P*for some

*h*that normalizes

*B*, and then

*A*

^{gh−1}=

*B*

^{h−1}=

*B*, so that

*A*and

*B*are

*N*(

_{G}*P*)-conjugate. Burnside's fusion theorem can be used to give a more powerful factorization called a semidirect product: if

*G*is a finite group whose Sylow

*p*-subgroup

*P*is contained in the center of its normalizer, then

*G*has a normal subgroup

*K*of order coprime to

*P*,

*G*=

*PK*and

*P*∩

*K*= 1, that is,

*G*is

*p*-nilpotent.

Less trivial applications of the Sylow theorems include the focal subgroup theorem, which studies the control a Sylow *p*-subgroup of the derived subgroup has on the structure of the entire group. This control is exploited at several stages of the classification of finite simple groups, and for instance defines the case divisions used in the Alperin–Brauer–Gorenstein theorem classifying finite simple groups whose Sylow 2-subgroup is a quasi-dihedral group. These rely on J. L. Alperin's strengthening of the conjugacy portion of Sylow's theorem to control what sorts of elements are used in the conjugation.

## Proof of the Sylow theorems

The Sylow theorems have been proved in a number of ways, and the history of the proofs themselves are the subject of many papers including Template:Harv, Template:Harv, Template:Harv, Template:Harv, and to some extent Template:Harv.

One proof of the Sylow theorems exploits the notion of group action in various creative ways. The group *G* acts on itself or on the set of its *p*-subgroups in various ways, and each such action can be exploited to prove one of the Sylow theorems. The following proofs are based on combinatorial arguments of Template:Harv. In the following, we use *a* | *b* as notation for "a divides b" and *a* *b* for the negation of this statement.

Theorem 1: A finite groupGwhose order |G| is divisible by a prime powerphas a subgroup of order^{k}p.^{k}

Proof: Let |*G*| = *p ^{k}m = p^{k+r}u* such that

*p*does not divide

*u*, and let Ω denote the set of subsets of

*G*of size

*p*.

^{k}*G*acts on Ω by left multiplication. The orbits

*G*ω = {

*g*ω |

*g*∈

*G*} of the ω ∈ Ω are the equivalence classes under the action of

*G*.

For any ω ∈ Ω consider its stabilizer subgroup *G*_{ω} = {*g* ∈ *G* | *g*ω = ω}. For any fixed element α ∈ ω the function [*g* ↦ *g*α] maps *G*_{ω} to ω injectively: for any two *g*, *h* ∈ *G*_{ω} we have that *g*α = *h*α implies *g* = *h*, because α ∈ ω ⊆ *G* means that one may cancel on the right. Therefore * p ^{k}* = |ω| ≥ |

*G*

_{ω}|.

On the other hand

and no power of *p* remains in any of the factors inside the product on the right. Hence *ν _{p}*(|Ω|) =

*ν*(

_{p}*m*) =

*r*. Let

*R*⊆ Ω be a complete representation of all the equivalence classes under the action of

*G*. Then,

Thus, there exists an element ω ∈ *R* such that *s* := *ν _{p}*(|

*G*ω|) ≤

*ν*(|Ω|) =

_{p}*r*. Hence |

*G*ω| =

*p*where

^{s}v*p*does not divide

*v*. By the stabilizer-orbit-theorem we have |

*G*

_{ω}| = |

*G*| / |

*G*ω| =

*p*. Therefore

^{k+r-s}u/v*p*| |

^{k}*G*

_{ω}|, so

*p*≤ |

^{k}*G*

_{ω}| and

*G*

_{ω}

*is the desired subgroup.*

Lemma: LetGbe a finitep-group, letGact on a finite set Ω, and let Ω_{0}denote the set of points of Ω that are fixed under the action ofG. Then |Ω| ≡ |Ω_{0}| modp.

Proof: Write Ω as a disjoint sum of its orbits under *G*. Any element *x* ∈ Ω not fixed by *G* will lie in an orbit of order |*G*|/|*G _{x}*| (where

*G*denotes the stabilizer), which is a multiple of

_{x}*p*by assumption. The result follows immediately.

Theorem 2: IfHis ap-subgroup ofGandPis a Sylowp-subgroup ofG, then there exists an elementginGsuch thatg^{−1}Hg≤P. In particular, all Sylowp-subgroups ofGare conjugate to each other (and therefore isomorphic), i.e. ifHandKare Sylowp-subgroups ofG, then there exists an elementginGwithg^{−1}Hg=K.

Proof: Let Ω be the set of left cosets of *P* in *G* and let *H* act on Ω by left multiplication. Applying the Lemma to *H* on Ω, we see that |Ω_{0}| ≡ |Ω| = [*G* : *P*] mod *p*. Now *p* [*G* : *P*] by definition so *p* |Ω_{0}|, hence in particular |Ω_{0}| ≠ 0 so there exists some *gP* ∈ Ω_{0}. It follows that for some *g* ∈ *G* and ∀ *h* ∈ *H* we have *hgP* = *gP* so *g*^{−1}*HgP* = *P* and therefore *g*^{−1}*Hg* ≤ *P*. Now if *H* is a Sylow *p*-subgroup, |*H*| = |*P*| = |*gPg*^{−1}| so that *H* = *gPg*^{−1} for some *g* ∈ *G*.

Theorem 3: Letqdenote the order of any Sylowp-subgroup of a finite groupG. Thenn| |_{p}G|/qandn≡ 1 mod_{p}p.

Proof: By Theorem 2, *n _{p}* = [

*G*:

*N*(

_{G}*P*)], where

*P*is any such subgroup, and

*N*(

_{G}*P*) denotes the normalizer of

*P*in

*G*, so this number is a divisor of |

*G*|/

*q*. Let Ω be the set of all Sylow

*p*-subgroups of

*G*, and let

*P*act on Ω by conjugation. Let

*Q*∈ Ω

_{0}and observe that then

*Q*=

*xQx*

^{−1}for all

*x*∈

*P*so that

*P*≤

*N*(

_{G}*Q*). By Theorem 2,

*P*and

*Q*are conjugate in

*N*(

_{G}*Q*) in particular, and

*Q*is normal in

*N*(

_{G}*Q*), so then

*P*=

*Q*. It follows that Ω

_{0}= {

*P*} so that, by the Lemma, |Ω| ≡ |Ω

_{0}| = 1 mod

*p*.

## Algorithms

The problem of finding a Sylow subgroup of a given group is an important problem in computational group theory.

One proof of the existence of Sylow *p*-subgroups is constructive: if *H* is a *p*-subgroup of *G* and the index [*G*:*H*] is divisible by *p*, then the normalizer *N* = *N _{G}*(

*H*) of

*H*in

*G*is also such that [

*N*:

*H*] is divisible by

*p*. In other words, a polycyclic generating system of a Sylow

*p*-subgroup can be found by starting from any

*p*-subgroup

*H*(including the identity) and taking elements of

*p*-power order contained in the normalizer of

*H*but not in

*H*itself. The algorithmic version of this (and many improvements) is described in textbook form in Template:Harv, including the algorithm described in Template:Harv. These versions are still used in the GAP computer algebra system.

In permutation groups, it has been proven in (Template:Harvs; Template:Harvnb) that a Sylow *p*-subgroup and its normalizer can be found in polynomial time of the input (the degree of the group times the number of generators). These algorithms are described in textbook form in Template:Harv, and are now becoming practical as the constructive recognition of finite simple groups becomes a reality. In particular, versions of this algorithm are used in the Magma computer algebra system.

## See also

## Notes

- ↑ Fraleigh, Victor J. Katz. A First Course In Abstract Algebra. p. 322. ISBN 9788178089973

## References

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

### Proofs

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

### Algorithms

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}