Lemma 9: covariance is a matrix commutant condition
ProvedQAlgorithms.Papers.Independent.Extend50.P31.lemma9_covarianceLet be finite, let be unitary irreducible with , and let be complex-linear. Covariance is equivalent to the matrix commutant condition:
This transfers covariance to a matrix commutant without complete positivity or multiplicity-freeness assumptions.
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 pp.8--9, Lemma 9 Eq.(32), Appendix A p.34. No CP or MF premise. -/
theorem lemma9_covariance (hG : Finite G) (U : UnitaryIrrep G n) (Phi : EndMat n) :
IsIrrepCovariant U Phi ↔ rowMatrixRepresentative Phi ∈ representationCommutant (tensorConjugate U) := by sorry
end QAlgorithms.Papers.Independent.Extend50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For a group supplied with the hypothesis that it is finite, a positive-dimensional irreducible unitary representation , and any complex-linear map , define by , and define by . The representation preserves identity and multiplication, its matrices satisfy both unitary identities, and its only invariant complex subspaces are zero and the whole space. The assertion is the equivalence
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.