Solvability by Radicals and the Insolubility of the Quintic

One-line statement: A polynomial equation is solvable by radicals if and only if its Galois group is a solvable group; the general quintic is not solvable by radicals because

S_{5}

is not a solvable group. Key result in words: There is no general formula expressing the roots of a degree-5 (or higher) polynomial using only the coefficients, the four arithmetic operations, and the extraction of

n

-th roots. Where it applies: Field theory, Galois theory, the classification of when algebraic equations admit closed-form solutions. Who/when: Conjectured and partially proved by Paolo Ruffini (1799), rigorously established by Niels Henrik Abel (1824), and given its definitive structural explanation by Évariste Galois (1830–32).

A polynomial $f (x)$ over a field $F$ is solvable by radicals if its roots lie in some field obtained from $F$ by a finite tower of extensions, each adjoining an $n$ -th root of an element already present. Galois theory translates this analytic-looking demand into a purely group-theoretic condition: solvability of the field tower corresponds exactly to solvability of the Galois group of the splitting field. The matter is decisive because it answers a question two centuries old — whether the success of the quadratic, cubic, and quartic formulas extends to degree 5 — and the answer is a firm no. The surprising fact is that the obstruction is not computational difficulty but an intrinsic structural feature: the symmetric group $S_{5}$ contains the simple non-abelian group $A_{5}$ of order 60, and simplicity is precisely the wall against which radical solvability shatters.

The Core Insight

Adjoining a radical $n a$ to a field (containing the needed roots of unity) produces a cyclic Galois extension. A formula built from nested radicals therefore corresponds to a tower of cyclic extensions, whose total Galois group is built by successive abelian "layers" — i.e., it is a solvable group. Conversely, every solvable group can be realized by such a tower. Thus solvability by radicals = solvability of the Galois group. Since the Galois group of the generic quintic is $S_{5}$ , and $S_{5}$ is not solvable (its only nontrivial proper normal subgroup $A_{5}$ is simple and non-abelian), no radical formula can exist.

Formal Statement

Radical Extension and Solvability by Radicals

A field extension $K / F$ is a radical extension if there is a tower

F = K_{0} \subseteq K_{1} \subseteq \dots \subseteq K_{m} = K, K_{i + 1} = K_{i} (α_{i}), α_{i}^{n_{i}} \in K_{i}

⟳each step adjoins a single element whose

n_{i}

-th power already lies in the previous field; this is the algebraic encoding of "taking an

n_{i}

-th root."

A polynomial $f \in F [x]$ is solvable by radicals if its splitting field $E$ over $F$ is contained in some radical extension $K$ of $F$ . Here $F$ is the base field (typically $Q$ or $Q (t_{1}, \dots, t_{n})$ ), $α_{i}$ are the radical generators, and $n_{i} \in N$ are the radical degrees.

Solvable Group

A finite group $G$ is solvable if it possesses a subnormal series

{e} = G_{0} ◃ G_{1} ◃ \dots ◃ G_{r} = G, G_{i + 1} / G_{i} abelian

⟳each quotient of consecutive terms is abelian; equivalently the derived series

G \supseteq G^{'} \supseteq G^{''} \supseteq \dots

terminates at

{e}

Equivalently, $G$ is solvable iff the derived series $G^{(0)} = G$ , $G^{(k + 1)} = [G^{(k)}, G^{(k)}]$ reaches the trivial group in finitely many steps.

Galois's Solvability Criterion

Let $F$ be a field of characteristic $0$ (or characteristic $p$ with appropriate separability), $f \in F [x]$ , and let $E$ be the splitting field of $f$ over $F$ with Galois group $Gal (E / F)$ . Then

f is solvable by radicals over F ⟺ Gal (E / F) is a solvable group .

⟳the forward direction refines a radical tower into cyclic steps after adjoining roots of unity; the converse builds a radical tower from a composition series with cyclic factors via Kummer theory.

Insolubility of the General Quintic — Abel–Ruffini

Let $t_{1}, \dots, t_{5}$ be indeterminates and $F = Q (s_{1}, \dots, s_{5})$ the field of symmetric functions, where $s_{i}$ are the elementary symmetric polynomials. The general quintic

f (x) = x^{5} - s_{1} x^{4} + s_{2} x^{3} - s_{3} x^{2} + s_{4} x - s_{5}

⟳

f

is the polynomial whose roots are the algebraically independent

t_{i}

; its coefficients are the elementary symmetric functions

s_{i} = σ_{i} (t_{1}, \dots, t_{5})

has Galois group $Gal (E / F) ≅ S_{5}$ , which is not solvable. Hence the general quintic is not solvable by radicals: no formula in $s_{1}, \dots, s_{5}$ using $+, -, \times, \div$ and radicals expresses the roots.

Why It Holds / Derivation

Radical solvability implies solvable Galois group

Step 1 (Reduce to a Galois radical tower). Suppose

E \subseteq K

with

K / F

radical via the tower [1]. By enlarging

K

we may assume

K / F

is itself Galois (take the Galois closure; a compositum of conjugates of a radical extension is again radical). Step 2 (Adjoin roots of unity). Let

n = lcm (n_{i})

and let

ζ

be a primitive

n

-th root of unity. Form

F^{'} = F (ζ)

and

K^{'} = K (ζ)

. The extension

F^{'} / F

is abelian (cyclotomic), so

Gal (F^{'} / F)

is abelian, hence solvable. Step 3 (Each radical step is cyclic). Over a field containing the relevant roots of unity, adjoining

α

with

α^{n} \in K_{i}^{'}

gives a Kummer extension

K_{i + 1}^{'} / K_{i}^{'}

that is Galois with cyclic Galois group of order dividing

n

. This is because any automorphism sends

α \mapsto ζ^{j} α

, and the assignment

σ \mapsto j mod n

is an injective homomorphism into

Z / n Z

\frac{σ ( α )}{α} \in μ_{n}, σ \mapsto \frac{σ ( α )}{α} is a group homomorphism Gal (K_{i + 1}^{'} / K_{i}^{'}) ↪ μ_{n} .

⟳

σ (α)^{n} = σ (α^{n}) = α^{n}

forces

σ (α) / α

to be an

n

-th root of unity; multiplicativity follows from

σ τ (α) / α = (σ τ (α) / τ (α)) (τ (α) / α)

using that

μ_{n} \subseteq K_{i}^{'}

is fixed.

Step 4 (Assemble the solvable series). The chain

F \subseteq F^{'} \subseteq K_{1}^{'} \subseteq \dots \subseteq K_{m}^{'} = K^{'}

gives, via the Galois correspondence, a subnormal series of

Gal (K^{'} / F)

whose successive quotients are abelian (cyclotomic at the bottom, cyclic above). Hence

Gal (K^{'} / F)

is solvable. Step 5 (Pass to the quotient). Since

E / F

is Galois (the splitting field) and

E \subseteq K^{'}

Gal (E / F)

is a quotient of

Gal (K^{'} / F)

Gal (E / F) ≅ Gal (K^{'} / F) / Gal (K^{'} / E) .

⟳the fundamental theorem of Galois theory; the subgroup fixing

E

is normal because

E / F

is normal, and the quotient is the Galois group of

E / F

Quotients of solvable groups are solvable. Therefore $Gal (E / F)$ is solvable. $■$

Solvable Galois group implies radical solvability

Step 1. Let

G = Gal (E / F)

be solvable with composition-style series [2] having abelian, indeed cyclic, quotients of prime order. Adjoin a primitive

n

-th root of unity

ζ

for

n = ∣ G ∣!

(or

lcm

of quotient orders) to obtain

F^{'} = F (ζ)

; this enlargement keeps the group solvable and supplies the roots of unity needed for Kummer theory. Step 2. To each cyclic quotient

G_{i + 1} / G_{i}

of order

p

(prime,

p ∣ n

), the fixed-field correspondence assigns a degree-

p

cyclic extension

L_{i + 1} / L_{i}

. Because

μ_{p} \subseteq L_{i}

, Kummer theory guarantees

L_{i + 1} = L_{i} (β)

with

β^{p} \in L_{i}

; the existence of such a radical generator follows from the nonvanishing of a Lagrange resolvent:

β = k = 0 \sum p - 1 ζ^{- k} σ^{k} (θ), β^{p} \in L_{i},

⟳for a generator

σ

of the cyclic group and suitable

θ

σ (β) = ζ β

, so

σ (β^{p}) = β^{p}

, i.e.

β^{p}

is fixed and lies in

L_{i}

; the resolvent is nonzero for some

θ

by linear independence of characters.

Step 3. Chaining these radical steps yields a radical tower from

F^{'}

up to

E (ζ)

, and prepending the radical step

F \to F (ζ) = F^{'}

(since

ζ^{n} = 1

) shows

E

lies in a radical extension of

F

. Hence

f

is solvable by radicals.

■

The general quintic has Galois group $S_5$, which is not solvable

Step 1 (Galois group is $S_{5}$ ). With

t_{1}, \dots, t_{5}

algebraically independent and

F = Q (s_{1}, \dots, s_{5})

, the splitting field is

E = Q (t_{1}, \dots, t_{5})

. Every permutation of the

t_{i}

fixes the symmetric functions

s_{i}

, giving

S_{5} ↪ Gal (E / F)

; conversely

[E : F] \leq 5! = 120

since

E

is generated by 5 roots of a degree-5 polynomial. Hence

Gal (E / F) ≅ S_{5}

. Step 2 ( $A_{5}$ is simple). The alternating group

A_{5}

of order 60 is simple: its conjugacy classes have sizes

1, 15, 20, 12, 12

, and no proper nonempty union containing

{e}

(other than

{e}

itself) sums to a divisor of 60 — so it has no nontrivial proper normal subgroup. Step 3 ( $S_{5}$ not solvable). The only normal subgroups of

S_{5}

are

{e}

A_{5}

, and

S_{5}

. The derived series is

S_{5} ⊋ S_{5}^{'} = A_{5} ⊋ A_{5}^{'} = A_{5} = A_{5} = \dots,

⟳

[S_{5}, S_{5}] = A_{5}

because commutators are even;

[A_{5}, A_{5}] = A_{5}

since

A_{5}

is non-abelian and simple, so its commutator subgroup (a normal subgroup) must be all of

A_{5}

The derived series stalls at $A_{5} \neq = {e}$ , so $S_{5}$ is not solvable.

Step 4 (Conclude). By [3] (the forward direction proven above), since

Gal (E / F) = S_{5}

is not solvable,

f

is not solvable by radicals.

■

Lattice correspondence: radical tower of fields (left) vs. solvable series of groups (right). The break for the quintic is the simple block $A_5$.

Évariste Galois | 1811–1832

Galois, dead in a duel at twenty, transformed algebra by shifting attention from formulas to the symmetries of roots. Where Ruffini and Abel showed that no quintic formula exists, Galois explained why — and simultaneously provided a criterion deciding, for any specific polynomial, whether radicals suffice. He introduced the group attached to an equation (the "group of the equation"), recognized normal subgroups and quotient groups as the engine of the theory, and coined the notion of a solvable (then "résoluble") group. His ideas, dismissed or lost by Cauchy, Fourier, and Poisson during his lifetime, were finally published by Liouville in 1846 and became the foundation of modern abstract algebra.

Building Intuition

Think of solving a polynomial as peeling away symmetry layer by layer. Initially the roots are indistinguishable to you — you only know their symmetric combinations (the coefficients), and the full symmetry group permutes them freely. Each radical you extract is a tool that breaks one cyclic chunk of this symmetry: a clever combination (a resolvent) becomes computable, and the group of remaining ambiguity shrinks by a cyclic factor. For the quadratic, one square root suffices because $S_{2}$ is already cyclic; for the cubic, a square root plus a cube root peel $S_{3} \to A_{3} \to {e}$ ; for the quartic, the chain $S_{4} \to A_{4} \to V_{4} \to {e}$ works because every step is abelian. The quintic stalls because, after peeling off the sign ( $S_{5} \to A_{5}$ ), what remains — $A_{5}$ — is a rigid, simple block of 60 symmetries with no abelian sub-layer to grab onto. There is no resolvent that breaks it cleanly; the symmetry is "atomic."

Worked Examples

The cubic is solvable — explicit tower

Given:

f (x) = x^{3} + p x + q

over

F = Q (p, q)

, with generic Galois group

S_{3}

. Step 1 — check the group is solvable.

S_{3} ▹ A_{3} ▹ {e}

with quotients

S_{3} / A_{3} ≅ Z /2

and

A_{3} ≅ Z /3

— both cyclic. So

S_{3}

is solvable and

f

is solvable by radicals. Step 2 — square root (peel $S_{3} \to A_{3}$ ). Adjoin

Δ

where the discriminant is

Δ = - 4 p^{3} - 27 q^{2} .

⟳

Δ = \prod_{i < j} (r_{i} - r_{j})^{2}

; the element

Δ = \prod_{i < j} (r_{i} - r_{j})

is fixed exactly by even permutations, i.e. by

A_{3}

Step 3 — cube root (peel $A_{3} \to {e}$ ). Adjoin

ζ_{3}

and form the Lagrange resolvent, leading to Cardano's formula:

r = 3 - \frac{q}{2} + \frac{q ^{2}}{4} + \frac{p ^{3}}{27} + 3 - \frac{q}{2} - \frac{q ^{2}}{4} + \frac{p ^{3}}{27} .

⟳set

r = u + v

with

3 uv = - p

; then

u^{3}, v^{3}

are roots of a quadratic whose discriminant is

- Δ/108

, recovering the inner square root.

Boxed answer:

Tower F \subseteq F (Δ) \subseteq F (Δ, ζ_{3}, 3 \cdot) \supseteq E; every cubic is solvable by radicals.

A specific quintic that is NOT solvable by radicals

Given:

f (x) = x^{5} - 6 x + 3 \in Q [x]

. Step 1 — irreducibility. By Eisenstein at

p = 3

(

3 ∣ 6, 3 ∣ 3, 3^{2} ∤ 3

f

is irreducible over

Q

, so

5 ∣ ∣ Gal (f) ∣

and the group is a transitive subgroup of

S_{5}

. Step 2 — count real roots.

f^{'} (x) = 5 x^{4} - 6

vanishes at

x = \pm (6/5)^{1/4} \approx \pm 1.046

, giving exactly two critical points (one local max, one local min). Evaluating:

f (- 2) = - 17

f (0) = 3

f (1) = - 2

f (2) = 23

. Sign changes give exactly 3 real roots and hence 2 complex (non-real) roots. Step 3 — produce a transposition. Complex conjugation fixes the 3 real roots and swaps the 2 conjugate complex roots — it acts as a transposition in

Gal (f) \subseteq S_{5}

. Step 4 — group is $S_{5}$ . A transitive subgroup of

S_{5}

containing a transposition and an element of order 5 (Cauchy, from

5 ∣ ∣ G ∣

) must be all of

S_{5}

. By [8],

S_{5}

is not solvable. Boxed answer:

Gal (x^{5} - 6 x + 3/ Q) ≅ S_{5} \Rightarrow the roots are NOT expressible by radicals.

Common Misconceptions

"Insolubility means the quintic has no solutions." False. Every quintic with complex coefficients has exactly 5 roots (with multiplicity) by the Fundamental Theorem of Algebra. The roots exist and can be computed numerically to arbitrary precision; what fails is their expression in a closed radical formula. Indeed quintics can be solved using elliptic / hypergeometric functions (Hermite, Kronecker, 1858) — just not by radicals. "Every quintic is unsolvable by radicals." Also false. Many specific quintics are radically solvable, e.g.

x^{5} - 2

(group a subgroup of the metacyclic Frobenius group

F_{20}

, which is solvable), or any quintic with abelian/solvable Galois group. The theorem concerns the general quintic (group

S_{5}

A solvable specific quintic versus the insolvable general case

Consider $x^{5} - 2 = 0$ . Its splitting field is $Q (52, ζ_{5})$ and its Galois group is the Frobenius group $F_{20} = Z /5 ⋊ Z /4$ of order 20, which has the solvable series

F_{20} ▹ Z /5 ▹ {e}, F_{20} / (Z /5) ≅ Z /4,

⟳the normal Sylow-5 subgroup is generated by the cyclic permutation of the five fifth roots of 2; the quotient

Z /4

is the cyclotomic group of

ζ_{5}

Both quotients are cyclic, so $F_{20}$ is solvable and the roots $ζ_{5}^{k} 52$ are (obviously) radical. This shows the solvability obstruction is a property of the group, not the degree: degree 5 alone does not forbid radicals — only the appearance of an unsolvable group like $S_{5}$ or $A_{5}$ does.

Connections

The solvability criterion sits at the confluence of several theories. It is the capstone application of the Fundamental Theorem of Galois Theory, which supplies the dictionary between intermediate fields and subgroups used throughout the proofs. The cyclic-extension half rests on Kummer Theory and Cyclotomic Extensions, which characterize abelian extensions adjoining roots of unity. The group-side input — that $A_{n}$ is simple for $n \geq 5$ — belongs to Simple Groups and Composition Series, and the very notion of solvable group feeds forward into the Classification of Finite Simple Groups. Finally, the philosophy of attaching symmetry groups to structure generalizes into Inverse Galois Problem and, via differential analogues, into Differential Galois Theory (Picard–Vessiot), where one asks when differential equations are solvable in "closed form."

Real-World Applications

Compass-and-straightedge constructibility. A length is constructible iff it lies in a tower of degree-2 extensions; the same field-tower machinery proves the impossibility of trisecting a general angle and doubling the cube.
Coding theory & BCH/Reed–Solomon decoding. Error-locator polynomials over finite fields are solved with awareness of their Galois structure; the algorithms exploit that finite-field Galois groups are cyclic (hence solvable), guaranteeing factorization.
Symbolic computation systems (Maple, Mathematica, SageMath, GAP) implement Galois-group computation to decide whether a given polynomial admits a radical solution before attempting one — avoiding fruitless symbolic searches on $S_{5}$ -type quintics.
Cryptography. The discrete-log and pairing-based protocols rely on the structure of multiplicative groups of finite fields and elliptic curves; Galois-theoretic descent governs which field extensions admit efficient arithmetic.
Bring–Jerrard / Hermite's elliptic-modular solution of the quintic is used in special-function libraries to evaluate quintic roots in closed (non-radical) form, important in some integrable-systems and algebraic-geometry computations.
Algebraic number theory / class field theory. Solvable extensions of number fields are exactly those described by abelian/solvable reciprocity laws, foundational to modern arithmetic.
Robotics and kinematics. Inverse-kinematics polynomial systems of high degree are analyzed for closed-form solvability; Galois obstructions flag when only numerical solution is possible.

Historical Development

1545 — Cardano's Ars Magna publishes the cubic (Tartaglia/del Ferro) and quartic (Ferrari) formulas, completing radical solutions through degree 4 and prompting the centuries-long quest for the quintic.
1770–1771 — Lagrange's Réflexions sur la résolution algébrique des équations introduces resolvents and the permutation theory of roots, the conceptual seed of group theory; he notices the methods fail at degree 5.
1799 — Paolo Ruffini publishes a 500-page argument that the general quintic is insolvable, essentially correct but with a gap and ignored by contemporaries.
1815–1820s — Cauchy develops permutation-group theory (cycle notation, the theory of substitutions), supplying tools Ruffini lacked.
1824 — Niels Henrik Abel gives the first rigorous proof (the Abel–Ruffini theorem), self-published in a terse pamphlet at his own expense.
1829–1832 — Évariste Galois writes the memoirs introducing the group of an equation, normal subgroups, and the solvability criterion; submitted to the Académie and lost/rejected before his death in 1832.
1846 — Joseph Liouville edits and publishes Galois's manuscripts in his Journal, finally making the theory accessible.
1858 — Hermite, Kronecker, and Brioschi solve the general quintic using elliptic modular functions, showing closed-form solution is possible beyond radicals.
1870 — Camille Jordan's Traité des substitutions systematizes Galois theory and group theory, cementing them as central mathematics.

Subtleties & Limits

The Inverse Galois Problem asks the converse-style question: is every finite group the Galois group of some extension of

Q

? Solvable groups are known to be realizable (Shafarevich, 1954), and many simple groups have been realized, but the general problem remains open. This matters here because realizing

S_{n}

and

A_{n}

over

Q

is classical (Hilbert's irreducibility theorem), confirming that genuinely insolvable polynomials over

Q

exist in abundance — not as artifacts of generic indeterminates but as concrete equations.

Further subtleties: (i) In characteristic $p$ , separability and Artin–Schreier extensions (replacing Kummer theory for degree- $p$ steps) complicate the radical-tower correspondence. (ii) Solvability in radicals vs. "solvability in real radicals" differs — the casus irreducibilis shows some real cubics need complex radicals even when all roots are real. (iii) Computationally, deciding the Galois group of a high-degree polynomial is feasible but subtle; resolvent-based algorithms have been tabulated through degree 15 and beyond, yet effective Galois-group computation for very large degrees remains an active area.

Solvability by Radicals and the Insolubility of the Quintic

The Core Insight

Formal Statement

Radical Extension and Solvability by Radicals

Solvable Group

Galois's Solvability Criterion

Insolubility of the General Quintic — Abel–Ruffini

Why It Holds / Derivation

Radical solvability implies solvable Galois group

Solvable Galois group implies radical solvability

The general quintic has Galois group $S_5$, which is not solvable

Lattice correspondence: radical tower of fields (left) vs. solvable series of groups (right). The break for the quintic is the simple block $A_5$.

Évariste Galois | 1811–1832

Building Intuition

Worked Examples

The cubic is solvable — explicit tower

A specific quintic that is NOT solvable by radicals

Common Misconceptions

A solvable specific quintic versus the insolvable general case

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also

Before this

Where this leads