Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.1.b): the derived subgroup of a type P maximal subgroup is MFUM_FUMF​U with K≤NG(U)K\le N_G(U)K≤NG​(U)

Proved
OddOrder.BG.Ch4.S14.exists_kappaHall_invariant_complement_to_MF

by burkh4rt · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group which is a minimal simple group of odd order (IsMinimalSimpleOdd G). Let MMM be a maximal subgroup of GGG of type P, let K≤MK\le MK≤M be a cyclic subgroup that is a Hall κ(M)\kappa(M)κ(M)-subgroup of MMM (that is, K.subgroupOf M is a Hall subgroup for the prime set κ(M)\kappa(M)κ(M)). Then there is a subgroup U≤GU\le GU≤G such that

M′=MF⊔U,K≤NG(U),MF∩U=1,M'=M_F\sqcup U,\qquad K\le N_G(U),\qquad M_F\cap U=1,M′=MF​⊔U,K≤NG​(U),MF​∩U=1,

where M′M'M′ is the derived subgroup of MMM (taken inside GGG) and MFM_FMF​ is the maximal nilpotent normal Hall subgroup of MMM.

This is part of Peterfalvi (13.1.b): the derived subgroup of a type P maximal subgroup is a semidirect product MFUM_F UMF​U with complement UUU normalised by the cyclic κ\kappaκ-Hall subgroup KKK.

Formalization Note MFM_FMF​ is maxNilpotentNormalHall M, M′M'M′ is derivedInG M, and ⊔\sqcup⊔ is the join of subgroups; since MFM_FMF​ is normal in MMM and MF∩U=1M_F\cap U=1MF​∩U=1, the join is a semidirect product.

Preamble
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S14_TypePCounting_Basics
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S14_TypePCounting_LocalStructure
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S14_TypePCounting_SigmaLengthOne
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S14_TypePCounting_TypePDuality
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S14_TypePCounting_GlobalCounting
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S15_MF_SetupLemma151
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S15_MF_Theorem152Helpers
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S15_MF_Corollary155
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S15_MF_TIFailure
import Definitions.Def_OddOrder_BG_Ch4_FamilyOfMaximal_S15_MF_WitnessPGroup
import Definitions.Def_OddOrder_GroupTheory_AInvariantComplement
Formal statement
namespace OddOrder.BG.Ch4.S14

open OddOrder.GroupTheory

open OddOrder.Isaacs

open OddOrder.BG.Ch4.S15

variable {G : Type*} [Group G] [Finite G]

theorem exists_kappaHall_invariant_complement_to_MF (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    {M K : Subgroup G} (hM : M ∈ maximalSubgroups G) (hP : IsTypeP M) (hKM : K ≤ M)
    (hK : Ch03.IsHallSubgroup (kappa M) (K.subgroupOf M)) [IsCyclic ↥K] :
    ∃ U : Subgroup G, derivedInG M = maxNilpotentNormalHall M ⊔ U ∧
      K ≤ Subgroup.normalizer (U : Set G) ∧ maxNilpotentNormalHall M ⊓ U = ⊥ := by sorry

end OddOrder.BG.Ch4.S14
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/BG/Ch4_FamilyOfMaximal/S14_TypePComplement.lean#L30-L90

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me