Peterfalvi (13.6): the correction of at is a multiple of (chosen base)
ProvedOddOrder.Peterfalvi.S15.CharacterDegreeCore.exists_lambda_alphaFun_one_qb_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 ) such that and . Write hypothesis76AlphaFun for the correction function of the (7.6) family based at (with respect to ), applied to the class function core.tau1S lam.lambda. Then there is an integer with
This is the congruence of (13.6) used to bound the correction term of in the Case B degree argument.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines
Formal statement
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
variable {G : Type*} [Group G]
section
open scoped Classical in
open scoped FiniteInduce in
theorem CharacterDegreeCore.exists_lambda_alphaFun_one_qb_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) :
∃ b : ℤ, hypothesis76AlphaFun (H_sharp_hypothesis76_base hG hyp φ₀)
(hyp.P.subgroupOf hyp.S) (core.tau1S lam.lambda) 1
= (hyp.q : ℂ) * (b : ℂ) := by sorry
end
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_CaseBEndgameSupply/LambdaCorrection.lean#L256-L393