# Abstract Algebra/Group Theory/The Sylow Theorems

In this section, we will have a look at the Sylow theorems and their applications. The Sylow theorems are three powerful theorems in group theory which allow us for example to show that groups of a certain order are not simple.

The proofs are a bit difficult but nonetheless interesting. Important remark: Wikipedia also has proofs of the Sylow theorems, see Wikipedia article on the Sylow theorems, which are shorter and more elegant. But here you can find other proofs. This is because the author wanted to avoid redundancy. So you can choose the proof you like, or read both :-)

Remark: The proofs below also teach a lot about how to apply group actions, so they might give you also an idea how to do this kind of stuff :-)

## The Sylow theorems[edit | edit source]

**Definition 1**: Let be a finite group of order , where is a prime, and is coprime to . We say that a subgroup of is a *Sylow -subgroup* iff it has order .

**Definition 2**: Let H be a subgroup of a group G. We define the *normalizer* N[H] of H as follows:

- due to Fermat

**Theorem 3 (Cauchy's theorem)** Let G be a group and be a prime number such that divides . Then there exists an element of G which has order p. In particular, there is a subgroup of order p of G, namely .

*Proof*: Let X be the set of all tuples for which . The cyclic group acts on X with the action . An example is , for which the orbit contains only this same element ().

We also have that since we can choose the first p-1 elements arbitrarily and , and therefore |X| is a multiple of p, because |G| is also divisible by p. Furthermore, we know by the orbit-stabilizer theorem (theorem 19 from the section about group actions), that . Since p is a prime number, we have for all that either or . But since the orbits partition X (due to lemma 11 from the section about group actions), and is divisible by p, we need at least one (in the case p = 2, else even more elements) other element of X such that . Let . We have , because otherwise x' would not be fixed by the action we defined. Then . QED.

**Theorem 4 (Sylow I)**: Let be a finite group of order , where is a prime, and is coprime to . For every , there is a subgroup of order of G. In particular, there exists a Sylow -subgroup of G.

*Proof*: For this proof, we use induction. Let H be a p-subgroup of G, i. e. for some natural i. H acts on the sets of left cosets G/H by left multiplication. By corollary 23 from the section about group actions, we obtain that , where . But also the following equivalences are true:

- because

But from this we can conclude that . Therefore, (*) becomes . From this we can conclude, that if , and therefore p divides by the theorem of Lagrange, that then also p divides . And also: Since is a normal subgroup of , we know that is a group. Therefore we can apply Cauchy's theorem: has a subgroup of order p. But if we set , then is a subgroup of of order , because

a) the intersection of two different cosets is the empty set, and

b) is a subgroup of G because for for some , because , the normaliser. QED.

**Lemma 5 (order of the conjugate)**: Let G be a group with identity , and an element of that group. Then

*Proof*: First, we observe that by induction: For n = 1, the claim is obviosly true, and the calculation

shows the induction step.

Therefore, , which shows that .

Let furthermore . Then , where the first implication is true because the inverse is uniquely determined, and the second implication is true because the identity is uniquely determined. Therefore , implying with the former inequality that and finishing the proof. QED.

**Lemma 6**: Let , and let G act on X by conjugation. Then is a subgroup of G, and any p-subgroup of is contained in P.

*Proof*: Conjugation of G on X is a transitive action: If are arbitrary, by choosing . By the section about group actions, transitivity implies is really a group.

By the definition of X, we have that P is even a normal subgroup of . Let now Q be an arbitrary p-subgroup of . Then is a subgroup due to the section about normal subgroups. Due to the second isomorphism theorem, we have that . Therefore, we also have by Lagrange's theorem, that for some , because Q is a Sylow p-subgroup. Furthermore, Lagrange's theorem also assures that . Since P is a Sylow p-subgroup and QP is a subgroup of G and therefore divides |G|, we know that p does not divide . Therefore, must be the trivial subgroup, and therefore also , which implies because due to the section about subgroups, QED.

**Theorem 7 (Sylow II)**: If P is a Sylow p-subgroup of G, and Q is an arbitrary p-group of G, then , so Q is contained in a Sylow p-group, since for arbitrary groups G if is an arbitrary subgroup of G, then also . In particular, all Sylow -subgroup of are conjugate.

*Proof*: Let's choose . P acts on X by conjugation. By the orbit-stabilizer theorem (corollary 19 of the section on group actions), we have that . But since P is a Sylow p-group, we know that or . Since , we furthermore have and therefore , because P is a single element in X.

But P is also the only element with trivial orbit: Let . That has trivial orbit means translated into the language of our group action, that . If we multiply this equation by on the right and on the left, we obtain that . Because of Lemma 5 we know that . Therefore is a p-subgroup of . Due to Lemma 6, we know that therefore must be a subgroup of P, and since both sets contain the same number of elements, they must be equal.

We now recall the above formula and note that since , all the other elements must have the property , since their orbits are not trivial. Since the orbits partition X, we have that .

Now we let *Q* act on X by conjugation, instead of P. Since , we know that there is at least one orbit of length 1. So what does this mean?:

As before:

, and, by Lemma 6:

- , and therefore . QED.

**Lemma 8**: The normalizer of a subgroup is a subgroup.

*Proof*: Let H be a subgroup of G, and let G act on H by conjugation. Then the normalizer of H is the stabilizer of H in this action. Therefore, it is a subgroup due to Lemma 14 of the section about group actions, QED.

**Theorem 9 (Sylow III*)**: Let again be the number of Sylow -groups of . Then , where is any Sylow -group.

*Proof*: This follows from the proof of Sylow II and the thm. Sylow II itself: Choose as in the proof of Sylow II. Then by the theorem itself follows that , and if we consider the group action of G on X of conjugation, then we have that . But since due to the orbit-stabilizer theorem (thm. 19 in the section about group actions) due to the definition of the normalizer, and due to the theorem of Lagrange (which is applicable since N[P] is a subgroup due to Lemma 8), the theorem follows. QED.

**Theorem 10 (Sylow III)**: Let be a finite group of order , where is a prime, and is coprime to . If is the number of Sylow -subgroups of , then and .

*Proof*: Choose as in the proof of Sylow II. The proof for Sylow II shows that , and the theorem Sylow II *itself* shows that . This proves the second part. The first part follows from Sylow III* and the fact that due to Lagrange (which we can apply here because N[P] is a subgroup due to Lemma 8): Since P is a subgroup of N[P], we know that divides . This means that is not divisible by p. But since divides , it must divide m. QED.

## How to show that groups of a certain order aren't simple[edit | edit source]

In this section, it will be shown how to show that groups of a certain order can not be simple using the Sylow theorems. This is a useful application of the Sylow theorems.

**Example 11**: Groups of order 340 are not simple.

*Proof*: Let |G| = 340 = 2^{2} ⋅ 5 ⋅ 17. Due to Sylow III, we have that , because and has only this solution (this can be seen by computing all possible solutions, which are finitely many since the last condition implies that ). But since, due to Sylow II, the conjugate of the only Sylow 5-group is again a Sylow 5-group, it is itself. This is the definition of normal subgroups. Therefore, by the definition of simple groups, groups of order 340 are not simple. QED.

**Example 12**: Groups of order 48 are not simple.

*Proof*: Let |G| = 48 = 2^{4} ⋅ 3. Sylow III tells us that and . From this follows that either or . If now , then, in the same way as example 11, the (then only) Sylow 2-group is normal. In the other case, through conjugation on the set of the three Sylow 2-groups, we generate a homomorphism . This is due to theorem 2 from the section about group actions. The image can't be trivial, because all Sylow 2-groups are conjugate because of Sylow II. But since the kernel is a normal subgroup, and , we have that due to the first isomorphism theorem and the theorem of Lagrange, that the kernel is a proper, non-trivial normal subgroup, which is why the group is not simple.

**Example 13**: Groups of order 108 are not simple.

*Proof*: Let |G| = 108 = 2 ⋅ 2 ⋅ 3^{3} and S be a Sylow 3-group. We let G act on the cosets of S by left multiplication. Due to theorem 2 from the section about group actions, we know that this action generates a homomorphism . Due to the first isomorphism theorem and Lagrange, we have that and therefore must divide 108. Since is a subgroup in and , must divide 24. From this follows that , and therefore, again due to the formula from the first isomorphism theorem and Lagrange, we have that . If the kernel would be G, then the action would be trivial and therefore , which is a contradiction, since G is no Sylow 3-group. Therefore, the kernel is a proper, non-trivial normal subgroup, which is why the group is not simple.