Example 55: uniform class function gives the depolarizing projector
ProvedQAlgorithms.Papers.Independent.Extend50.P31.example55_uniformLet 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.
Take the constant function in the character-coefficient construction. Its coefficients and resulting map are
This describes the uniform class function gives the depolarizing projector 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.24, Example 55 Eq.(122), with explicit depolarizing action from Eq.(58). -/
theorem example55_uniform (D : Data G A n) :
(∀ a : OccurringIrrep D, classCoefficients D (fun _ => 1) a = if a.val = D.F.trivial then 1 else 0) ∧
spectralMap D (classCoefficients D (fun _ => 1)) = centralMap D.U D.F D.F.trivial ∧
∀ X : Mat n, spectralMap D (classCoefficients D (fun _ => 1)) X =
(Matrix.trace X / n) • (1 : Mat n) := 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 type with decidable equality, and consist of an irreducible unitary representation , , a complete family of pairwise inequivalent irreducible unitary representations of positive dimensions , with designated one-dimensional trivial member , and an invertible complex-linear intertwining equivalence for a subset , each summand appearing once. For , define
Then every satisfies if and otherwise; ; and, for every complex matrix , . The formula applies to all matrices , without a positivity or normalization hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.