Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.19.b): η\etaη-grid coefficients of βL\beta_LβL​ do not depend on the choice of coherent family member

Proved
OddOrder.Peterfalvi.S16.OrthogonalitySwitchData.typeIGrid_betaL_inner_eta_eq_h78_beta

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. Let MMM be a maximal subgroup of GGG and dataM : TypeICoherent78Data M. Let grid : S15.TypeIOrthogonalityGridData hyp.base dataM be the type-I orthogonality grid data from §13, and assume the distinguished member grid.phi of the grid data lies in the coherent family dataM.typeIHyp.Sset. Then, whenever [Fintype G] and [Invertible (Nat.card G : ℂ)] are available, for all i<qi<qi<q and j<pj<pj<p:

⟨βgrid, ηij⟩  =  ⟨βM, ηij⟩,\langle \beta_{\mathrm{grid}},\ \eta_{ij}\rangle \;=\; \langle \beta_{M},\ \eta_{ij}\rangle ,⟨βgrid​, ηij​⟩=⟨βM​, ηij​⟩,

where βgrid\beta_{\mathrm{grid}}βgrid​ is grid.betaL, βM\beta_MβM​ is coherentBeta hG dataM (from the §7.8 coherent bundle), and ηij\eta_{ij}ηij​ are the grid characters of hyp.base.

The two β\betaβ's need not be equal as class functions; only their grid coefficients agree, since the difference of two coherent images is orthogonal to the η\etaη-grid by (13.19.b). This choice-free synchronization is needed in (14.11.2).

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupL
import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion
import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentEtaOrthogonality
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
set_option backward.isDefEq.respectTransparency false in

theorem typeIGrid_betaL_inner_eta_eq_h78_beta [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)}
    {M : Subgroup G} (hMmax : M ∈ maximalSubgroups G) (dataM : TypeICoherent78Data M)
    (grid : OddOrder.Peterfalvi.S15.TypeIOrthogonalityGridData
      hyp.base dataM)
    (hphi : grid.phi ∈ dataM.typeIHyp.Sset) :
    ∀ [Fintype G] [Invertible (Nat.card G : ℂ)],
      ∀ (i : Fin hyp.base.q) (j : Fin hyp.base.p),
        ClassFunction.inner grid.betaL (hyp.base.eta i j) =
          ClassFunction.inner (coherentBeta hG dataM) (hyp.base.eta i j) := 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/CoherentEtaOrthogonality.lean#L321-L449

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