Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6: comparison of squashed-type and relative-entropy measures

Open
QAlgorithms.Papers.Independent.Support50.P16.entanglement_comparisons

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ be a density matrix on nonzero finite-dimensional registers. Let EsqE_{\mathrm{sq}}Esq​ denote quantum squashed entanglement, Esq,cE_{\mathrm{sq},c}Esq,c​ its restriction to classical flagged extensions, and EI=12inf⁡[I(AA′;BB′)−I(A′;B′)]E_I=\tfrac12\inf[I(AA';BB')-I(A';B')]EI​=21​inf[I(AA′;BB′)−I(A′;B′)] over normalized extensions of ρAB\rho_{AB}ρAB​ with unrestricted finite A′,B′A',B'A′,B′. Write ErE_rEr​ for relative entropy of entanglement, Er,↔=Er,LOCCE_{r,\leftrightarrow}=E_{r,\mathrm{LOCC}}Er,↔​=Er,LOCC​, and Er,→(ρ)=sup⁡Λ∈LOCCEr,1-LOCC(Λ(ρ))E_{r,\to}(\rho)=\sup_{\Lambda\in\mathrm{LOCC}}E_{r,1\text{-LOCC}}(\Lambda(\rho))Er,→​(ρ)=supΛ∈LOCC​Er,1-LOCC​(Λ(ρ)), where Λ\LambdaΛ has arbitrary finite quantum outputs. All entropies are in bits. The regularization limits exist, and

2Esq,c∞≥Er∞,2EI≥Er,↔∞,2Esq≥Er,→∞,2Esq,c≥Er,2EI≥Er,↔,2Esq≥Er,→.\begin{aligned} 2E_{\mathrm{sq},c}^\infty&\ge E_r^\infty,&2E_I&\ge E_{r,\leftrightarrow}^\infty,&2E_{\mathrm{sq}}&\ge E_{r,\to}^\infty,\\ 2E_{\mathrm{sq},c}&\ge E_r,&2E_I&\ge E_{r,\leftrightarrow},&2E_{\mathrm{sq}}&\ge E_{r,\to}. \end{aligned}2Esq,c∞​2Esq,c​​≥Er∞​,≥Er​,​2EI​2EI​​≥Er,↔∞​,≥Er,↔​,​2Esq​2Esq​​≥Er,→∞​,≥Er,→​.​

Every quantity is evaluated at ρAB\rho_{AB}ρAB​. This retains all three nonregularized versions as well as the three displayed comparisons.

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)

/-- Proposition 6, PDF pp.13--14: all three comparisons, and ALL three
nonregularized versions. Only E_sq,c is regularized on the left. -/
theorem entanglement_comparisons {a b : ℕ+} (rho : Bipartite a b)
    (hrho : IsDensityMatrix rho) :
    Regularizes classicalSquashed rho ∧ Regularizes relative rho ∧
    Regularizes (measuredEntanglement .LOCC) rho ∧ Regularizes updated rho ∧
    regularized relative rho ≤ 2 * regularized classicalSquashed rho ∧
    regularized (measuredEntanglement .LOCC) rho ≤ 2 * conditionalEntanglement a b rho ∧
    regularized updated rho ≤ 2 * squashed a b rho ∧
    relative a b rho ≤ 2 * classicalSquashed a b rho ∧
    measuredEntanglement .LOCC a b rho ≤ 2 * conditionalEntanglement a b rho ∧
    updated a b rho ≤ 2 * squashed a b rho := by sorry

end

end QAlgorithms.Papers.Independent.Support50.P16
Source
Relative entropy and squashed entanglement, arXiv:1210.3181v2, PDF p. 13, Proposition 6: comparison of squashed-type and relative-entropy measures
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 ρ\rhoρ of type Bipartite(a,b)\mathrm{Bipartite}(a,b)Bipartite(a,b) that is positive semidefinite of trace 111, the following assertions hold. Write R=relative⁡R=\operatorname{relative}R=relative, S=squashed⁡S=\operatorname{squashed}S=squashed, and define QQQ by taking the infimum of ∑jpjMI(τj)\sum_jp_j\mathrm{MI}(\tau_j)∑j​pj​MI(τj​) over all finite ensembles of positive semidefinite trace-111 matrices with pj≥0p_j\ge0pj​≥0, ∑jpj=1\sum_jp_j=1∑j​pj​=1, and ∑jpjτj=ρ\sum_jp_j\tau_j=\rho∑j​pj​τj​=ρ, dividing that real infimum by 222, and replacing a negative result by 000. For a measurement class M\mathcal MM, define EM(ρ)=inf⁡σ∈Sepsup⁡M∈MK(pM(ρ),pM(σ))E_{\mathcal M}(\rho)=\inf_{\sigma\in\mathrm{Sep}}\sup_{M\in\mathcal M}K(p_M(\rho),p_M(\sigma))EM​(ρ)=infσ∈Sep​supM∈M​K(pM​(ρ),pM​(σ)), where Sep\mathrm{Sep}Sep consists of finite convex mixtures of product positive semidefinite trace-111 matrices, 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 px>0⇒qx>0p_x>0\Rightarrow q_x>0px​>0⇒qx​>0 for every xxx, 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​)}. The class M→\mathcal M_\toM→​ contains measurements with effects ∑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 a Bob POVM conditional on iii; MLOCC\mathcal M_{\mathrm{LOCC}}MLOCC​ contains records for which there exists a map L:AB→1×{outcomes}L:AB\to1\times\{\text{outcomes}\}L:AB→1×{outcomes} satisfying the supplied predicate LOCC(L)\mathrm{LOCC}(L)LOCC(L) and (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 matrix XXX and outcome xxx. Define

U(ρ)=sup⁡c,d>0 sup⁡L: LOCC(L)E→(L(ρ)),I(ρ)=inf⁡e,f>0, ω≥0, Tr⁡ω=1ωAB=ρmax⁡ ⁣{0,MI(ω)−MI(ωA′B′)2},U(\rho)=\sup_{c,d>0}\ \sup_{L:\,\mathrm{LOCC}(L)}E_\to(L(\rho)), \qquad I(\rho)=\inf_{\substack{e,f>0,\ \omega\ge0,\ \operatorname{Tr}\omega=1\\ \omega_{AB}=\rho}} \max\!\left\{0,\frac{\mathrm{MI}(\omega)-\mathrm{MI}(\omega_{A'B'})}{2}\right\},U(ρ)=c,d>0sup​ L:LOCC(L)sup​E→​(L(ρ)),I(ρ)=e,f>0, ω≥0, Trω=1ωAB​=ρ​inf​max{0,2MI(ω)−MI(ωA′B′​)​},

where ω\omegaω is on AA′BB′AA'BB'AA′BB′, ωAB\omega_{AB}ωAB​ sums over matching A′,B′A',B'A′,B′ indices, and ωA′B′\omega_{A'B'}ωA′B′​ sums over matching A,BA,BA,B indices. For any functional FFF, 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 four sequences for Q,R,ELOCC,UQ,R,E_{\mathrm{LOCC}},UQ,R,ELOCC​,U converge to their respective liminfs, and

R‾(ρ)≤2Q‾(ρ),E‾LOCC(ρ)≤2I(ρ),U‾(ρ)≤2S(ρ),R(ρ)≤2Q(ρ),ELOCC(ρ)≤2I(ρ),U(ρ)≤2S(ρ).\begin{gathered} \overline R(\rho)\le2\overline Q(\rho),\qquad \overline E_{\mathrm{LOCC}}(\rho)\le2I(\rho),\qquad \overline U(\rho)\le2S(\rho),\\ R(\rho)\le2Q(\rho),\qquad E_{\mathrm{LOCC}}(\rho)\le2I(\rho),\qquad U(\rho)\le2S(\rho). \end{gathered}R(ρ)≤2Q​(ρ),ELOCC​(ρ)≤2I(ρ),U(ρ)≤2S(ρ),R(ρ)≤2Q(ρ),ELOCC​(ρ)≤2I(ρ),U(ρ)≤2S(ρ).​

These inequalities are in [0,+∞][0,+\infty][0,+∞]. The supplied layer leaves relative, squashed, MI, power (written PnP_nPn​), the map predicate LOCC, Bipartite, and FiniteMeasurement undefined.

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