MathLabs

Worked solution: Abel–Ruffini theorem and the Galois solvability criterion (1824)

Step 8 of 8: A concrete unsolvable quintic: x5−4x+2x^5-4x+2
In plain words

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 S5S_5 symmetry, or whether S5S_5 only shows up for imaginary, symbolic equations. The equation x5−4x+2=0x^5-4x+2=0 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 S5S_5, no symbols required.

f(x)=x5−4x+2: irreducible (Eisenstein, p=2), exactly 3 real roots  ⟹  Gal(f/Q)≅S5f(x) = x^5 - 4x + 2 \text{: irreducible (Eisenstein, } p=2\text{), exactly 3 real roots} \;\Longrightarrow\; \mathrm{Gal}(f/\mathbb{Q}) \cong S_5
Detailed analysis

Take f(x)=x5−4x+2f(x)=x^5-4x+2. By Eisenstein's criterion at the prime p=2p=2 (the leading coefficient 11 is not divisible by 22, every other coefficient 0,0,0,−4,20,0,0,-4,2 is divisible by 22, and the constant term 22 is not divisible by 22=42^2=4), ff is irreducible over Q\mathbb{Q}, so its Galois group GG acts transitively on the 55 roots and hence has order divisible by 55; by Cauchy's theorem GG contains a 55-cycle. Calculus pins down the real roots: f′(x)=5x4−4f'(x)=5x^4-4 vanishes at only two real points, so by Rolle's theorem ff has at most 33 real roots, and evaluating f(−2)<0<f(0)f(-2)<0<f(0), f(0)>0>f(1)f(0)>0>f(1), f(1)<0<f(2)f(1)<0<f(2) shows (via the intermediate value theorem) it has at least 33; so ff has exactly 33 real roots and one complex-conjugate pair. Complex conjugation is then a field automorphism swapping just that pair, i.e. a transposition in GG. A theorem of elementary group theory says a subgroup of SpS_p (pp prime) containing a pp-cycle and a transposition must be all of SpS_p, so Gal(f/Q)≅S5\mathrm{Gal}(f/\mathbb{Q})\cong S_5 — the very group shown unsolvable in Step 7 — and by Galois's criterion (Step 5), x5−4x+2=0x^5-4x+2=0 cannot be solved by any radical formula.

Terms in this step
Eisenstein's criterion
A test for irreducibility over Q\mathbb{Q}: if a prime pp divides every coefficient except the leading one, and p2p^2 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.
Knowledge used in this step