Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (7.10): weighted Gamma decomposition over a family of Frobenius subgroups

Proved
OddOrder.Peterfalvi.S09.FrobeniusFamily.exists_weightedGammaDecomposition

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group of odd order, and let FFF be a Frobenius family in GGG (FrobeniusFamily G k): subgroups Lj,Hj≤GL_j,H_j\le GLj​,Hj​≤G (j<kj<kj<k, k≥2k\ge 2k≥2) with Hj≤LjH_j\le L_jHj​≤Lj​, each LjL_jLj​ a Frobenius group with kernel HjH_jHj​, Lj=NG(Hj)L_j=N_G(H_j)Lj​=NG​(Hj​), Hj#H_j^\#Hj#​ a TI-subset with normalizer LjL_jLj​, and the orders ∣Hj∣|H_j|∣Hj​∣ pairwise coprime. For every j<kj<kj<k assume the kernel HjH_jHj​ is nilpotent and that Cj≤LjC_j\le L_jCj​≤Lj​ is a Frobenius complement (IsFrobeniusGroup L_j H_j (C j)); the canonical (7.8) data of each member are then defined.

Write βi=\beta_i=βi​= betaAt i, Γi=\Gamma_i=Γi​= gammaAt i, Nj=N_j=Nj​= distinguishedNuAt j, Wj=W_j=Wj​= weightedNuSumAt j, wj=(hj−1)/ejw_j=(h_j-1)/e_jwj​=(hj​−1)/ej​ (BsumWeight j), where hj=∣Hj∣h_j=|H_j|hj​=∣Hj​∣, ej=∣Lj:Hj∣e_j=|L_j:H_j|ej​=∣Lj​:Hj​∣. Let i<ki<ki<k and let B⊆{0,…,k−1}B\subseteq\{0,\dots,k-1\}B⊆{0,…,k−1} be a finite set with j≠ij\neq ij=i for all j∈Bj\in Bj∈B. Then there exist integers xjx_jxj​ (j<kj<kj<k) and a class function Γ1\Gamma_1Γ1​ on GGG such that:

  1. ⟨βi,Nj⟩=xj\langle\beta_i,N_j\rangle=x_j⟨βi​,Nj​⟩=xj​ for all jjj;
  2. ⟨Wj,Wl⟩=wj\langle W_j,W_l\rangle=w_j⟨Wj​,Wl​⟩=wj​ if j=lj=lj=l and 000 otherwise, for j,l∈Bj,l\in Bj,l∈B;
  3. Γi=∑j∈Bxj Wj+Γ1\displaystyle \Gamma_i=\sum_{j\in B}x_j\,W_j+\Gamma_1Γi​=j∈B∑​xj​Wj​+Γ1​;
  4. ⟨Γ1,Wj⟩=0\langle\Gamma_1,W_j\rangle=0⟨Γ1​,Wj​⟩=0 for all j∈Bj\in Bj∈B.

This is the family-wide decomposition of the Gamma residual in Peterfalvi (7.10).

Formalization Note. The ambient Fintype/Invertible (Nat.card · : ℂ) instances for GGG, LiL_iLi​ and the kernel, and the normality instance for the kernel in LiL_iLi​, are explicit hypotheses; they are automatic mathematically. Oddness of ∣G∣|G|∣G∣ is the hypothesis hodd : Odd (Nat.card G).

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S09_FrobeniusConjIndex
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_BrauerPermutationUnconditional
import Definitions.Def_OddOrder_Peterfalvi_S08_CoherenceCorePart1
import Definitions.Def_OddOrder_Peterfalvi_S09_FrobeniusGammaDecomposition
Formal statement
namespace OddOrder.Peterfalvi.S09

open OddOrder.RepresentationTheory

namespace FrobeniusFamily

variable {G : Type*} [Group G] {k : ℕ}

section FamilyRealization

variable [Fintype G] [Invertible (Nat.card G : ℂ)]

variable (F : FrobeniusFamily G k) (hodd : Odd (Nat.card G))

variable (hnilp : ∀ j : Fin k,
  Group.IsNilpotent ↥((F.H j).subgroupOf (F.L j)))

variable (C : ∀ j : Fin k, Subgroup ↥(F.L j))

variable (hFrob : ∀ j : Fin k, OddOrder.Isaacs.Ch06.IsFrobeniusGroup
  ↥(F.L j) ((F.H j).subgroupOf (F.L j)) (C j))

theorem exists_weightedGammaDecomposition
    (i : Fin k) (B : Finset (Fin k))
    (hB : ∀ j ∈ B, i ≠ j) :
    ∃ x : Fin k → ℤ, ∃ Γ₁ : ClassFunction G ℂ,
      (∀ j, ClassFunction.inner
        (F.betaAt hodd hnilp C hFrob i)
        (F.distinguishedNuAt hodd hnilp C hFrob j) = (x j : ℂ)) ∧
      (∀ j ∈ B, ∀ l ∈ B,
        ClassFunction.inner
          (F.weightedNuSumAt hodd hnilp C hFrob j)
          (F.weightedNuSumAt hodd hnilp C hFrob l) =
            if j = l then (F.BsumWeight j : ℂ) else 0) ∧
      F.gammaAt hodd hnilp C hFrob i =
        (∑ j ∈ B,
          (((x j : ℝ) : ℂ) • F.weightedNuSumAt hodd hnilp C hFrob j)) + Γ₁ ∧
      ∀ j ∈ B, ClassFunction.inner Γ₁
        (F.weightedNuSumAt hodd hnilp C hFrob j) = 0 := by sorry

end FamilyRealization

end FrobeniusFamily

end OddOrder.Peterfalvi.S09
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/S09_FrobeniusGammaDecomposition.lean#L639-L785

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