Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Isaacs 7.1, Step 6: 222-subgroups are abelian in a minimal counterexample, p≠2p\ne2p=2

Proved
OddOrder.Isaacs.Ch07.twoSubgroups_commutative_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, p≠2p\neq 2p=2 a prime, PPP a Sylow ppp-subgroup, and assume: GGG satisfies the Thompson local hypothesis at ppp; the induction hypothesis that every finite group HHH (in the same universe) with ∣H∣<∣G∣|H|<|G|∣H∣<∣G∣ satisfying the Thompson local hypothesis at ppp 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

∀S≤G,  S a 2-group ⟹ S is abelian.\forall S\le G,\ \ S\ \text{a }2\text{-group}\ \Longrightarrow\ S\ \text{is abelian.}∀S≤G,  S a 2-group ⟹ S is abelian.

This is Step 6 of the proof of Isaacs's Theorem 7.1, supplying the abelian-222-subgroup hypothesis of Theorem 7.6.

Formalization Note. The Sylow subgroup PPP is an argument of the theorem but does not occur in the conclusion; "222-group" is IsPGroup 2 S.

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

open scoped IsMulCommutative

section MinimalCounterexampleStepSix

theorem twoSubgroups_commutative_of_minimal_counterexample.{u}
    {G : Type u} [Group G] [Finite G] {p : ℕ} [Fact p.Prime]
    (P : Sylow p G) (hp2 : p ≠ 2)
    (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)) :
    ∀ S : Subgroup G, IsPGroup 2 S →
      ∀ x y : ↥S, x * y = y * x := by sorry

end MinimalCounterexampleStepSix

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_AbelianQuotientComplement.lean#L225-L318

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