Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.16): V∩NG(W1)=1V\cap N_G(W_1)=1V∩NG​(W1​)=1 from coprimality data

Proved
OddOrder.Peterfalvi.S15.normalizer_V_inf_W1_eq_bot_of_data

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a minimal simple group of odd order (IsMinimalSimpleOdd G), and let hyp : Hypothesis be the Peterfalvi (13.1) configuration for GGG: two maximal subgroups S,TS,TS,T with W=S∩T=W1W2W=S\cap T=W_1W_2W=S∩T=W1​W2​ cyclic, ∣W1∣=q|W_1|=q∣W1​∣=q, ∣W2∣=p|W_2|=p∣W2​∣=p (p,qp,qp,q odd primes), P=SFP=S_FP=SF​ and Q=TFQ=T_FQ=TF​ the maximal nilpotent normal Hall subgroups, complements U,VU,VU,V with S′=PUS'=PUS′=PU, T′=QVT'=QVT′=QV, C=CU(P)C=C_U(P)C=CU​(P), D=CV(Q)D=C_V(Q)D=CV​(Q), ∣U∣=uc|U|=uc∣U∣=uc, ∣V∣=vd|V|=vd∣V∣=vd, together with the associated character grids ηij\eta_{ij}ηij​, μij\mu_{ij}μij​, νij\nu_{ij}νij​ (i<qi<qi<q, j<pj<pj<p). Assume TTT is of type II, that gcd⁡(∣Q∣,∣V⊔W2∣)=1\gcd(|Q|,|V\sqcup W_2|)=1gcd(∣Q∣,∣V⊔W2​∣)=1, that QQQ is an elementary abelian qqq-group, and that V∩CG(Q)=1V\cap C_G(Q)=1V∩CG​(Q)=1. Then

V∩NG(W1)=1.V\cap N_G(W_1)=1 .V∩NG​(W1​)=1.

This assembles the W1W_1W1​-side core of (13.16) from the crux NV(W1)≤CG(W1)N_V(W_1)\le C_G(W_1)NV​(W1​)≤CG​(W1​) using coprime action on the abelian group QQQ.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

variable {G : Type*} [Group G]

theorem normalizer_V_inf_W1_eq_bot_of_data [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) (hyp : Hypothesis (G := G))
    (hTTypeII : IsTypeII hyp.T)
    (hcop : Nat.Coprime (Nat.card ↥hyp.Q) (Nat.card ↥(hyp.V ⊔ hyp.W2)))
    (hQ_elemAb : IsElementaryAbelian hyp.q ↥hyp.Q)
    (hDbot : hyp.V ⊓ Subgroup.centralizer (hyp.Q : Set G) = ⊥) :
    hyp.V ⊓ Subgroup.normalizer (hyp.W1 : Set G) = ⊥ := by sorry

end OddOrder.Peterfalvi.S15
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/Peterfalvi/S15_SAndTBasic.lean#L424-L587

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