Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.4: face antidegradability criterion (109)

Open
QAlgorithms.Papers.Independent.Gap20.P19.threeKrausFaceCriterion

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 σ0=I\sigma_0=Iσ0​=I and σ1,σ2,σ3=X,Y,Z\sigma_1,\sigma_2,\sigma_3=X,Y,Zσ1​,σ2​,σ3​=X,Y,Z. For real amplitudes ak≥0a_k\ge0ak​≥0 with ∑k=03ak2=1\sum_{k=0}^3a_k^2=1∑k=03​ak2​=1, put Pa(ρ)=∑k=03ak2σkρσkP_a(\rho)=\sum_{k=0}^3 a_k^2\sigma_k\rho\sigma_kPa​(ρ)=∑k=03​ak2​σk​ρσk​ and λk=a02+ak2−ai2−aj2\lambda_k=a_0^2+a_k^2-a_i^2-a_j^2λk​=a02​+ak2​−ai2​−aj2​, where {i,j,k}={1,2,3}\{i,j,k\}=\{1,2,3\}{i,j,k}={1,2,3}.

Assume a0=0a_0=0a0​=0 and a1,a2,a3≠0a_1,a_2,a_3\ne0a1​,a2​,a3​=0. Then

Pa is antidegradable  ⟺  (λi−λj)2≤(1−3λk)(1+λk)P_a\text{ is antidegradable}\iff(\lambda_i-\lambda_j)^2\le(1-3\lambda_k)(1+\lambda_k)Pa​ is antidegradable⟺(λi​−λj​)2≤(1−3λk​)(1+λk​)

for every permutation (i,j,k)(i,j,k)(i,j,k) of (1,2,3)(1,2,3)(1,2,3). Swapping a0a_0a0​ with any ana_nan​ preserves antidegradability and supplies the corresponding criterion on the other three faces.

The source's nonzero face-interior hypotheses are kept; edges are treated separately.

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]

/-- Appendix B.4, PDF pp.33–34, (109): interior of the a_0=0 face, with
nonzero remaining amplitudes. Other faces follow by swapping a_0 with a_n. -/
theorem threeKrausFaceCriterion (a : Fin 4 → ℝ)
    (ha : ∀ k, 0 ≤ a k) (hnorm : ∑ k, a k^2 = 1)
    (hzero : a 0 = 0) (hpos : ∀ k : Fin 3, a k.succ ≠ 0) :
    ((∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (qubitPauliMap a) ∧ IsAntidegradable witness) ↔ ∀ k : Fin 3,
      (pauliMultipliers a (k+1)-pauliMultipliers a (k+2))^2 ≤
        (1-3*pauliMultipliers a k)*(1+pauliMultipliers a k)) ∧
    (∀ n : Fin 4, ∀ b : Fin 4 → ℝ,
      b = a ∘ Equiv.swap 0 n →
      ((∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (qubitPauliMap b) ∧ IsAntidegradable witness) ↔ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (qubitPauliMap a) ∧ IsAntidegradable witness))) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 33, B.4: face antidegradability criterion (109)
Read-back

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

Let a0,a1,a2,a3a_0,a_1,a_2,a_3a0​,a1​,a2​,a3​ be nonnegative real numbers with ∑j=03aj2=1\sum_{j=0}^{3}a_j^2=1∑j=03​aj2​=1, a0=0a_0=0a0​=0, and a1,a2,a3≠0a_1,a_2,a_3\ne0a1​,a2​,a3​=0. For the standard Pauli matrices σ0=I,σ1=X,σ2=Y,σ3=Z\sigma_0=I,\sigma_1=X,\sigma_2=Y,\sigma_3=Zσ0​=I,σ1​=X,σ2​=Y,σ3​=Z, define Φa(ρ)=∑j=03aj2σjρσj†\Phi_a(\rho)=\sum_{j=0}^{3}a_j^2\sigma_j\rho\sigma_j^\daggerΦa​(ρ)=∑j=03​aj2​σj​ρσj†​, and define λ0=a02+a12−a22−a32\lambda_0=a_0^2+a_1^2-a_2^2-a_3^2λ0​=a02​+a12​−a22​−a32​, λ1=a02−a12+a22−a32\lambda_1=a_0^2-a_1^2+a_2^2-a_3^2λ1​=a02​−a12​+a22​−a32​, and λ2=a02−a12−a22+a32\lambda_2=a_0^2-a_1^2-a_2^2+a_3^2λ2​=a02​−a12​−a22​+a32​. Then Φa\Phi_aΦa​ admits a finite-dimensional antidegradable dilation if and only if, for every k=0,1,2k=0,1,2k=0,1,2,

(λk+1−λk+2)2≤(1−3λk)(1+λk),(\lambda_{k+1}-\lambda_{k+2})^2\le(1-3\lambda_k)(1+\lambda_k),(λk+1​−λk+2​)2≤(1−3λk​)(1+λk​),

where indices of λ\lambdaλ are taken modulo 333. Here admitting such a dilation means that there exist a natural number rrr, an isometry W:C2→C2×rW:\mathbb C^2\to\mathbb C^{2\times r}W:C2→C2×r, and a channel DDD such that Tr⁡r(WρW†)=Φa(ρ)\operatorname{Tr}_{r}(W\rho W^\dagger)=\Phi_a(\rho)Trr​(WρW†)=Φa​(ρ) and D(Tr⁡2(WρW†))=Φa(ρ)D(\operatorname{Tr}_{2}(W\rho W^\dagger))=\Phi_a(\rho)D(Tr2​(WρW†))=Φa​(ρ) for every matrix ρ\rhoρ; a channel is a finite Kraus map with Kraus completeness ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. In addition, for every n∈{0,1,2,3}n\in\{0,1,2,3\}n∈{0,1,2,3} and every real quadruple bbb satisfying bk=aτ(k)b_k=a_{\tau(k)}bk​=aτ(k)​, where τ\tauτ exchanges 000 and nnn, Φb\Phi_bΦb​ admits such an antidegradable dilation if and only if Φa\Phi_aΦa​ does. The case n=0n=0n=0 is included.

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