Skip to main content
\(\newcommand{\identity}{\mathrm{id}} \newcommand{\notdivide}{{\not{\mid}}} \newcommand{\notsubset}{\not\subset} \newcommand{\lcm}{\operatorname{lcm}} \newcommand{\gf}{\operatorname{GF}} \newcommand{\inn}{\operatorname{Inn}} \newcommand{\aut}{\operatorname{Aut}} \newcommand{\Hom}{\operatorname{Hom}} \newcommand{\cis}{\operatorname{cis}} \newcommand{\chr}{\operatorname{char}} \newcommand{\Null}{\operatorname{Null}} \newcommand{\lt}{ < } \newcommand{\gt}{ > } \newcommand{\amp}{ & } \)

Section15.2Examples and Applications

Example15.9

Using the Sylow Theorems, we can determine that \(A_5\) has subgroups of orders \(2\), \(3\), \(4\), and \(5\). The Sylow \(p\)-subgroups of \(A_5\) have orders \(3\), \(4\), and \(5\). The Third Sylow Theorem tells us exactly how many Sylow \(p\)-subgroups \(A_5\) has. Since the number of Sylow 5-subgroups must divide 60 and also be congruent to \(1 \pmod{5}\), there are either one or six Sylow 5-subgroups in \(A_5\). All Sylow 5-subgroups are conjugate. If there were only a single Sylow 5-subgroup, it would be conjugate to itself; that is, it would be a normal subgroup of \(A_5\). Since \(A_5\) has no normal subgroups, this is impossible; hence, we have determined that there are exactly six distinct Sylow 5-subgroups of \(A_5\).

The Sylow Theorems allow us to prove many useful results about finite groups. By using them, we can often conclude a great deal about groups of a particular order if certain hypotheses are satisfied.

Proof
Example15.11

Every group of order 15 is cyclic. This is true because \(15 = 5 \cdot 3\) and \(5 \not\equiv 1 \pmod{3}\).

Example15.12

Let us classify all of the groups of order \(99 = 3^2 \cdot 11\) up to isomorphism. First we will show that every group \(G\) of order 99 is abelian. By the Third Sylow Theorem, there are \(1 + 3k\) Sylow 3-subgroups, each of order \(9\), for some \(k = 0, 1, 2, \ldots\). Also, \(1 + 3k\) must divide 11; hence, there can only be a single normal Sylow 3-subgroup \(H\) in \(G\). Similarly, there are \(1 +11k\) Sylow 11-subgroups and \(1 +11k\) must divide \(9\). Consequently, there is only one Sylow 11-subgroup \(K\) in \(G\). By Corollary 14.16, any group of order \(p^2\) is abelian for \(p\) prime; hence, \(H\) is isomorphic either to \({\mathbb Z}_3 \times {\mathbb Z}_3\) or to \({\mathbb Z}_9\). Since \(K\) has order 11, it must be isomorphic to \({\mathbb Z}_{11}\). Therefore, the only possible groups of order 99 are \({\mathbb Z}_3 \times {\mathbb Z}_3 \times {\mathbb Z}_{11}\) or \({\mathbb Z}_9 \times {\mathbb Z}_{11}\) up to isomorphism.

To determine all of the groups of order \(5 \cdot 7 \cdot 47 = 1645\), we need the following theorem.

The subgroup \(G'\) of \(G\) is called the commutator subgroup of \(G\). We leave the proof of this theorem as an exercise (Exercise 10.3.14 in Chapter 10).

Example15.14

We will now show that every group of order \(5 \cdot 7 \cdot 47 = 1645\) is abelian, and cyclic by Corollary 9.21. By the Third Sylow Theorem, \(G\) has only one subgroup \(H_1\) of order \(47\). So \(G/H_1\) has order 35 and must be abelian by Theorem 15.10. Hence, the commutator subgroup of \(G\) is contained in \(H\) which tells us that \(|G'|\) is either 1 or 47. If \(|G'|=1\), we are done. Suppose that \(|G'|=47\). The Third Sylow Theorem tells us that \(G\) has only one subgroup of order 5 and one subgroup of order 7. So there exist normal subgroups \(H_2\) and \(H_3\) in \(G\), where \(|H_2| = 5\) and \(|H_3| = 7\). In either case the quotient group is abelian; hence, \(G'\) must be a subgroup of \(H_i\), \(i= 1, 2\). Therefore, the order of \(G'\) is 1, 5, or 7. However, we already have determined that \(|G'| =1\) or 47. So the commutator subgroup of \(G\) is trivial, and consequently \(G\) is abelian.

SubsectionFinite Simple Groups

Given a finite group, one can ask whether or not that group has any normal subgroups. Recall that a simple group is one with no proper nontrivial normal subgroups. As in the case of \(A_5\), proving a group to be simple can be a very difficult task; however, the Sylow Theorems are useful tools for proving that a group is not simple. Usually, some sort of counting argument is involved.

Example15.15

Let us show that no group \(G\) of order 20 can be simple. By the Third Sylow Theorem, \(G\) contains one or more Sylow \(5\)-subgroups. The number of such subgroups is congruent to \(1 \pmod{5}\) and must also divide 20. The only possible such number is 1. Since there is only a single Sylow 5-subgroup and all Sylow 5-subgroups are conjugate, this subgroup must be normal.

Example15.16

Let \(G\) be a finite group of order \(p^n\), \(n \gt 1\) and \(p\) prime. By Theorem 14.15, \(G\) has a nontrivial center. Since the center of any group \(G\) is a normal subgroup, \(G\) cannot be a simple group. Therefore, groups of orders 4, 8, 9, 16, 25, 27, 32, 49, 64, and 81 are not simple. In fact, the groups of order 4, 9, 25, and 49 are abelian by Corollary 14.16.

Example15.17

No group of order \(56= 2^3 \cdot 7\) is simple. We have seen that if we can show that there is only one Sylow \(p\)-subgroup for some prime \(p\) dividing 56, then this must be a normal subgroup and we are done. By the Third Sylow Theorem, there are either one or eight Sylow 7-subgroups. If there is only a single Sylow 7-subgroup, then it must be normal.

On the other hand, suppose that there are eight Sylow 7-subgroups. Then each of these subgroups must be cyclic; hence, the intersection of any two of these subgroups contains only the identity of the group. This leaves \(8 \cdot 6 = 48\) distinct elements in the group, each of order 7. Now let us count Sylow 2-subgroups. There are either one or seven Sylow 2-subgroups. Any element of a Sylow 2-subgroup other than the identity must have as its order a power of 2; and therefore cannot be one of the 48 elements of order 7 in the Sylow 7-subgroups. Since a Sylow 2-subgroup has order 8, there is only enough room for a single Sylow 2-subgroup in a group of order 56. If there is only one Sylow 2-subgroup, it must be normal.

For other groups \(G\), it is more difficult to prove that \(G\) is not simple. Suppose \(G\) has order 48. In this case the technique that we employed in the last example will not work. We need the following lemma to prove that no group of order 48 is simple.

Example15.19

To demonstrate that a group \(G\) of order 48 is not simple, we will show that \(G\) contains either a normal subgroup of order 8 or a normal subgroup of order 16. By the Third Sylow Theorem, \(G\) has either one or three Sylow 2-subgroups of order 16. If there is only one subgroup, then it must be a normal subgroup.

Suppose that the other case is true, and two of the three Sylow 2-subgroups are \(H\) and \(K\). We claim that \(|H \cap K| = 8\). If \(|H \cap K| \leq 4\), then by Lemma 15.18, \begin{equation*}|HK| = \frac{16 \cdot 16}{4} =64,\end{equation*} which is impossible. Notice that \(H \cap K\) has index two in both of \(H\) and \(K\), so is normal in both, and thus \(H\) and \(K\) are each in the normalizer of \(H \cap K\). Because \(H\) is a subgroup of \(N(H \cap K)\) and because \(N(H \cap K)\) has strictly more than 16 elements, \(|N(H \cap K)|\) must be a multiple of 16 greater than 1, as well as dividing 48. The only possibility is that \(|N(H \cap K)|= 48\). Hence, \(N(H \cap K) = G\).

The following famous conjecture of Burnside was proved in a long and difficult paper by Feit and Thompson [2].

The proof of this theorem laid the groundwork for a program in the 1960s and 1970s that classified all finite simple groups. The success of this program is one of the outstanding achievements of modern mathematics.