Jordan's theorem on primitive groups containing a 3-cycle
ProvedFamousTheorems.jordan_primitive_three_cycleJordan's theorem on primitive groups containing a 3-cycle. Let be a finite set and a primitive permutation group. If contains a 3-cycle, then contains the alternating group .
With the transposition case, this is a classical criterion for recognising the full symmetric and alternating groups. It is used in computing Galois groups and in the study of multiply transitive groups.
Formalization note. Mathlib's Equiv.Perm.alternatingGroup_le_of_isPreprimitive_of_isThreeCycle_mem. Primitivity is MulAction.IsPreprimitive G α, and IsThreeCycle says that the permutation is a 3-cycle.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem jordan_primitive_three_cycle {α : Type*} [Fintype α] [DecidableEq α] {G : Subgroup (Equiv.Perm α)} (hG : MulAction.IsPreprimitive G α)
{g : Equiv.Perm α} (hg : g.IsThreeCycle) (hgG : g ∈ G) : alternatingGroup α ≤ G := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Equiv.Perm.alternatingGroup_le_of_isPreprimitive_of_isThreeCycle_mem`. Proof here reduces to that Mathlib result.