Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 12: a channel from a bounded entanglement witness

Open
QAlgorithms.Papers.Independent.Intakethird100.P19.witnessMap_duallyNonEntangling

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 WWW be Hermitian and satisfy Tr⁡(Wσ)≥0\operatorname{Tr}(W\sigma)\ge0Tr(Wσ)≥0 for every separable state, and let ∥W∥F≤1\|W\|_F\le1∥W∥F​≤1 be its Frobenius norm. Define A=(W+2I)/3A=(W+2I)/3A=(W+2I)/3 and

Λ(X)=Tr⁡(AX)I44+Tr⁡((I−A)X)ϕ2+.\Lambda(X)=\operatorname{Tr}(AX)\frac{I_4}{4}+\operatorname{Tr}((I-A)X)\phi_2^+.Λ(X)=Tr(AX)4I4​​+Tr((I−A)X)ϕ2+​.

Then Λ\LambdaΛ is a channel and both Λ\LambdaΛ and its trace dual preserve the separable positive cone.

This is the witness conversion construction used for distillability.

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)

/-- Lemma 12, PDF pp.16-17: every witness of Frobenius norm at most one
constructs the specified dually non-entangling channel of Eq.(21). -/
theorem witnessMap_duallyNonEntangling {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
    (W : Bip a b) (hw : Witness W) (hnorm : frobenius W ≤ 1) :
    IsChannel (witnessMap W) ∧ DNE (witnessMap W) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P19

end
Source
Entanglement manipulation and distillability beyond LOCC, arXiv:1711.03835v2, PDF p. 16, Lemma 12
Read-back

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

For all positive natural numbers a,ba,ba,b, let WWW be a Hermitian matrix on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb satisfying Re⁡Tr⁡(WX)≥0\operatorname{Re}\operatorname{Tr}(WX)\ge0ReTr(WX)≥0 for every separable positive matrix XXX, and suppose ∑i,j∣Wij∣2≤1\sqrt{\sum_{i,j}|W_{ij}|^2}\le1∑i,j​∣Wij​∣2​≤1. Here separable positive matrices are finite nonnegative sums of tensor products of positive semidefinite trace-one matrices, including the empty sum. Put A=(W+2I)/3A=(W+2I)/3A=(W+2I)/3 and Φ2=∣Ω2⟩⟨Ω2∣\Phi_2=|\Omega_2\rangle\langle\Omega_2|Φ2​=∣Ω2​⟩⟨Ω2​∣, where ∣Ω2⟩=(∣00⟩+∣11⟩)/2|\Omega_2\rangle=(|00\rangle+|11\rangle)/\sqrt2∣Ω2​⟩=(∣00⟩+∣11⟩)/2​. Then the map ΛW(X)=Tr⁡(AX)I4/4+Tr⁡((I−A)X)Φ2\Lambda_W(X)=\operatorname{Tr}(AX)I_4/4+\operatorname{Tr}((I-A)X)\Phi_2ΛW​(X)=Tr(AX)I4​/4+Tr((I−A)X)Φ2​ is a channel, and both ΛW\Lambda_WΛW​ and its trace-bilinear dual are non-entangling. Explicitly, the channel condition supplies a finite Kraus representation with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I; each non-entangling condition requires a finite Kraus representation, without a normalization requirement, and preservation of the separable positive cone. The dual is defined by (ΛW∨(Y))ij=Tr⁡(ΛW(Eji)Y)(\Lambda_W^\vee(Y))_{ij}=\operatorname{Tr}(\Lambda_W(E_{ji})Y)(ΛW∨​(Y))ij​=Tr(ΛW​(Eji​)Y). Zero witnesses and one-dimensional input factors are included.

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