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 . 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 , 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 is not solvable. We construct an explicit rational quintic — — whose Galois group is . Combining these facts yields the Abel–Ruffini theorem: there is no formula in radicals for the roots of a general quintic.
- Solvability by radicals of a polynomial is equivalent to solvability (in the group-theoretic sense) of its Galois group.
- has composition series with simple and non-abelian, so is not solvable.
- An irreducible quintic with exactly three real roots and two complex conjugate roots has Galois group , via a transitivity + transposition argument.
- The explicit polynomial is irreducible over (Eisenstein at ) and has exactly 3 real roots.
- Hence cannot be solved by any formula involving only , and radicals of the coefficients.
- Key idea: unsolvability of 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 -gons correspond to specific arithmetic conditions on (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 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 's role here exactly.
Ask the tutor: Why does the same argument fail to immediately show (a different-looking quintic) has Galois group without redoing the real-root count?
Let be a field of characteristic (all fields below are subfields of unless stated otherwise). A field extension is a radical extension if there is a tower
such that for each , where for some positive integer . (Each step adjoins an -th root of an element already present.) A polynomial is solvable by radicals if its splitting field over is contained in some radical extension . A finite group is solvable if there is a chain of subgroups
with each normal in and each quotient abelian. (Equivalently, the derived series terminates at the trivial group, where is the commutator subgroup.)
Intuition
The classical formulas for degrees 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 -th root of an element in a field containing the -th roots of unity produces a Kummer extension whose Galois group is cyclic of order dividing . 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 happen to be solvable (their orders are small and rich in normal subgroups), which is why the low-degree formulas exist. The group breaks this pattern for a structural reason: it contains the simple, non-abelian group 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 . The second half of the story is existential: does a rational quintic actually realize 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.
Let be a field of characteristic and a nonconstant polynomial with splitting field over . Let . Then is solvable by radicals over if and only if is a solvable group. Consequently: if there exists a polynomial of degree whose Galois group over is , and is not a solvable group, then no formula built from field operations and radicals (in the coefficients) can express the roots of — and in particular no such universal formula exists for the general polynomial of degree .
Let be a field of characteristic containing a primitive -th root of unity . Then: (a) If for some , then is Galois with cyclic of order dividing . (b) Conversely, if is Galois with cyclic of order , then for some with .
(a) Let be a fixed root of in an algebraic closure, so . Since contains all -th roots of unity , the full set of roots of is , all lying in . Thus is the splitting field of over , hence Galois. Any sends for a unique (unique because ), and the map is an injective homomorphism , since (using as ) giving , and injectivity holds because fixing fixes all of . Hence is isomorphic to a subgroup of the cyclic group , so it is cyclic of order dividing .
(b) Let , cyclic of order . By linear independence of characters (Dedekind), the automorphisms are linearly independent as functions . Form the Lagrange resolvent: for any , set
Since are linearly independent, we may choose so that . Applying :
using and re-indexing the sum. Hence , so is fixed by , hence by all of , so . Since (as and when ), does not fix , so ; but and is prime-to-nothing generic — more precisely the stabilizer of under is a proper subgroup of the cyclic group not containing , forcing by the Galois correspondence.
∎Proof of the main theorem, using <span class="wiki-link-missing">Fundamental Theorem of Galois Theory</span> and Kummer's lemma above.
() Solvable group solvable by radicals. Suppose is solvable, with subnormal series
By refining (using the structure theorem for finite abelian groups, each abelian group has a subnormal series with cyclic factors), we may assume each is cyclic of some order . Let ; more simply let be any common multiple of all the and of . Adjoin a primitive -th root of unity: let and . The extension is radical (it is generated by one root of , an -th root of ). Standard Galois theory (the extension is Galois with abelian Galois group, a subgroup of ) gives that is isomorphic to a subgroup of via restriction (the restriction map is injective because are linearly disjoint over , and its image is exactly the subgroup of fixing pointwise, which is all of when, as here, can only be a cyclotomic subfield of — in the generic case one simply replaces by this image , which inherits a subnormal series with cyclic quotients from by the correspondence theorem for groups). So without loss of generality we may assume itself has a subnormal series with cyclic factors of orders dividing , all the relevant roots of unity already lying in . Now form the fixed fields corresponding to under the Galois correspondence for :
For each , ... (re-indexing so containments increase): concretely set = fixed field of , so
and by the Fundamental Theorem, is Galois with group — wait, orient correctly: the fixed field of the smaller subgroup is the larger field, and normality of in gives ... To avoid sign confusion we state the clean conclusion directly: for each , is a Galois extension with group , cyclic of order dividing . Since already contains all -th roots of unity (as for every ), Kummer's lemma part (b) applies: with . Chaining these adjunctions from up to , and prepending the radical step , we exhibit a full radical tower from to a field containing . Hence is solvable by radicals.
() Solvable by radicals solvable group. Suppose where is a radical tower, , . We may enlarge the tower (a standard reduction) so that: 1. is Galois — replace by the Galois closure of (a splitting field of the product of minimal polynomials of all conjugates of the ); one checks the tower property is preserved by adjoining, at each stage, all -conjugates of each , which are again roots of the same pure equations , hence radical steps. 2. contains a primitive -th root of unity where — insert the radical step 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 ; the resulting tower is still radical with the same exponents , using Kummer's lemma (a) at every stage which requires exactly the ambient root of unity to be present, guaranteed now since is a common multiple). With these normalizations, each step is, by Kummer's Lemma part (a), Galois with cyclic Galois group. Let and let . Since is Galois, (this is exactly the Galois correspondence statement that an intermediate field is Galois over iff its corresponding subgroup is normal in ), and
is cyclic, hence abelian. This exhibits a subnormal series
with abelian quotients, so is solvable. Finally, since and is Galois, restriction gives a surjective homomorphism (surjective because Galois implies every -embedding of into extends to an automorphism of , and restricts to give every element of ; the kernel is ). A quotient of a solvable group is solvable: if has abelian quotients and is a surjective homomorphism with kernel , then gives a subnormal series in (images of normal subgroups under surjections remain normal in images) with quotients that are homomorphic images of , hence still abelian. Therefore is solvable.
∎Worked examples
Example 1: The Galois group of over is . Let . Step 1 — Irreducibility. Apply the Eisenstein criterion at : the coefficients are , and while (leading coefficient) and (constant term). All Eisenstein hypotheses hold, so is irreducible over . Since is irreducible of degree , its Galois group (acting on the 5 roots) is a transitive subgroup of : irreducibility means 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 itself, of full degree 5, so the orbit is all 5 roots. By elementary group theory, a transitive subgroup of has order divisible by (orbit-stabilizer: -orbit), so by Cauchy's theorem contains an element of order . The only elements of order in are -cycles (an element of order 5 in has cycle type with all cycle lengths dividing 5 and summing to ; the only possibility other than the identity is a single 5-cycle). So contains a 5-cycle. Step 2 — Real root count via calculus. Consider on . Then , which vanishes exactly at . Numerically . Compute:
so there is a root in .
so there is a root in .
so there is a root in . Since has only two critical points, it has at most 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 is strictly monotonic, so on each of the 3 monotonic intervals , , , has at most one root, giving at most real roots total). We exhibited sign changes above, so has exactly 3 real roots and (since complex roots of a real polynomial come in conjugate pairs, and ) 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 (as is stable under conjugation, being a splitting field of a real polynomial), and it fixes the real roots while swapping the complex roots. Viewed inside , this element is exactly a transposition (a 2-cycle) on the labeled roots. Step 4 — A transitive subgroup of containing a 5-cycle and a transposition is all of . This is a general group-theoretic fact proved below as a lemma; granting it, .
Example 2: Why does not give , and how the two examples differ. Consider . By Eisenstein at , is irreducible over , so its Galois group is again a transitive subgroup of containing a 5-cycle. But now count real roots: has derivative , so is (weakly monotonic, in fact strictly since only at the single point ) strictly increasing on . Hence has exactly one real root, , 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 , not a single transposition. A subgroup generated by a 5-cycle and a double-transposition need not be all of : indeed here the splitting field of is , of degree over (degree 5 from adjoining the real root, degree 4 from adjoining a primitive 5th root of unity, and these extensions are linearly disjoint since has degree 4 coprime considerations / direct computation of the tower degree , and one checks stays irreducible over by a degree/field-theoretic argument, giving degree ). So , not ; concretely is the Frobenius group of order 20,
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 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 ; satisfies the first ingredient but fails the second.
Let be prime and let be a transitive subgroup containing a transposition. Then .
Since is transitive and is prime, is divisible by (orbit-stabilizer, as in the main worked example), so by Cauchy's theorem contains an element of order ; as is prime, is an -cycle. Relabel so . Let be the given transposition, and consider the subgroup . Define a graph on vertex set where iff . We claim contains all transpositions, which (since transpositions generate ) gives , hence . Conjugating by powers of : for any , is a transposition lying in (as is a group containing ). As is an -cycle, the map is a bijection-invariant "shift": in fact all the transpositions for move indices at the fixed cyclic distance (i.e. connect and for all , cycling through all positions as varies, since , ). Since is prime and , is invertible mod , so as ranges over , the pairs range over pairs at cyclic distance , and the graph with edges for all is a single -cycle on the vertex set (because implies repeatedly adding mod visits every residue before returning). A connected graph on vertices where consecutive-in-the-cycle transpositions all lie in the group generates, by composing adjacent transpositions, every transposition : indeed if then , so the set of pairs with is closed under "graph-connectivity", and since our -cycle graph is connected, all transpositions lie in . Since the transpositions generate (standard fact: any permutation is a product of transpositions, e.g. by writing it in cycle notation and expanding each cycle ), we conclude , and since , also .
∎The symmetric group is not solvable.
We use two standard facts about , the alternating group on 5 letters, of order .
Claim 1: is simple (no normal subgroups other than and itself). Proof of Claim 1. acts by conjugation on itself; a normal subgroup must be a union of conjugacy classes, including . The conjugacy classes of have sizes (identity; double-transpositions ; 3-cycles; and two classes of 5-cycles, split because the centralizer of a 5-cycle in has order 5, giving classes of size each — the two classes correspond to 5-cycles and their "inverse-conjugate" type under the -fusion, a standard computation). If is a union of some of these class sizes including , and divides , one checks by direct enumeration that the only subset of containing and summing to a divisor of is itself or the full set summing to : e.g. ; ; ; ; ; ; ; ; ; (the whole group). So or , proving simplicity.
Claim 2: is non-abelian. Proof of Claim 2. Take and , both even permutations (products of an even number of transpositions: , two transpositions; is manifestly two transpositions), hence both lie in . Compute : apply then (right-to-left convention), tracking where each of goes. sends ; then sends , others fixed. So , , , , . Thus (since , and fixed). Now compute : apply then : sends ; then sends . So , , , , . Thus . Since as permutations (e.g. the first sends while the second fixes ), , so is non-abelian.
Conclusion. Suppose, for contradiction, that were solvable: with abelian quotients. A subgroup of a solvable group is solvable (intersect the series with the subgroup: gives a subnormal series for with each quotient embedding, by the second isomorphism theorem, into , hence abelian since subgroups of abelian groups are abelian). So would be solvable. But is simple and non-abelian by Claims 1–2, so the only subnormal series for is itself (any subnormal series with abelian quotients could be refined/collapsed, but since has no proper nontrivial normal subgroup, any subnormal chain starting from and ending at must have as consecutive terms at some point, forcing a quotient to appear as one of the successive quotients up to relabeling — more directly: if is any subnormal series, then forces by simplicity; if we drop the redundant top step and induct; if then and the single quotient is , non-abelian). Either way some quotient in any subnormal series for is isomorphic to the non-abelian group itself, contradicting solvability. This contradiction shows is not solvable, and therefore , having the non-solvable subgroup , is not solvable.
∎The polynomial has Galois group over (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 is not solvable (theorem above), the Main Theorem shows is not solvable by radicals over . Consequently, there is no general algebraic formula — built from the coefficients of an arbitrary degree-5 polynomial using field operations and extraction of -th roots — that expresses the roots of every quintic. This is the Abel–Ruffini theorem.
The entire correspondence between radical towers and solvable Galois groups leans on Kummer theory, which requires either characteristic or that the relevant root-extraction degrees be coprime to the characteristic. Drop the hypothesis "" and consider , the field of rational functions over the finite field , and the polynomial
This is an Artin–Schreier extension, not a Kummer one: its splitting field , where , has (if is one root, the others are , since using Frobenius in ; and generates a cyclic group of order acting simply transitively on the roots). This Galois group is cyclic, hence certainly solvable — yet is not a radical extension of the Kummer type with ; the mechanism (part (b) of the Lemma) that would produce a Lagrange resolvent breaks down because contains no nontrivial -th roots of unity at all (in characteristic , has the single root with multiplicity ). More seriously for the theorem itself: the forward direction of the Main Theorem's proof (adjoining to guarantee enough roots of unity) simply cannot repair a Kummer-style radical description whenever , since then fails to be separable and Kummer's Lemma's very first sentence — " is the splitting field, with distinct roots " — becomes false. In characteristic , one must instead build a parallel theory (Artin–Schreier and Artin–Schreier–Witt theory) to characterize solvability by radicals-and--th-root-extractions; the clean equivalence "solvable by radicals solvable Galois group," as stated, genuinely requires (or at least characteristic not dividing any of the relevant extension degrees).
Scope, edge cases & common traps
| Situation | What holds | What can fail |
|---|---|---|
| char 0, irreducible degree | , always solvable | Nothing — formulas always exist |
| char 0, irreducible degree 5, Galois group properly (e.g. cyclic, or the order-20 Frobenius group) | Solvable by radicals | Do not assume every quintic is unsolvable — only the ones with Galois group or are |
| char 0, irreducible degree 5, exactly 3 real roots | Galois group is (by the lemma) | Miscounting real roots (e.g. via a flawed derivative sign analysis) silently invalidates the argument |
| of positive characteristic | Kummer correspondence fails when divides a radical exponent | Artin–Schreier phenomena mimic "radical-like" solvability without genuine -th roots |
| general (not just ) | for is non-solvable (since is simple for ), so the general polynomial of every degree is unsolvable by radicals | This 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
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.
Does the Abel–Ruffini theorem mean quintics have no roots?
No — every polynomial of degree 5 with complex coefficients has exactly 5 roots in , 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 () 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 are all solvable groups: is abelian; has the normal subgroup with abelian quotient ; has the chain with abelian quotients . Starting at , the alternating group is simple and non-abelian, so no subnormal series with abelian quotients exists. This algebraic fact about the abstract groups , 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 are also unsolvable?
Yes. is a subgroup of , 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 itself has no proper nontrivial normal subgroup). Any quintic whose Galois group is exactly — these arise precisely when the discriminant of the quintic is a perfect square in , forcing the Galois group into the alternating group — is therefore also unsolvable by radicals, even though .
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 pins down which transitive subgroup of occurs. Modern computer algebra systems automate this via resolvent computations combined with -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 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 and extraction of -th roots (), 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.