Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.5)/(13.7): integral Parseval data and inflation bound for η10\eta_{10}η10​ on H#H^\#H# (Core form)

Proved
OddOrder.Peterfalvi.S15.CharacterDegreeCore.exists_caseB_data_eta10_H_core

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). Here H=PC≤SH=PC\le SH=PC≤S, H#=H∖{1}H^\#=H\setminus\{1\}H#=H∖{1} and η10\eta_{10}η10​ denotes hyp.eta10. Let core : CharacterDegreeCore hyp be the Core character-degree data attached to hyp. Then there exist a function α:G→C\alpha:G\to\mathbb Cα:G→C and natural numbers d,n,sd,n,sd,n,s such that

η10(x)=α(x) (x∈H#),∑x∈H#∣α(x)∣2=s,n≥1,s+d2=∣H∣ n,(pq−1) d2≤s,(n=1⇒d2=1).\eta_{10}(x)=\alpha(x)\ (x\in H^\#),\quad \sum_{x\in H^\#}|\alpha(x)|^2=s,\quad n\ge 1,\quad s+d^2=|H|\,n,\quad (p^q-1)\,d^2\le s,\quad (n=1\Rightarrow d^2=1).η10​(x)=α(x) (x∈H#),x∈H#∑​∣α(x)∣2=s,n≥1,s+d2=∣H∣n,(pq−1)d2≤s,(n=1⇒d2=1).

This packages the (13.5)/(13.7) correction of η10\eta_{10}η10​ on H#H^\#H# (Parseval identity, inflation bound and the abelian equality case) in the Case B endgame of Peterfalvi Section 13.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Canonicalization
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

variable {G : Type*} [Group G]

section

open scoped Classical in
open scoped FiniteInduce in

theorem CharacterDegreeCore.exists_caseB_data_eta10_H_core [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) {hyp : Hypothesis (G := G)}
    (core : CharacterDegreeCore hyp) :
    ∃ (α : G → ℂ) (d n s : ℕ),
      (∀ x ∈ (Set.toFinite (sharpSubgroup hyp.H)).toFinset, hyp.eta10 x = α x) ∧
      (∑ x ∈ (Set.toFinite (sharpSubgroup hyp.H)).toFinset, ‖α x‖ ^ 2 = (s : ℝ)) ∧
      1 ≤ n ∧ s + d ^ 2 = Nat.card ↥hyp.H * n ∧
      (hyp.p ^ hyp.q - 1) * d ^ 2 ≤ s ∧ (n = 1 → d ^ 2 = 1) := by sorry

end

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_CaseBEndgameSupply/Eta10HCorrection.lean#L84-L256

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