Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The four-piece split of a conjugation-invariant sum over GGG (counting skeleton of (13.10))

Proved
OddOrder.Peterfalvi.S15.Hypothesis.sum_univ_split

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). Let GGG be a finite group (Fintype G) with IsMinimalSimpleOdd G, assume ∣Q∣=qp|Q|=q^p∣Q∣=qp and vd≠1vd\ne1vd=1, let MMM be an additive commutative monoid and f:G→Mf:G\to Mf:G→M a class function (f (g x g⁻¹) = f x for all g,xg,xg,x). Put H#=(PC)∖{1}H^\#=(PC)\setminus\{1\}H#=(PC)∖{1}, Q#=Q∖{1}Q^\#=Q\setminus\{1\}Q#=Q∖{1} and let G0=G_0=G0​= hyp.G0Finset be the set of elements of GGG outside {1}∪(H#)G∪(Q#)G\{1\}\cup(H^\#)^G\cup(Q^\#)^G{1}∪(H#)G∪(Q#)G. Then

∑x∈Gf(x)=f(1)+∑x∈G0f(x)+[G:S]⋅∑x∈H#f(x)+[G:T]⋅∑x∈Q#f(x),\sum_{x\in G}f(x)=f(1)+\sum_{x\in G_0}f(x)+[G:S]\cdot\sum_{x\in H^\#}f(x)+[G:T]\cdot\sum_{x\in Q^\#}f(x),x∈G∑​f(x)=f(1)+x∈G0​∑​f(x)+[G:S]⋅x∈H#∑​f(x)+[G:T]⋅x∈Q#∑​f(x),

where n⋅mn\cdot mn⋅m denotes the nnn-fold multiple in MMM.

Instances with f=∣χ∣2f=|\chi|^2f=∣χ∣2 give the Parseval splits (13.10.1), (13.10.2) and f=1f=1f=1 the cover count (13.10.3).

Formalization Note. G0G_0G0​ is defined in the formalization as the complement of the other pieces (see G0Finset).

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_PairStructure
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_CountingLayer
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

variable {G : Type*} [Group G]

section CountingLayer

open OddOrder.GroupTheory

open scoped Classical in

theorem Hypothesis.sum_univ_split [Fintype G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hyp : Hypothesis (G := G)) {M : Type*} [AddCommMonoid M] (f : G → M)
    (hf : ∀ g x : G, f (g * x * g⁻¹) = f x)
    (hcardQ : Nat.card ↥hyp.Q = hyp.q ^ hyp.p) (hvd : hyp.v * hyp.d ≠ 1) :
    ∑ x : G, f x
      = f 1 + (∑ x ∈ hyp.G0Finset, f x)
        + hyp.S.index • ∑ x ∈ (Set.toFinite (sharpSubgroup hyp.H)).toFinset, f x
        + hyp.T.index • ∑ x ∈ (Set.toFinite (sharpSubgroup hyp.Q)).toFinset, f x := by sorry

end CountingLayer

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_Setup/CountingLayer.lean#L224-L310

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