A finite soluble group is one whose derived series , reaches the trivial group. Equivalently it has a finite normal series with abelian factors. If , induction using commutator containment gives for every . Thus termination for implies termination for , proving every subgroup of a soluble group is soluble.
For , the chain
has abelian factors , and . Here consists of the identity and the three double transpositions. It is normal because conjugation permutes those double transpositions. Hence is soluble.
An example neither soluble nor simple is . Its subgroup is proper, nontrivial and normal, so is not simple. The group is nontrivial and perfect: its generating three-cycles are commutators of double transpositions, using two additional symbols, so . For example the commutator of and is a three-cycle, and conjugation and inversion give all three-cycles. Thus is not soluble, and subgroup inheritance then proves is not soluble either.

Articles by others on the same topic (0)

There are currently no matching articles.