Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Isaacs 7.6, Step 5: ∣Aˉ∣=p|\bar A|=p∣Aˉ∣=p, i.e. ∣A:A∩Op(G)∣=p|A:A\cap O_p(G)|=p∣A:A∩Op​(G)∣=p

Proved
OddOrder.Isaacs.Ch07.step5_Abar_card_eq_p

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group and ppp a prime. Write Op(G)O_p(G)Op​(G) for the largest normal ppp-subgroup (opCore p G), Op′(G)O_{p'}(G)Op′​(G) for the largest normal p′p'p′-subgroup (oPiCore {q | q ≠ p} G), and Z(⋅)Z(\cdot)Z(⋅) for the center, viewed as a subgroup of GGG. Put U=Op(G)U=O_p(G)U=Op​(G).

Assume p≠2p\ne 2p=2, GGG is ppp-separable, every 222-subgroup of GGG is abelian, Op′(G)=1O_{p'}(G)=1Op′​(G)=1, PPP is a Sylow ppp-subgroup of GGG with CG(Z(P))=PC_G(Z(P))=PCG​(Z(P))=P, together with the induction hypothesis ih: for every finite group HHH (in the same universe as GGG) with ∣H∣<∣G∣|H|<|G|∣H∣<∣G∣ that is ppp-separable, has all 222-subgroups abelian and Op′(H)=1O_{p'}(H)=1Op′​(H)=1, and for every Sylow ppp-subgroup QQQ of HHH with CH(Z(Q))=QC_H(Z(Q))=QCH​(Z(Q))=Q, the Thompson subgroup J(Q)J(Q)J(Q) is normal in HHH. Let A∈E(P)A\in E(P)A∈E(P) with A≰UA\not\le UA≤U and UA=PUA=PUA=P. Then

∣A:A∩U∣=p,|A : A\cap U| = p ,∣A:A∩U∣=p,

that is, the image Aˉ\bar AAˉ of AAA in G/UG/UG/U has order ppp.

This is Step 5 of the proof of Isaacs's Theorem 7.6: Aˉ\bar AAˉ acts faithfully and coprimely on Op′(G/U)O_{p'}(G/U)Op′​(G/U), and Lemma 6.20 forces it to be cyclic of order ppp.

Formalization Note. Op(G)O_p(G)Op​(G) appears both as opCore p G and as oPiCore {p} G (the π\piπ-core for π={p}\pi=\{p\}π={p}); Subgroup.relIndex H K is the index ∣K:H∩K∣|K : H\cap K|∣K:H∩K∣. "ppp-separable" is the instance IsPiSeparable {p} G. E(P)E(P)E(P) is maxElemAbelianIn P p, the elementary abelian ppp-subgroups of PPP of maximal order, and J(P)J(P)J(P) is Subgroup.thompsonJ P p, the subgroup they generate.

Preamble
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7A2_NormalPThm75
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B1_NormalJ_Setup
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B2_NormalJClose
Formal statement
namespace OddOrder.Isaacs.Ch07

open scoped commutatorElement

open scoped Pointwise

variable {G : Type*} [Group G]

theorem step5_Abar_card_eq_p.{u}
    {G : Type u} [Group G] [Finite G]
    {p : ℕ} [Fact p.Prime] (P : Sylow p G)
    (hp2 : p ≠ 2)
    (h_pSolvable : OddOrder.Isaacs.Ch03.IsPiSeparable ({p} : Set ℕ) G)
    (h2abelian : ∀ S : Subgroup G, IsPGroup 2 S → ∀ x y : ↥S, x * y = y * x)
    (h_oPiPrime_trivial : OddOrder.Isaacs.Ch03.oPiCore {q | q ≠ p} G = ⊥)
    (h_centralizer_center :
       Subgroup.centralizer
         (((Subgroup.center (P : Subgroup G)).map (P : Subgroup G).subtype) : Set G)
         = (P : Subgroup G))
    (ih : ∀ (H : Type u) [Group H] [Finite H]
      [OddOrder.Isaacs.Ch03.IsPiSeparable ({p} : Set ℕ) H],
      Nat.card H < Nat.card G →
      (∀ S : Subgroup H, IsPGroup 2 S → ∀ x y : ↥S, x * y = y * x) →
      OddOrder.Isaacs.Ch03.oPiCore {q | q ≠ p} H = ⊥ →
      ∀ (Q : Sylow p H),
        Subgroup.centralizer
            (((Subgroup.center (Q : Subgroup H)).map
              (Q : Subgroup H).subtype) : Set H)
          = (Q : Subgroup H) →
        (Subgroup.thompsonJ (Q : Subgroup H) p).Normal)
    {A : Subgroup G}
    (hA_mem : A ∈ Subgroup.maxElemAbelianIn (P : Subgroup G) p)
    (hA_not_le : ¬ A ≤ OddOrder.Isaacs.Ch01.opCore p G)
    (h_P_eq_UA : OddOrder.Isaacs.Ch01.opCore p G ⊔ A = (P : Subgroup G)) :
    (OddOrder.Isaacs.Ch01.opCore p G).relIndex A = p := by sorry

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/S7B2_NormalJClose.lean#L685-L853

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