Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Character orthogonality for coordinate-fixed irreducible finite-group representations

Proved
QAlgorithms.Papers.Independent.Extend50.P31.character_orthogonality

by Mrnaiq · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-groupsquantum-informationrepresentation-theory

Let GGG be a finite group and (φa)a∈A(\varphi^a)_{a\in A}(φa)a∈A​ a coordinate-fixed family of pairwise inequivalent unitary irreducible complex representations. For any labels a,ba,ba,b, their characters satisfy

1∣G∣∑g∈Gχa(g)χb(g−1)={1a=b,0a≠b.\frac1{|G|}\sum_{g\in G}\chi_a(g)\chi_b(g^{-1})=\begin{cases}1&a=b,\\0&a\ne b.\end{cases}∣G∣1​g∈G∑​χa​(g)χb​(g−1)={10​a=b,a=b.​

This is Schur character orthogonality in the paper's conventions. It applies without requiring AAA 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 sorry
Source
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).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me