Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2: self-complementary Werner–Holevo qutrit channel

Proved
QAlgorithms.Papers.Independent.Gap20.P19.wernerHolevoStructure

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write r(Φ)r(\Phi)r(Φ) for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.

For d>1d>1d>1, define Wd(X)=(Tr⁡(X)I−XT)/(d−1)W_d(X)=(\operatorname{Tr}(X)I-X^T)/(d-1)Wd​(X)=(Tr(X)I−XT)/(d−1), extending the source's formula linearly. Every unit pure input has output rank d−1d-1d−1. In dimension three the isometry U(b,e),a=εbea/2U_{(b,e),a}=\varepsilon_{bea}/\sqrt2U(b,e),a​=εbea​/2​, where ε\varepsilonε is the three-dimensional Levi-Civita tensor, has both marginals equal to W3W_3W3​, and

W3=W3C,W3 is degradable, antidegradable, and an extreme CPTP map.W_3=W_3^C,\qquad W_3\text{ is degradable, antidegradable, and an extreme CPTP map}.W3​=W3C​,W3​ is degradable, antidegradable, and an extreme CPTP map.

This is a concrete channel with no full-rank pure output.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P19

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker

open Filter Topology

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
   maximumCoherentInformation dilationPower)

open QAlgorithms.Papers.Independent.Claimed50.P48
  (MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)

open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)

open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)

open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)

open QAlgorithms.Papers.Independent.Information100.P69 (choi)

open QAlgorithms.Papers.Independent.Information100.P50 (matrixRange)

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C E F R K A2 B2 E2 : Type}

variable [Fintype A] [DecidableEq A] [Nonempty A]

variable [Fintype B] [DecidableEq B] [Nonempty B]

variable [Fintype C] [DecidableEq C] [Nonempty C]

variable [Fintype E] [DecidableEq E] [Nonempty E]

variable [Fintype F] [DecidableEq F] [Nonempty F]

variable [Fintype R] [DecidableEq R] [Nonempty R]

variable [Fintype K] [DecidableEq K]

variable [Fintype A2] [DecidableEq A2] [Nonempty A2]

variable [Fintype B2] [DecidableEq B2] [Nonempty B2]

variable [Fintype E2] [DecidableEq E2] [Nonempty E2]

/-- Section 2.2, PDF p.10: pure-output rank in every d>1 and the specific
self-complementary extreme Werner–Holevo qutrit channel. The complement is tied
to its antisymmetric Levi-Civita isometry, not freely selected. -/
theorem wernerHolevoStructure :
    (∀ d : ℕ, 1 < d → ∀ psi : EuclideanSpace ℂ (Fin d), IsState psi →
      (wernerHolevo d (pureDensity psi)).rank = d-1) ∧
    IsIsometry wernerIsometry ∧ receiverChannel wernerIsometry = wernerHolevo 3 ∧
    complementaryChannel wernerIsometry = wernerHolevo 3 ∧
    (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (wernerHolevo 3) ∧ IsDegradable witness) ∧ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (wernerHolevo 3) ∧ IsAntidegradable witness) ∧
    ExtremeIn IsChannel (wernerHolevo 3) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 10, §2.2: self-complementary Werner–Holevo qutrit channel
Read-back

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

For every natural number d>1d>1d>1 and every vector ψ∈Cd\psi\in\mathbb C^dψ∈Cd with ∥ψ∥=1\|\psi\|=1∥ψ∥=1, define Wd(X)=(Tr⁡(X)I−XT)/(d−1)W_d(X)=(\operatorname{Tr}(X)I-X^{\mathsf T})/(d-1)Wd​(X)=(Tr(X)I−XT)/(d−1); then rank⁡Wd(ψψ†)=d−1\operatorname{rank}W_d(\psi\psi^\dagger)=d-1rankWd​(ψψ†)=d−1. Define V:C3→C3⊗C3V:\mathbb C^3\to\mathbb C^3\otimes\mathbb C^3V:C3→C3⊗C3 by V(i,j),k=0V_{(i,j),k}=0V(i,j),k​=0 if any two of i,j,k∈{0,1,2}i,j,k\in\{0,1,2\}i,j,k∈{0,1,2} coincide, and otherwise by 1/21/\sqrt21/2​ if j=(i+1) mod 3j=(i+1)\bmod3j=(i+1)mod3, and −1/2-1/\sqrt2−1/2​ otherwise. Then

V†V=I,Tr⁡second(VXV†)=W3(X)=Tr⁡first(VXV†)V^\dagger V=I,\qquad \operatorname{Tr}_{\text{second}}(VXV^\dagger)=W_3(X) =\operatorname{Tr}_{\text{first}}(VXV^\dagger)V†V=I,Trsecond​(VXV†)=W3​(X)=Trfirst​(VXV†)

for every 3×33\times33×3 matrix XXX. There exists a finite isometric dilation of W3W_3W3​ whose environment output can be obtained from its receiver output by a channel, and there exists one whose receiver output can be obtained from its environment output by a channel. Here a channel has a finite Kraus representation X↦∑ℓKℓXKℓ†X\mapsto\sum_\ell K_\ell XK_\ell^\daggerX↦∑ℓ​Kℓ​XKℓ†​ with ∑ℓKℓ†Kℓ=I\sum_\ell K_\ell^\dagger K_\ell=I∑ℓ​Kℓ†​Kℓ​=I, and the conversion identities hold for all matrices. Finally, W3W_3W3​ is a channel and, whenever channels N,MN,MN,M on 3×33\times33×3 matrices and 0<p<10<p<10<p<1 satisfy W3(X)=pN(X)+(1−p)M(X)W_3(X)=pN(X)+(1-p)M(X)W3​(X)=pN(X)+(1−p)M(X) for every XXX, both N=W3N=W_3N=W3​ and M=W3M=W_3M=W3​.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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