Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Isaacs 7.1, Step 2: G/UG/UG/U has a normal ppp-complement for maximal bad UUU

Proved
OddOrder.Isaacs.Ch07.maximal_badNormalizer_quotient_hasNormalPComplement

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Say that GGG satisfies the Thompson local hypothesis at ppp (HasThompsonPComplementHypothesis p G) if for every Sylow ppp-subgroup PPP of GGG, both CG(Z(P))C_G(Z(P))CG​(Z(P)) and NG(J(P))N_G(J(P))NG​(J(P)) have a normal ppp-complement (HasNormalPComplement; a normal subgroup that complements every Sylow ppp-subgroup). Call a subgroup U≤GU\le GU≤G bad (IsBadNormalizerPSubgroup p U) if U≠1U\neq 1U=1, UUU is a ppp-group, and NG(U)N_G(U)NG​(U) has no normal ppp-complement. For a subgroup XXX, let w(X)w(X)w(X) (normalizerPPart p X) denote the ppp-part of ∣NG(X)∣|N_G(X)|∣NG​(X)∣, i.e. pvp(∣NG(X)∣)p^{v_p(|N_G(X)|)}pvp​(∣NG​(X)∣).

Let GGG be a finite group and ppp a prime. Assume the induction hypothesis: every finite group HHH (same universe) with ∣H∣<∣G∣|H|<|G|∣H∣<∣G∣ satisfying the Thompson local hypothesis at ppp has a normal ppp-complement. Let U⊴GU\trianglelefteq GU⊴G be a normal bad subgroup with w(X)≤w(U)w(X)\le w(U)w(X)≤w(U) for every bad XXX, and ∣X∣≤∣U∣|X|\le|U|∣X∣≤∣U∣ for every bad XXX with w(X)=w(U)w(X)=w(U)w(X)=w(U). Then

G/U has a normal p-complement.G/U\ \text{has a normal } p\text{-complement.}G/U has a normal p-complement.

This is Step 2 in the proof of Isaacs's Theorem 7.1.

Preamble
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B2_NormalJ_PComplement
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7C_ThompsonPComplement
Formal statement
namespace OddOrder.Isaacs.Ch07

open scoped Pointwise

variable {G : Type*} [Group G]

section MinimalCounterexampleStepTwo

theorem maximal_badNormalizer_quotient_hasNormalPComplement.{u}
    {G : Type u} [Group G] [Finite G] {p : ℕ} [Fact p.Prime]
    (ih : ∀ (H : Type u) [Group H] [Finite H],
      Nat.card H < Nat.card G →
      HasThompsonPComplementHypothesis p H →
      OddOrder.Isaacs.Ch05.HasNormalPComplement p H)
    {U : Subgroup G} [U.Normal]
    (hU_bad : IsBadNormalizerPSubgroup p U)
    (hU_weight_max : ∀ X : Subgroup G, IsBadNormalizerPSubgroup p X →
      normalizerPPart p X ≤ normalizerPPart p U)
    (hU_card_max : ∀ X : Subgroup G, IsBadNormalizerPSubgroup p X →
      normalizerPPart p X = normalizerPPart p U → Nat.card X ≤ Nat.card U) :
    OddOrder.Isaacs.Ch05.HasNormalPComplement p (G ⧸ U) := by sorry

end MinimalCounterexampleStepTwo

end OddOrder.Isaacs.Ch07
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/Isaacs/Ch07_ThompsonSubgroup/S7C_ThompsonPComplement.lean#L720-L848

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