Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered orderings and the new distillation chain

Open
QAlgorithms.Papers.Independent.Support50.P16.relative_entropy_orderings

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

prove2quantum

For a density matrix ρAB\rho_{AB}ρAB​ on nonzero finite-dimensional registers, write EdE_dEd​ for the operational two-way LOCC distillation rate and EcE_cEc​ for the infimum of eventual LOCC formation rates from shared singlets, with vanishing full trace-norm error. Let ErE_rEr​ be ordinary relative entropy of entanglement, Er,↔=Er,LOCCE_{r,\leftrightarrow}=E_{r,\mathrm{LOCC}}Er,↔​=Er,LOCC​, and Er,→E_{r,\to}Er,→​ its one-way measured version optimized after arbitrary LOCC operations with finite quantum outputs. All rates use bits per input copy. The regularizations are actual limits, and

Ed≤Er,→∞≤Er,↔∞≤Er∞≤Ec,Er,→≤Er,↔.E_d\le E_{r,\to}^\infty\le E_{r,\leftrightarrow}^\infty\le E_r^\infty\le E_c, \qquad E_{r,\to}\le E_{r,\leftrightarrow}.Ed​≤Er,→∞​≤Er,↔∞​≤Er∞​≤Ec​,Er,→​≤Er,↔​.

All terms are evaluated at ρAB\rho_{AB}ρAB​. The endpoint comparison with EcE_cEc​ is cited background in the source; the new chain includes Proposition 7.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P16
Formal statement
namespace QAlgorithms.Papers.Independent.Support50.P16

noncomputable section

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

local notation "tau" => QAlgorithms.Papers.Independent.Information100.P76.maximallyMixed

local notation "RE" => QAlgorithms.Papers.Independent.Information100.P54.relativeEntanglement

local notation "RER" => QAlgorithms.Papers.Independent.Information100.P54.regularizedEntanglement

local notation "SQ" => QAlgorithms.Papers.Independent.Dependency50.P19.squashed

local notation "CMI" => QAlgorithms.Papers.Independent.Dependency50.P19.conditionalMutual

local notation "MI" => QAlgorithms.Papers.Independent.Dependency50.P19.mutualInformation

local notation "LOCC" => QAlgorithms.Papers.Independent.Information100.P21.FiniteLOCC

local notation "power" => QAlgorithms.Papers.Independent.Dependency50.P42.dimensionedPower

local notation "index" => QAlgorithms.Papers.Independent.Dependency50.P42.copyIndex

-- Accepted matrix coordinates (not P50.Bipartite, which is a vector space).

local notation "Bipartite" => QAlgorithms.Papers.Independent.Dependency50.P50.BipartiteMat

-- Positive outcome counts follow already from a POVM on a nonzero register.

local notation "FiniteMeasurement" => QAlgorithms.Papers.Independent.Information100.P04.Measurement

local notation "relative" =>
  ((fun _ _ rho => RE rho) : ExtendedEntanglementFunctional)

-- Reuse the accepted operational/variational quantity through a typed notation.

local notation "squashed" =>
  ((fun _ _ rho => ENNReal.ofReal (SQ rho)) : ExtendedEntanglementFunctional)

local notation "originalMarginal" => QAlgorithms.Papers.Independent.Information100.P04.principalMarginal

-- Exact accepted partial trace of the same AA'BB' extension.

local notation "ancillaryMarginal" => QAlgorithms.Papers.Independent.Information100.P04.ancillaryMarginal

local notation "distillable" =>
  ((fun _ _ rho => ENNReal.ofReal (QAlgorithms.Papers.Independent.Gap48.P32.twoWayDistillable rho)) : ExtendedEntanglementFunctional)

local notation "cost" =>
  ((fun _ _ rho => ENNReal.ofReal (QAlgorithms.Papers.Independent.Dependency50.P42.alternativeCost
    (fun _ _ X Y => traceNorm (X-Y)) rho)) : ExtendedEntanglementFunctional)

/-- Unnumbered ordering chain, PDF p.13. E_c is operational formation cost.
The last clause retains the single-copy update ordering used on p.15. -/
theorem relative_entropy_orderings {a b : ℕ+} (rho : Bipartite a b)
    (hrho : IsDensityMatrix rho) :
    Regularizes updated rho ∧ Regularizes (measuredEntanglement .LOCC) rho ∧ Regularizes relative rho ∧
    distillable a b rho ≤ regularized updated rho ∧
    regularized updated rho ≤ regularized (measuredEntanglement .LOCC) rho ∧
    regularized (measuredEntanglement .LOCC) rho ≤ regularized relative rho ∧
    regularized relative rho ≤ cost a b rho ∧ updated a b rho ≤ measuredEntanglement .LOCC a b rho := by sorry

end

end QAlgorithms.Papers.Independent.Support50.P16
Source
Relative entropy and squashed entanglement, arXiv:1210.3181v2, PDF p. 13, Unnumbered orderings and the new distillation chain
Read-back

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

For all positive integers a,ba,ba,b and every positive semidefinite trace-111 ρ\rhoρ of type Bipartite(a,b)\mathrm{Bipartite}(a,b)Bipartite(a,b), let Sep\mathrm{Sep}Sep denote finite convex mixtures of product positive semidefinite trace-111 matrices, and put EM(X)=inf⁡σ∈Sepsup⁡M∈MK(pM(X),pM(σ))E_{\mathcal M}(X)=\inf_{\sigma\in\mathrm{Sep}}\sup_{M\in\mathcal M}K(p_M(X),p_M(\sigma))EM​(X)=infσ∈Sep​supM∈M​K(pM​(X),pM​(σ)), where pM(X)x=Re⁡Tr⁡(MxX)p_M(X)_x=\operatorname{Re}\operatorname{Tr}(M_xX)pM​(X)x​=ReTr(Mx​X) and K(p,q)K(p,q)K(p,q) is +∞+\infty+∞ unless every positive pxp_xpx​ has positive qxq_xqx​, and otherwise equals max⁡{0,∑xpx(log⁡2px−log⁡2qx)}\max\{0,\sum_xp_x(\log_2p_x-\log_2q_x)\}max{0,∑x​px​(log2​px​−log2​qx​)}, with total logarithms. The class M→\mathcal M_\toM→​ consists of measurement records whose effects are ∑f(i,j)=xAi⊗Bij\sum_{f(i,j)=x}A_i\otimes B_{ij}∑f(i,j)=x​Ai​⊗Bij​, for an Alice POVM and conditional Bob POVMs. The class MLOCC\mathcal M_{\mathrm{LOCC}}MLOCC​ consists of records admitting a map LLL satisfying LOCC(L)\mathrm{LOCC}(L)LOCC(L), with output dimension 1×{outcomes}1\times\{\text{outcomes}\}1×{outcomes}, such that (L(X))(0,x),(0,x)=Tr⁡(MxX)(L(X))_{(0,x),(0,x)}=\operatorname{Tr}(M_xX)(L(X))(0,x),(0,x)​=Tr(Mx​X) for every X,xX,xX,x. Define U(X)=sup⁡c,d>0sup⁡L:LOCC(L)E→(L(X))U(X)=\sup_{c,d>0}\sup_{L:\mathrm{LOCC}(L)}E_\to(L(X))U(X)=supc,d>0​supL:LOCC(L)​E→​(L(X)), write R=relative⁡R=\operatorname{relative}R=relative, and write F‾(ρ)=lim inf⁡r→∞F(Pr+1(ρ))/(r+1)\overline F(\rho)=\liminf_{r\to\infty}F(P_{r+1}(\rho))/(r+1)F(ρ)=liminfr→∞​F(Pr+1​(ρ))/(r+1). The sequences defining U‾(ρ)\overline U(\rho)U(ρ), E‾LOCC(ρ)\overline E_{\mathrm{LOCC}}(\rho)ELOCC​(ρ), and R‾(ρ)\overline R(\rho)R(ρ) converge to those liminfs, and

distillable⁡(a,b,ρ)≤U‾(ρ)≤E‾LOCC(ρ)≤R‾(ρ)≤cost⁡(a,b,ρ),U(ρ)≤ELOCC(ρ).\operatorname{distillable}(a,b,\rho) \le\overline U(\rho) \le\overline E_{\mathrm{LOCC}}(\rho) \le\overline R(\rho) \le\operatorname{cost}(a,b,\rho), \qquad U(\rho)\le E_{\mathrm{LOCC}}(\rho).distillable(a,b,ρ)≤U(ρ)≤ELOCC​(ρ)≤R(ρ)≤cost(a,b,ρ),U(ρ)≤ELOCC​(ρ).

All inequalities and regularizations are in [0,+∞][0,+\infty][0,+∞]. The supplied layer does not define relative, distillable, cost, power (written PnP_nPn​), the map predicate LOCC, Bipartite, or FiniteMeasurement.

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