Character orthogonality for coordinate-fixed irreducible finite-group representations
ProvedQAlgorithms.Papers.Independent.Extend50.P31.character_orthogonalityfinite-groupsquantum-informationrepresentation-theory
Let be a finite group and a coordinate-fixed family of pairwise inequivalent unitary irreducible complex representations. For any labels , their characters satisfy
This is Schur character orthogonality in the paper's conventions. It applies without requiring to be finite and is the basic input for character projectors, channel trace preservation, and uniform group averaging.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P31 import Mathlib.RepresentationTheory.Character import Mathlib.Analysis.Complex.Polynomial.Basic noncomputable section open scoped Matrix ComplexConjugate open QAlgorithms.Papers.Independent.Extend50.P31
Formal statement
theorem QAlgorithms.Papers.Independent.Extend50.P31.character_orthogonality {G A : Type*} [Group G] [Fintype G] [DecidableEq A] (F : IrrepFamily G A) (a b : A) :
(Fintype.card G : ℂ)⁻¹ * ∑ g : G, character (F.irrep a) g * character (F.irrep b) g⁻¹ =
if a = b then 1 else 0 := by sorrySource
Mozrzymas, Studzinski and Datta, Structure of irreducibly covariant quantum channels for finite groups, https://arxiv.org/abs/1610.05657v2, PDF p.10, Schur orthogonality Eq.(43) summed on diagonal indices, and Eq.(44).