Insolvability of the Quintic

Can every polynomial equation be solved with a formula built from addition, multiplication, and radicals? For degree two, the quadratic formula answers yes. For degrees three and four, the Cardano and Ferrari formulas answer yes, with more elaborate radical expressions. For degree five and higher, the astonishing answer is no. It is not merely that nobody has found a formula. Rather, no such formula can exist, for arbitrary quintics with rational coefficients. This is one of the crowning achievements of nineteenth-century mathematics. It was first glimpsed by Ruffini, proved by Abel, and given its definitive conceptual explanation by Galois. The idea matters because it marks a turning point in algebra. The question "can this be solved?" is transformed from a computational challenge into a structural one. That structural question concerns symmetry groups. Galois's insight was to attach to every polynomial a group. This group consists of permutations of its roots that respect all algebraic relations among them. He showed that solvability by radicals is a purely group-theoretic property of this Galois group. A polynomial is solvable by radicals if and only if its Galois group is a solvable group. This holds in the technical sense of having a subnormal series with abelian factors. The big picture is this: building a radical extension, one root at a time, corresponds to something on the Galois side. It corresponds to peeling off a chain of normal subgroups with abelian (in fact cyclic) quotients. Consider a five-element set of roots whose permutation group is the full symmetric group S5S_5. This group is not solvable. Its existence is therefore an algebraic obstruction with nothing to do with cleverness or effort. Once we exhibit a single quintic with rational coefficients whose Galois group is S5S_5, the impossibility of a universal radical formula for degree five follows immediately. This article completes the story begun in Solvability by Radicals. We prove the Galois correspondence between radical towers and solvable Galois groups. We prove that S5S_5 is not solvable. We construct an explicit rational quintic — x5−4x+2x^5 - 4x + 2 — whose Galois group is S5S_5. Combining these facts yields the Abel–Ruffini theorem: there is no formula in radicals for the roots of a general quintic.

Key takeaways
  • Solvability by radicals of a polynomial is equivalent to solvability (in the group-theoretic sense) of its Galois group.
  • S5S_5 has composition series S5▹A5▹1S_5 \triangleright A_5 \triangleright 1 with A5A_5 simple and non-abelian, so S5S_5 is not solvable.
  • An irreducible quintic with exactly three real roots and two complex conjugate roots has Galois group S5S_5, via a transitivity + transposition argument.
  • The explicit polynomial x5−4x+2x^5 - 4x + 2 is irreducible over Q\mathbb{Q} (Eisenstein at p=2p=2) and has exactly 3 real roots.
  • Hence x5−4x+2=0x^5 - 4x + 2 = 0 cannot be solved by any formula involving only +,−,×,÷+,-,\times,\div, and radicals of the coefficients.
  • Key idea: unsolvability of S5S_5 as an abstract group is the entire obstruction — no radical tower can ever produce this symmetry type.

Where this lives today

Galois's solvability criterion is far more than a historical curiosity about the quintic; it is the prototype for using group theory to certify impossibility. In Field & Galois Theory more broadly, the same correspondence between subgroup lattices and subfield lattices underlies the proof that angle trisection and cube duplication are impossible with compass and straightedge, and that constructible regular nn-gons correspond to specific arithmetic conditions on nn (Gauss–Wantzel). In computational algebra, determining the Galois group of a specific integer polynomial (via resolvent polynomials, reduction mod primes, and Chebotarev-density heuristics) is a standard task in computer algebra systems, feeding directly into questions of whether a given equation admits closed-form radical solutions. In cryptography, the structure of Galois groups of extensions of finite fields underlies the analysis of discrete logarithm problems and the design of error-correcting codes via finite-field algebra. In the theory of differential equations, Picard–Vessiot theory is an exact analogue of Galois theory for linear ODEs, and the same "solvable group   ⟺  \iff solvable by quadratures" dichotomy governs when a differential equation can be solved in closed form — the unsolvability of certain special functions (e.g. some hypergeometric-type equations) is proved by identifying a non-solvable differential Galois group, echoing S5S_5's role here exactly.

Ask the tutor: Why does the same argument fail to immediately show x5−5x+12x^5-5x+12 (a different-looking quintic) has Galois group S5S_5 without redoing the real-root count?

DefinitionRadical extension, solvable extension, solvable group

Let FF be a field of characteristic 00 (all fields below are subfields of C\mathbb{C} unless stated otherwise). A field extension K/FK/F is a radical extension if there is a tower

F=F0⊆F1⊆⋯⊆Fn=KF = F_0 \subseteq F_1 \subseteq \cdots \subseteq F_n = K

such that for each ii, Fi+1=Fi(αi)F_{i+1} = F_i(\alpha_i) where αini∈Fi\alpha_i^{n_i} \in F_i for some positive integer nin_i. (Each step adjoins an nin_i-th root of an element already present.) A polynomial f(x)∈F[x]f(x) \in F[x] is solvable by radicals if its splitting field EE over FF is contained in some radical extension K/FK/F. A finite group GG is solvable if there is a chain of subgroups

1=G0◃G1◃⋯◃Gm=G1 = G_0 \triangleleft G_1 \triangleleft \cdots \triangleleft G_m = G

with each GiG_i normal in Gi+1G_{i+1} and each quotient Gi+1/GiG_{i+1}/G_i abelian. (Equivalently, the derived series G≥G′≥G′′≥⋯G \geq G' \geq G'' \geq \cdots terminates at the trivial group, where G′=[G,G]G' = [G,G] is the commutator subgroup.)

Intuition

The classical formulas for degrees 2,3,42,3,4 all share a pattern: you compute some auxiliary quantity (the discriminant, or a "resolvent" cubic or quadratic), take a square root or cube root of it, and use that root to peel apart the original roots. Each radical extraction is an abelian, indeed cyclic, step: adjoining an nn-th root of an element in a field containing the nn-th roots of unity produces a Kummer extension whose Galois group is cyclic of order dividing nn. Solving "by radicals" is therefore the same as building the splitting field by a tower of cyclic extensions. Galois theory converts this tower of field extensions into a chain of subgroups of the Galois group, read in reverse: the bottom field corresponds to the whole group, and each successive field extension corresponds to a smaller normal subgroup with cyclic (hence abelian) quotient. So a radical tower exists exactly when the Galois group has a subnormal series with abelian quotients — precisely the definition of a solvable group. Groups like S2,S3,S4S_2, S_3, S_4 happen to be solvable (their orders are small and rich in normal subgroups), which is why the low-degree formulas exist. The group S5S_5 breaks this pattern for a structural reason: it contains the simple, non-abelian group A5A_5 as its unique proper nontrivial normal subgroup, and a simple non-abelian group admits no further refinement into abelian pieces. The chain "cannot get started" past A5A_5. The second half of the story is existential: does a rational quintic actually realize S5S_5 as its Galois group, or might all rational quintics secretly have smaller, solvable Galois groups? The answer requires exhibiting one polynomial explicitly, and checking irreducibility (to get transitivity) and the exact count of real roots (to produce a transposition) forces the full symmetric group to appear.

Figure
The subgroup lattice obstruction: S5S_5 has no abelian tower, unlike S4S_4
S₄ is solvable S₄ (order 24) A₄ (order 12) V₄ = {e,(12)(34),(13)(24),(14)(23)} ⟨(12)(34)⟩ (order 2) 1 all quotients abelian: ℤ/2, ℤ/3, ℤ/2×ℤ/2, ℤ/2 S₅ is not solvable S₅ (order 120) A₅ (order 60, simple, non-abelian) no further normal subgroup: chain stops, non-abelian factor A₅ persists 1
TheoremGalois's Solvability Criterion (Abel–Ruffini Theorem)

Let FF be a field of characteristic 00 and f(x)∈F[x]f(x) \in F[x] a nonconstant polynomial with splitting field EE over FF. Let G=Gal(E/F)G = \mathrm{Gal}(E/F). Then ff is solvable by radicals over FF if and only if GG is a solvable group. Consequently: if there exists a polynomial f(x)∈Q[x]f(x) \in \mathbb{Q}[x] of degree nn whose Galois group over Q\mathbb{Q} is SnS_n, and SnS_n is not a solvable group, then no formula built from field operations and radicals (in the coefficients) can express the roots of ff — and in particular no such universal formula exists for the general polynomial of degree nn.

LemmaKummer's cyclic extension criterion

Let FF be a field of characteristic 00 containing a primitive nn-th root of unity ζn\zeta_n. Then: (a) If K=F(an)K = F(\sqrt[n]{a}) for some a∈Fa \in F, then K/FK/F is Galois with Gal(K/F)\mathrm{Gal}(K/F) cyclic of order dividing nn. (b) Conversely, if K/FK/F is Galois with Gal(K/F)\mathrm{Gal}(K/F) cyclic of order nn, then K=F(α)K = F(\alpha) for some α\alpha with αn∈F\alpha^n \in F.

Proof

(a) Let α=an\alpha = \sqrt[n]{a} be a fixed root of xn−ax^n - a in an algebraic closure, so αn=a\alpha^n = a. Since FF contains all nn-th roots of unity 1,ζn,…,ζnn−11,\zeta_n,\dots,\zeta_n^{n-1}, the full set of roots of xn−ax^n-a is {α,ζnα,…,ζnn−1α}\{\alpha, \zeta_n \alpha, \dots, \zeta_n^{n-1}\alpha\}, all lying in K=F(α)K = F(\alpha). Thus KK is the splitting field of xn−ax^n - a over FF, hence Galois. Any σ∈Gal(K/F)\sigma \in \mathrm{Gal}(K/F) sends α↦ζni(σ)α\alpha \mapsto \zeta_n^{i(\sigma)} \alpha for a unique i(σ)∈Z/nZi(\sigma) \in \mathbb{Z}/n\mathbb{Z} (unique because α≠0\alpha \neq 0), and the map σ↦i(σ)\sigma \mapsto i(\sigma) is an injective homomorphism Gal(K/F)→Z/nZ\mathrm{Gal}(K/F) \to \mathbb{Z}/n\mathbb{Z}, since στ(α)=σ(ζni(τ)α)=ζni(τ)ζni(σ)α\sigma\tau(\alpha) = \sigma(\zeta_n^{i(\tau)}\alpha) = \zeta_n^{i(\tau)}\zeta_n^{i(\sigma)}\alpha (using σ(ζn)=ζn\sigma(\zeta_n)=\zeta_n as ζn∈F\zeta_n \in F) giving i(στ)=i(σ)+i(τ)i(\sigma\tau) = i(\sigma)+i(\tau), and injectivity holds because σ\sigma fixing α\alpha fixes all of K=F(α)K = F(\alpha). Hence Gal(K/F)\mathrm{Gal}(K/F) is isomorphic to a subgroup of the cyclic group Z/nZ\mathbb{Z}/n\mathbb{Z}, so it is cyclic of order dividing nn.

(b) Let G=Gal(K/F)=⟨σ⟩G = \mathrm{Gal}(K/F) = \langle \sigma \rangle, cyclic of order nn. By linear independence of characters (Dedekind), the automorphisms 1,σ,…,σn−11,\sigma,\dots,\sigma^{n-1} are linearly independent as functions K→KK \to K. Form the Lagrange resolvent: for any θ∈K\theta \in K, set

α=∑j=0n−1ζn−j σj(θ).\alpha = \sum_{j=0}^{n-1} \zeta_n^{-j}\, \sigma^j(\theta).

Since 1,σ,…,σn−11,\sigma,\ldots,\sigma^{n-1} are linearly independent, we may choose θ\theta so that α≠0\alpha \neq 0. Applying σ\sigma:

σ(α)=∑j=0n−1ζn−jσj+1(θ)=ζn∑j=0n−1ζn−(j+1)σj+1(θ)=ζnα,\sigma(\alpha) = \sum_{j=0}^{n-1}\zeta_n^{-j}\sigma^{j+1}(\theta) = \zeta_n \sum_{j=0}^{n-1}\zeta_n^{-(j+1)}\sigma^{j+1}(\theta) = \zeta_n \alpha,

using σn(θ)=θ\sigma^n(\theta)=\theta and re-indexing the sum. Hence σ(αn)=σ(α)n=ζnnαn=αn\sigma(\alpha^n) = \sigma(\alpha)^n = \zeta_n^n \alpha^n = \alpha^n, so αn\alpha^n is fixed by σ\sigma, hence by all of GG, so αn∈F\alpha^n \in F. Since σ(α)=ζnα≠α\sigma(\alpha) = \zeta_n\alpha \neq \alpha (as α≠0\alpha \ne 0 and ζn≠1\zeta_n \neq 1 when n>1n>1), σ\sigma does not fix α\alpha, so F(α)≠FF(\alpha) \ne F; but F(α)⊆KF(\alpha) \subseteq K and [K:F]=n[K:F]=n is prime-to-nothing generic — more precisely the stabilizer of F(α)F(\alpha) under GG is a proper subgroup of the cyclic group GG not containing σ\sigma, forcing F(α)=KF(\alpha) = K by the Galois correspondence. ■\blacksquare

∎
Proof

Proof of the main theorem, using <span class="wiki-link-missing">Fundamental Theorem of Galois Theory</span> and Kummer's lemma above.

(⇐\Leftarrow) Solvable group ⇒\Rightarrow solvable by radicals. Suppose G=Gal(E/F)G = \mathrm{Gal}(E/F) is solvable, with subnormal series

1=G0◃G1◃⋯◃Gm=G,Gi+1/Gi abelian.1 = G_0 \triangleleft G_1 \triangleleft \cdots \triangleleft G_m = G, \qquad G_{i+1}/G_i \text{ abelian}.

By refining (using the structure theorem for finite abelian groups, each abelian group has a subnormal series with cyclic factors), we may assume each Gi+1/GiG_{i+1}/G_i is cyclic of some order nin_i. Let n=lcm(n0,…,nm−1)⋅[anything convenient]n = \mathrm{lcm}(n_0,\dots,n_{m-1}) \cdot [\text{anything convenient}]; more simply let NN be any common multiple of all the nin_i and of ∣G∣|G|. Adjoin a primitive NN-th root of unity: let F′=F(ζN)F' = F(\zeta_N) and E′=E(ζN)=E⋅F′E' = E(\zeta_N) = E \cdot F'. The extension F′/FF'/F is radical (it is generated by one root of xN−1∈F[x]x^N - 1 \in F[x], an NN-th root of 1∈F1 \in F). Standard Galois theory (the extension F(ζN)/FF(\zeta_N)/F is Galois with abelian Galois group, a subgroup of (Z/NZ)×(\mathbb{Z}/N\mathbb{Z})^\times) gives that Gal(E′/F′)\mathrm{Gal}(E'/F') is isomorphic to a subgroup HH of Gal(E/F)=G\mathrm{Gal}(E/F)=G via restriction (the restriction map Gal(E′/F′)→Gal(E/F)\mathrm{Gal}(E'/F') \to \mathrm{Gal}(E/F) is injective because E,F′E,F' are linearly disjoint over F′∩EF' \cap E, and its image is exactly the subgroup of GG fixing F′∩EF' \cap E pointwise, which is all of GG when, as here, E∩F′E \cap F' can only be a cyclotomic subfield of EE — in the generic case one simply replaces GG by this image H≤GH \le G, which inherits a subnormal series with cyclic quotients from GG by the correspondence theorem for groups). So without loss of generality we may assume Gal(E′/F′)\mathrm{Gal}(E'/F') itself has a subnormal series with cyclic factors of orders dividing NN, all the relevant roots of unity already lying in F′F'. Now form the fixed fields LiL_i corresponding to GiG_i under the Galois correspondence for E′/F′E'/F':

F′=Lm⊆Lm−1⊆⋯⊆L0=E′.F' = L_m \subseteq L_{m-1} \subseteq \cdots \subseteq L_0 = E'.

For each ii, Li−1/LiL_{i-1}/L_i... (re-indexing so containments increase): concretely set KiK_i = fixed field of GiG_i, so

F′=K0⊆K1⊆⋯⊆Km=E′,F' = K_0 \subseteq K_1 \subseteq \cdots \subseteq K_m = E',

and by the Fundamental Theorem, Ki/Ki−1K_i/K_{i-1} is Galois with group Gi/Gi−1G_{i}/G_{i-1} — wait, orient correctly: the fixed field of the smaller subgroup is the larger field, and normality of Gi−1G_{i-1} in GiG_i gives Gal(Ki−1/Ki)\mathrm{Gal}(K_{i-1}/K_i)... To avoid sign confusion we state the clean conclusion directly: for each ii, Fix(Gi−1)/Fix(Gi)\mathrm{Fix}(G_{i-1})/\mathrm{Fix}(G_i) is a Galois extension with group Gi/Gi−1G_i/G_{i-1}, cyclic of order nin_i dividing NN. Since Fix(Gi)\mathrm{Fix}(G_i) already contains all NN-th roots of unity (as F′⊆Fix(Gi)F' \subseteq \mathrm{Fix}(G_i) for every ii), Kummer's lemma part (b) applies: Fix(Gi−1)=Fix(Gi)(βi)\mathrm{Fix}(G_{i-1}) = \mathrm{Fix}(G_i)(\beta_i) with βini∈Fix(Gi)\beta_i^{n_i} \in \mathrm{Fix}(G_i). Chaining these adjunctions from Fix(Gm)=F′\mathrm{Fix}(G_m) = F' up to Fix(G0)=E′\mathrm{Fix}(G_0) = E', and prepending the radical step F⊆F(ζN)=F′F \subseteq F(\zeta_N) = F', we exhibit a full radical tower from FF to a field E′E' containing EE. Hence ff is solvable by radicals.

(⇒\Rightarrow) Solvable by radicals ⇒\Rightarrow solvable group. Suppose E⊆KE \subseteq K where F=F0⊆F1⊆⋯⊆Fn=KF = F_0 \subseteq F_1 \subseteq \cdots \subseteq F_n = K is a radical tower, Fi+1=Fi(αi)F_{i+1} = F_i(\alpha_i), αini∈Fi\alpha_i^{n_i} \in F_i. We may enlarge the tower (a standard reduction) so that: 1. K/FK/F is Galois — replace KK by the Galois closure of K/FK/F (a splitting field of the product of minimal polynomials of all conjugates of the αi\alpha_i); one checks the tower property is preserved by adjoining, at each stage, all FF-conjugates of each αi\alpha_i, which are again roots of the same pure equations xni=(conjugate of αini)x^{n_i} = (\text{conjugate of } \alpha_i^{n_i}), hence radical steps. 2. FF contains a primitive NN-th root of unity where N=lcm(n0,…,nn−1)N = \mathrm{lcm}(n_0,\ldots,n_{n-1}) — insert the radical step F⊆F(ζN)F \subseteq F(\zeta_N) at the bottom of the tower (harmless: adjoining a root of unity is itself a radical extension, of an even simpler/more special type, and one re-bases every subsequent field by tensoring with F(ζN)F(\zeta_N); the resulting tower is still radical with the same exponents nin_i, using Kummer's lemma (a) at every stage which requires exactly the ambient root of unity to be present, guaranteed now since NN is a common multiple). With these normalizations, each step Fi+1/FiF_{i+1}/F_i is, by Kummer's Lemma part (a), Galois with cyclic Galois group. Let H=Gal(K/F)H = \mathrm{Gal}(K/F) and let Hi=Gal(K/Fi)≤HH_i = \mathrm{Gal}(K/F_i) \le H. Since Fi+1/FiF_{i+1}/F_i is Galois, Hi+1◃HiH_{i+1} \triangleleft H_i (this is exactly the Galois correspondence statement that an intermediate field is Galois over FiF_i iff its corresponding subgroup is normal in Gal(K/Fi)\mathrm{Gal}(K/F_i)), and

Hi/Hi+1≅Gal(Fi+1/Fi)H_i/H_{i+1} \cong \mathrm{Gal}(F_{i+1}/F_i)

is cyclic, hence abelian. This exhibits a subnormal series

1=Hn◃Hn−1◃⋯◃H0=H1 = H_n \triangleleft H_{n-1} \triangleleft \cdots \triangleleft H_0 = H

with abelian quotients, so H=Gal(K/F)H = \mathrm{Gal}(K/F) is solvable. Finally, since E⊆KE \subseteq K and E/FE/F is Galois, restriction gives a surjective homomorphism Gal(K/F)↠Gal(E/F)=G\mathrm{Gal}(K/F) \twoheadrightarrow \mathrm{Gal}(E/F) = G (surjective because K/FK/F Galois implies every FF-embedding of EE into F‾\overline{F} extends to an automorphism of KK, and restricts to give every element of Gal(E/F)\mathrm{Gal}(E/F); the kernel is Gal(K/E)\mathrm{Gal}(K/E)). A quotient of a solvable group is solvable: if 1=Hn◃⋯◃H0=H1=H_n \triangleleft \cdots \triangleleft H_0 = H has abelian quotients and π:H→G\pi: H \to G is a surjective homomorphism with kernel MM, then π(Hi)\pi(H_i) gives a subnormal series in GG (images of normal subgroups under surjections remain normal in images) with quotients π(Hi)/π(Hi+1)\pi(H_i)/\pi(H_{i+1}) that are homomorphic images of Hi/Hi+1H_i/H_{i+1}, hence still abelian. Therefore G=Gal(E/F)G = \mathrm{Gal}(E/F) is solvable. ■\blacksquare

∎

Worked examples

Example 1: The Galois group of x5−4x+2x^5 - 4x + 2 over Q\mathbb{Q} is S5S_5. Let f(x)=x5−4x+2f(x) = x^5 - 4x + 2. Step 1 — Irreducibility. Apply the Eisenstein criterion at p=2p = 2: the coefficients are 1,0,0,0,−4,21, 0, 0, 0, -4, 2, and 2∣0,0,0,−4,22 \mid 0,0,0,-4,2 while 2∤12 \nmid 1 (leading coefficient) and 4∤24 \nmid 2 (constant term). All Eisenstein hypotheses hold, so ff is irreducible over Q\mathbb{Q}. Since ff is irreducible of degree 55, its Galois group G=Gal(E/Q)≤S5G = \mathrm{Gal}(E/\mathbb{Q}) \le S_5 (acting on the 5 roots) is a transitive subgroup of S5S_5: irreducibility means Gal(E/Q)\mathrm{Gal}(E/\mathbb{Q}) acts transitively on the roots, because the orbit of a root under the Galois group corresponds to the roots of its minimal polynomial, and irreducibility forces this minimal polynomial to be ff itself, of full degree 5, so the orbit is all 5 roots. By elementary group theory, a transitive subgroup of S5S_5 has order divisible by 55 (orbit-stabilizer: 5=∣S55 = |S_5-orbit∣∣∣G∣| \mid |G|), so by Cauchy's theorem GG contains an element of order 55. The only elements of order 55 in S5S_5 are 55-cycles (an element of order 5 in S5S_5 has cycle type with all cycle lengths dividing 5 and summing to ≤5\le 5; the only possibility other than the identity is a single 5-cycle). So GG contains a 5-cycle. Step 2 — Real root count via calculus. Consider f(x)=x5−4x+2f(x) = x^5 - 4x + 2 on R\mathbb{R}. Then f′(x)=5x4−4f'(x) = 5x^4 - 4, which vanishes exactly at x=±(4/5)1/4x = \pm(4/5)^{1/4}. Numerically (4/5)1/4≈0.9457(4/5)^{1/4} \approx 0.9457. Compute:

f(−2)=−32+8+2=−22<0,f(−1)=−1+4+2=5>0,f(-2) = -32+8+2 = -22 <0,\quad f(-1) = -1+4+2=5>0,

so there is a root in (−2,−1)(-2,-1).

f(0)=2>0,f(1)=1−4+2=−1<0,f(0) = 2 > 0, \quad f(1) = 1-4+2=-1<0,

so there is a root in (0,1)(0,1).

f(1)=−1<0,f(2)=32−8+2=26>0,f(1)=-1<0,\quad f(2)=32-8+2=26>0,

so there is a root in (1,2)(1,2). Since ff has only two critical points, it has at most 33 real roots (a degree-5 polynomial with exactly two critical points can change monotonicity at most twice, giving at most 3 monotonic "arcs" that can each cross zero once — rigorously: between consecutive critical points ff is strictly monotonic, so on each of the 3 monotonic intervals (−∞,−0.9457)(-\infty,-0.9457), (−0.9457,0.9457)(-0.9457,0.9457), (0.9457,∞)(0.9457,\infty), ff has at most one root, giving at most 33 real roots total). We exhibited 33 sign changes above, so ff has exactly 3 real roots and (since complex roots of a real polynomial come in conjugate pairs, and 5−3=25 - 3 = 2) exactly one conjugate pair of non-real roots. Step 3 — Complex conjugation gives a transposition. Complex conjugation restricts to an automorphism of the splitting field E⊂CE \subset \mathbb{C} (as EE is stable under conjugation, being a splitting field of a real polynomial), and it fixes the 33 real roots while swapping the 22 complex roots. Viewed inside G≤S5G \le S_5, this element is exactly a transposition (a 2-cycle) on the labeled roots. Step 4 — A transitive subgroup of S5S_5 containing a 5-cycle and a transposition is all of S5S_5. This is a general group-theoretic fact proved below as a lemma; granting it, G=S5G = S_5.

Example 2: Why x5−2x^5 - 2 does not give S5S_5, and how the two examples differ. Consider g(x)=x5−2g(x) = x^5 - 2. By Eisenstein at p=2p=2, gg is irreducible over Q\mathbb{Q}, so its Galois group is again a transitive subgroup of S5S_5 containing a 5-cycle. But now count real roots: g(x)=x5−2g(x) = x^5 - 2 has derivative g′(x)=5x4≥0g'(x) = 5x^4 \ge 0, so gg is (weakly monotonic, in fact strictly since g′=0g'=0 only at the single point x=0x=0) strictly increasing on R\mathbb{R}. Hence gg has exactly one real root, x=21/5x = 2^{1/5}, and two conjugate pairs of complex roots (4 non-real roots total). Complex conjugation now fixes one root and acts on the remaining four as a product of two disjoint transpositions — an element of cycle type (2,2,1)(2,2,1), not a single transposition. A subgroup generated by a 5-cycle and a double-transposition need not be all of S5S_5: indeed here the splitting field of x5−2x^5-2 is Q(21/5,ζ5)\mathbb{Q}(2^{1/5}, \zeta_5), of degree 5⋅4=205 \cdot 4 = 20 over Q\mathbb{Q} (degree 5 from adjoining the real root, degree 4 from adjoining a primitive 5th root of unity, and these extensions are linearly disjoint since Q(ζ5)\mathbb{Q}(\zeta_5) has degree 4 coprime considerations / direct computation of the tower degree [Q(21/5,ζ5):Q]=[Q(21/5,ζ5):Q(21/5)]⋅5[\mathbb{Q}(2^{1/5},\zeta_5):\mathbb{Q}]=[\mathbb{Q}(2^{1/5},\zeta_5):\mathbb{Q}(2^{1/5})]\cdot 5, and one checks x4+x3+x2+x+1x^4+x^3+x^2+x+1 stays irreducible over Q(21/5)\mathbb{Q}(2^{1/5}) by a degree/field-theoretic argument, giving degree 4⋅5=204\cdot 5=20). So ∣G∣=20|G| = 20, not 120120; concretely GG is the Frobenius group of order 20,

G≅{x↦ax+b:a∈(Z/5Z)×, b∈Z/5Z},G \cong \{x \mapsto ax+b : a \in (\mathbb{Z}/5\mathbb{Z})^\times,\ b \in \mathbb{Z}/5\mathbb{Z}\},

a solvable group (it has a normal cyclic subgroup of order 5 with cyclic quotient of order 4). This is entirely consistent with the classical fact that "pure" radical equations xn=ax^n = a are, of course, solvable by radicals — trivially, by taking the radical! It illustrates precisely why both transitivity/degree-5 and the right kind of complex-conjugation transposition are needed to force S5S_5; x5−2x^5-2 satisfies the first ingredient but fails the second.

LemmaTransitive + transposition generates SnS_n, for nn prime

Let nn be prime and let G≤SnG \le S_n be a transitive subgroup containing a transposition. Then G=SnG = S_n.

Proof

Since GG is transitive and nn is prime, ∣G∣|G| is divisible by nn (orbit-stabilizer, as in the main worked example), so by Cauchy's theorem GG contains an element σ\sigma of order nn; as nn is prime, σ\sigma is an nn-cycle. Relabel so σ=(1 2 3 ⋯ n)\sigma = (1\,2\,3\,\cdots\,n). Let τ=(a b)∈G\tau = (a\ b) \in G be the given transposition, and consider the subgroup H=⟨σ,τ⟩≤GH = \langle \sigma, \tau\rangle \le G. Define a graph on vertex set {1,…,n}\{1,\ldots,n\} where i∼ji \sim j iff (i j)∈H(i\ j) \in H. We claim HH contains all transpositions, which (since transpositions generate SnS_n) gives H=SnH = S_n, hence G=SnG = S_n. Conjugating τ\tau by powers of σ\sigma: for any kk, σkτσ−k=(σk(a) σk(b))\sigma^k \tau \sigma^{-k} = (\sigma^k(a)\ \sigma^k(b)) is a transposition lying in HH (as HH is a group containing σ,τ\sigma,\tau). As σ\sigma is an nn-cycle, the map k↦σk(a)−σk(b)(modn)k \mapsto \sigma^k(a) - \sigma^k(b) \pmod n is a bijection-invariant "shift": in fact all the transpositions (σk(a) σk(b))(\sigma^k(a)\,\sigma^k(b)) for k=0,…,n−1k=0,\dots,n-1 move indices at the fixed cyclic distance d=b−a(modn)d = b - a \pmod n (i.e. connect ii and i+d  ni+d \bmod n for all ii, cycling through all nn positions as kk varies, since σk(a)=a+k\sigma^k(a)=a+k, σk(b)=a+k+d(modn)\sigma^k(b) = a+k+d \pmod n). Since nn is prime and d≢0d \not\equiv 0, dd is invertible mod nn, so as kk ranges over Z/nZ\mathbb{Z}/n\mathbb{Z}, the pairs {a+k,a+k+d}\{a+k, a+k+d\} range over pairs at cyclic distance dd, and the graph with edges {i,i+d  n}\{i, i+d \bmod n\} for all ii is a single nn-cycle on the vertex set {1,…,n}\{1,\ldots,n\} (because gcd⁡(d,n)=1\gcd(d,n)=1 implies repeatedly adding dd mod nn visits every residue before returning). A connected graph on nn vertices where consecutive-in-the-cycle transpositions all lie in the group HH generates, by composing adjacent transpositions, every transposition (i j)(i\ j): indeed if (i j),(j k)∈H(i\ j), (j\ k) \in H then (i k)=(i j)(j k)(i j)∈H(i\ k) = (i\ j)(j\ k)(i\ j) \in H, so the set of pairs {i,j}\{i,j\} with (i j)∈H(i\ j)\in H is closed under "graph-connectivity", and since our nn-cycle graph is connected, all (n2)\binom{n}{2} transpositions lie in HH. Since the transpositions generate SnS_n (standard fact: any permutation is a product of transpositions, e.g. by writing it in cycle notation and expanding each cycle (c1 c2 … cr)=(c1 c2)(c2 c3)⋯(cr−1 cr)(c_1\,c_2\,\ldots\,c_r) = (c_1\,c_2)(c_2\,c_3)\cdots(c_{r-1}\,c_r)), we conclude H=SnH = S_n, and since H≤G≤SnH \le G \le S_n, also G=SnG = S_n. ■\blacksquare

∎
TheoremS5S_5 is not a solvable group

The symmetric group S5S_5 is not solvable.

Proof

We use two standard facts about A5A_5, the alternating group on 5 letters, of order 6060.

Claim 1: A5A_5 is simple (no normal subgroups other than {1}\{1\} and A5A_5 itself). Proof of Claim 1. A5A_5 acts by conjugation on itself; a normal subgroup N◃A5N \triangleleft A_5 must be a union of conjugacy classes, including {1}\{1\}. The conjugacy classes of A5A_5 have sizes 1,15,20,12,121, 15, 20, 12, 12 (identity; double-transpositions (ab)(cd)(ab)(cd); 3-cycles; and two classes of 5-cycles, split because the centralizer of a 5-cycle in A5A_5 has order 5, giving classes of size 60/5=1260/5=12 each — the two classes correspond to 5-cycles and their "inverse-conjugate" type under the S5S_5-fusion, a standard computation). If NN is a union of some of these class sizes including 11, and ∣N∣|N| divides 6060, one checks by direct enumeration that the only subset of {1,15,20,12,12}\{1,15,20,12,12\} containing 11 and summing to a divisor of 6060 is {1}\{1\} itself or the full set {1,15,20,12,12}\{1,15,20,12,12\} summing to 6060: e.g. 1+15=16∤601+15=16 \nmid 60; 1+20=21∤601+20=21\nmid 60; 1+12=13∤601+12=13\nmid 60; 1+12+12=25∤601+12+12=25\nmid 60; 1+15+20=36∤601+15+20=36\nmid 60; 1+15+12=28∤601+15+12=28\nmid 60; 1+15+12+12=40∤601+15+12+12=40\nmid 60; 1+20+12=33∤601+20+12=33\nmid 60; 1+20+12+12=45∤601+20+12+12=45\nmid 60; 1+12+12+20+15=601+12+12+20+15=60 (the whole group). So N={1}N=\{1\} or N=A5N=A_5, proving simplicity.

Claim 2: A5A_5 is non-abelian. Proof of Claim 2. Take α=(1 2 3)\alpha = (1\,2\,3) and β=(1 2)(3 4)\beta=(1\,2)(3\,4), both even permutations (products of an even number of transpositions: (1 2 3)=(1 3)(1 2)(1\,2\,3)=(1\,3)(1\,2), two transpositions; (1 2)(3 4)(1\,2)(3\,4) is manifestly two transpositions), hence both lie in A5A_5. Compute αβ\alpha\beta: apply β\beta then α\alpha (right-to-left convention), tracking where each of 1,2,3,4,51,2,3,4,5 goes. β\beta sends 1→2,2→1,3→4,4→3,5→51\to2,2\to1,3\to4,4\to3,5\to5; then α\alpha sends 1→2,2→3,3→11\to2,2\to3,3\to1, others fixed. So αβ:1→2→3\alpha\beta: 1\to2\to3, 2→1→22\to1\to2, 3→4→43\to4\to4, 4→3→14\to3\to1, 5→5→55\to5\to5. Thus αβ=(1 3 4)\alpha\beta = (1\,3\,4) (since 1→3,3→4,4→11\to3, 3\to4,4\to1, and 2,52,5 fixed). Now compute βα\beta\alpha: apply α\alpha then β\beta: α\alpha sends 1→2,2→3,3→11\to2,2\to3,3\to1; then β\beta sends 1→2,2→1,3→4,4→31\to2,2\to1,3\to4,4\to3. So βα:1→2→1\beta\alpha: 1\to2\to1, 2→3→42\to3\to4, 3→1→23\to1\to2, 4→4→34\to4\to3, 5→5→55\to5\to5. Thus βα=(2 4 3)\beta\alpha = (2\,4\,3). Since (1 3 4)≠(2 4 3)(1\,3\,4)\ne(2\,4\,3) as permutations (e.g. the first sends 1↦31\mapsto3 while the second fixes 11), αβ≠βα\alpha\beta \ne \beta\alpha, so A5A_5 is non-abelian.

Conclusion. Suppose, for contradiction, that S5S_5 were solvable: 1=G0◃G1◃⋯◃Gm=S51=G_0\triangleleft G_1\triangleleft\cdots\triangleleft G_m=S_5 with abelian quotients. A subgroup of a solvable group is solvable (intersect the series with the subgroup: Gi∩A5G_i \cap A_5 gives a subnormal series for A5A_5 with each quotient (Gi∩A5)/(Gi−1∩A5)(G_i\cap A_5)/(G_{i-1}\cap A_5) embedding, by the second isomorphism theorem, into Gi/Gi−1G_i/G_{i-1}, hence abelian since subgroups of abelian groups are abelian). So A5A_5 would be solvable. But A5A_5 is simple and non-abelian by Claims 1–2, so the only subnormal series for A5A_5 is 1◃A51 \triangleleft A_5 itself (any subnormal series with abelian quotients could be refined/collapsed, but since A5A_5 has no proper nontrivial normal subgroup, any subnormal chain starting from 11 and ending at A5A_5 must have 1◃A51 \triangleleft A_5 as consecutive terms at some point, forcing a quotient A5/1=A5A_5/1 = A_5 to appear as one of the successive quotients up to relabeling — more directly: if 1=H0◃H1◃⋯◃Hk=A51 = H_0 \triangleleft H_1 \triangleleft \cdots \triangleleft H_k = A_5 is any subnormal series, then Hk−1◃A5H_{k-1} \triangleleft A_5 forces Hk−1∈{1,A5}H_{k-1} \in \{1, A_5\} by simplicity; if Hk−1=A5H_{k-1}=A_5 we drop the redundant top step and induct; if Hk−1=1H_{k-1}=1 then k=1k=1 and the single quotient is A5/1≅A5A_5/1 \cong A_5, non-abelian). Either way some quotient in any subnormal series for A5A_5 is isomorphic to the non-abelian group A5A_5 itself, contradicting solvability. This contradiction shows A5A_5 is not solvable, and therefore S5S_5, having the non-solvable subgroup A5A_5, is not solvable. ■\blacksquare

∎
CorollaryThe Insolvability of the General Quintic

The polynomial f(x)=x5−4x+2∈Q[x]f(x) = x^5 - 4x+2 \in \mathbb{Q}[x] has Galois group S5S_5 over Q\mathbb{Q} (by the worked example above, using irreducibility, transitivity, the existence of a 5-cycle, exactly one transposition from complex conjugation, and the transitive-plus-transposition lemma). Since S5S_5 is not solvable (theorem above), the Main Theorem shows ff is not solvable by radicals over Q\mathbb{Q}. Consequently, there is no general algebraic formula — built from the coefficients of an arbitrary degree-5 polynomial using field operations and extraction of nn-th roots — that expresses the roots of every quintic. This is the Abel–Ruffini theorem.

CounterexampleDropping "characteristic 0" breaks Kummer's lemma, and with it the main theorem's proof

The entire correspondence between radical towers and solvable Galois groups leans on Kummer theory, which requires either characteristic 00 or that the relevant root-extraction degrees be coprime to the characteristic. Drop the hypothesis "char(F)=0\mathrm{char}(F) = 0" and consider F=Fp(t)F = \mathbb{F}_p(t), the field of rational functions over the finite field Fp\mathbb{F}_p, and the polynomial

f(x)=xp−x−t∈F[x].f(x) = x^p - x - t \in F[x].

This is an Artin–Schreier extension, not a Kummer one: its splitting field E=F(α)E = F(\alpha), where αp−α=t\alpha^p - \alpha = t, has Gal(E/F)≅Z/pZ\mathrm{Gal}(E/F) \cong \mathbb{Z}/p\mathbb{Z} (if α\alpha is one root, the others are α+1,…,α+(p−1)\alpha+1,\ldots,\alpha+(p-1), since (α+i)p−(α+i)=αp+ip−α−i=αp−α+(i−i)=t(\alpha+i)^p-(\alpha+i) = \alpha^p + i^p - \alpha - i = \alpha^p-\alpha + (i-i) = t using Frobenius ip=ii^p=i in Fp\mathbb{F}_p; and σ:α↦α+1\sigma:\alpha\mapsto\alpha+1 generates a cyclic group of order pp acting simply transitively on the roots). This Galois group is cyclic, hence certainly solvable — yet E/FE/F is not a radical extension of the Kummer type F(an)F(\sqrt[n]{a}) with gcd⁡(n,p)=1\gcd(n,p)=1; the mechanism (part (b) of the Lemma) that would produce a Lagrange resolvent breaks down because FF contains no nontrivial pp-th roots of unity at all (in characteristic pp, xp−1=(x−1)px^p - 1 = (x-1)^p has the single root 11 with multiplicity pp). More seriously for the theorem itself: the forward direction of the Main Theorem's proof (adjoining ζN\zeta_N to guarantee enough roots of unity) simply cannot repair a Kummer-style radical description whenever p∣Np \mid N, since xN−1x^N-1 then fails to be separable and Kummer's Lemma's very first sentence — "KK is the splitting field, with nn distinct roots ζniα\zeta_n^i \alpha" — becomes false. In characteristic pp, one must instead build a parallel theory (Artin–Schreier and Artin–Schreier–Witt theory) to characterize solvability by radicals-and-pp-th-root-extractions; the clean equivalence "solvable by radicals   ⟺  \iff solvable Galois group," as stated, genuinely requires char(F)=0\mathrm{char}(F)=0 (or at least characteristic not dividing any of the relevant extension degrees).

Scope, edge cases & common traps

SituationWhat holdsWhat can fail
FF char 0, ff irreducible degree ≤4\le 4Gal(E/F)≤S4\mathrm{Gal}(E/F) \le S_4, always solvableNothing — formulas always exist
FF char 0, ff irreducible degree 5, Galois group properly <S5<S_5 (e.g. cyclic, or the order-20 Frobenius group)Solvable by radicalsDo not assume every quintic is unsolvable — only the ones with Galois group A5A_5 or S5S_5 are
FF char 0, ff irreducible degree 5, exactly 3 real rootsGalois group is S5S_5 (by the lemma)Miscounting real roots (e.g. via a flawed derivative sign analysis) silently invalidates the argument
FF of positive characteristic ppKummer correspondence fails when pp divides a radical exponentArtin–Schreier phenomena mimic "radical-like" solvability without genuine nn-th roots
n≥5n \ge 5 general (not just 55)SnS_n for n≥5n\ge5 is non-solvable (since AnA_n is simple for n≥5n \ge 5), so the general polynomial of every degree ≥5\ge 5 is unsolvable by radicalsThis does not say a specific numeric polynomial of high degree is unsolvable — some are, some aren't

The mathematician behind it

Origins · 1 minÉvariste Galois and how this was discovered
ÉG
Évariste Galois
1811–1832 · Revolutionary-era France, algebra and group theory

Galois developed, in his teens, the theory of what we now call Galois groups while trying to determine exactly which polynomial equations are solvable by radicals — reformulating and completing work of Lagrange, Ruffini, and Abel. His memoir on the theory of equations was submitted to the French Academy of Sciences and famously mishandled (lost, or dismissed as incomprehensible) by referees including Cauchy and Poisson. He died at twenty from wounds sustained in a duel, having spent the night before writing a testamentary letter outlining his mathematical ideas to his friend Auguste Chevalier. His work was not properly understood and published until Joseph Liouville edited and presented it in 1846, fourteen years after Galois's death.

History
- 1770–1771 — Lagrange analyzes the classical solution methods for degrees 2,3,42,3,4 via resolvent polynomials and permutations of roots, laying groundwork without a general theory.
- 1799 — Paolo Ruffini publishes an attempted proof that the general quintic is unsolvable by radicals; the argument is incomplete but captures the essential idea.
- 1824 — Niels Henrik Abel gives the first complete, rigorous proof that the general quintic is not solvable by radicals.
- 1830–1832 — Évariste Galois develops the group-theoretic framework (Galois groups, normal subgroups, solvability) that explains why, submitting his memoir shortly before his death in a duel in 1832.
- 1846 — Joseph Liouville publishes and popularizes Galois's papers in the Journal de Mathématiques Pures et Appliquées, establishing Galois theory as a subject.
Does the Abel–Ruffini theorem mean quintics have no roots?

No — every polynomial of degree 5 with complex coefficients has exactly 5 roots in C\mathbb{C}, counted with multiplicity, by the Fundamental Theorem of Algebra. The theorem says nothing about the existence of roots, which is never in doubt; it says there is no formula for those roots using only the field operations and root extractions (⋅n\sqrt[n]{\cdot}) applied to the coefficients, valid uniformly for every quintic. Roots can still be found numerically (Newton's method, etc.) or expressed using more powerful special functions (elliptic or theta functions), just not with radicals alone.

Why do degrees 2, 3, and 4 have formulas but degree 5 does not?

The symmetric groups S2,S3,S4S_2, S_3, S_4 are all solvable groups: S2≅Z/2S_2 \cong \mathbb{Z}/2 is abelian; S3S_3 has the normal subgroup A3≅Z/3A_3\cong \mathbb{Z}/3 with abelian quotient Z/2\mathbb{Z}/2; S4S_4 has the chain S4▹A4▹V4▹{e}S_4 \triangleright A_4 \triangleright V_4 \triangleright \{e\} with abelian quotients Z/2,Z/3,(Z/2)2\mathbb{Z}/2,\mathbb{Z}/3,(\mathbb{Z}/2)^2. Starting at S5S_5, the alternating group A5A_5 is simple and non-abelian, so no subnormal series with abelian quotients exists. This algebraic fact about the abstract groups SnS_n, not any deficiency of ingenuity, is the entire reason the pattern of radical formulas stops at degree 4.

Is it true that all quintics with rational Galois group A5A_5 are also unsolvable?

Yes. A5A_5 is a subgroup of S5S_5, but it is simple and non-abelian in its own right, so it is not solvable (the same argument used in the main proof applies verbatim, since A5A_5 itself has no proper nontrivial normal subgroup). Any quintic whose Galois group is exactly A5A_5 — these arise precisely when the discriminant of the quintic is a perfect square in Q\mathbb{Q}, forcing the Galois group into the alternating group — is therefore also unsolvable by radicals, even though ∣A5∣=60<120=∣S5∣|A_5|=60 < 120=|S_5|.

How do you actually compute the Galois group of a specific quintic in practice?

Beyond the ad hoc method used here (irreducibility for transitivity, real-root count for a transposition), one systematic tool is the resolvent polynomial: construct an auxiliary polynomial (e.g., built from the discriminant, or from a degree-6 "sextic resolvent" associated to the quintic) whose factorization pattern over Q\mathbb{Q} pins down which transitive subgroup of S5S_5 occurs. Modern computer algebra systems automate this via resolvent computations combined with pp-adic factorization patterns (linking cycle types of Frobenius elements, via reduction mod various primes, to the possible Galois group, guided by the Chebotarev density theorem).

Does this mean quintics are useless or that we should give up trying to solve them?

Not at all. Quintics (and higher-degree equations) are solved constantly, just not by an unrestricted "radicals-only" formula. Numerical root-finding (Newton's method, eigenvalue methods for companion matrices) solves any specific quintic to arbitrary precision. Additionally, Charles Hermite showed in 1858 that the general quintic can be solved using elliptic modular functions (theta functions), a genuinely more powerful tool than radicals. The theorem only rules out the very restrictive toolkit of field operations plus root extraction.

Why must the transposition come specifically from complex conjugation, rather than any transposition?

It doesn't have to be complex conjugation specifically — any transposition in the Galois group, found by any means, would complete the argument via the transitive-plus-transposition lemma. Complex conjugation is simply a convenient, always-available automorphism of C\mathbb{C} that restricts to an automorphism of any splitting field of a real polynomial (since such a splitting field is closed under conjugation). When exactly two roots are non-real, conjugation acts as a single transposition on the labeled root set, which is exactly the input the lemma needs; other transpositions could arise from other symmetries but are harder to produce in general.

What exactly does "solvable by radicals" forbid that numerical methods do not need?

Solvability by radicals demands a closed-form expression built only from the coefficients using +,−,×,÷+,-,\times,\div and extraction of nn-th roots (⋅n\sqrt[n]{\cdot}), producing the roots exactly and symbolically. Numerical methods approximate roots to any desired precision using iterative algorithms (bisection, Newton's method, Durand–Kerner) that never claim to produce an exact symbolic formula. The Abel–Ruffini theorem is entirely a statement about symbolic solvability; it has no bearing on numerical approximability, which is unconstrained and always possible for polynomials with real or complex coefficients.

Before this