Peterfalvi (13.9.a): off the value is an -column sum
ProvedOddOrder.Peterfalvi.S15.lambda_tau1_apply_eq_of_not_mem_H_sat_corefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group with IsMinimalSimpleOdd G (and invertible in ), let hyp : Hypothesis be the Peterfalvi (13.1) configuration, and let a LambdaClusterData hyp (the -cluster, with character lam.lambda, a class function on ) and core : CharacterDegreeCore hyp (Core data providing the -extension core.tau1S). Let lie outside the conjugacy saturation of . Then there is with
This is the first step of (13.9.a), expressing away from 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.S15Source
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