Minimal -invariant normal subgroups are elementary abelian
DefinitionOddOrder_GroupTheory_MinimalInvariantNormalfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
For a finite solvable group with an action , a nontrivial has a nontrivial -invariant normal subgroup that is elementary abelian (exists_aInvariant_normal_isElementaryAbelian). This is the existence input driving the chief-series induction for Peterfalvi (9.1). It consists of lemmas only.
The bundle consists of lemmas only.
The bundle also proves 6 supporting lemmas used by later statements.
Definition code
/-
Copyright (c) 2026 Yawara Ishida. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yawara Ishida
-/
-- From github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0; LICENSE at that commit):
-- OddOrder/GroupTheory/MinimalInvariantNormal.lean
-- Generated for Prove2Me by deleting declarations; the remaining commands are verbatim except:
-- `private` dropped where another file uses the declaration, and a solution's main theorem
-- renamed `_root_.solution` (platform convention).
import Definitions.Def_OddOrder_Isaacs_Ch03_SplitExtensions_Main
import Definitions.Def_OddOrder_GroupTheory_ElementaryAbelian
import Mathlib.GroupTheory.GroupAction.ConjAct
namespace OddOrder.GroupTheory
open OddOrder.Isaacs.Ch03 (IsAInvariant isAInvariant_iff_smul_mem)
open scoped commutatorElement
variable {L H : Type*} [Group L] [Group H] {φ : L →* MulAut H}
/-- A subgroup `K ≤ ↥N` invariant under the restricted action `hN.restrict` maps, via `N.subtype`,
to an `L`-invariant subgroup of `H`. -/
theorem aInvariant_map_subtype_of_restrict {N : Subgroup H} (hN : IsAInvariant φ N)
{K : Subgroup ↥N} (hK : IsAInvariant hN.restrict K) :
IsAInvariant φ (K.map N.subtype) := by
rw [isAInvariant_iff_smul_mem]
rintro l _ ⟨k, hk, rfl⟩
exact ⟨(hN.restrict l) k, hK.smul_mem l hk, IsAInvariant.restrict_apply_val hN l k⟩
/-- A *characteristic* subgroup `K` of an `L`-invariant normal subgroup `N ◁ H` maps to a subgroup
of `H` that is simultaneously `L`-invariant, normal in `H`, and contained in `N`. -/
theorem aInvariant_normal_map_of_characteristic {N : Subgroup H} [N.Normal]
(hN : IsAInvariant φ N) (K : Subgroup ↥N) [K.Characteristic] :
IsAInvariant φ (K.map N.subtype) ∧ (K.map N.subtype).Normal ∧ K.map N.subtype ≤ N :=
⟨aInvariant_map_subtype_of_restrict hN (IsAInvariant.of_characteristic hN.restrict),
ConjAct.normal_of_characteristic_of_normal, Subgroup.map_subtype_le K⟩
/-- **Minimal nontrivial `L`-invariant normal subgroup.** A nontrivial finite group
with an `L`-action has a minimal nontrivial normal subgroup invariant under that action. -/
theorem exists_minimal_aInvariant_normal [Finite H] [Nontrivial H] :
∃ N : Subgroup H, N ≠ ⊥ ∧ N.Normal ∧ IsAInvariant φ N ∧
∀ M : Subgroup H, M.Normal → IsAInvariant φ M → M ≤ N → M ≠ ⊥ → N ≤ M := by
classical
set S : Set (Subgroup H) := {N | N ≠ ⊥ ∧ N.Normal ∧ IsAInvariant φ N}
have hS_ne : S.Nonempty := ⟨⊤, top_ne_bot, inferInstance, IsAInvariant.top φ⟩
obtain ⟨N, ⟨hN_ne, hN_normal, hN_inv⟩, hN_min⟩ := (Set.toFinite S).exists_minimal hS_ne
refine ⟨N, hN_ne, hN_normal, hN_inv, ?_⟩
intro M hM_normal hM_inv hM_le hM_ne
exact hN_min ⟨hM_ne, hM_normal, hM_inv⟩ hM_le
/-- A minimal nontrivial `L`-invariant normal subgroup of a finite solvable group is
commutative. -/
theorem isMulCommutative_of_minimal_aInvariant_normal [Finite H] [Group.IsSolvable H]
{N : Subgroup H} [N.Normal]
(hN_inv : IsAInvariant φ N)
(hN_ne_bot : N ≠ ⊥)
(hN_min : ∀ M : Subgroup H, M.Normal → IsAInvariant φ M → M ≤ N → M ≠ ⊥ → N ≤ M) :
IsMulCommutative N := by
have hcomm_lt : ⁅N, N⁆ < N := Group.IsSolvable.commutator_lt_of_ne_bot hN_ne_bot
have hcomm_bot : (⁅N, N⁆ : Subgroup H) = ⊥ := by
by_contra hcomm_ne_bot
have hN_le_comm : N ≤ ⁅N, N⁆ :=
hN_min ⁅N, N⁆ (Subgroup.commutator_normal N N)
(hN_inv.commutator hN_inv) hcomm_lt.le hcomm_ne_bot
exact hcomm_lt.not_ge hN_le_comm
rw [Subgroup.commutator_eq_bot_iff_le_centralizer] at hcomm_bot
refine IsMulCommutative.of_comm ?_
intro x y
have hx_cent : (x : H) ∈ Subgroup.centralizer N := hcomm_bot x.2
rw [Subgroup.mem_centralizer_iff] at hx_cent
exact Subtype.ext ((hx_cent y y.2).symm)
/-- A minimal nontrivial `L`-invariant normal subgroup of a finite solvable group is a
`p`-group for some prime `p`. -/
theorem exists_prime_isPGroup_of_minimal_aInvariant_normal [Finite H] [Group.IsSolvable H]
{N : Subgroup H} [N.Normal]
(hN_inv : IsAInvariant φ N)
(hN_ne_bot : N ≠ ⊥)
(hN_min : ∀ M : Subgroup H, M.Normal → IsAInvariant φ M → M ≤ N → M ≠ ⊥ → N ≤ M) :
∃ p : ℕ, p.Prime ∧ IsPGroup p N := by
classical
have hN_comm : IsMulCommutative N :=
isMulCommutative_of_minimal_aInvariant_normal hN_inv hN_ne_bot hN_min
have hN_card_ne_one : Nat.card N ≠ 1 := by
intro hcard
exact hN_ne_bot ((Subgroup.eq_bot_iff_card N).mpr hcard)
obtain ⟨p, hp_prime, hp_dvd⟩ := Nat.exists_prime_and_dvd hN_card_ne_one
have hpFact : Fact p.Prime := ⟨hp_prime⟩
let P : Sylow p N := default
have hP_normal : (P : Subgroup N).Normal :=
Subgroup.normal_of_isMulCommutative (P : Subgroup N)
have hP_char : (P : Subgroup N).Characteristic :=
Sylow.characteristic_of_normal P hP_normal
let Pmap : Subgroup H := (P : Subgroup N).map N.subtype
obtain ⟨hPmap_inv, hPmap_normal, hPmap_le_N⟩ :=
aInvariant_normal_map_of_characteristic hN_inv (P : Subgroup N)
have hP_ne_bot : (P : Subgroup N) ≠ ⊥ := P.ne_bot_of_dvd_card hp_dvd
have hPmap_ne_bot : Pmap ≠ ⊥ := by
intro hbot
apply hP_ne_bot
have hmap_bot : (P : Subgroup N).map N.subtype = ⊥ := by
simpa [Pmap] using hbot
exact (Subgroup.map_eq_bot_iff_of_injective _ N.subtype_injective).mp hmap_bot
have hN_le_Pmap : N ≤ Pmap :=
hN_min Pmap hPmap_normal hPmap_inv hPmap_le_N hPmap_ne_bot
have hPmap_eq_N : Pmap = N := le_antisymm hPmap_le_N hN_le_Pmap
have hP_eq_top : (P : Subgroup N) = ⊤ := by
apply (Subgroup.map_subtype_inj (H := N)).mp
have htop_map : (⊤ : Subgroup N).map N.subtype = N := by
rw [← MonoidHom.range_eq_map, Subgroup.range_subtype]
calc
(P : Subgroup N).map N.subtype = N := by simpa [Pmap] using hPmap_eq_N
_ = (⊤ : Subgroup N).map N.subtype := htop_map.symm
obtain ⟨n, hnP⟩ := (IsPGroup.iff_card (p := p) (G := P)).mp P.2
have hcardN : Nat.card N = p ^ n := by
have hcardP : Nat.card P = Nat.card N := by
rw [hP_eq_top, Subgroup.card_top]
rwa [← hcardP]
exact ⟨p, hp_prime, (IsPGroup.iff_card (p := p) (G := N)).mpr ⟨n, hcardN⟩⟩
/-- **Existence of an elementary-abelian `L`-invariant normal subgroup.** A nontrivial finite
solvable group `H` carrying an action `φ : L →* MulAut H` has a nontrivial `L`-invariant normal
subgroup `N ◁ H` that is elementary abelian (of some prime exponent `p`). -/
theorem exists_aInvariant_normal_isElementaryAbelian [Finite H] [Group.IsSolvable H]
[Nontrivial H] :
∃ (N : Subgroup H) (p : ℕ), p.Prime ∧ N ≠ ⊥ ∧ N.Normal ∧ IsAInvariant φ N ∧
IsElementaryAbelian p ↥N := by
classical
obtain ⟨N, hN_ne, hN_normal, hN_inv, hN_min⟩ :=
exists_minimal_aInvariant_normal (φ := φ)
-- Minimality kill: an `L`-invariant normal subgroup `≤ N` is either trivial or all of `N`.
have hkill : ∀ M : Subgroup H, M.Normal → IsAInvariant φ M → M ≤ N → M = ⊥ ∨ M = N := by
intro M hMnorm hMinv hMle
by_cases hM0 : M = ⊥
· exact Or.inl hM0
· exact Or.inr (le_antisymm hMle (hN_min M hMnorm hMinv hMle hM0))
have : N.Normal := hN_normal
have : Nontrivial ↥N := (Subgroup.nontrivial_iff_ne_bot N).mpr hN_ne
have : Group.IsSolvable ↥N := inferInstance
-- Step 1: `↥N` is abelian.
have hN_comm : IsMulCommutative ↥N :=
isMulCommutative_of_minimal_aInvariant_normal hN_inv hN_ne hN_min
have hab : ∀ x y : ↥N, x * y = y * x := fun x y => hN_comm.is_comm.comm x y
-- Step 2: `↥N` has prime exponent `p` (the subgroup of `p`-th powers is trivial).
let : CommGroup ↥N := { (inferInstance : Group ↥N) with mul_comm := hab }
obtain ⟨p, hp, hN_pgroup⟩ :=
exists_prime_isPGroup_of_minimal_aInvariant_normal hN_inv hN_ne hN_min
have : Fact p.Prime := ⟨hp⟩
obtain ⟨n, hN_card⟩ := (IsPGroup.iff_card (p := p) (G := N)).mp hN_pgroup
have hpdvd : p ∣ Nat.card N := by
rw [hN_card]
exact dvd_pow_self p (by
intro hn
have hcard_one : Nat.card N = 1 := by
simpa [hn] using hN_card
exact hN_ne ((Subgroup.eq_bot_iff_card N).mpr hcard_one))
refine ⟨N, p, hp, hN_ne, hN_normal, hN_inv, hab, fun x => ?_⟩
-- The subgroup of `p`-th powers `(powMonoidHom p).range` is characteristic.
have hPchar : ((powMonoidHom p).range : Subgroup ↥N).Characteristic := by
rw [Subgroup.characteristic_iff_map_le]
rintro ϕ _ ⟨_, ⟨z, rfl⟩, rfl⟩
exact ⟨ϕ z, by simp only [powMonoidHom_apply, map_pow, MulEquiv.coe_toMonoidHom]⟩
have := hPchar
obtain ⟨hinv, hnorm, hle⟩ :=
aInvariant_normal_map_of_characteristic hN_inv ((powMonoidHom p).range)
rcases hkill _ hnorm hinv hle with h | h
· -- `(p`-th powers`).map = ⊥` ⟹ `p`-th powers trivial ⟹ `x ^ p = 1`.
have hbot : ((powMonoidHom p).range : Subgroup ↥N) = ⊥ :=
Subgroup.map_injective N.subtype_injective (by rw [h, Subgroup.map_bot])
have hxp : x ^ p ∈ ((powMonoidHom p).range : Subgroup ↥N) := ⟨x, rfl⟩
rw [hbot, Subgroup.mem_bot] at hxp
exact hxp
· -- `(p`-th powers`).map = N` ⟹ powering is surjective, hence injective, contradicting Cauchy.
exfalso
have htop : ((powMonoidHom p).range : Subgroup ↥N) = ⊤ :=
Subgroup.map_injective N.subtype_injective
(by rw [h, ← MonoidHom.range_eq_map, N.range_subtype])
have hsurj : Function.Surjective (powMonoidHom p : ↥N →* ↥N) :=
MonoidHom.range_eq_top.mp htop
have hinj : Function.Injective (powMonoidHom p : ↥N →* ↥N) :=
Finite.injective_iff_surjective.mpr hsurj
have : Fintype ↥N := Fintype.ofFinite _
obtain ⟨g, hg⟩ :=
exists_prime_orderOf_dvd_card p (by rwa [Nat.card_eq_fintype_card] at hpdvd)
have hgp : (powMonoidHom p : ↥N →* ↥N) g = (powMonoidHom p : ↥N →* ↥N) 1 := by
simp only [powMonoidHom_apply, one_pow]
rw [← hg]; exact pow_orderOf_eq_one g
have hg1 : g = 1 := hinj hgp
rw [hg1, orderOf_one] at hg
exact hp.ne_one hg.symm
end OddOrder.GroupTheory
Source
Yawara Ishida, Lean 4 formalization of the Feit–Thompson (odd order) theorem, github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0), https://github.com/yawara/odd-order/blob/20a6fccbb63c0b138acda9f7fafd798c42f9441b/OddOrder/GroupTheory/MinimalInvariantNormal.lean