Jordan's theorem on primitive groups containing a transposition
ProvedFamousTheorems.jordan_primitive_transpositionJordan's theorem on primitive groups containing a transposition. Let be a finite set and a primitive permutation group. If contains a transposition, then .
This theorem of Jordan is used to prove that Galois groups are full symmetric groups. For example, an irreducible polynomial of prime degree with exactly two non-real roots has Galois group .
Formalization note. Mathlib's Equiv.Perm.subgroup_eq_top_of_isPreprimitive_of_isSwap_mem. Primitivity is MulAction.IsPreprimitive G α and a transposition is a permutation satisfying IsSwap.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem jordan_primitive_transposition {α : Type*} [DecidableEq α] [Finite α] {G : Subgroup (Equiv.Perm α)} (hG : MulAction.IsPreprimitive G α)
{g : Equiv.Perm α} (hg : g.IsSwap) (hgG : g ∈ G) : G = ⊤ := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Equiv.Perm.subgroup_eq_top_of_isPreprimitive_of_isSwap_mem`. Proof here reduces to that Mathlib result.