Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (14.11.2) on the LLL-side: βLτ\beta_L^\tauβLτ​ is a signed η\etaη-grid sum minus a unit-norm χ\chiχ

Proved
OddOrder.Peterfalvi.S16.OrthogonalitySwitchData.lSide_expansion_classification

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite minimal simple odd-order group with no maximal subgroup of type V (hnoV), hncH0C : S13.H0CNoncoherenceRefuter G, and hyp a Peterfalvi §14 configuration with parameters p,q,u,vp,q,u,vp,q,u,v and grid ηij\eta_{ij}ηij​. Let LLL be a maximal subgroup of GGG and dataL : TypeICoherent78Data L. Write β=\beta=β= (dataL.h78 hG).beta, ν=\nu=ν= (dataL.h78 hG).nu, ζ∗=\zeta_*=ζ∗​= the distinguished member (dataL.h78 hG).hyp76.zeta (dataL.h78 hG).zetaDistinct. Assume

  • q=3q=3q=3 and p=5p=5p=5;
  • the complement index eL=pqe_L = pqeL​=pq;
  • u−1q<∣H∣−1j\dfrac{u-1}{q} < \dfrac{|H|-1}{j}qu−1​<j∣H∣−1​ and v−1p<∣H∣−1j\dfrac{v-1}{p} < \dfrac{|H|-1}{j}pv−1​<j∣H∣−1​ in Q\mathbb{Q}Q (with u−1u-1u−1, v−1v-1v−1, ∣H∣−1|H|-1∣H∣−1 computed in N\mathbb{N}N), where ∣H∣|H|∣H∣ is Nat.card dataL.typeIHyp.H and jjj is the index in LLL of the subgroup (maxNilpotentNormalHall L).subgroupOf L, the maximal normal nilpotent Hall subgroup of LLL regarded inside LLL.

Then there are signs εij∈{1,−1}\varepsilon_{ij}\in\{1,-1\}εij​∈{1,−1} (i<qi<qi<q, j<pj<pj<p) and a class function χ\chiχ on GGG such that χ=ν(ζ∗)\chi=\nu(\zeta_*)χ=ν(ζ∗​) or χ=−ν(ζ∗‾)\chi = -\nu(\overline{\zeta_*})χ=−ν(ζ∗​​), and

β  =  ∑i<q∑j<pεij ηij  −  χ.\beta \;=\; \sum_{i<q}\sum_{j<p}\varepsilon_{ij}\,\eta_{ij} \;-\; \chi .β=i<q∑​j<p∑​εij​ηij​−χ.

This is the LLL-instance of the general (14.11.2) expansion: the rigidity of the η\etaη-grid projection and the norm-one classification of the removed character are combined with the Bessel bound.

Formalization Note. The index jjj is ((maxNilpotentNormalHall L).subgroupOf L).index, cast to Q\mathbb{Q}Q.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_BetaVanishing
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Canonicalization
import Definitions.Def_OddOrder_Peterfalvi_S13_ElementaryAbelianKernel
import Definitions.Def_OddOrder_BG_Ch2_Uniqueness_S07_Theorem74
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeSupply
Formal statement
namespace OddOrder.Peterfalvi.S16

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

open scoped BigOperators

variable {G : Type*} [Group G]

namespace OrthogonalitySwitchData

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in

theorem lSide_expansion_classification [Finite G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    (hncH0C : OddOrder.Peterfalvi.S13.H0CNoncoherenceRefuter G)
    {hyp : Hypothesis (G := G)} {L : Subgroup G} (hLmax : L ∈ maximalSubgroups G)
    (dataL : TypeICoherent78Data L)
    (hq3 : hyp.base.q = 3) (hp5 : hyp.base.p = 5)
    (hepq : (dataL.h78 hG).complementIndex = hyp.base.p * hyp.base.q)
    (hub_u : ((hyp.base.u - 1 : ℕ) : ℚ) / (hyp.base.q : ℚ) <
      ((Nat.card ↥dataL.typeIHyp.H - 1 : ℕ) : ℚ)
        / (((maxNilpotentNormalHall L).subgroupOf L).index : ℚ))
    (hub_v : ((hyp.base.v - 1 : ℕ) : ℚ) / (hyp.base.p : ℚ) <
      ((Nat.card ↥dataL.typeIHyp.H - 1 : ℕ) : ℚ)
        / (((maxNilpotentNormalHall L).subgroupOf L).index : ℚ)) :
    ∃ (signs : Fin hyp.base.q → Fin hyp.base.p → ℤ) (chi : ClassFunction G ℂ),
      (∀ i j, signs i j = 1 ∨ signs i j = -1) ∧
      (chi = (dataL.h78 hG).nu ((dataL.h78 hG).hyp76.zeta (dataL.h78 hG).zetaDistinct) ∨
        chi = -((dataL.h78 hG).nu
          (((dataL.h78 hG).hyp76.zeta (dataL.h78 hG).zetaDistinct).conj))) ∧
      (dataL.h78 hG).beta =
        (∑ i : Fin hyp.base.q, ∑ j : Fin hyp.base.p,
            (signs i j : ℂ) • hyp.base.eta i j) - chi := by sorry

end OrthogonalitySwitchData

end OddOrder.Peterfalvi.S16
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/S16_NonExistenceG/ComparingLMBasic.lean#L433-L542

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