Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The symmetric group S₅ is not solvable

Proved
FamousTheorems.symmetric_group_five_not_solvable_6c

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

The symmetric group S5S_5S5​ is not solvable. The group of permutations of a 555-element set is not solvable: its derived series never reaches the trivial group.

Galois theory turns this into the unsolvability of the general quintic by radicals (Abel–Ruffini), because the Galois group of the generic quintic is S5S_5S5​. The derived subgroup of S5S_5S5​ is the simple group A5A_5A5​, which is its own derived subgroup.

Formalization note. Mathlib's Equiv.Perm.not_isSolvable_fin_5. S5S_5S5​ is Equiv.Perm (Fin 5), and Group.IsSolvable G means that some term of the derived series of GGG is trivial.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem symmetric_group_five_not_solvable_6c : ¬Group.IsSolvable (Equiv.Perm (Fin 5)) := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Equiv.Perm.not_isSolvable_fin_5`. 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