Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2, Eq. (8): commensurate lower bound for squashed entanglement

Open
QAlgorithms.Papers.Independent.Support50.P16.squashed_commensurate_lower_bound

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ be a density matrix on two nonzero finite-dimensional complex registers. Write EsqE_{\mathrm{sq}}Esq​ for half the infimum of I(A;B∣E)I(A;B\mid E)I(A;B∣E) over every normalized finite-dimensional extension, Er,1-LOCCE_{r,1\text{-LOCC}}Er,1-LOCC​ for the infimum over separable σAB\sigma_{AB}σAB​ of the supremum of the classical relative entropy after one-way measurements from AAA to BBB, and a superscript ∞\infty∞ for the per-copy regularization limit. Entropies use base-two logarithms. Then

Esq(ρAB)≥12Er,1-LOCC∞(ρAB)≥12Er,1-LOCC(ρAB).E_{\mathrm{sq}}(\rho_{AB})\ge\tfrac12 E_{r,1\text{-LOCC}}^\infty(\rho_{AB})\ge\tfrac12 E_{r,1\text{-LOCC}}(\rho_{AB}).Esq​(ρAB​)≥21​Er,1-LOCC∞​(ρAB​)≥21​Er,1-LOCC​(ρAB​).

The regularized quantity is asserted to be an actual limit. This is the paper's commensurate lower bound for squashed entanglement.

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 2, Eq.(8), PDF p.4; proof p.9. Both halves and both inequalities. -/
theorem squashed_commensurate_lower_bound {a b : ℕ+} (rho : Bipartite a b)
    (hrho : IsDensityMatrix rho) :
    Regularizes (measuredEntanglement .oneWay) rho ∧
    regularized (measuredEntanglement .oneWay) rho / 2 ≤ squashed a b rho ∧
    measuredEntanglement .oneWay a b rho / 2 ≤ regularized (measuredEntanglement .oneWay) rho / 2 := by sorry

end

end QAlgorithms.Papers.Independent.Support50.P16
Source
Relative entropy and squashed entanglement, arXiv:1210.3181v2, PDF p. 4, Theorem 2, Eq. (8): commensurate lower bound for squashed entanglement
Read-back

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

For every pair of positive integers a,ba,ba,b and every positive semidefinite matrix ρ\rhoρ of trace 111 on the pair index of dimensions a,ba,ba,b, let

E→(ω)=inf⁡ζ separable densitysup⁡M Alice-to-BobD2(pωM∥pζM).E_{\rightarrow}(\omega) =\inf_{\zeta\ \mathrm{separable\ density}} \sup_{M\ \mathrm{Alice\text{-}to\text{-}Bob}} D_2(p^M_\omega\|p^M_\zeta).E→​(ω)=ζ separable densityinf​M Alice-to-Bobsup​D2​(pωM​∥pζM​).

Here a separable density matrix is a finite sum ∑jwjAj⊗Bj\sum_jw_jA_j\otimes B_j∑j​wj​Aj​⊗Bj​ with wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and positive semidefinite trace-one matrices Aj,BjA_j,B_jAj​,Bj​; an Alice-to-Bob measurement has effects obtained by grouping matrices Ai⊗BijA_i\otimes B_{ij}Ai​⊗Bij​, where (Ai)i(A_i)_i(Ai​)i​ is a POVM and, for each iii, (Bij)j(B_{ij})_j(Bij​)j​ is a POVM. A POVM consists of positive semidefinite effects summing to the identity, pωM(x)=Re⁡tr⁡(Mxω)p^M_\omega(x)=\operatorname{Re}\operatorname{tr}(M_x\omega)pωM​(x)=Retr(Mx​ω), and D2(p∥q)D_2(p\|q)D2​(p∥q) is +∞+\infty+∞ if some px>0p_x>0px​>0 has qx≤0q_x\le0qx​≤0, otherwise it is the nonnegative extended-real conversion of ∑xpx(log⁡2px−log⁡2qx)\sum_xp_x(\log_2p_x-\log_2q_x)∑x​px​(log2​px​−log2​qx​). Define sr=E→(ρ⊗(r+1))/(r+1)s_r=E_{\rightarrow}(\rho^{\otimes(r+1)})/(r+1)sr​=E→​(ρ⊗(r+1))/(r+1), with each party’s copy indices grouped together, and E→∞(ρ)=lim inf⁡r→∞srE_{\rightarrow}^{\infty}(\rho)=\liminf_{r\to\infty}s_rE→∞​(ρ)=liminfr→∞​sr​. The assertion is that srs_rsr​ converges to this lower limit and that

E→∞(ρ)2≤squashed⁡(a,b,ρ),E→(ρ)2≤E→∞(ρ)2.\frac{E_{\rightarrow}^{\infty}(\rho)}2 \le \operatorname{squashed}(a,b,\rho), \qquad \frac{E_{\rightarrow}(\rho)}2 \le\frac{E_{\rightarrow}^{\infty}(\rho)}2.2E→∞​(ρ)​≤squashed(a,b,ρ),2E→​(ρ)​≤2E→∞​(ρ)​.

The definition of the symbol squashed is not supplied, so its value and codomain cannot be expanded further from the provided 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