The four-piece split of a conjugation-invariant sum over (counting skeleton of (13.10))
ProvedOddOrder.Peterfalvi.S15.Hypothesis.sum_univ_splitLet 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 , , (, ). Let be a finite group (Fintype G) with IsMinimalSimpleOdd G, assume and , let be an additive commutative monoid and a class function (f (g x g⁻¹) = f x for all ). Put , and let hyp.G0Finset be the set of elements of outside . Then
where denotes the -fold multiple in .
Instances with give the Parseval splits (13.10.1), (13.10.2) and the cover count (13.10.3).
Formalization Note. is defined in the formalization as the complement of the other pieces (see G0Finset).
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_PairStructure import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_CountingLayer
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
variable {G : Type*} [Group G]
section CountingLayer
open OddOrder.GroupTheory
open scoped Classical in
theorem Hypothesis.sum_univ_split [Fintype G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
(hyp : Hypothesis (G := G)) {M : Type*} [AddCommMonoid M] (f : G → M)
(hf : ∀ g x : G, f (g * x * g⁻¹) = f x)
(hcardQ : Nat.card ↥hyp.Q = hyp.q ^ hyp.p) (hvd : hyp.v * hyp.d ≠ 1) :
∑ x : G, f x
= f 1 + (∑ x ∈ hyp.G0Finset, f x)
+ hyp.S.index • ∑ x ∈ (Set.toFinite (sharpSubgroup hyp.H)).toFinset, f x
+ hyp.T.index • ∑ x ∈ (Set.toFinite (sharpSubgroup hyp.Q)).toFinset, f x := by sorry
end CountingLayer
end OddOrder.Peterfalvi.S15