Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positive filtering preserves entanglement breaking

Proved
QAlgorithms.Papers.Independent.Support50.P19.positiveFilter

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

prove2quantum

Let M:B(A)→B(B)\mathcal M:\mathcal B(A)\to\mathcal B(B)M:B(A)→B(B) be a completely positive entanglement-breaking map on positive-dimensional finite complex spaces; trace preservation is not required. For every positive semidefinite operator YYY on BBB, define F(X)=YM(X)Y\mathcal F(X)=Y\mathcal M(X)YF(X)=YM(X)Y. Then

F is completely positive and entanglement breaking.\mathcal F\text{ is completely positive and entanglement breaking}.F is completely positive and entanglement breaking.

The input and output dimensions may differ, and YYY is not normalized. This closure property permits the positive filtering used in the channel subadditivity argument.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

open Filter Topology

namespace QAlgorithms.Papers.Independent.Support50.P19

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P35
  (tr Dominates spectralPower elog elogNN rawTrace cq)

open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)

open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)

open QAlgorithms.Papers.Independent.Dependency50.P23
  (UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)

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

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)

open QAlgorithms.Papers.Independent.Claimed50.P26
  (CovariantIrreducible minOutput UnassistedExponentialConverse)

variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]

variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]

/-- PDF p.7, Remark 1: arbitrary rectangular CP EB maps remain CP and EB after filtering. -/
theorem positiveFilter [Nonempty I] [Nonempty J] (N : Superop I J) (hCP : FiniteKrausCP N) (hEB : IsEB N)
    (Y : Matrix J J ℂ) (hY : Y.PosSemidef) :
    FiniteKrausCP (filtered Y N) ∧ IsEB (filtered Y N) := by sorry

end QAlgorithms.Papers.Independent.Support50.P19

end
Source
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy, arXiv:1306.1586v4, PDF p. 7, remark1
Read-back

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

Let I,JI,JI,J be finite nonempty types with decidable equality, and let NNN be a function from complex matrices on III to complex matrices on JJJ admitting a finite representation N(X)=∑sEsXEs†N(X)=\sum_sE_sXE_s^\daggerN(X)=∑s​Es​XEs†​, without any normalization requirement on the EsE_sEs​. Assume that for every natural r>0r>0r>0 and every positive semidefinite trace-one matrix XXX on the reference space times III, the matrix (idr⊗N)(X)(\mathrm{id}_r\otimes N)(X)(idr​⊗N)(X) is a finite sum ∑jwjAj⊗Bj\sum_jw_jA_j\otimes B_j∑j​wj​Aj​⊗Bj​, where wj≥0w_j\ge0wj​≥0 and the factors are positive semidefinite trace-one matrices on the reference and output spaces; the weights need not sum to 111, and the sum may be empty. For every positive semidefinite matrix YYY on JJJ, define F(X)=YN(X)YF(X)=YN(X)YF(X)=YN(X)Y. The theorem asserts that FFF also admits a finite representation F(X)=∑tKtXKt†F(X)=\sum_tK_tXK_t^\daggerF(X)=∑t​Kt​XKt†​, and that every (idr⊗F)(X)(\mathrm{id}_r\otimes F)(X)(idr​⊗F)(X) for r>0r>0r>0 and a density-matrix input XXX has a finite decomposition of the same form. Amplification means applying the function separately to each reference-indexed matrix block. Neither NNN nor FFF is required here to preserve trace, and Y=0Y=0Y=0 is included.

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

    Confirmed by the moderator at approval.

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