Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7: qutrit nondegradable channels arbitrarily near identity

Open
QAlgorithms.Papers.Independent.Gap20.P19.nearIdentityNeither

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.

Set εn=1/(n+4)\varepsilon_n=1/(n+4)εn​=1/(n+4) for n≥0n\ge0n≥0 and

Tn(ρ)=(1−2εn)ρ+εnXρX†+εnZρZ†T_n(\rho)=(1-2\varepsilon_n)\rho+\varepsilon_nX\rho X^\dagger+\varepsilon_nZ\rho Z^\daggerTn​(ρ)=(1−2εn​)ρ+εn​XρX†+εn​ZρZ†

on qutrits. Every TnT_nTn​ is CPTP, has Choi rank three, and is neither degradable nor antidegradable. Also 2εn→02\varepsilon_n\to02εn​→0, and for every matrix unit EijE_{ij}Eij​ and every output entry (k,l)(k,l)(k,l), (Tn(Eij))kl→(Eij)kl(T_n(E_{ij}))_{kl}\to(E_{ij})_{kl}(Tn​(Eij​))kl​→(Eij​)kl​.

This makes the source's arbitrarily-near-identity conclusion precise by entrywise convergence, without inventing a diamond-distance constant.

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 7, PDF p.23: an explicit sequence of rank-three qutrit channels,
neither class, converging entrywise on all matrix units to the identity. -/
theorem nearIdentityNeither :
    let eps : ℕ → ℝ := fun n => 1/((n : ℝ)+4)
    let N : ℕ → Superop (Fin 3) (Fin 3) := fun n => threeWeyl (1-2*eps n) (eps n) (eps n)
    (∀ n, IsChannel (N n) ∧ (choi (N n)).rank = 3 ∧
      ¬ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (N n) ∧ IsDegradable witness) ∧ ¬ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (N n) ∧ IsAntidegradable witness)) ∧
    Tendsto (fun n => 2*eps n) atTop (nhds 0) ∧
    (∀ i j k l : Fin 3, Tendsto (fun n => N n (Matrix.single i j 1) k l)
      atTop (nhds ((Matrix.single i j 1 : Matrix (Fin 3) (Fin 3) ℂ) k l))) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 23, §7: qutrit nondegradable channels arbitrarily near identity
Read-back

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

For every natural number nnn, including n=0n=0n=0, set εn=1/(n+4)\varepsilon_n=1/(n+4)εn​=1/(n+4) and define the map on 3×33\times33×3 complex matrices

Nn(ρ)=(1−2εn)ρ+εnSρS†+εnZρZ†,N_n(\rho)=(1-2\varepsilon_n)\rho+\varepsilon_n S\rho S^\dagger+\varepsilon_n Z\rho Z^\dagger,Nn​(ρ)=(1−2εn​)ρ+εn​SρS†+εn​ZρZ†,

where S∣j⟩=∣j+1 mod 3⟩S|j\rangle=|j+1\bmod3\rangleS∣j⟩=∣j+1mod3⟩ and Z∣j⟩=e2πij/3∣j⟩Z|j\rangle=e^{2\pi i j/3}|j\rangleZ∣j⟩=e2πij/3∣j⟩. Each NnN_nNn​ is a channel, meaning it has a finite Kraus representation with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, and its Choi matrix J(Nn)(a,b),(a′,b′)=Nn(∣a⟩⟨a′∣)b,b′J(N_n)_{(a,b),(a',b')}=N_n(|a\rangle\langle a'|)_{b,b'}J(Nn​)(a,b),(a′,b′)​=Nn​(∣a⟩⟨a′∣)b,b′​ has rank 333. There is no natural number rrr and matrix W:C3→C3×rW:\mathbb C^3\to\mathbb C^{3\times r}W:C3→C3×r whose receiver map is NnN_nNn​ and which is degradable; nor is there such a WWW which is antidegradable. Here the receiver and complementary maps are RW(ρ)=Tr⁡r(WρW†)R_W(\rho)=\operatorname{Tr}_{r}(W\rho W^\dagger)RW​(ρ)=Trr​(WρW†) and CW(ρ)=Tr⁡3(WρW†)C_W(\rho)=\operatorname{Tr}_{3}(W\rho W^\dagger)CW​(ρ)=Tr3​(WρW†); degradability requires W†W=IW^\dagger W=IW†W=I and a channel DDD satisfying CW=D∘RWC_W=D\circ R_WCW​=D∘RW​ on every matrix, while antidegradability requires W†W=IW^\dagger W=IW†W=I and a channel DDD satisfying RW=D∘CWR_W=D\circ C_WRW​=D∘CW​ on every matrix. The quantified environment size includes r=0r=0r=0, although that size cannot support such an isometry. Furthermore, 2εn→02\varepsilon_n\to02εn​→0, and for all i,j,k,l∈{0,1,2}i,j,k,l\in\{0,1,2\}i,j,k,l∈{0,1,2},

Nn(∣i⟩⟨j∣)k,l⟶(∣i⟩⟨j∣)k,las n→∞.N_n(|i\rangle\langle j|)_{k,l}\longrightarrow (|i\rangle\langle j|)_{k,l} \quad\text{as }n\to\infty.Nn​(∣i⟩⟨j∣)k,l​⟶(∣i⟩⟨j∣)k,l​as n→∞.
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