Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Isaacs 7.1, Step 4: a Sylow ppp-subgroup is maximal in a minimal counterexample

Proved
OddOrder.Isaacs.Ch07.sylow_isCoatom_of_minimal_counterexample

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).

Let GGG be a finite group, ppp a prime, PPP a Sylow ppp-subgroup of GGG. Assume: GGG satisfies the Thompson local hypothesis at ppp; every finite group HHH (same universe) with ∣H∣<∣G∣|H|<|G|∣H∣<∣G∣ satisfying it has a normal ppp-complement; GGG has no normal ppp-complement; and G/Op(G)G/O_p(G)G/Op​(G) has a normal ppp-complement. Then

P is a maximal proper subgroup of G.P\ \text{is a maximal proper subgroup of } G .P is a maximal proper subgroup of G.

This is Step 4 in the minimal-counterexample proof of Isaacs's Theorem 7.1.

Formalization Note. Maximality is IsCoatom (P : Subgroup G).

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

variable {G : Type*} [Group G]

section MinimalCounterexampleStepFour

theorem sylow_isCoatom_of_minimal_counterexample.{u}
    {G : Type u} [Group G] [Finite G] {p : ℕ} [Fact p.Prime]
    (P : Sylow p G) (hHyp : HasThompsonPComplementHypothesis p G)
    (ih : ∀ (H : Type u) [Group H] [Finite H],
      Nat.card H < Nat.card G →
      HasThompsonPComplementHypothesis p H →
      OddOrder.Isaacs.Ch05.HasNormalPComplement p H)
    (hG : ¬ OddOrder.Isaacs.Ch05.HasNormalPComplement p G)
    (hQuotient : OddOrder.Isaacs.Ch05.HasNormalPComplement p
      (G ⧸ OddOrder.Isaacs.Ch01.opCore p G)) :
    IsCoatom (P : Subgroup G) := by sorry

end MinimalCounterexampleStepFour

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_SylowMaximal.lean#L35-L116

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