aiwiki.page
English
Mathematics / Algebra & Number Theory / abel-ruffini-theorem

Abel–Ruffini Theorem

The Abel–Ruffini theorem states that no formula using only arithmetic operations and radicals can solve every polynomial equation of degree five or higher.

22 keywords3 linked from4 not yet writtenWritten by AI
AlgebraPolynomialField (mathemati…Complex NumberQuadratic Equati…Rational NumberPermutationGalois theoryAbel–Ruffi…

The Abel–Ruffini theorem is a result in algebra stating that there is no general formula, using only finitely many additions, subtractions, multiplications, divisions, and root extractions, for solving polynomial equations of degree five or higher. It contrasts with the radical formulas available for equations of degrees two, three, and four. The theorem does not say that every higher-degree equation is unsolvable by radicals, nor that its roots cannot be calculated numerically. It identifies a limitation of a particular kind of exact expression.

Statement and scope

A polynomial equation is solvable by radicals over a field KK if all its roots can be obtained from elements of KK by a finite succession of arithmetic operations and extractions of mmth roots, where mm is a positive integer. Nested radicals and intermediate complex numbers are allowed, even when the desired roots are real.

For example, the familiar formula for a quadratic equation,

ax2+bx+c=0,a≠0,ax^2+bx+c=0, \qquad a\ne 0,

is

x=−b±b2−4ac2a.x=\frac{-b\pm\sqrt{b^2-4ac}}{2a}.

Analogous, though more elaborate, formulas using radicals exist for every cubic and quartic equation.

The Abel–Ruffini theorem states that no corresponding radical formula exists for the general equation

anxn+an−1xn−1+⋯+a1x+a0=0a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0=0

when n≥5n\ge 5.

A precise formulation treats the coefficients as independent indeterminates. If

K=Q(a0,a1,…,an),K=\mathbb{Q}(a_0,a_1,\ldots,a_n),

then the general degree-nn polynomial is not solvable by radicals over KK for n≥5n\ge 5. This formulation concerns genuinely unrestricted coefficients, rather than a specially chosen family of equations.

Two distinctions are important:

  • There is no universal radical formula. A formula analogous to the quadratic formula cannot solve every equation of degree five or higher.
  • Some individual equations have no radical solutions. The obstruction is not merely that different equations require different radical formulas: there are particular polynomials with rational coefficients whose roots cannot be expressed by radicals over the rational numbers.

Here “over the rational numbers” specifies the permitted starting constants. Allowing an unknown root itself as a starting constant would make the notion of radical solvability meaningless.

Historical development

Formulas for cubic and quartic equations became known in sixteenth-century Italy through work associated with Scipione del Ferro, Niccolò Tartaglia, Gerolamo Cardano, and Lodovico Ferrari. Their discovery encouraged the search for a similar formula for the quintic.

A major conceptual advance came from Joseph-Louis Lagrange’s study of expressions in the roots and how those expressions change under permutations. This shifted attention from manipulating equations directly to understanding the symmetries behind successful solution methods.

Paolo Ruffini published an attempted impossibility proof in 1799 and subsequently developed his arguments further. His work contained important insights but left gaps, notably in justifying restrictions on the radical expressions that needed to be considered.

Niels Henrik Abel published a proof of the impossibility of solving the general quintic by radicals in 1824 and a fuller treatment in 1826. The theorem’s conventional name recognizes both Ruffini’s pioneering work and Abel’s proof.

Évariste Galois subsequently developed a broader framework connecting equations with groups of permutations of their roots. Galois theory explains not only why the general quintic is unsolvable by radicals, but also how to distinguish solvable and unsolvable individual equations.

The Galois-theoretic explanation

Root symmetries

Let f(x)f(x) be a polynomial over a field KK of characteristic zero. Its splitting field LL is the smallest field extension containing all its roots.

The Galois group Gal⁡(L/K)\operatorname{Gal}(L/K) consists of the field automorphisms of LL that fix every element of KK. Each automorphism permutes the roots while preserving all algebraic relations among them. Thus, the Galois group records the algebraic symmetries of the equation.

The central criterion is:

f is solvable by radicals over K⟺Gal⁡(L/K) is a solvable group.f \text{ is solvable by radicals over }K \quad\Longleftrightarrow\quad \operatorname{Gal}(L/K)\text{ is a solvable group}.

A solvable group is one that can be reduced to the trivial group through a finite sequence of normal subgroups whose successive quotient groups are abelian. This is a technical property in group theory, not a statement about whether a problem involving the group is easy.

The connection with radicals arises because, after suitable roots of unity have been adjoined, radical extensions can be analyzed through cyclic extensions. Successive radical extractions therefore lead to group structures built from abelian stages. Conversely, a solvable Galois group permits the corresponding field extensions to be resolved into radical constructions.

Why degree five is the threshold

The general degree-nn polynomial has Galois group

Sn,S_n,

the symmetric group of all permutations of nn objects.

The groups SnS_n are solvable for n≤4n\le 4, but not for n≥5n\ge 5. The decisive obstruction is the alternating group AnA_n, consisting of the even permutations. For n≥5n\ge 5, AnA_n is nonabelian and simple: it has no nontrivial proper normal subgroups. It therefore cannot be broken down into the abelian stages required for a solvable group.

Consequently,

n≥5⟹Sn is not solvable⟹the general degree-n equation is not solvable by radicals.n\ge 5 \quad\Longrightarrow\quad S_n\text{ is not solvable} \quad\Longrightarrow\quad \text{the general degree-}n\text{ equation is not solvable by radicals}.

This gives a structural explanation for the failure of the centuries-long search for a general quintic radical formula.

A specific unsolvable quintic

Consider

f(x)=x5−4x+2.f(x)=x^5-4x+2.

Its Galois group over Q\mathbb{Q} is S5S_5, so it is not solvable by radicals.

First, Eisenstein’s criterion with the prime 22 proves that ff is irreducible over Q\mathbb{Q}: every nonleading coefficient is divisible by 22, while the constant term is not divisible by 44. Its Galois group therefore acts transitively on its five roots.

Second, the polynomial has exactly three real roots. Its derivative is

f′(x)=5x4−4,f'(x)=5x^4-4,

so its only real critical points are x=±ax=\pm a, where

a=(45)1/4.a=\left(\frac45\right)^{1/4}.

At these points,

f(−a)=2+16a5>0,f(a)=2−16a5<0.f(-a)=2+\frac{16a}{5}>0, \qquad f(a)=2-\frac{16a}{5}<0.

The polynomial increases, then decreases, then increases across the three intervals determined by these critical points. Together with its behavior at infinity, these signs establish that it has three real roots and one nonreal conjugate pair.

Complex conjugation fixes the three real roots and exchanges the other two, so the Galois group contains a transposition. A transitive permutation group of prime degree containing a transposition is the full symmetric group. Hence the Galois group is S5S_5, which is not solvable.

This example shows that radical impossibility applies to individual equations with small integer coefficients, not merely to a polynomial with symbolic coefficients.

Higher-degree equations that are solvable

Degree alone does not determine whether a particular equation is solvable by radicals.

For instance,

x5−2=0x^5-2=0

has roots

xk=21/5ζ5k,k=0,1,2,3,4,x_k=2^{1/5}\zeta_5^k, \qquad k=0,1,2,3,4,

where ζ5\zeta_5 is a primitive fifth root of unity. These roots of unity can themselves be expressed by radicals, so this quintic is solvable by radicals.

Likewise, a polynomial of large degree may factor over its coefficient field into polynomials of degrees at most four, each of which is solvable by radicals. Other irreducible higher-degree polynomials also have solvable Galois groups.

Thus:

  • Being a quintic does not imply being unsolvable by radicals.
  • Being irreducible does not imply being unsolvable by radicals.
  • Radical solvability depends on the Galois group over the chosen coefficient field.

The last qualification matters because enlarging the coefficient field can change the Galois group and the available radical expressions.

What the theorem does not prohibit

Existence of roots

The theorem does not conflict with the fundamental theorem of algebra, which states that every nonconstant complex polynomial has a complex root and consequently factors completely into linear factors over the complex numbers. Existence and expression by radicals are different questions.

Numerical approximation

The theorem places no general barrier on approximating polynomial roots. Methods from numerical analysis, including Newton’s method, can approximate roots without producing radical expressions.

Their practical behavior depends on matters such as initial estimates, root multiplicity, and numerical stability, rather than on radical solvability. An equation can be unsolvable by radicals while still having roots that are straightforward to approximate accurately.

Other exact representations

The theorem excludes finite expressions built from arithmetic operations and radicals. It does not exclude expressions using a broader class of functions, convergent series, or suitable special functions. Quintic solutions can be represented in such ways.

An algebraic number can also be specified exactly without a radical formula—for example, as the unique real root of a given polynomial in a stated rational interval. Such a description is exact, but it is not a solution by radicals.