Worked solution: Abel–Ruffini theorem and the Galois solvability criterion (1824)
Steps 6–7 concern an abstract "general" quintic with symbolic coefficients — a skeptic might ask whether any actual equation with plain integer coefficients really has this untamed symmetry, or whether only shows up for imaginary, symbolic equations. The equation answers this: a short irreducibility check plus a quick sketch of its graph is enough to pin down its Galois group as the very same , no symbols required.
Take . By Eisenstein's criterion at the prime (the leading coefficient is not divisible by , every other coefficient is divisible by , and the constant term is not divisible by ), is irreducible over , so its Galois group acts transitively on the roots and hence has order divisible by ; by Cauchy's theorem contains a -cycle. Calculus pins down the real roots: vanishes at only two real points, so by Rolle's theorem has at most real roots, and evaluating , , shows (via the intermediate value theorem) it has at least ; so has exactly real roots and one complex-conjugate pair. Complex conjugation is then a field automorphism swapping just that pair, i.e. a transposition in . A theorem of elementary group theory says a subgroup of ( prime) containing a -cycle and a transposition must be all of , so — the very group shown unsolvable in Step 7 — and by Galois's criterion (Step 5), cannot be solved by any radical formula.
- Eisenstein's criterion
- A test for irreducibility over : if a prime divides every coefficient except the leading one, and does not divide the constant term, the polynomial cannot be factored into lower-degree integer polynomials.
- Transitive action
- A group's action on a set is transitive when every element of the set can be moved to every other element by some group member; the Galois group of an irreducible polynomial always acts transitively on its roots.
- Transposition
- A permutation that swaps exactly two objects and leaves all others fixed.