Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.19.c): the two pairings at ζ0\zeta_0ζ0​ have odd sum when c=1c=1c=1

Proved
OddOrder.Peterfalvi.S15.typeI_caseC_parity_of_c_eq_one

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 no maximal subgroup of GGG is of type V and c=1c=1c=1. Let L≤GL\le GL≤G be a subgroup carrying dataL : TypeICoherent78Data L (type I coherence data with (7.8) bookkeeping; its characters are ζ0,…\zeta_0,\dotsζ0​,…, its coherent extension is τ1=\tau_1=τ1​= dataL.coh.extension, and e=[L:LF]e=[L:L_F]e=[L:LF​] with LF=L_F=LF​= maxNilpotentNormalHall L). Then there exist integers nS,nLn_S,n_LnS​,nL​ such that

⟨βSτ, ζ0τ1⟩=nS,⟨βLτ(ζ0), η01⟩=nL,nS+nL odd,\langle \beta_S^{\tau},\ \zeta_0^{\tau_1}\rangle=n_S,\qquad \langle \beta_L^{\tau}(\zeta_0),\ \eta_{01}\rangle=n_L,\qquad n_S+n_L\ \text{odd},⟨βSτ​, ζ0τ1​​⟩=nS​,⟨βLτ​(ζ0​), η01​⟩=nL​,nS​+nL​ odd,

where βSτ=\beta_S^\tau=βSτ​= tauSbetaGrid hG hyp, βLτ(⋅)=\beta_L^\tau(\cdot)=βLτ​(⋅)= typeIBetaL dataL.typeIHyp and η01=η0,1\eta_{01}=\eta_{0,1}η01​=η0,1​.

This is the parity core of (13.19.c), a step in the case analysis for type I subgroups in Section 13.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_BridgeCharacter
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs
import Definitions.Def_OddOrder_Peterfalvi_S15_SSideGaloisFieldModel
import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality
import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTGrid
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

variable {G : Type*} [Group G]

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in

theorem typeI_caseC_parity_of_c_eq_one [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    (hyp : Hypothesis (G := G)) (hc1 : hyp.c = 1)
    {L : Subgroup G} (dataL : OddOrder.Peterfalvi.S16.TypeICoherent78Data L) :
    ∃ nS nL : ℤ,
      ClassFunction.inner (tauSbetaGrid hG hyp)
          (dataL.coh.extension (dataL.zeta 0)) = (nS : ℂ) ∧
        ClassFunction.inner (typeIBetaL dataL.typeIHyp (dataL.zeta 0))
            (hyp.eta ⟨0, hyp.q_prime.pos⟩ ⟨1, by have := hyp.three_le_p; omega⟩)
          = (nL : ℂ) ∧
        Odd (nS + nL) := 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_SAndT.lean#L72-L214

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