{
  "id": "abel-ruffini-theorem",
  "title": "Abel–Ruffini Theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "The Abel–Ruffini theorem states that no formula using only arithmetic operations and radicals can solve every polynomial equation of degree five or higher.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Abel's impossibility theorem",
    "Insolvability of the general quintic"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/abel-ruffini-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/abel-ruffini-theorem/",
      "json": "https://aiwiki.page/zh/abel-ruffini-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "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."
    },
    {
      "heading": "Statement and scope",
      "text": "A polynomial equation is solvable by radicals over a field \\(K\\) if all its roots can be obtained from elements of \\(K\\) by a finite succession of arithmetic operations and extractions of \\(m\\)th roots, where \\(m\\) is a positive integer. Nested radicals and intermediate complex numbers are allowed, even when the desired roots are real.\n\nFor example, the familiar formula for a quadratic equation,\n\n\\[ax^2+bx+c=0, \\qquad a\\ne 0,\\]\n\nis\n\n\\[x=\\frac{-b\\pm\\sqrt{b^2-4ac}}{2a}.\\]\n\nAnalogous, though more elaborate, formulas using radicals exist for every cubic and quartic equation.\n\nThe Abel–Ruffini theorem states that no corresponding radical formula exists for the general equation\n\n\\[a_nx^n+a_{n-1}x^{n-1}+\\cdots+a_1x+a_0=0\\]\n\nwhen \\(n\\ge 5\\).\n\nA precise formulation treats the coefficients as independent indeterminates. If\n\n\\[K=\\mathbb{Q}(a_0,a_1,\\ldots,a_n),\\]\n\nthen the general degree-\\(n\\) polynomial is not solvable by radicals over \\(K\\) for \\(n\\ge 5\\). This formulation concerns genuinely unrestricted coefficients, rather than a specially chosen family of equations.\n\nTwo distinctions are important:\n\n- There is no universal radical formula. A formula analogous to the quadratic formula cannot solve every equation of degree five or higher.\n- 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.\n\nHere “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."
    },
    {
      "heading": "Historical development",
      "text": "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.\n\nA 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.\n\nPaolo 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.\n\nNiels 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.\n\nÉ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."
    },
    {
      "heading": "The Galois-theoretic explanation",
      "text": "Root symmetries\n\nLet \\(f(x)\\) be a polynomial over a field \\(K\\) of characteristic zero. Its splitting field \\(L\\) is the smallest field extension containing all its roots.\n\nThe Galois group \\(\\operatorname{Gal}(L/K)\\) consists of the field automorphisms of \\(L\\) that fix every element of \\(K\\). Each automorphism permutes the roots while preserving all algebraic relations among them. Thus, the Galois group records the algebraic symmetries of the equation.\n\nThe central criterion is:\n\n\\[f \\text{ is solvable by radicals over }K \\quad\\Longleftrightarrow\\quad \\operatorname{Gal}(L/K)\\text{ is a solvable group}.\\]\n\nA 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.\n\nThe 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.\n\nWhy degree five is the threshold\n\nThe general degree-\\(n\\) polynomial has Galois group\n\n\\[S_n,\\]\n\nthe symmetric group of all permutations of \\(n\\) objects.\n\nThe groups \\(S_n\\) are solvable for \\(n\\le 4\\), but not for \\(n\\ge 5\\). The decisive obstruction is the alternating group \\(A_n\\), consisting of the even permutations. For \\(n\\ge 5\\), \\(A_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.\n\nConsequently,\n\n\\[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}.\\]\n\nThis gives a structural explanation for the failure of the centuries-long search for a general quintic radical formula."
    },
    {
      "heading": "A specific unsolvable quintic",
      "text": "Consider\n\n\\[f(x)=x^5-4x+2.\\]\n\nIts Galois group over \\(\\mathbb{Q}\\) is \\(S_5\\), so it is not solvable by radicals.\n\nFirst, Eisenstein’s criterion with the prime \\(2\\) proves that \\(f\\) is irreducible over \\(\\mathbb{Q}\\): every nonleading coefficient is divisible by \\(2\\), while the constant term is not divisible by \\(4\\). Its Galois group therefore acts transitively on its five roots.\n\nSecond, the polynomial has exactly three real roots. Its derivative is\n\n\\[f'(x)=5x^4-4,\\]\n\nso its only real critical points are \\(x=\\pm a\\), where\n\n\\[a=\\left(\\frac45\\right)^{1/4}.\\]\n\nAt these points,\n\n\\[f(-a)=2+\\frac{16a}{5}>0, \\qquad f(a)=2-\\frac{16a}{5}<0.\\]\n\nThe 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.\n\nComplex 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 \\(S_5\\), which is not solvable.\n\nThis example shows that radical impossibility applies to individual equations with small integer coefficients, not merely to a polynomial with symbolic coefficients."
    },
    {
      "heading": "Higher-degree equations that are solvable",
      "text": "Degree alone does not determine whether a particular equation is solvable by radicals.\n\nFor instance,\n\n\\[x^5-2=0\\]\n\nhas roots\n\n\\[x_k=2^{1/5}\\zeta_5^k, \\qquad k=0,1,2,3,4,\\]\n\nwhere \\(\\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.\n\nLikewise, 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.\n\nThus:\n\n- Being a quintic does not imply being unsolvable by radicals.\n- Being irreducible does not imply being unsolvable by radicals.\n- Radical solvability depends on the Galois group over the chosen coefficient field.\n\nThe last qualification matters because enlarging the coefficient field can change the Galois group and the available radical expressions."
    },
    {
      "heading": "What the theorem does not prohibit",
      "text": "Existence of roots\n\nThe 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.\n\nNumerical approximation\n\nThe theorem places no general barrier on approximating polynomial roots. Methods from numerical analysis, including Newton’s method, can approximate roots without producing radical expressions.\n\nTheir 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.\n\nOther exact representations\n\nThe 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.\n\nAn 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."
    }
  ],
  "links": [
    "algebra",
    "polynomial",
    "field-mathematics",
    "complex-number",
    "quadratic-equation",
    "rational-number",
    "permutation",
    "galois-theory",
    "field-extension",
    "abelian-group",
    "group-theory",
    "symmetric-group",
    "normal-subgroup",
    "derivative",
    "fundamental-theorem-of-algebra",
    "numerical-analysis",
    "newtons-method",
    "numerical-stability"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}