Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2: closure under CPTP postprocessing

Proved
QAlgorithms.Papers.Independent.Support50.P01.conjugateAnti_postprocess

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

prove2quantum

Let A,B,CA,B,CA,B,C be positive finite-dimensional complex spaces with fixed bases. Suppose N:A→B\mathcal N:A\to BN:A→B is a conjugate antidegradable channel: it has a common isometric dilation and complement Nc\mathcal N^cNc and one CPTP map DaD_aDa​ satisfying DaNc=TND_a\mathcal N^c=T\mathcal NDa​Nc=TN on every operator. For any CPTP map Δ:B→C\Delta:B\to CΔ:B→C,

Δ∘N is conjugate antidegradable.\Delta\circ\mathcal N\text{ is conjugate antidegradable}.Δ∘N is conjugate antidegradable.

The conclusion allows the complement of the composed dilation and a new CPTP witness. No unitality or inverse-channel assumption is imposed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P01

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

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

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)

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

open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

variable {a b e c : ℕ}

/-- PDF pp.13–14, Lemma 2: postprocessing by any CPTP map; no unitality condition.
The proof's Eq.(36) reverses Kraus order; trace preservation uses sum E_k†E_k=I. -/
theorem conjugateAnti_postprocess (ha : 0<a) (hb : 0<b) (hc : 0<c)
    (Phi : Superop (Fin a) (Fin b)) (Delta : Superop (Fin b) (Fin c))
    (hPhi : ConjugateAntiChannel Phi) (hDelta : IsChannel Delta) :
    ConjugateAntiChannel (Delta ∘ Phi) := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 13, Lemma 2: closure under CPTP postprocessing
Read-back

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

Let a,b,ca,b,ca,b,c be positive natural numbers, and let Φ\PhiΦ map complex a×aa\times aa×a matrices to b×bb\times bb×b matrices and Δ\DeltaΔ map b×bb\times bb×b matrices to c×cc\times cc×c matrices. Suppose there exist a positive natural number eee, a matrix U:Ca→Cb⊗CeU:\mathbb C^a\to\mathbb C^b\otimes\mathbb C^eU:Ca→Cb⊗Ce with U†U=IaU^\dagger U=I_aU†U=Ia​, and a finite Kraus map D:E→B\mathcal D:E\to BD:E→B such that, for every complex input matrix XXX,

Φ(X)=Tr⁡E(UXU†),D ⁣(Tr⁡B(UXU†))=Φ(X)T.\Phi(X)=\operatorname{Tr}_{E}(UXU^\dagger),\qquad \mathcal D\!\left(\operatorname{Tr}_{B}(UXU^\dagger)\right)=\Phi(X)^{\mathsf T}.Φ(X)=TrE​(UXU†),D(TrB​(UXU†))=Φ(X)T.

Suppose also that Δ\DeltaΔ is a finite Kraus map. Here a finite Kraus map from dimension ddd to dimension hhh means a map Y↦∑ℓ=0s−1KℓYKℓ†Y\mapsto\sum_{\ell=0}^{s-1}K_\ell YK_\ell^\daggerY↦∑ℓ=0s−1​Kℓ​YKℓ†​, for some natural number sss, with KℓK_\ellKℓ​ of size h×dh\times dh×d and ∑ℓKℓ†Kℓ=Id\sum_\ell K_\ell^\dagger K_\ell=I_d∑ℓ​Kℓ†​Kℓ​=Id​. Then there exist a positive natural number fff, a matrix W:Ca→Cc⊗CfW:\mathbb C^a\to\mathbb C^c\otimes\mathbb C^fW:Ca→Cc⊗Cf with W†W=IaW^\dagger W=I_aW†W=Ia​, and a finite Kraus map D′:F→C\mathcal D':F\to CD′:F→C such that, for every XXX,

(Δ∘Φ)(X)=Tr⁡F(WXW†),D′ ⁣(Tr⁡C(WXW†))=((Δ∘Φ)(X))T.(\Delta\circ\Phi)(X)=\operatorname{Tr}_{F}(WXW^\dagger),\qquad \mathcal D'\!\left(\operatorname{Tr}_{C}(WXW^\dagger)\right) =((\Delta\circ\Phi)(X))^{\mathsf T}.(Δ∘Φ)(X)=TrF​(WXW†),D′(TrC​(WXW†))=((Δ∘Φ)(X))T.

All transposes are ordinary transposes, and the partial traces remove the indicated output factor.

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

    Confirmed by the moderator at approval.

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