Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, Eqs. (6)–(7): relative-entropy monogamy

Open
QAlgorithms.Papers.Independent.Support50.P16.relative_entropy_monogamy

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

prove2quantum

Let ρABE\rho_{ABE}ρABE​ be any density matrix on three nonzero finite-dimensional complex registers. All displayed reduced states are actual partial traces. Let ErE_rEr​ denote the relative entropy distance to separable states across the indicated bipartition, and let Er,1-LOCCE_{r,1\text{-LOCC}}Er,1-LOCC​ use measurements from AAA to BBB. Superscript ∞\infty∞ denotes per-copy regularization, with copies grouped by laboratory. In bits,

Er(ρB:AE)≥Er,1-LOCC(ρAB)+Er∞(ρBE),Er∞(ρB:AE)≥Er,1-LOCC∞(ρAB)+Er∞(ρBE).\begin{aligned} E_r(\rho_{B:AE})&\ge E_{r,1\text{-LOCC}}(\rho_{AB})+E_r^\infty(\rho_{BE}),\\ E_r^\infty(\rho_{B:AE})&\ge E_{r,1\text{-LOCC}}^\infty(\rho_{AB})+E_r^\infty(\rho_{BE}). \end{aligned}Er​(ρB:AE​)Er∞​(ρB:AE​)​≥Er,1-LOCC​(ρAB​)+Er∞​(ρBE​),≥Er,1-LOCC∞​(ρAB​)+Er∞​(ρBE​).​

The same register BBB occurs in both right-hand terms. The one-way regularization limit exists. This weak monogamy relation needs no separability or purity of the input.

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)

/-- Theorem 1, Eqs.(6)--(7), PDF p.4; proof pp.8--9. B is repeated, not split. -/
theorem relative_entropy_monogamy {a b e : ℕ+}
    (rho : Matrix ((Fin (a : ℕ) × Fin (b : ℕ)) × Fin (e : ℕ))
      ((Fin (a : ℕ) × Fin (b : ℕ)) × Fin (e : ℕ)) ℂ)
    (hrho : IsDensityMatrix rho) :
    let AB := traceRight rho
    let BE := traceLeft (QAlgorithms.Papers.Independent.Dependency50.P19.associate rho)
    Regularizes (measuredEntanglement .oneWay) AB ∧
    measuredEntanglement .oneWay a b AB + RER BE ≤ RE (cutBAE rho) ∧
    regularized (measuredEntanglement .oneWay) AB + RER BE ≤ RER (cutBAE rho) := by sorry

end

end QAlgorithms.Papers.Independent.Support50.P16
Source
Relative entropy and squashed entanglement, arXiv:1210.3181v2, PDF p. 4, Theorem 1, Eqs. (6)–(7): relative-entropy monogamy
Read-back

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

For positive integers a,b,ea,b,ea,b,e and every positive semidefinite trace-one matrix ρ\rhoρ indexed by ((i,j),k)((i,j),k)((i,j),k) of dimensions a,b,ea,b,ea,b,e, define

(ρAB)(i,j),(i′,j′)=∑kρ((i,j),k),((i′,j′),k),(ρBE)(j,k),(j′,k′)=∑iρ((i,j),k),((i,j′),k′),(\rho_{AB})_{(i,j),(i',j')}=\sum_k\rho_{((i,j),k),((i',j'),k)},\qquad (\rho_{BE})_{(j,k),(j',k')}=\sum_i\rho_{((i,j),k),((i,j'),k')},(ρAB​)(i,j),(i′,j′)​=k∑​ρ((i,j),k),((i′,j′),k)​,(ρBE​)(j,k),(j′,k′)​=i∑​ρ((i,j),k),((i,j′),k′)​,

and define ρ^\widehat\rhoρ​, indexed by B×(A×E)B\times(A\times E)B×(A×E), by ρ^(j,(i,k)),(j′,(i′,k′))=ρ((i,j),k),((i′,j′),k′)\widehat\rho_{(j,(i,k)),(j',(i',k'))}=\rho_{((i,j),k),((i',j'),k')}ρ​(j,(i,k)),(j′,(i′,k′))​=ρ((i,j),k),((i′,j′),k′)​. Let E→(ω)E_{\rightarrow}(\omega)E→​(ω) be the infimum over separable density matrices ζ=∑lwlAl⊗Bl\zeta=\sum_lw_lA_l\otimes B_lζ=∑l​wl​Al​⊗Bl​, with nonnegative weights summing to 111 and density matrices Al,BlA_l,B_lAl​,Bl​, of the supremum over Alice-to-Bob POVMs of the extended classical relative entropy between the outcome functions of ω,ζ\omega,\zetaω,ζ. Such POVMs group effects Ai⊗BijA_i\otimes B_{ij}Ai​⊗Bij​, with ∑iAi=I\sum_iA_i=I∑i​Ai​=I, ∑jBij=I\sum_jB_{ij}=I∑j​Bij​=I, and all these effects positive semidefinite; outcome values are Re⁡tr⁡(Mxω)\operatorname{Re}\operatorname{tr}(M_x\omega)Retr(Mx​ω). The relative entropy is +∞+\infty+∞ if a positive first outcome value has a nonpositive second value, and otherwise is ofReal⁡∑xpx(log⁡2px−log⁡2qx)\operatorname{ofReal}\sum_xp_x(\log_2p_x-\log_2q_x)ofReal∑x​px​(log2​px​−log2​qx​), where ofReal⁡(t)=max⁡(t,0)\operatorname{ofReal}(t)=\max(t,0)ofReal(t)=max(t,0) viewed in [0,∞][0,\infty][0,∞]. Let E→∞(ω)=lim inf⁡rE→(ω⊗(r+1))/(r+1)E_{\rightarrow}^{\infty}(\omega)=\liminf_r E_{\rightarrow}(\omega^{\otimes(r+1)})/(r+1)E→∞​(ω)=liminfr​E→​(ω⊗(r+1))/(r+1). The assertion is that this sequence for ρAB\rho_{AB}ρAB​ converges to its lower limit and

E→(ρAB)+RER⁡(ρBE)≤RE⁡(ρ^),E→∞(ρAB)+RER⁡(ρBE)≤RER⁡(ρ^).E_{\rightarrow}(\rho_{AB})+\operatorname{RER}(\rho_{BE}) \le\operatorname{RE}(\widehat\rho),\qquad E_{\rightarrow}^{\infty}(\rho_{AB})+\operatorname{RER}(\rho_{BE}) \le\operatorname{RER}(\widehat\rho).E→​(ρAB​)+RER(ρBE​)≤RE(ρ​),E→∞​(ρAB​)+RER(ρBE​)≤RER(ρ​).

The definitions of RE and RER are absent from the supplied code.

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