Peterfalvi (9.8.c) with an explicit regular seed: an irreducible degree- member of
ProvedOddOrder.Peterfalvi.S15.caseA_exists_irreducible_witnessedLet be a finite group with IsMinimalSimpleOdd G, a subgroup with data : TypesIIIIIIVSetup M, chief : ChiefFactorData data, chars : Section11CharacterData data chief, and caseA : CliffordCaseAData chars a Clifford case (a) datum. Assume the finiteness, invertibility, Fintype and normality instances displayed in the statement for the groups hInHu data, huSub data and hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf (huSub data), and that is finite ( data.H, chief.N). Then there is a linear character such that
- ;
- for every , the restriction of to the Clifford summand
caseA.Hpart iis nontrivial; - the character
induceHU data (ClassFunction.induce _ (hcPsi chief θ).toClassFunction)is irreducible.
Here hcPsi chief θ is the character of -type groups attached to , it is induced to the group hInHu ⊔ … and then to via induceHU. This exposes the regular seed behind the parity argument of (9.8.c) so that the shape can be recovered.
Formalization Note. The exact subgroups involved are encoded through the project's hInHu, huSub, cSub, hcPsi, induceHU definitions.
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Canonicalization import Definitions.Def_OddOrder_Peterfalvi_S13_ElementaryAbelianKernel import Definitions.Def_OddOrder_BG_Ch2_Uniqueness_S07_Theorem74 import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_HypothesisSwap import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeSupply
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
variable {G : Type*} [Group G]
open OddOrder.Peterfalvi.S11 in
theorem caseA_exists_irreducible_witnessed [Finite G] {M : Subgroup G}
{data : TypesIIIIIIVSetup M} {chief : ChiefFactorData data}
{chars : Section11CharacterData data chief} (caseA : CliffordCaseAData chars)
(hG : OddOrder.BG.IsMinimalSimpleOdd G)
[Finite ((↥data.H ⧸ chief.N) →* ℂˣ)]
[Finite ↥(hInHu data)] [Invertible (Nat.card ↥(hInHu data) : ℂ)]
[Fintype ↥(huSub data)]
[Finite ↥(hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf (huSub data))]
[Invertible (Nat.card ↥(hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf
(huSub data)) : ℂ)]
[(hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf (huSub data)).Normal] :
∃ θ : (↥data.H ⧸ chief.N) →* ℂˣ, θ ≠ 1 ∧
(∀ i, θ.comp (caseA.Hpart i).subtype ≠ 1) ∧
IsIrreducibleCharacter (induceHU data (ClassFunction.induce
(hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf (huSub data))
(hcPsi chief θ).toClassFunction)) := by sorry
end OddOrder.Peterfalvi.S15