Class-sum coefficient times a centralizer order as a sum over irreducible characters
ProvedOddOrder.RepresentationTheory.classSumCoeff_mul_centralizer_card_eq_sum_irreducibleCharacterfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group and let be conjugacy classes of . Let be the class-sum coefficient, the number of pairs with , , (classSumCoeff). Let be a chosen representative of (Cs.out), and similarly for . Then in ,
This is the class-sum coefficient formula with the centralizer factor left explicit: multiplying the pair-count coefficient by inverts the single-character central-character product formula by column orthogonality.
Formalization Note The sum runs over IrreducibleCharacter G, viewed as class functions G → ℂ; is Nat.card {x // ConjClasses.mk x = Ci}; is Nat.card (Subgroup.centralizer {Cs.out}).
Preamble
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ClassSumAlgebra import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality
Formal statement
namespace OddOrder.RepresentationTheory
open OddOrder.GroupTheory.CenterClassSum
variable {G : Type*} [Group G]
section Formula
variable [Fintype G] [DecidableEq (ConjClasses G)]
theorem classSumCoeff_mul_centralizer_card_eq_sum_irreducibleCharacter
(Ci Cj Cs : ConjClasses G) :
(classSumCoeff Ci Cj Cs : ℂ) *
(Nat.card (Subgroup.centralizer ({Cs.out} : Set G)) : ℂ) =
∑ χ : IrreducibleCharacter G,
(((Nat.card { x : G // ConjClasses.mk x = Ci } : ℂ) *
(χ : ClassFunction G ℂ) Ci.out *
((Nat.card { x : G // ConjClasses.mk x = Cj } : ℂ) *
(χ : ClassFunction G ℂ) Cj.out)) /
(χ : ClassFunction G ℂ) (1 : G)) *
(χ : ClassFunction G ℂ) Cs.out⁻¹ := by sorry
end Formula
end OddOrder.RepresentationTheorySource
Yawara Ishida, Lean 4 formalization of the Feit–Thompson (odd order) theorem, github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0), https://github.com/yawara/odd-order/blob/20a6fccbb63c0b138acda9f7fafd798c42f9441b/OddOrder/GroupTheory/RepresentationTheory/ClassSumCoefficientFormula.lean#L119-L210