Peterfalvi (13.3.c): for a nonzero row
ProvedOddOrder.Peterfalvi.S15.Hypothesis.tau1T_ofHonest_nuRow_eta_rowLet be a finite group which is a minimal simple odd-order group, and assume there is no maximal subgroup of of type V (hnoV). Let hyp be a Peterfalvi §13 configuration with parameters , subgroup , and let pins : NuGridSupplyData hyp. Assume , that is of type P (IsTypeP hyp.T), and let Tdata : TypePData hyp.T be a type- datum whose -, -, -components are , , of hyp (hU, hW1, hW2). Let chief : ChiefFactorData (hyp.toTypesIIIIIIVSetupT hG hvd) be chief-factor data for the associated type I–IV setup on . Write for the map hyp.tau1T_ofHonest … built from all these data. Then for every row index with there are a row and an integer such that
In the proof of (13.3.c) the generic case is , , while for a flip , can occur. This is the -form input to the -package of (13.4).
Formalization Note. The map tau1T_ofHonest is a project-defined function on class functions of (with values in class functions of ); the exact data it depends on are exactly the hypotheses listed above. Scalar multiplication by is via the cast .
import Definitions.Def_OddOrder_Peterfalvi_S15_NuRowPin import Definitions.Def_OddOrder_Peterfalvi_S15_CaseACoherence import Definitions.Def_OddOrder_Peterfalvi_S15_Tau1T
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
variable {G : Type*} [Group G]
open OddOrder.Peterfalvi.S11 in
open scoped FiniteInduce in
theorem Hypothesis.tau1T_ofHonest_nuRow_eta_row [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))
{r : Fin hyp.q} (hr : r ≠ ⟨0, hyp.q_prime.pos⟩) :
∃ (r' : Fin hyp.q) (δ' : ℤ), r' ≠ ⟨0, hyp.q_prime.pos⟩ ∧ (δ' = 1 ∨ δ' = -1) ∧
hyp.tau1T_ofHonest hG hnoV pins hvd hTP Tdata hU hW1 hW2 chief
(∑ j : Fin hyp.p, hyp.nu r j)
= (δ' : ℂ) • ∑ j : Fin hyp.p, hyp.eta r' j := by sorry
end OddOrder.Peterfalvi.S15