Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The φ\varphiφ-invariance identity φτ1−ζ0τ1=βLτ(ζ0)−βLτ(φ)\varphi^{\tau_1}-\zeta_0^{\tau_1}=\beta_L^\tau(\zeta_0)-\beta_L^\tau(\varphi)φτ1​−ζ0τ1​​=βLτ​(ζ0​)−βLτ​(φ)

Proved
OddOrder.Peterfalvi.S15.coh_extension_sub_zeta0_eq_typeIBetaL_sub

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group with IsMinimalSimpleOdd G, let L≤GL\le GL≤G carry dataL : TypeICoherent78Data L with coherent extension τ1=\tau_1=τ1​= dataL.coh.extension, and let φ\varphiφ be a class function on LLL lying in the family dataL.typeIHyp.Sset with φ(1)=[L:LF]\varphi(1)=[L:L_F]φ(1)=[L:LF​] (where LF=L_F=LF​= maxNilpotentNormalHall L). Then, as class functions on GGG,

φτ1−ζ0τ1=βLτ(ζ0)−βLτ(φ),\varphi^{\tau_1}-\zeta_0^{\tau_1}=\beta_L^{\tau}(\zeta_0)-\beta_L^{\tau}(\varphi),φτ1​−ζ0τ1​​=βLτ​(ζ0​)−βLτ​(φ),

with βLτ=\beta_L^\tau=βLτ​= typeIBetaL dataL.typeIHyp.

This is the bridge allowing the ζ0\zeta_0ζ0​-based parity argument of (13.19.c) to apply to an arbitrary degree-eee member φ\varphiφ.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_BridgeCharacter
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs
import Definitions.Def_OddOrder_Peterfalvi_S15_SSideGaloisFieldModel
import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality
import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTGrid
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

variable {G : Type*} [Group G]

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in

theorem coh_extension_sub_zeta0_eq_typeIBetaL_sub [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) {L : Subgroup G}
    (dataL : OddOrder.Peterfalvi.S16.TypeICoherent78Data L)
    (φ : ClassFunction ↥L ℂ) (hφ : φ ∈ dataL.typeIHyp.Sset)
    (hdeg : φ 1 = (((maxNilpotentNormalHall L).subgroupOf L).index : ℂ)) :
    dataL.coh.extension φ - dataL.coh.extension (dataL.zeta 0)
      = typeIBetaL dataL.typeIHyp (dataL.zeta 0) - typeIBetaL dataL.typeIHyp φ := by sorry

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.lean#L354-L410

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