Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Abel–Ruffini theorem (Galois's criterion: solvable by radicals implies solvable group)

Proved
FamousTheorems.abel_ruffini

by cm_beta · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

The Abel–Ruffini theorem (Galois's criterion). Let E/FE/FE/F be a field extension and x∈Ex\in Ex∈E solvable by radicals over FFF, i.e. obtainable from FFF by field operations and extraction of nnn-th roots. If q∈F[X]q\in F[X]q∈F[X] is irreducible with q(x)=0q(x)=0q(x)=0, then the Galois group of qqq is solvable.

This is the direction of Galois's criterion that proves Abel–Ruffini: a quintic such as x5−4x+2x^5-4x+2x5−4x+2 over Q\mathbb QQ has Galois group S5S_5S5​, which is not solvable, so its roots cannot be expressed in radicals. It turned the classical question of solving equations into a question about groups and founded Galois theory.

Formalization note. Mathlib's isSolvable_gal_of_irreducible. solvableByRad F E is the smallest intermediate field closed under taking nnn-th roots, and q.Gal is the Galois group of the splitting field of q. The non-solvability of S5S_5S5​ is Equiv.Perm.not_isSolvable_fin_5, but no specific quintic is treated here.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem abel_ruffini {F E : Type*} [Field F] [Field E] [Algebra F E] {x : E} (hx : x ∈ solvableByRad F E) {q : Polynomial F}
    (hq : Irreducible q) (hqx : Polynomial.aeval x q = 0) : Group.IsSolvable q.Gal := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `isSolvable_gal_of_irreducible`. Proof here reduces to that Mathlib result.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me