The alternating group is generated by 3-cycles
ProvedFamousTheorems.alternating_generated_by_three_cycles_7bThe alternating group is generated by 3-cycles. Let be a finite set. The subgroup of generated by the -cycles is the alternating group of even permutations.
This is the standard generating set of . It is the key step in the proof that is simple for : a nontrivial normal subgroup is shown to contain one -cycle, then all of them by conjugation. The proof writes each product of two transpositions as a product of -cycles, using and .
Formalization note. Mathlib's Equiv.Perm.closure_three_cycles_eq_alternating. σ.IsThreeCycle says that is a cycle of length , and alternatingGroup α is the kernel of the sign homomorphism.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem alternating_generated_by_three_cycles_7b (α : Type*) [Fintype α] [DecidableEq α] :
Subgroup.closure {σ : Equiv.Perm α | σ.IsThreeCycle} = alternatingGroup α := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Equiv.Perm.closure_three_cycles_eq_alternating`. Proof here reduces to that Mathlib result.