In the conjugacy class order , the five complex irreducible characters of the alternating group are
The class sizes are . Restricting the degree-four and degree-five irreducible characters of gives rows of squared character inner product one. The degree-six restriction has squared norm two and is orthogonal to those rows and the trivial row, so it splits into the two remaining irreducibles. The sum of squared degrees forces their degrees to be three. Orthogonality forces their last two values to have sum one and product minus one, producing the displayed roots. Since a normal subgroup is a union of classes and its order divides sixty, these class sizes also prove the Simplicity of the alternating group A5.
We prove Simplicity of the alternating group A5 by finding all its conjugacy classes. The alternating group has group order . Its even permutations have cycle types , , and . There are three-cycles, products of disjoint transpositions, and five-cycles.
For a three-cycle, a commuting permutation must rotate its three-element support and may interchange the two fixed points. Its centralizer in has order six, and only the three rotations are even. Thus its conjugacy class in has size and contains every three-cycle. The centralizer of in has order eight: one may interchange the two pairs and independently interchange the elements within each pair. It contains the odd element , so exactly half of these commuting elements are even. The conjugacy class in consequently has size . A permutation commuting with a five-cycle is determined by the image of one point and must be a power of that cycle. All five powers are even, so each such conjugacy class has size . The 24 five-cycles form exactly two classes.
A normal subgroup contains the identity and is a union of whole conjugacy classes. Its possible orders therefore lie in
By Lagrange's theorem, its order must divide 60. Only 1 and 60 in this list do so. Hence has no proper nontrivial normal subgroup and is a simple group.
Work in the finite-group setting. If is maximal in a nonabelian simple , then : otherwise every nonidentity element would generate , forcing a cyclic group of prime order. Choose a minimal normal subgroup of . Every characteristic subgroup of is normal in , so minimality makes a characteristically simple group. Its normalizer contains . By maximality it is or , and the latter would make a nontrivial normal subgroup of the simple group , impossible because . This proves the maximal subgroup normalizer criterion:
For , stabilizer subgroups have order 12. Stabilizer subgroups of a two-element subset have order , and are isomorphic to ; for example . The normalizer of a Sylow 5-subgroup has order 10: its normalizer in has order , and exactly half its permutations are even, since a multiplier of order four on is an odd four-cycle. This gives a dihedral group of order 10.
To prove completeness, an intransitive subgroup either fixes a point, or its orbits on five letters have sizes two and three. It therefore lies in one of the first two types. A transitive proper subgroup has order divisible by 5. Its number of Sylow 5-subgroups is one or six, since has six and the count is modulo 5. A count of six would make , forcing an index-two subgroup and contradicting Simplicity of the alternating group A5. Therefore normalizes its unique Sylow 5-subgroup and lies in the order-ten normalizer.
Stabilizer subgroups are maximal because their index is prime. The order-ten group is transitive and cannot have a larger proper transitive overgroup by the preceding argument. The order-six group has no fixed point, cannot lie in a stabilizer subgroup, and cannot lie in the order-ten type because 3 does not divide 10. Thus all three types are maximal. is transitive on points and on unordered pairs, while Sylow conjugacy handles the normalizers. Consequently
Now let . Choosing independent columns gives . Its simplicity follows from the elementary projective-transvection proof in part 4(i), which does not use this subgroup classification.
A stabilizer subgroup and a plane stabilizer subgroup each have index seven and order 24. To construct the remaining type, identify with and take the Singer cycle of multiplications by nonzero field elements, of order seven. Any linear map commuting with a primitive multiplication commutes with all of , so its centralizer is precisely . A normalizer sends a primitive element to another root of its minimum polynomial, namely . The Frobenius map realizes those three choices. Hence
If for a proper , its Sylow count is one or eight. Eight would make , hence . Its index-three coset action would inject the simple group into : the kernel is normal and cannot be all of . This is impossible. Thus normalizes a unique Sylow 7-subgroup and lies in the order-21 normalizer.
If , its order divides 24. In its action on seven nonzero vectors, an odd orbit has size one or three. A one-point orbit gives a fixed point. If a three-point orbit is collinear, it is the set of nonzero vectors of an invariant plane. If its three vectors are independent, their nonzero sum is fixed by . Thus lies in a point or plane stabilizer subgroup.
The index-seven stabilizer subgroups are maximal, and any proper overgroup of the order-21 normalizer would again have a unique Sylow 7-subgroup and normalize that same subgroup, so the normalizer is maximal too. The point and plane stabilizer subgroups are not conjugate: a stabilizer subgroup fixes a point, whereas a plane stabilizer subgroup is transitive on its three internal points and its four external points, so fixes no point. Each type is one conjugacy class. We have proved maximal subgroups of GL3 over F2:
A simple group has no normal subgroup except the identity subgroup and the whole group. To prove the Simplicity of the alternating group A5, we compute its conjugacy classes. Since the sign homomorphism is onto, . Its possible nonidentity cycle types are a three-cycle, a product of two disjoint transpositions, and a five-cycle.
There are three-cycles. The centralizer in of consists of its three powers and an independent interchange of the two unused letters. Only the three powers are even. Its centralizer in therefore has order three, giving one conjugacy class of size by the orbit-stabilizer theorem.
There are products of two disjoint transpositions: choose the fixed letter and then a pairing of the other four letters. For , a commuting permutation fixes and may interchange the two pairs and swap within them, giving a centralizer of order eight in . It contains an odd element, , so exactly half its elements are even. The centralizer in has order four, and these fifteen elements form one conjugacy class of size .
Finally, there are five-cycles. A permutation commuting with a five-cycle is determined by the image of one letter and must be a power of that cycle. All five powers are even, so the centralizer in has order five. Each such conjugacy class has size , giving two classes of size twelve.
A normal subgroup must be a union of conjugacy classes and must include the identity. Its order therefore has the form
The resulting distinct possibilities are
Of these, only and divide . Lagrange's theorem rules out every other possible order. Hence
A soluble group, also called a solvable group, has a terminating derived series:
For a subgroup , induction gives , so subgroups of soluble groups are soluble. For a surjective group homomorphism , , so quotients of soluble groups are soluble. Finally, in a group extension , suppose and . Then and . Soluble groups are closed under subgroups, quotients and group extensions.
A virtually soluble group contains a soluble group as a finite-index subgroup. The finite-index facts proved in parts (i)–(iii) imply closure under subgroups and quotients: intersect a finite-index soluble subgroup with the chosen subgroup, or take its image under the quotient map.
For group extensions, no finite-generation hypothesis may be inserted. We first establish the finite-index characteristic soluble subgroup lemma. If is a virtually soluble group, the kernel of its action on the cosets of a finite-index soluble subgroup is a soluble normal subgroup of finite index. Among soluble normal subgroups containing , choose with maximal , possible because is finite. If is any soluble normal subgroup of , then is soluble: it is an extension of by . Maximality forces . Thus is the unique largest soluble normal subgroup of , making it a characteristic subgroup, and it has finite index.
Now suppose has both and virtually soluble. Replace by the preimage of a finite-index soluble subgroup of . The subgroup just constructed is characteristic in and therefore normal in . In , the subgroup is a finite normal subgroup, and is a soluble group. The centralizer has finite index in , since conjugation gives a map with finite image. Its intersection with is the center of a group , an abelian group, while its quotient by embeds in the soluble group . Thus is a soluble group. Its preimage in is an extension by , so it too is soluble and has finite index in . Virtually soluble groups are closed under group extensions.
For the final example take the restricted direct sum of groups
where is the nonabelian simple group of even permutations on five letters. Every finite collection of elements lies in a product of finitely many finite factors, so is a locally finite group and hence a torsion group. It cannot contain a nonabelian free group, which is a torsion-free group.
To show that is not a virtually soluble group, let be any finite-index subgroup and let be the kernel of the finite coset action. Each coordinate maps either injectively or trivially into the finite quotient , by Simplicity of the alternating group A5. The nontrivial images of distinct factors commute, and each has trivial centre, so any of them generate a direct product of groups of order . Only finitely many such images can occur in a finite quotient. Therefore , and hence , contains a whole coordinate copy of , which is not soluble: its nontrivial commutator subgroup is normal and therefore equals . No finite-index subgroup of is soluble.
The conjugacy classes in consist of the identity, the double transpositions, the three-cycles, and two classes of five-cycles. Thus their sizes are
A normal subgroup is a union of conjugacy classes containing the identity, and its order must divide by Lagrange's theorem. Checking sums of a subset of shows that no number
divides . Hence the only possible normal-subgroup orders are and . This proves the Simplicity of the alternating group A5.