## Section 10.4 The group \(S_5\)

### Worksheet 10.4.1 Activity: Working with \(S_5\)

We are close to our goal of finding a degree 5 polynomial whose roots cannot be expressed in a nice way (using radicals and field operations). It turns out that a key step in this goal is understanding the group \(S_5\text{.}\) In this activity, we will get a better feel for this group by examining the “cycle structure” of its elements.

###### 1.

Every element in \(S_5\) can be written as a single cycle or a product of disjoint cycles. Write down all the different possibilities for how these cycles or products of cycles might look (focusing on their “shape” rather than the specific numbers in the cycles).

###### 2.

Does \(S_5\) contain a non-trivial subgroup that contains all the transpositions (2-cycles)? What is it, or why not?

###### 3.

Does \(S_5\) contain a non-trivial subgroup that includes the elements \((12)\text{,}\) \((13)\text{,}\) \((14)\text{,}\) and \((15)\text{?}\) What else would it contain? Hint: what is \((12)(14)(12)\text{?}\)

###### 4.

Does \(S_5\) contain a non-trivial subgroup that contains \((24) \) and \((12345)\text{?}\) Think about what else such a subgroup would contain.

###### 5.

What if you started with a different 2-cycle and a different 5-cycle?Would any pair of 5-cycle and 2-cycle work?

Now let's consider the alternating group \(A_5\text{.}\) Recall this is the group of all permutations in \(S_5\) that can be written as the product of an even number of 2-cycles.

###### 6.

If you write elements of \(A_5\) as the product of disjoint cycles, what sorts of cycle structures do you get?

###### 7.

Does \(A_5\) contain a non-trivial subgroup that contains all the 3-cycles? Hint: show that every pair of transpositions can be written as a product of 3-cycles.

###### 8.

Now consider *normal* subgroups \(N\) of \(A_5\text{.}\) Remember, a normal subgroup is closed under conjugates (here the conjugate would be \(aba\inv\) where \(a \in A_5\) and \(b \in N\)). Does \(A_5\) contain a non-trivial normal subgroup that contains \((123)\text{?}\)

###### 9.

Look at the different cycle structures of elements in \(A_n\) and start taking conjugates. Will you be able to get \((123)\) starting from any non-identity element?

### Subsection 10.4.2 The Simplicity of the Alternating Group

Of special interest are groups with no nontrivial normal subgroups. Such groups are called simple groups. Of course, we already have a whole class of examples of simple groups, \({\mathbb Z}_p\text{,}\) where \(p\) is prime. These groups are trivially simple since they have no proper subgroups other than the subgroup consisting solely of the identity. Other examples of simple groups are not so easily found. We can, however, show that the alternating group, \(A_n\text{,}\) is simple for \(n \geq 5\text{.}\) The proof of this result requires several lemmas.

###### Lemma 10.30.

The alternating group \(A_n\) is generated by \(3\)-cycles for \(n \geq 3\text{.}\)

###### Proof.

To show that the \(3\)-cycles generate \(A_n\text{,}\) we need only show that any pair of transpositions can be written as the product of \(3\)-cycles. Since \((a b) = (b a)\text{,}\) every pair of transpositions must be one of the following:

###### Lemma 10.31.

Let \(N\) be a normal subgroup of \(A_n\text{,}\) where \(n \geq 3\text{.}\) If \(N\) contains a \(3\)-cycle, then \(N = A_n\text{.}\)

###### Proof.

We will first show that \(A_n\) is generated by \(3\)-cycles of the specific form \((ijk)\text{,}\) where \(i\) and \(j\) are fixed in \(\{ 1, 2, \ldots, n \}\) and we let \(k\) vary. Every \(3\)-cycle is the product of \(3\)-cycles of this form, since

Now suppose that \(N\) is a nontrivial normal subgroup of \(A_n\) for \(n \geq 3\) such that \(N\) contains a \(3\)-cycle of the form \((i j a)\text{.}\) Using the normality of \(N\text{,}\) we see that

is in \(N\text{.}\) Hence, \(N\) must contain all of the \(3\)-cycles \((i j k)\) for \(1 \leq k \leq n\text{.}\) By Lemma 10.30, these \(3\)-cycles generate \(A_n\text{;}\) hence, \(N = A_n\text{.}\)

###### Lemma 10.32.

For \(n \geq 5\text{,}\) every nontrivial normal subgroup \(N\) of \(A_n\) contains a \(3\)-cycle.

###### Proof.

Let \(\sigma\) be an arbitrary element in a normal subgroup \(N\text{.}\) There are several possible cycle structures for \(\sigma\text{.}\)

\(\sigma\) is a \(3\)-cycle.

\(\sigma\) is the product of disjoint cycles, \(\sigma = \tau(a_1 a_2 \cdots a_r) \in N\text{,}\) where \(r \gt 3\text{.}\)

\(\sigma\) is the product of disjoint cycles, \(\sigma = \tau(a_1 a_2 a_3)(a_4 a_5 a_6)\text{.}\)

\(\sigma = \tau(a_1 a_2 a_3)\text{,}\) where \(\tau\) is the product of disjoint 2-cycles.

\(\sigma = \tau (a_1 a_2) (a_3 a_4)\text{,}\) where \(\tau\) is the product of an even number of disjoint 2-cycles.

If \(\sigma\) is a \(3\)-cycle, then we are done. If \(N\) contains a product of disjoint cycles, \(\sigma\text{,}\) and at least one of these cycles has length greater than 3, say \(\sigma = \tau(a_1 a_2 \cdots a_r)\text{,}\) then

is in \(N\) since \(N\) is normal; hence,

is also in \(N\text{.}\) Since

\(N\) must contain a \(3\)-cycle; hence, \(N = A_n\text{.}\)

Now suppose that \(N\) contains a disjoint product of the form

Then

since

So

So \(N\) contains a disjoint cycle of length greater than 3, and we can apply the previous case.

Suppose \(N\) contains a disjoint product of the form \(\sigma = \tau(a_1 a_2 a_3)\text{,}\) where \(\tau\) is the product of disjoint 2-cycles. Since \(\sigma \in N\text{,}\) \(\sigma^2 \in N\text{,}\) and

So \(N\) contains a \(3\)-cycle.

The only remaining possible case is a disjoint product of the form

where \(\tau\) is the product of an even number of disjoint \(2\)-cycles. But

is in \(N\) since \((a_1 a_2 a_3)\sigma(a_1 a_2 a_3)^{-1}\) is in \(N\text{;}\) and so

Since \(n \geq 5\text{,}\) we can find \(b \in \{1, 2, \ldots, n \}\) such that \(b \neq a_1, a_2, a_3, a_4\text{.}\) Let \(\mu = (a_1 a_3 b)\text{.}\) Then

and

Therefore, \(N\) contains a \(3\)-cycle. This completes the proof of the lemma.

###### Theorem 10.33.

The alternating group, \(A_n\text{,}\) is simple for \(n \geq 5\text{.}\)

###### Proof.

Let \(N\) be a normal subgroup of \(A_n\text{.}\) By Lemma 10.32, \(N\) contains a \(3\)-cycle. By Lemma 10.31, \(N = A_n\text{;}\) therefore, \(A_n\) contains no proper nontrivial normal subgroups for \(n \geq 5\text{.}\)

### Subsection 10.4.3 Historical Note

One of the foremost problems of group theory has been to classify all simple finite groups. This problem is over a century old and has been solved only in the last few decades of the twentieth century. In a sense, finite simple groups are the building blocks of all finite groups. The first nonabelian simple groups to be discovered were the alternating groups. Galois was the first to prove that \(A_5\) was simple. Later, mathematicians such as C. Jordan and L. E. Dickson found several infinite families of matrix groups that were simple. Other families of simple groups were discovered in the 1950s. At the turn of the century, William Burnside conjectured that all nonabelian simple groups must have even order. In 1963, W. Feit and J. Thompson proved Burnside's conjecture and published their results in the paper “Solvability of Groups of Odd Order,” which appeared in the Pacific Journal of Mathematics. Their proof, running over 250 pages, gave impetus to a program in the 1960s and 1970s to classify all finite simple groups. Daniel Gorenstein was the organizer of this remarkable effort. One of the last simple groups was the “Monster,” discovered by R. Greiss. The Monster, a \(196{,}833 \times 196{,}833\) matrix group, is one of the 26 sporadic, or special, simple groups. These sporadic simple groups are groups that fit into no infinite family of simple groups. Some of the sporadic groups play an important role in physics.