Peterfalvi (13.5)/(13.6): (7.7.a) coefficients of over a chosen -base
ProvedOddOrder.Peterfalvi.S15.lambda_tau1_cCoeff_basefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group (Fintype G, invertible in ) with IsMinimalSimpleOdd G, 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 be an irreducible character of (as a subgroup of ) with and . Here H_sharp_hypothesis76_base hG hyp φ₀ is the (7.6) family of characters of based at and cCoeff denotes its (7.7.a) coefficients. Suppose is an index with . Then
where core.tau1S lam.lambda. The coefficients at -kernel indices are left undetermined.
This computes the non-kernel part of the expansion of 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.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#L648-L853