Peterfalvi (13.19.c): the two pairings at have odd sum when
ProvedOddOrder.Peterfalvi.S15.typeI_caseC_parity_of_c_eq_oneLet 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 , , (, ). Assume no maximal subgroup of is of type V and . Let be a subgroup carrying dataL : TypeICoherent78Data L (type I coherence data with (7.8) bookkeeping; its characters are , its coherent extension is dataL.coh.extension, and with maxNilpotentNormalHall L). Then there exist integers such that
where tauSbetaGrid hG hyp, typeIBetaL dataL.typeIHyp and .
This is the parity core of (13.19.c), a step in the case analysis for type I subgroups in Section 13.
import Definitions.Def_OddOrder_Peterfalvi_S15_BridgeCharacter import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs import Definitions.Def_OddOrder_Peterfalvi_S15_SSideGaloisFieldModel import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTGrid
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
variable {G : Type*} [Group G]
open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
theorem typeI_caseC_parity_of_c_eq_one [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G)
(hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
(hyp : Hypothesis (G := G)) (hc1 : hyp.c = 1)
{L : Subgroup G} (dataL : OddOrder.Peterfalvi.S16.TypeICoherent78Data L) :
∃ nS nL : ℤ,
ClassFunction.inner (tauSbetaGrid hG hyp)
(dataL.coh.extension (dataL.zeta 0)) = (nS : ℂ) ∧
ClassFunction.inner (typeIBetaL dataL.typeIHyp (dataL.zeta 0))
(hyp.eta ⟨0, hyp.q_prime.pos⟩ ⟨1, by have := hyp.three_le_p; omega⟩)
= (nL : ℂ) ∧
Odd (nS + nL) := by sorry
end OddOrder.Peterfalvi.S15