Proposition 13: character projectors form the commutant basis
ProvedQAlgorithms.Papers.Independent.Extend50.P31.proposition13_projectorsLet be a finite group and an ordinary unitary irreducible representation with . Fix a complete family of inequivalent unitary irreducibles , in fixed coordinate bases, with dimensions and characters . Assume , each occurring once. Throughout, , , and is unnormalized. Fine projectors use the diagonal matrix coefficient in place of the character. Whenever vectors occur, choose one pivot per fine sector with and set and . Write and when these spectral coordinates occur.
Define . Their span is the entire commutant, of dimension . They form a complete orthogonal family of self-adjoint projectors:
This describes the character projectors form the commutant basis in the fixed source conventions.
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P31
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Extend50.P31
open QAlgorithms.Papers.Independent.Information100.P44 (Mat matrixUnit)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)
open QAlgorithms.Papers.Independent.Bridge50.P37 (hsAdjoint)
open QAlgorithms.Papers.Independent.Information100.P34 (choi)
open QAlgorithms.Papers.Independent.Dependency50.P26 (TracePreserving)
open QAlgorithms.Papers.Independent.Dependency50.P16 (sandwich)
open QAlgorithms.Papers.Independent.Information100.P75 (phase)
variable {G A : Type*} [Group G] [Fintype G] [Fintype A] [DecidableEq A] {n : ℕ}
/-- PDF p.11, Proposition 13 Eqs.(48)--(50): projectors are the computed Eq.(49) averages. -/
theorem proposition13_projectors (D : Data G A n) :
representationCommutant (tensorConjugate D.U) =
Submodule.span ℂ (Set.range (fun a : OccurringIrrep D => centralMatrix D.U D.F a.val)) ∧
Module.finrank ℂ (representationCommutant (tensorConjugate D.U)) = Fintype.card (OccurringIrrep D) ∧
(∀ a b : OccurringIrrep D, centralMatrix D.U D.F a.val * centralMatrix D.U D.F b.val =
if a = b then centralMatrix D.U D.F a.val else 0) ∧
(∀ a : OccurringIrrep D, (centralMatrix D.U D.F a.val)ᴴ = centralMatrix D.U D.F a.val) ∧
(∑ a : OccurringIrrep D, centralMatrix D.U D.F a.val) = 1 ∧
(∀ a : OccurringIrrep D, Matrix.trace (centralMatrix D.U D.F a.val) = (D.F.dim a.val : ℂ) ∧
Matrix.rank (centralMatrix D.U D.F a.val) = D.F.dim a.val) := by sorry
end QAlgorithms.Papers.Independent.Extend50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite group, a finite index set with decidable equality, and consist of an irreducible unitary representation with , a complete family of pairwise inequivalent irreducible unitary representations of positive dimensions , with a designated one-dimensional trivial member, and a subset together with a complex-linear intertwining isomorphism from to . Write , and define
Then , , and, for every ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.