Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.9.a): off (H#)G(H^\#)^G(H#)G the value λτ1(x)\lambda^{\tau_1}(x)λτ1​(x) is ±\pm± an η\etaη-column sum

Proved
OddOrder.Peterfalvi.S15.lambda_tau1_apply_eq_of_not_mem_H_sat_core

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 (and ∣G∣|G|∣G∣ invertible in C\mathbb CC), 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 x∈Gx\in Gx∈G lie outside the conjugacy saturation (H#)G(H^\#)^G(H#)G of H#=(PC)∖{1}H^\#=(PC)\setminus\{1\}H#=(PC)∖{1}. Then there is δ∈{1,−1}\delta\in\{1,-1\}δ∈{1,−1} with

λτ1(x)=δ∑i<qηi1(x).\lambda^{\tau_1}(x)=\delta\sum_{i<q}\eta_{i1}(x).λτ1​(x)=δi<q∑​ηi1​(x).

This is the first step of (13.9.a), expressing λτ1\lambda^{\tau_1}λτ1​ away from (H#)G(H^\#)^G(H#)G through the (13.3.c) column formula.

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]

open scoped FiniteInduce in

theorem lambda_tau1_apply_eq_of_not_mem_H_sat_core [Finite G]
    [Invertible (Nat.card G : ℂ)]
    (_hG : OddOrder.BG.IsMinimalSimpleOdd G) {hyp : Hypothesis (G := G)}
    (core : CharacterDegreeCore hyp) (lam : LambdaClusterData hyp) {x : G}
    (hx : x ∉ OddOrder.GroupTheory.conjClassSet (sharpSubgroup hyp.H)) :
    ∃ δ : ℤ, (δ = 1 ∨ δ = -1) ∧
      core.tau1S lam.lambda x
        = (δ : ℂ) * ∑ i : Fin hyp.q, hyp.eta i ⟨1, hyp.p_prime.one_lt⟩ x := 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#L988-L1053

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