Galois Theory — Solvability by Radicals
00 · Symbol Glossary
Shorthand sometimes used for the -th term of a chain witnessing solvability — a group that can be broken down into a finite series of abelian pieces, made precise in Section 01.
A chain of subgroups, each normal in the next one (not necessarily normal in itself) — the structure a solvable group's decomposition takes.
An element with . A radical extension adjoins a chain of such roots, one at a time, to build up a tower of fields.
01 · Solvable Groups
A group is solvable if there is a chain of subgroups (each normal in , though not necessarily in ) such that every quotient is abelian. In the full Galois story, each abelian step corresponds to adjoining roots of unity and th roots along a tower of extensions — the reason solvable groups eventually line up with polynomials solvable by radicals.
Take the chain directly: is abelian by hypothesis. One step suffices.
02 · Solvability Is Inherited
If is solvable and , then is solvable.
Let witness solvability. Set . Each , and : for and , (since and , with too) and (closure in ), so . The map , , is a well-defined injective homomorphism (well-defined and injective by the same style of coset-membership argument as Theorem 4.1; a homomorphism directly from the quotient operation), so is isomorphic to a subgroup of the abelian group — hence abelian itself (subgroups of abelian groups are abelian). The chain witnesses 's solvability.
If is solvable and , then is solvable.
Let witness solvability. Let be the quotient map, and set . Since is surjective and , (homomorphic images of normal-in preserve normal-in, by the same argument as Theorem 6.2 combined with surjectivity). The map induced by is surjective (by construction), so is a homomorphic image of the abelian group — hence abelian (images of abelian groups under homomorphisms are abelian, directly from the definition). The chain witnesses 's solvability.
If with and both solvable, then is solvable.
Let witness 's solvability, and witness 's solvability. Let be the preimage of under (a subgroup, preimages of subgroups under homomorphisms). Since , (preimages preserve normality-in, the ideal-theoretic analog of which appeared already in Theorem 12.4's style of argument), and (a standard correspondence between subgroups containing and subgroups of , mirroring Theorem 6.7's Third Isomorphism Theorem machinery), abelian.
Concatenate: , with every consecutive quotient abelian (the first stretch by 's solvability, the second by the correspondence just shown). This witnesses 's solvability.
03 · Solvable Examples
: (order 3, prime, cyclic by Corollary 4.6), and (Chapter 06's example). Both quotients abelian. Solvable.
Let (the Klein four group, closed under composition: any two of the nonidentity elements compose to the third, checkable directly). Every element of is even, so . Moreover for a clean reason: conjugation preserves cycle type, and consists of the identity together with all three elements of of cycle type — so conjugating any element of by anything lands on an element of the same cycle type, which is necessarily back inside . is abelian (isomorphic to ). has order , cyclic (Corollary 4.6), abelian. (index 2, Chapter 06 style). Chain: , all quotients abelian. Solvable.
04 · A_5 Is Simple
A group is simple if its only normal subgroups are and itself.
(order 60) is simple.
Step 1: Conjugacy class sizes in . Using the Orbit-Stabilizer Theorem (Theorem 8.4) applied to conjugation, each class size is .
Double transpositions, e.g. : its centralizer in has order 8 (generated by , , and the swap exchanging the two pairs), of which the even elements form a subgroup of order 4. Class size in : .
3-cycles, e.g. : centralizer in has order 6 (powers of the 3-cycle, times permutations of the 2 fixed points); the even elements form a subgroup of order 3 (the 3-cycle's powers only — the transposition of fixed points is odd). Class size in : .
5-cycles, e.g. : centralizer in has order 5 (only its own powers), entirely even — so this centralizer already sits inside , meaning the single -class of size splits into two -classes of size each (a class splits into two equal halves exactly when its -centralizer contains no odd permutation).
Tally: . ✓
Step 2: No proper nontrivial normal subgroup exists. A normal subgroup is a union of entire conjugacy classes (Theorem 8.2-style: conjugation orbits are exactly the classes, and normality means is a union of orbits), always including , with dividing 60 (Lagrange). Checking every possible sum of plus a nonempty sub-collection of against divisibility by 60:
| Classes included (besides ) | Divides 60? | |
|---|---|---|
| none | 1 | trivial case |
| 16 | no | |
| 21 | no | |
| 13 | no | |
| 25 | no | |
| 36 | no | |
| 28 | no | |
| 40 | no | |
| 33 | no | |
| 45 | no | |
| 48 | no | |
| 60 | all of |
No proper nonempty combination gives a divisor of 60 — only the trivial subgroup and all of survive. So 's only normal subgroups are and : simple.
05 · S_n Is Not Solvable for n ≥ 5
is not solvable for any .
is not solvable. Since is simple (Theorem 21.4) and nonabelian (it contains noncommuting elements, e.g. two different 3-cycles), any subnormal series for can only have the trivial jump (no intermediate normal subgroups exist to insert), giving the single quotient — which is not abelian. So admits no series with all-abelian quotients: not solvable.
is not solvable. If were solvable, Theorem 21.1 would force every subgroup, including , to be solvable too — contradicting the previous paragraph. So is not solvable.
is not solvable for . embeds as a subgroup of for (permutations of extended to fix ). If were solvable, Theorem 21.1 would force this copy of to be solvable — contradiction.
06 · Radical Extensions and Galois's Criterion
is a radical extension if there is a tower with each for some satisfying for some positive integer (each step adjoins an -th root of a previously available element).
For , the roots live in , a single radical step ( with ). Solvability by radicals for a polynomial means its splitting field sits inside some radical extension of the base field — exactly the classical notion of "a formula using , and -th roots."
Let have characteristic and . The roots of can be expressed by radicals over (equivalently, 's splitting field is contained in a radical extension of ) if and only if (for the splitting field of ) is a solvable group.
Both directions of Theorem 21.6 require machinery beyond this course: adjoining roots of unity (so that becomes a genuine Galois extension with a cyclic Galois group — the "Kummer theory" needed to match radical steps with abelian quotients precisely), and careful bookkeeping about how solvability transfers between the radical tower and the Galois correspondence's subgroup chain. We take the statement as given, in the same spirit as the Fundamental Theorem of Algebra and Artin's Lemma, and spend this chapter's remaining effort on its most famous consequence — which needs only the group theory already built.
07 · The Insolvability of the General Quintic
Consider .
Irreducible over : by Eisenstein's criterion with the prime (each non-leading coefficient — — is divisible by 2, the constant term is not divisible by , and the leading coefficient is not divisible by ).
Exactly 3 real roots: a calculus fact (checking has exactly two real critical points, and evaluating there shows one local max is positive and the other local min is negative, giving three sign changes — taken as given here, since it is a computation in analysis rather than algebra).
The Galois group contains a 5-cycle: since is irreducible of degree 5, acts transitively on the 5 roots (Corollary 20.3's embedding is transitive whenever the polynomial is irreducible — any root can be sent to any other via some automorphism, since all roots share the same minimal polynomial, Theorem 18.4). A transitive subgroup of has order divisible by 5 (Orbit-Stabilizer: the orbit of size 5 forces ), so by Cauchy's Theorem (Theorem 8.6), contains an element of order 5 — necessarily a single 5-cycle (the only order-5 elements of ).
The Galois group contains a transposition: with exactly 3 real roots and 2 nonreal (complex conjugate) roots, complex conjugation restricts to an automorphism of the splitting field fixing (conjugation fixes every rational number and is a field automorphism of , hence of any subfield it preserves — and it preserves since is generated by roots of , which conjugation permutes among themselves by Theorem 20.2, since has real coefficients). This automorphism fixes the 3 real roots and swaps the 2 complex-conjugate roots: a single transposition, viewed inside .
A 5-cycle and a transposition generate all of (a classical fact about permutation groups of prime degree — omitted here, but intuitively: repeatedly conjugating the transposition by powers of the 5-cycle produces enough transpositions to generate every transposition, and transpositions alone generate ). So .
By Theorem 21.5, is not solvable. By Theorem 21.6 (Galois's criterion), 's roots cannot be expressed by radicals — a specific, explicit quintic with no radical formula for its roots.
Since some quintic has no radical formula, no general formula (built from , and -th roots, applying uniformly to every degree-5 polynomial's coefficients) can exist — such a formula would apply to in particular, contradicting what was just shown. This is the Abel–Ruffini Theorem, and the entire argument — from group actions in Chapter 08, through Sylow-style counting, through the Galois correspondence in Chapter 20 — converges on this single explicit polynomial as its final witness.
08 · Exercises
Apply Theorem 21.1: if contains a non-solvable subgroup, what does that say about itself?
contains as a subgroup (permutations fixing the 6th point). Since and is not solvable (Theorem 21.5's proof), Theorem 21.1 (contrapositive) shows cannot be solvable — if it were, its subgroup would have to be solvable too.
Using Theorem 21.1, explain why is not solvable, without repeating the full argument of Theorem 21.5.
Check whether (order 8) could possibly be nonsolvable — recall that all groups of prime-power order have special structure (Chapter 09).
has order , a -group. By Theorem 9.1, ; in fact (order 2). has order 4, abelian by Corollary 9.2. Chain: , with abelian (order 2) and abelian (order 4). is solvable. (In fact every finite -group is solvable, by this same style of argument iterated using Theorem 9.1 repeatedly.)
Show that (order 8) is solvable, using Chapter 09's fact that nontrivial -groups have nontrivial centers.
Apply Theorem 21.6 directly, given the Galois group is already identified.
From Chapter 20, . is solvable (Section 03's example). By Theorem 21.6 (Galois's criterion), the roots of can be expressed by radicals over — consistent with the classical fact that cubic equations have a radical formula (Cardano's formula), unlike the quintic example of Section 07.
Using Theorem 21.6 and Chapter 20's computation that , determine whether the roots of can be expressed by radicals.
09 · Chapter Summary
| Concept | Statement |
|---|---|
| Solvable group | Subnormal series with abelian quotients |
| Subgroups, quotients, extensions | All preserve solvability (Thm 21.1, 21.2, 21.3) |
| , | Solvable, via explicit chains through / |
| is simple | Only normal subgroups are and (Thm 21.4, via conjugacy class counting) |
| not solvable, | Since is nonabelian and simple (Thm 21.5) |
| Radical extension | Tower of -th root adjunctions |
| Galois's Criterion | Solvable by radicals is a solvable group (Thm 21.6) |
| Galois group , not solvable — no radical formula exists |
Next: Chapter 22 — Modules over Rings & Structure Theorems generalizes vector spaces by replacing the field of scalars with an arbitrary ring, unifying abelian groups, vector spaces, and ideals under a single framework and closing the course with the structure theorem for finitely generated modules over a PID.