Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 14

Open
QAlgorithms.Papers.Independent.Gap20.P19.noncommutingWeylObstruction

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 an integer d≥1d\ge1d≥1, let Vj,k=XjZkV_{j,k}=X^jZ^kVj,k​=XjZk with labels in Zd2\mathbb Z_d^2Zd2​, forward cyclic shift XXX and positive-phase clock ZZZ. Let am≥0a_m\ge0am​≥0, ∑mam=1\sum_m a_m=1∑m​am​=1, and Pa(ρ)=∑mamVmρVm†P_a(\rho)=\sum_m a_mV_m\rho V_m^\daggerPa​(ρ)=∑m​am​Vm​ρVm†​. These ama_mam​ are probabilities.

Retain the standing hypothesis a0,0≠0a_{0,0}\ne0a0,0​=0. If al≠0a_l\ne0al​=0, ak≠0a_k\ne0ak​=0, and VlVk≠VkVlV_lV_k\ne V_kV_lVl​Vk​=Vk​Vl​, then

Pa is not degradable.P_a\text{ is not degradable}.Pa​ is not degradable.

Identity support is essential: without it, a qubit mixture of XXX and ZZZ contradicts this assertion.

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]

/-- Corollary 14, PDF pp.21–22: standing a_0≠0 is retained. Without it,
a qubit mixture of X and Z refutes the raw noncommutation assertion. -/
theorem noncommutingWeylObstruction (d : ℕ) [NeZero d]
    (a : WeylLabel d → ℝ) (ha : WeylProbabilities a) (hidentity : a (0,0) ≠ 0)
    (l k : WeylLabel d) (hl : a l ≠ 0) (hk : a k ≠ 0)
    (hcomm : finWeyl d l * finWeyl d k ≠ finWeyl d k * finWeyl d l) :
    ¬ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (weylChannel d a) ∧ IsDegradable witness) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 22, Corollary 14
Read-back

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

Let ddd be a nonzero natural number and let a:Zd2→Ra:\mathbb Z_d^2\to\mathbb Ra:Zd2​→R have nonnegative entries summing to 111, with a(0,0)≠0a_{(0,0)}\ne0a(0,0)​=0. Define W(s,t)=SsrepCtrepW_{(s,t)}=S^{s_{\mathrm{rep}}}C^{t_{\mathrm{rep}}}W(s,t)​=Ssrep​Ctrep​, where S∣j⟩=∣j+1⟩S|j\rangle=|j+1\rangleS∣j⟩=∣j+1⟩, C∣j⟩=e2πij/d∣j⟩C|j\rangle=e^{2\pi i j/d}|j\rangleC∣j⟩=e2πij/d∣j⟩, addition is modulo ddd, and the exponents use representatives in {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}. Put Φa(X)=∑sasWsXWs†\Phi_a(X)=\sum_sa_sW_sXW_s^\daggerΦa​(X)=∑s​as​Ws​XWs†​. For every pair of labels l,kl,kl,k satisfying al≠0a_l\ne0al​=0, ak≠0a_k\ne0ak​=0, and WlWk≠WkWlW_lW_k\ne W_kW_lWl​Wk​=Wk​Wl​, there do not exist a natural number eee, a matrix V:Cd→Cd⊗CeV:\mathbb C^d\to\mathbb C^d\otimes\mathbb C^eV:Cd→Cd⊗Ce with V†V=IdV^\dagger V=I_dV†V=Id​, and a map D(Y)=∑jLjYLj†D(Y)=\sum_jL_jYL_j^\daggerD(Y)=∑j​Lj​YLj†​ with a finite family satisfying ∑jLj†Lj=Id\sum_jL_j^\dagger L_j=I_d∑j​Lj†​Lj​=Id​, such that, for every matrix XXX,

Tr⁡e(VXV†)=Φa(X),Tr⁡d(VXV†)=D(Φa(X)).\operatorname{Tr}_e(VXV^\dagger)=\Phi_a(X), \qquad \operatorname{Tr}_d(VXV^\dagger)=D(\Phi_a(X)).Tre​(VXV†)=Φa​(X),Trd​(VXV†)=D(Φa​(X)).

Partial traces sum matching indices of the discarded factor. The noncommutation hypothesis is literal matrix inequality, and cannot hold when d=1d=1d=1.

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