Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.5)/(13.6): (7.7.a) coefficients of λτ1\lambda^{\tau_1}λτ1​ over a chosen S1\mathcal S_1S1​-base

Proved
OddOrder.Peterfalvi.S15.lambda_tau1_cCoeff_base

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group (Fintype G, ∣G∣|G|∣G∣ invertible in C\mathbb CC) with IsMinimalSimpleOdd G, let hyp : Hypothesis be the Peterfalvi (13.1) configuration, and let a LambdaClusterData hyp (the λ\lambdaλ-cluster, with character λ=\lambda=λ= lam.lambda, a class function on SSS) and core : CharacterDegreeCore hyp (Core data providing the τ1\tau_1τ1​-extension core.tau1S). Let φ0\varphi_0φ0​ be an irreducible character of H=PCH=PCH=PC (as a subgroup of SSS) with P⊈ker⁡φ0P\not\subseteq\ker\varphi_0P⊆kerφ0​ and IndHSφ0≠λ\mathrm{Ind}_H^S\varphi_0\ne\lambdaIndHS​φ0​=λ. Here H_sharp_hypothesis76_base hG hyp φ₀ is the (7.6) family ζ0,…,ζn\zeta_0,\dots,\zeta_nζ0​,…,ζn​ of characters of SSS based at IndHSφ0\mathrm{Ind}_H^S\varphi_0IndHS​φ0​ and cCoeff denotes its (7.7.a) coefficients. Suppose i1i_1i1​ is an index with ζi1=λ\zeta_{i_1}=\lambdaζi1​​=λ. Then

ci1(λτ1)=1andci(λτ1)=0  for all i≠i1 with P⊈ker⁡ζi,c_{i_1}(\lambda^{\tau_1})=1\quad\text{and}\quad c_i(\lambda^{\tau_1})=0\ \text{ for all } i\ne i_1 \text{ with } P\not\subseteq\ker\zeta_i,ci1​​(λτ1​)=1andci​(λτ1​)=0  for all i=i1​ with P⊆kerζi​,

where λτ1=\lambda^{\tau_1}=λτ1​= core.tau1S lam.lambda. The coefficients at PPP-kernel indices are left undetermined.

This computes the non-kernel part of the expansion of λτ1\lambda^{\tau_1}λτ1​ used in (13.5)/(13.6).

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_CaseACoherence
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_CountingLayer
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_TSideDegrees
import Definitions.Def_OddOrder_Peterfalvi_S15_Tau1T
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

variable {G : Type*} [Group G]

set_option maxHeartbeats 800000 in
-- raised heartbeat budget for the heavy elaboration below
open scoped Classical in
open scoped FiniteInduce in

theorem lambda_tau1_cCoeff_base [Fintype G] [Invertible (Nat.card G : ℂ)]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) {hyp : Hypothesis (G := G)}
    (core : CharacterDegreeCore hyp) (lam : LambdaClusterData hyp)
    (φ₀ : OddOrder.RepresentationTheory.IrreducibleCharacter ↥(hyp.H.subgroupOf hyp.S))
    (hφ₀P : ¬ (((hyp.P.subgroupOf hyp.S).subgroupOf (hyp.H.subgroupOf hyp.S) :
        Set ↥(hyp.H.subgroupOf hyp.S)) ⊆
      OddOrder.Peterfalvi.S03.characterKernel
        (φ₀ : ClassFunction ↥(hyp.H.subgroupOf hyp.S) ℂ)))
    (hφ₀ne : ClassFunction.induce (hyp.H.subgroupOf hyp.S)
        (φ₀ : ClassFunction ↥(hyp.H.subgroupOf hyp.S) ℂ) ≠ lam.lambda)
    (i₁ : Fin ((H_sharp_hypothesis76_base hG hyp φ₀).n + 1))
    (hi₁eq : (H_sharp_hypothesis76_base hG hyp φ₀).zeta i₁ = lam.lambda) :
    (H_sharp_hypothesis76_base hG hyp φ₀).cCoeff (core.tau1S lam.lambda) i₁ = 1 ∧
      (∀ i : Fin ((H_sharp_hypothesis76_base hG hyp φ₀).n + 1), i ≠ i₁ →
        ¬ ((hyp.P.subgroupOf hyp.S : Set ↥hyp.S) ⊆
          OddOrder.Peterfalvi.S03.characterKernel
            ((H_sharp_hypothesis76_base hG hyp φ₀).zeta i)) →
        (H_sharp_hypothesis76_base hG hyp φ₀).cCoeff (core.tau1S lam.lambda) i = 0) := 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_CharacterDegreeEnginesSSide.lean#L648-L853

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