Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9: covariance is a matrix commutant condition

Proved
QAlgorithms.Papers.Independent.Extend50.P31.lemma9_covariance

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let GGG be finite, let U:G→U(n)U:G\to U(n)U:G→U(n) be unitary irreducible with n>0n>0n>0, and let Φ:Mn(C)→Mn(C)\Phi:M_n(\mathbb C)\to M_n(\mathbb C)Φ:Mn​(C)→Mn​(C) be complex-linear. Covariance is equivalent to the matrix commutant condition:

[∀g,X, Φ(U(g)XU(g)†)=U(g)Φ(X)U(g)†] ⟺ mat⁡(Φ)∈Int⁡G(U⊗U‾).\bigl[\forall g,X,\ \Phi(U(g)XU(g)^\dagger)=U(g)\Phi(X)U(g)^\dagger\bigr]\ \Longleftrightarrow\ \operatorname{mat}(\Phi)\in\operatorname{Int}_G(U\otimes\overline U).[∀g,X, Φ(U(g)XU(g)†)=U(g)Φ(X)U(g)†] ⟺ mat(Φ)∈IntG​(U⊗U).

This transfers covariance to a matrix commutant without complete positivity or multiplicity-freeness assumptions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P31
Formal statement
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
Source
Structure of irreducibly covariant quantum channels for finite groups, arXiv:1610.05657v2, PDF p. 8, Lemma 9: covariance is a matrix commutant condition
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For a group GGG supplied with the hypothesis that it is finite, a positive-dimensional irreducible unitary representation U:G→Mn(C)U:G\to M_n(\mathbb C)U:G→Mn​(C), and any complex-linear map Φ:Mn(C)→Mn(C)\Phi:M_n(\mathbb C)\to M_n(\mathbb C)Φ:Mn​(C)→Mn​(C), define SΦS_\PhiSΦ​ by (SΦ)(i,j),(k,ℓ)=Φ(Ekℓ)ij(S_\Phi)_{(i,j),(k,\ell)}=\Phi(E_{k\ell})_{ij}(SΦ​)(i,j),(k,ℓ)​=Φ(Ekℓ​)ij​, and define RgR_gRg​ by (Rg)(i,j),(k,ℓ)=U(g)ikU(g)jℓ‾(R_g)_{(i,j),(k,\ell)}=U(g)_{ik}\overline{U(g)_{j\ell}}(Rg​)(i,j),(k,ℓ)​=U(g)ik​U(g)jℓ​​. 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

[∀g∈G, ∀X∈Mn(C), Φ ⁣(U(g)XU(g)†)=U(g)Φ(X)U(g)†]⟺[∀g∈G, SΦRg=RgSΦ].\left[ \forall g\in G,\ \forall X\in M_n(\mathbb C),\ \Phi\!\left(U(g)XU(g)^\dagger\right) =U(g)\Phi(X)U(g)^\dagger \right] \quad\Longleftrightarrow\quad \left[ \forall g\in G,\ S_\Phi R_g=R_gS_\Phi \right].[∀g∈G, ∀X∈Mn​(C), Φ(U(g)XU(g)†)=U(g)Φ(X)U(g)†]⟺[∀g∈G, SΦ​Rg​=Rg​SΦ​].
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 2026

    Confirmed by the mission captain (proposal self-audit).

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