Conjugation-invariant sums over the saturation of a TI-subset
ProvedOddOrder.GroupTheory.IsTISubset.sum_conjClassSetLet be a finite group, a subgroup, and a TI-subset with normalizer bound , meaning: whenever and some has , then . Assume is stabilized by ( for all ). Let be a function into an additive commutative monoid that is conjugation invariant: for all . Then the sum of over the saturation equals times the sum over :
The saturation is the disjoint union of the conjugates indexed by cosets (disjointness is the TI condition), and each conjugate contributes the same sum. This is the weighted refinement of the cardinality count of the saturation, and the Parseval-split engine for the norm estimates of Peterfalvi (13.10).
Formalization Note IsTISubset A L is the project definition of the TI condition; the saturation is conjClassSet A; the factor acts by L.index • _ (repeated addition in ).
import Definitions.Def_OddOrder_GroupTheory_TISubset import Definitions.Def_OddOrder_GroupTheory_ConjClassSet import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedCharacter import Mathlib.GroupTheory.QuotientGroup.Basic import Mathlib.GroupTheory.Index import Mathlib.Algebra.BigOperators.GroupWithZero.Action
namespace OddOrder.GroupTheory
variable {G : Type*} [Group G]
namespace IsTISubset
open scoped Pointwise
theorem sum_conjClassSet [Finite G] {A : Set G} {L : Subgroup G}
{M : Type*} [AddCommMonoid M] (f : G → M)
(hTI : IsTISubset A L) (hstab : ∀ l ∈ L, MulAut.conj l • A = A)
(hf : ∀ g x : G, f (g * x * g⁻¹) = f x) :
∑ x ∈ (Set.toFinite (conjClassSet A)).toFinset, f x
= L.index • ∑ a ∈ (Set.toFinite A).toFinset, f a := by sorry
end IsTISubset
end OddOrder.GroupTheory