Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.3: symmetric-subspace channel (23)

Proved
QAlgorithms.Papers.Independent.Gap20.P19.symmetricSelfComplement

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.

Let V:C6→C3⊗C3V:\mathbb C^6\to\mathbb C^3\otimes\mathbb C^3V:C6→C3⊗C3 send a standard basis to the three diagonal vectors and the three normalized symmetric off-diagonal vectors. Then

V†V=I,VV†=(I+Swap)/2,S(ρ)=Tr⁡E(VρV†)=SC(ρ).V^\dagger V=I,\quad VV^\dagger=(I+\mathrm{Swap})/2,\quad S(\rho)=\operatorname{Tr}_E(V\rho V^\dagger)=S^C(\rho).V†V=I,VV†=(I+Swap)/2,S(ρ)=TrE​(VρV†)=SC(ρ).

The channel SSS is both degradable and antidegradable, with Choi rank three.

This constructs the source's symmetric-subspace example rather than assuming self-complementarity of an unrelated channel.

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.3, PDF p.11, (23): the constructed symmetric-subspace map
has equal marginals and is both classes; its Choi rank is three. -/
theorem symmetricSelfComplement :
    IsIsometry symmetricIsometry ∧
    (∀ p q, (symmetricIsometry * symmetricIsometryᴴ) p q =
      (1/2 : ℂ)*((if p=q then 1 else 0)+(if p=(q.2,q.1) then 1 else 0))) ∧
    complementaryChannel symmetricIsometry = symmetricSubspaceMap ∧
    (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = symmetricSubspaceMap ∧ IsDegradable witness) ∧ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = symmetricSubspaceMap ∧ IsAntidegradable witness) ∧
    (choi symmetricSubspaceMap).rank = 3 := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 11, §2.3: symmetric-subspace channel (23)
Read-back

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

Define S:C6→C3⊗C3S:\mathbb C^6\to\mathbb C^3\otimes\mathbb C^3S:C6→C3⊗C3 by sending the first three standard basis vectors to ∣0,0⟩,∣1,1⟩,∣2,2⟩|0,0\rangle,|1,1\rangle,|2,2\rangle∣0,0⟩,∣1,1⟩,∣2,2⟩, and the last three respectively to (∣0,1⟩+∣1,0⟩)/2(|0,1\rangle+|1,0\rangle)/\sqrt2(∣0,1⟩+∣1,0⟩)/2​, (∣0,2⟩+∣2,0⟩)/2(|0,2\rangle+|2,0\rangle)/\sqrt2(∣0,2⟩+∣2,0⟩)/2​, and (∣1,2⟩+∣2,1⟩)/2(|1,2\rangle+|2,1\rangle)/\sqrt2(∣1,2⟩+∣2,1⟩)/2​. Let N(X)=Tr⁡second(SXS†)N(X)=\operatorname{Tr}_{\text{second}}(SXS^\dagger)N(X)=Trsecond​(SXS†). Then S†S=IS^\dagger S=IS†S=I, and for every p,q∈{0,1,2}2p,q\in\{0,1,2\}^2p,q∈{0,1,2}2,

(SS†)pq=12(1p=q+1p=(q2,q1)).(SS^\dagger)_{pq} =\frac12\left(\mathbf1_{p=q}+\mathbf1_{p=(q_2,q_1)}\right).(SS†)pq​=21​(1p=q​+1p=(q2​,q1​)​).

Furthermore, Tr⁡first(SXS†)=N(X)\operatorname{Tr}_{\text{first}}(SXS^\dagger)=N(X)Trfirst​(SXS†)=N(X) for every 6×66\times66×6 matrix XXX. There exists a finite isometric dilation of NNN whose environment output is obtained from its receiver output by a channel, and there exists a finite isometric dilation whose receiver output is obtained from its environment output by a channel, with both identities required on all matrices. A channel means a map Y↦∑ℓKℓYKℓ†Y\mapsto\sum_\ell K_\ell YK_\ell^\daggerY↦∑ℓ​Kℓ​YKℓ†​ with finitely many Kraus matrices satisfying ∑ℓKℓ†Kℓ=I\sum_\ell K_\ell^\dagger K_\ell=I∑ℓ​Kℓ†​Kℓ​=I. Finally, the Choi matrix J(N)(a,b),(a′,b′)=N(Eaa′)bb′J(N)_{(a,b),(a',b')}=N(E_{aa'})_{bb'}J(N)(a,b),(a′,b′)​=N(Eaa′​)bb′​ has rank three.

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