Proposition 30 and Remarks 31–32: simultaneous Choi diagonalization
ProvedQAlgorithms.Papers.Independent.Extend50.P31.proposition30_simultaneousLet 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.
For the selected normalized matrices define . No trace-preservation or real-character hypothesis is imposed. The eigenvalues do not depend on the positive pivots, and
This describes the simultaneous Choi diagonalization 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.15, Proposition 30 and Remarks 31--32 Eqs.(76)--(78).
The modulus is squared, with no TP or real-character assumption. -/
theorem proposition30_simultaneous (D : Data G A n) (P : Pivots D) :
(∀ a : OccurringIrrep D, ∀ r, (choi (centralMap D.U D.F a.val)).mulVec (choiVector D P r) =
spectralMatrix D P r a • choiVector D P r) ∧
(∀ a b : OccurringIrrep D, choi (centralMap D.U D.F a.val) * choi (centralMap D.U D.F b.val) =
choi (centralMap D.U D.F b.val) * choi (centralMap D.U D.F a.val)) ∧
(∀ a : A, ∀ r : Row D, ∀ p q,
0 < pivotWeight D.U D.F r.1.val r.2 p → 0 < pivotWeight D.U D.F r.1.val r.2 q →
muAt D a r p = muAt D a r q) := 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 of positive dimension , a complete pairwise inequivalent family of positive dimensional irreducible unitary representations of dimensions , a distinguished one-dimensional trivial representation, and a finite subset with a complex linear intertwining isomorphism , each listed representation appearing once. Write , , , and define
for and index pairs . Given a choice of pairs with , let and . For any pair put and
With the unnormalized Choi matrix defined by , the assertion is that for every and every ; that for every ; and that, for every , every , and all pairs with and , one has . The last assertion includes indices outside and concerns only pairs with strictly positive weights.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.