Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 17: complete preservation and Choi classes

Open
QAlgorithms.Papers.Independent.Intakethird100.P19.completePreservation_characterization

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All Hilbert spaces are finite-dimensional complex spaces with fixed product bases and positive local dimensions. States are positive semidefinite operators of trace one; pure kets have norm one. Let d≥1d\ge1d≥1 and let Λ\LambdaΛ be any completely positive map from d×dd\times dd×d to an arbitrary positive-dimensional bipartite register. Trace preservation is not assumed. Then both chains hold:

Λ separable ⟺ Λ is d-non-entangling ⟺ Λ is completely non-entangling,\Lambda\text{ separable}\ \Longleftrightarrow\ \Lambda\text{ is }d\text{-non-entangling}\ \Longleftrightarrow\ \Lambda\text{ is completely non-entangling},Λ separable ⟺ Λ is d-non-entangling ⟺ Λ is completely non-entangling, J(Λ) PPT ⟺ Λ is d-PPT-preserving ⟺ Λ is completely PPT-preserving.J(\Lambda)\text{ PPT}\ \Longleftrightarrow\ \Lambda\text{ is }d\text{-PPT-preserving}\ \Longleftrightarrow\ \Lambda\text{ is completely PPT-preserving}.J(Λ) PPT ⟺ Λ is d-PPT-preserving ⟺ Λ is completely PPT-preserving.

The kkk-preservation conditions amplify by the identity on a kkk-dimensional ancilla at each party; complete preservation quantifies over all k≥1k\ge1k≥1.

This identifies the completely preserving classes with their grouped Choi classes.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P19
Formal statement
noncomputable section

open QAlgorithms QAlgorithms.Entanglement Filter

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakethird100.P19

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P19 (Bip)

open QAlgorithms.Papers.Independent.Information100.P69 (CP)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)

open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)

/-- Proposition 17, PDF pp.20-21: both respectively branches, for CP maps
without trace preservation. The local input dimension d=1 is included. -/
theorem completePreservation_characterization {d a b : ℕ}
    (hd : 0 < d) (ha : 0 < a) (hb : 0 < b)
    (L : Superop (Fin d × Fin d) (Fin a × Fin b)) (hcp : CP L) :
    ((SEP L ↔ KNE d L) ∧ (KNE d L ↔ CompleteNE L)) ∧
    ((ChoiPPT L ↔ KPPT d L) ∧ (KPPT d L ↔ CompletePPT L)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P19

end
Source
Entanglement manipulation and distillability beyond LOCC, arXiv:1711.03835v2, PDF p. 20, Proposition 17
Read-back

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

For all positive natural numbers d,a,bd,a,bd,a,b and every map LLL from operators on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd to operators on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb having a finite Kraus representation L(X)=∑jEjXEj†L(X)=\sum_jE_jXE_j^\daggerL(X)=∑j​Ej​XEj†​, without any trace-preservation requirement, the following equivalences hold: LLL has a separable positive party-grouped Choi matrix if and only if its amplification by a ddd-dimensional auxiliary system on each party is non-entangling, and this is equivalent to its amplification being non-entangling for every positive auxiliary dimension kkk; likewise, its party-grouped Choi matrix and that matrix’s first partial transpose are both positive semidefinite if and only if its amplification by ddd-dimensional auxiliaries preserves positive-partial-transpose matrices, and this is equivalent to that preservation property for every positive auxiliary dimension kkk. Precisely, the grouped Choi entries are JL(u,i),(v,j); (u′,i′),(v′,j′)=L(E(i,j),(i′,j′))(u,v),(u′,v′)J_L{}_{(u,i),(v,j);\,(u',i'),(v',j')}=L(E_{(i,j),(i',j')})_{(u,v),(u',v')}JL​(u,i),(v,j);(u′,i′),(v′,j′)​=L(E(i,j),(i′,j′)​)(u,v),(u′,v′)​, and the amplification acts by

Ak(L)(X)(u,e),(v,f); (u′,e′),(v′,f′)=L ⁣([X(i,e),(j,f); (i′,e′),(j′,f′)](i,j),(i′,j′))(u,v),(u′,v′).\mathcal A_k(L)(X)_{(u,e),(v,f);\,(u',e'),(v',f')} = L\!\left( \bigl[X_{(i,e),(j,f);\,(i',e'),(j',f')}\bigr]_{(i,j),(i',j')} \right)_{(u,v),(u',v')}.Ak​(L)(X)(u,e),(v,f);(u′,e′),(v′,f′)​=L([X(i,e),(j,f);(i′,e′),(j′,f′)​](i,j),(i′,j′)​)(u,v),(u′,v′)​.

A non-entangling map has a finite Kraus representation and preserves every separable positive matrix, meaning every finite nonnegative sum of tensor products of positive semidefinite trace-one matrices, including 000. Positive-partial-transpose preservation requires a finite Kraus representation and preservation of the set of matrices XXX for which both XXX and XTAX^{T_A}XTA​ are positive semidefinite, where (XTA)(i,j),(i′,j′)=X(i′,j),(i,j′)(X^{T_A})_{(i,j),(i',j')}=X_{(i',j),(i,j')}(XTA​)(i,j),(i′,j′)​=X(i′,j),(i,j′)​. Each fixed-kkk condition also explicitly requires k>0k>0k>0 and a finite Kraus representation for LLL; the complete conditions quantify over all positive kkk, excluding k=0k=0k=0.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me