Peterfalvi (13.8): a base orthogonal to (coefficient-zero choice)
ProvedOddOrder.Peterfalvi.S15.Hypothesis.exists_qSharpBase_orthogonal_eta10_coreLet be a finite minimal simple group of odd order with no maximal subgroup of type V, and hyp : Hypothesis (G := G) the Peterfalvi Section 13 hypothesis package with subgroups and pins : NuGridSupplyData hyp. Assume , that is of type P (IsTypeP hyp.T) with data Tdata satisfying (Tdata.U = hyp.V), and (Tdata.W1 = hyp.W2, Tdata.W2 = hyp.W1), let chief be a chief-factor datum for the Types I--V setup of , and assume . Then there is an irreducible character of (as a subgroup of ) such that and
where is hyp.tau1T_ofHonest ….
This is the coefficient-zero chosen base of Peterfalvi (13.8); it replaces the unavailable assumption that is irreducible in case B.
Formalization Note. The statement is for the scoped FiniteInduce and classical instances. The non-containment appears as ¬ (Q ⊆ characterKernel φ₀) with viewed in itself.
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]
section
open OddOrder.Peterfalvi.S11 in
open scoped Classical in
open scoped FiniteInduce in
theorem Hypothesis.exists_qSharpBase_orthogonal_eta10_core [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 = ⊥) :
∃ φ₀ : OddOrder.RepresentationTheory.IrreducibleCharacter
↥(hyp.Q.subgroupOf hyp.T),
¬ (((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) ℂ)) ∧
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 := by sorry
end
end OddOrder.Peterfalvi.S15