Peterfalvi (7.10): weighted Gamma decomposition over a family of Frobenius subgroups
ProvedOddOrder.Peterfalvi.S09.FrobeniusFamily.exists_weightedGammaDecompositionLet be a finite group of odd order, and let be a Frobenius family in (FrobeniusFamily G k): subgroups (, ) with , each a Frobenius group with kernel , , a TI-subset with normalizer , and the orders pairwise coprime. For every assume the kernel is nilpotent and that is a Frobenius complement (IsFrobeniusGroup L_j H_j (C j)); the canonical (7.8) data of each member are then defined.
Write betaAt i, gammaAt i, distinguishedNuAt j, weightedNuSumAt j, (BsumWeight j), where , . Let and let be a finite set with for all . Then there exist integers () and a class function on such that:
- for all ;
- if and otherwise, for ;
- ;
- for all .
This is the family-wide decomposition of the Gamma residual in Peterfalvi (7.10).
Formalization Note. The ambient Fintype/Invertible (Nat.card · : ℂ) instances for , and the kernel, and the normality instance for the kernel in , are explicit hypotheses; they are automatic mathematically. Oddness of is the hypothesis hodd : Odd (Nat.card G).
import Definitions.Def_OddOrder_Peterfalvi_S09_FrobeniusConjIndex import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_BrauerPermutationUnconditional import Definitions.Def_OddOrder_Peterfalvi_S08_CoherenceCorePart1 import Definitions.Def_OddOrder_Peterfalvi_S09_FrobeniusGammaDecomposition
namespace OddOrder.Peterfalvi.S09
open OddOrder.RepresentationTheory
namespace FrobeniusFamily
variable {G : Type*} [Group G] {k : ℕ}
section FamilyRealization
variable [Fintype G] [Invertible (Nat.card G : ℂ)]
variable (F : FrobeniusFamily G k) (hodd : Odd (Nat.card G))
variable (hnilp : ∀ j : Fin k,
Group.IsNilpotent ↥((F.H j).subgroupOf (F.L j)))
variable (C : ∀ j : Fin k, Subgroup ↥(F.L j))
variable (hFrob : ∀ j : Fin k, OddOrder.Isaacs.Ch06.IsFrobeniusGroup
↥(F.L j) ((F.H j).subgroupOf (F.L j)) (C j))
theorem exists_weightedGammaDecomposition
(i : Fin k) (B : Finset (Fin k))
(hB : ∀ j ∈ B, i ≠ j) :
∃ x : Fin k → ℤ, ∃ Γ₁ : ClassFunction G ℂ,
(∀ j, ClassFunction.inner
(F.betaAt hodd hnilp C hFrob i)
(F.distinguishedNuAt hodd hnilp C hFrob j) = (x j : ℂ)) ∧
(∀ j ∈ B, ∀ l ∈ B,
ClassFunction.inner
(F.weightedNuSumAt hodd hnilp C hFrob j)
(F.weightedNuSumAt hodd hnilp C hFrob l) =
if j = l then (F.BsumWeight j : ℂ) else 0) ∧
F.gammaAt hodd hnilp C hFrob i =
(∑ j ∈ B,
(((x j : ℝ) : ℂ) • F.weightedNuSumAt hodd hnilp C hFrob j)) + Γ₁ ∧
∀ j ∈ B, ClassFunction.inner Γ₁
(F.weightedNuSumAt hodd hnilp C hFrob j) = 0 := by sorry
end FamilyRealization
end FrobeniusFamily
end OddOrder.Peterfalvi.S09