Peterfalvi (13.9.a): and do not vanish simultaneously on
ProvedOddOrder.Peterfalvi.S15.CharacterDegreeCore.G0_nonvanishing_dichotomy_corefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite minimal simple group of odd order, hyp : Hypothesis (G := G) the Peterfalvi Section 13 hypothesis package, core : CharacterDegreeCore hyp the Core character-degree data and lam : LambdaClusterData hyp the -cluster data. Then for every (hyp.G0Finset),
where core.tau1S lam.lambda and hyp.eta10.
This is Peterfalvi (13.9.a), proved from the Core off- formula, the regular value formula, and the four-corner grid relation.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Canonicalization
Formal statement
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
variable {G : Type*} [Group G]
section
theorem CharacterDegreeCore.G0_nonvanishing_dichotomy_core [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G) {hyp : Hypothesis (G := G)}
(core : CharacterDegreeCore hyp) (lam : LambdaClusterData hyp) :
∀ x ∈ hyp.G0Finset, core.tau1S lam.lambda x ≠ 0 ∨ hyp.eta10 x ≠ 0 := 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/AnalyticRelayer.lean#L335-L442