Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The commutator subgroup of Sₙ is Aₙ

Proved
FamousTheorems.commutator_symmetric_alternating_7b

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

The commutator subgroup of SnS_nSn​ is AnA_nAn​. Let α\alphaα be a finite set with at least 555 elements. Then the commutator subgroup [Sym⁡(α),Sym⁡(α)][\operatorname{Sym}(\alpha),\operatorname{Sym}(\alpha)][Sym(α),Sym(α)] is the alternating group A(α)A(\alpha)A(α).

Equivalently, the abelianization of SnS_nSn​ is {±1}\{\pm1\}{±1}, given by the sign. This is part of the proof that SnS_nSn​ is not solvable for n≥5n\ge5n≥5, since AnA_nAn​ is then perfect and nontrivial. Via Galois theory, it is the source of the insolvability of the general quintic by radicals. The statement in fact holds for all nnn, and Mathlib proves it under the assumption n≥5n\ge5n≥5.

Formalization note. Mathlib's alternatingGroup.commutator_perm_eq. commutator G is the subgroup of GGG generated by all commutators.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem commutator_symmetric_alternating_7b {α : Type*} [Fintype α] [DecidableEq α] (h : 5 ≤ Nat.card α) :
    commutator (Equiv.Perm α) = alternatingGroup α := by sorry

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