Peterfalvi (13.3.b,c) for : the -package when the Case B conclusion fails (Core form)
ProvedOddOrder.Peterfalvi.S15.tSide_theta_package_of_not_caseB_corefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a minimal simple group of odd order (IsMinimalSimpleOdd G), and let hyp : Hypothesis be the Peterfalvi (13.1) configuration for : two maximal subgroups with cyclic, , ( odd primes), and the maximal nilpotent normal Hall subgroups, complements with , , , , , , together with the associated character grids , , (, ). Let core : CharacterDegreeCore hyp, lam : LambdaClusterData hyp and pins : NuGridSupplyData hyp. Assume the failure of the conclusion of (13.4), namely
(with natural-number division). Then there exist a class function on , indices , a sign and a class function on such that
- ;
- ;
- for all , ;
- , where
core.tau1S lam.lambda.
This is the -side -package of (13.3.b,c), used together with (13.4) to rule out the non-Case-B situation.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Canonicalization import Definitions.Def_OddOrder_Peterfalvi_S13_ElementaryAbelianKernel import Definitions.Def_OddOrder_BG_Ch2_Uniqueness_S07_Theorem74 import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_HypothesisSwap import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeSupply
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 tSide_theta_package_of_not_caseB_core [Finite G]
(_hG : OddOrder.BG.IsMinimalSimpleOdd G) {hyp : Hypothesis (G := G)}
(core : CharacterDegreeCore hyp) (lam : LambdaClusterData hyp)
(pins : NuGridSupplyData hyp)
(_hne : ¬ (hyp.D = ⊥ ∧ hyp.v = (hyp.q ^ hyp.p - 1) / (hyp.q - 1) ∧
Nat.card ↥hyp.Q = hyp.q ^ hyp.p)) :
∃ (θT : ClassFunction ↥hyp.T ℂ) (r r' : Fin hyp.q) (δ' : ℤ) (θG : ClassFunction G ℂ),
(δ' = 1 ∨ δ' = -1) ∧
((θT - ∑ j : Fin hyp.p, hyp.nu r j).support ⊆
{z : ↥hyp.T | (z : G) ∈ hyp.Q ⊔ hyp.D ∧ z ≠ 1}) ∧
(ClassFunction.induce hyp.T (θT - ∑ j : Fin hyp.p, hyp.nu r j)
= θG - (δ' : ℂ) • ∑ j : Fin hyp.p, hyp.eta r' j) ∧
(∀ (i : Fin hyp.q) (j : Fin hyp.p), ClassFunction.inner (hyp.eta i j) θG = 0) ∧
ClassFunction.inner (core.tau1S lam.lambda) θG = 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_CharacterDegreeSupply.lean#L770-L1098