Peterfalvi (13.8) for : a distinguished index with over a chosen base
ProvedOddOrder.Peterfalvi.S15.Hypothesis.exists_muT_index_core_of_base_conditionLet 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 moreover: no maximal subgroup of is of type V (hnoV); pins : NuGridSupplyData hyp; ; is of type P (IsTypeP hyp.T) with Tdata : TypePData hyp.T satisfying Tdata.U = V, Tdata.W1 = W₂, Tdata.W2 = W₁; chief : ChiefFactorData for the type-I/II/III/V setup of ; ; is commutative. Let be an irreducible character of (as a subgroup of ) with , such that either is irreducible or (with the honest -side extension tau1T_ofHonest). Let be the (7.6) family Q_sharp_hypothesis76_base of characters of based at with (7.7.a) coefficients cCoeff · i. Then there exist an index and an integer such that:
- and ;
- ;
- for every , with ;
- (
zetaNormSq) and .
This supplies, on the -side, the distinguished -row index needed in the character-degree argument of Peterfalvi Section 13.
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
variable {G : Type*} [Group G]
set_option maxHeartbeats 1600000 in
-- The (7.6)-family bookkeeping (constituent expansion + per-index coefficient computation)
-- elaborates as a single large proof term; the default budget covers only part of it.
open OddOrder.Peterfalvi.S11 in
open scoped Classical in
open scoped FiniteInduce in
theorem Hypothesis.exists_muT_index_core_of_base_condition [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G)
(hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
(hyp : Hypothesis (G := G)) (pins : NuGridSupplyData hyp)
(hvd : hyp.v * hyp.d ≠ 1)
(hTP : OddOrder.BG.Ch4.S14.IsTypeP hyp.T)
(Tdata : TypePData hyp.T) (hU : Tdata.U = hyp.V)
(hW1 : Tdata.W1 = hyp.W2) (hW2 : Tdata.W2 = hyp.W1)
(chief : ChiefFactorData (hyp.toTypesIIIIIIVSetupT hG hvd))
(hD : hyp.D = ⊥)
(hQcomm : IsMulCommutative ↥hyp.Q)
(φ₀ : OddOrder.RepresentationTheory.IrreducibleCharacter ↥(hyp.Q.subgroupOf hyp.T))
(hφ₀Q : ¬ (((hyp.Q.subgroupOf hyp.T).subgroupOf (hyp.Q.subgroupOf hyp.T) :
Set ↥(hyp.Q.subgroupOf hyp.T)) ⊆
OddOrder.Peterfalvi.S03.characterKernel
(φ₀ : ClassFunction ↥(hyp.Q.subgroupOf hyp.T) ℂ)))
(hφ₀base :
OddOrder.RepresentationTheory.IsIrreducibleCharacter
(ClassFunction.induce (hyp.Q.subgroupOf hyp.T)
(φ₀ : ClassFunction ↥(hyp.Q.subgroupOf hyp.T) ℂ)) ∨
ClassFunction.inner
(hyp.tau1T_ofHonest hG hnoV pins hvd hTP Tdata hU hW1 hW2 chief
(ClassFunction.induce (hyp.Q.subgroupOf hyp.T)
(φ₀ : ClassFunction ↥(hyp.Q.subgroupOf hyp.T) ℂ))) hyp.eta10 = 0) :
∃ (i₁ : Fin ((Q_sharp_hypothesis76_base hG hyp hvd φ₀).n + 1)) (δ : ℤ), 0 < i₁ ∧
¬ ((hyp.Q.subgroupOf hyp.T : Set ↥hyp.T) ⊆
OddOrder.Peterfalvi.S03.characterKernel
((Q_sharp_hypothesis76_base hG hyp hvd φ₀).zeta i₁)) ∧
δ ^ 2 = 1 ∧
(Q_sharp_hypothesis76_base hG hyp hvd φ₀).cCoeff hyp.eta10 i₁ = (δ : ℂ) ∧
(∀ i : Fin ((Q_sharp_hypothesis76_base hG hyp hvd φ₀).n + 1), 0 < i → i ≠ i₁ →
¬ ((hyp.Q.subgroupOf hyp.T : Set ↥hyp.T) ⊆
OddOrder.Peterfalvi.S03.characterKernel
((Q_sharp_hypothesis76_base hG hyp hvd φ₀).zeta i)) →
(Q_sharp_hypothesis76_base hG hyp hvd φ₀).cCoeff hyp.eta10 i = 0) ∧
(Q_sharp_hypothesis76_base hG hyp hvd φ₀).zetaNormSq i₁ = (hyp.p : ℂ) ∧
(Q_sharp_hypothesis76_base hG hyp hvd φ₀).zeta i₁ 1 = ((hyp.p * hyp.v : ℕ) : ℂ) := by sorry
end OddOrder.Peterfalvi.S15