Simplicity of the alternating group A_n for n ≥ 5
ProvedFamousTheorems.alternating_group_simpleSimplicity of the alternating group for . Let be a finite set with at least elements. Then the alternating group of even permutations of is a simple group.
Galois discovered this for , and it is the group-theoretic reason for the insolubility of the general quintic (Abel–Ruffini). The groups , , form one of the infinite families in the classification of finite simple groups. is not simple: it has the Klein four-group as a normal subgroup.
Formalization note. Mathlib's alternatingGroup.isSimpleGroup. alternatingGroup α is the kernel of the sign homomorphism on Equiv.Perm α, and IsSimpleGroup means nontrivial with no normal subgroups other than ⊥ and ⊤.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem alternating_group_simple {α : Type*} [DecidableEq α] [Fintype α] (h : 5 ≤ Nat.card α) : IsSimpleGroup (alternatingGroup α) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `alternatingGroup.isSimpleGroup`. Proof here reduces to that Mathlib result.