Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered improved one-way trace-norm faithfulness bound

Open
QAlgorithms.Papers.Independent.Support50.P16.squashed_pinsker_lower_bound

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ be any density matrix on nonzero finite-dimensional registers. Write SEP(A:B)\mathrm{SEP}(A:B)SEP(A:B) for finite convex mixtures of product density matrices and ∥ρ−σ∥1-LOCC=sup⁡M∥M(ρ)−M(σ)∥1\|\rho-\sigma\|_{1\text{-LOCC}}=\sup_M\|M(\rho)-M(\sigma)\|_1∥ρ−σ∥1-LOCC​=supM​∥M(ρ)−M(σ)∥1​, where MMM ranges over normalized one-way measurements from AAA to BBB. With full classical ℓ1\ell_1ℓ1​ distance, the minimum is attained and

Esq(ρAB)≥14ln⁡2min⁡σAB∈SEP(A:B)∥ρAB−σAB∥1-LOCC2.E_{\mathrm{sq}}(\rho_{AB})\ge\frac{1}{4\ln2}\min_{\sigma_{AB}\in\mathrm{SEP}(A:B)}\|\rho_{AB}-\sigma_{AB}\|_{1\text{-LOCC}}^2.Esq​(ρAB​)≥4ln21​σAB​∈SEP(A:B)min​∥ρAB​−σAB​∥1-LOCC2​.

Squashed entanglement is half the infimum of conditional mutual information over all normalized finite-dimensional extensions, in bits. The Lean statement explicitly includes a minimizing separable state. This improves the earlier coefficient 1/(16ln⁡2)1/(16\ln2)1/(16ln2).

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)

/-- Improved unnumbered Pinsker consequence, PDF p.4. The full measured l1 norm
has coefficient 1/(4 ln 2). A minimizing separable state is asserted to exist. -/
theorem squashed_pinsker_lower_bound {a b : ℕ+} (rho : Bipartite a b)
    (hrho : IsDensityMatrix rho) :
    ∃ sigma ∈ separable a b,
      (∀ competitor ∈ separable a b,
        measurementDistance (measurementClass .oneWay a b) rho sigma ^ 2 ≤
        measurementDistance (measurementClass .oneWay a b) rho competitor ^ 2) ∧
      ENNReal.ofReal (measurementDistance (measurementClass .oneWay a b) rho sigma ^ 2 /
        (4 * Real.log 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. 4, Unnumbered improved one-way trace-norm faithfulness bound
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 the supplied type Bipartite(a,b)\mathrm{Bipartite}(a,b)Bipartite(a,b) that is positive semidefinite and has trace 111, there exists a separable matrix σ\sigmaσ minimizing the square of the following measurement distance over all separable competitors. Here “separable” means a finite sum ∑jwjαj⊗βj\sum_jw_j\alpha_j\otimes\beta_j∑j​wj​αj​⊗βj​ with nonnegative real weights summing to 111 and local positive semidefinite matrices αj,βj\alpha_j,\beta_jαj​,βj​ of trace 111. The permitted measurement records have effects Mx=∑f(i,j)=xAi⊗BijM_x=\sum_{f(i,j)=x}A_i\otimes B_{ij}Mx​=∑f(i,j)=x​Ai​⊗Bij​, where (Ai)(A_i)(Ai​) is a finite Alice POVM, (Bij)j(B_{ij})_j(Bij​)j​ is a finite Bob POVM for each iii, and fff groups the local outcome pairs. For this class M→\mathcal M_\toM→​, put

d→(X,Y)=(sup⁡M∈M→max⁡ ⁣{0,∑x∣Re⁡Tr⁡(MxX)−Re⁡Tr⁡(MxY)∣})real,d_\to(X,Y)= \left(\sup_{M\in\mathcal M_\to} \max\!\left\{0,\sum_x \left|\operatorname{Re}\operatorname{Tr}(M_xX) -\operatorname{Re}\operatorname{Tr}(M_xY)\right|\right\}\right)_{\mathrm{real}},d→​(X,Y)=(M∈M→​sup​max{0,x∑​∣ReTr(Mx​X)−ReTr(Mx​Y)∣})real​,

where the supremum is taken in [0,+∞][0,+\infty][0,+∞], and conversion to a real number sends +∞+\infty+∞ to 000. The asserted properties of σ\sigmaσ are precisely

∀τ∈Sepa,b,d→(ρ,σ)2≤d→(ρ,τ)2,max⁡ ⁣{0,d→(ρ,σ)24ln⁡2}≤squashed⁡(a,b,ρ).\forall\tau\in\mathrm{Sep}_{a,b},\quad d_\to(\rho,\sigma)^2\le d_\to(\rho,\tau)^2, \qquad \max\!\left\{0,\frac{d_\to(\rho,\sigma)^2}{4\ln2}\right\} \le \operatorname{squashed}(a,b,\rho).∀τ∈Sepa,b​,d→​(ρ,σ)2≤d→​(ρ,τ)2,max{0,4ln2d→​(ρ,σ)2​}≤squashed(a,b,ρ).

The last inequality is in the extended nonnegative reals. The supplied layer does not define Bipartite, FiniteMeasurement, or the functional squashed; in particular, its formula cannot be expanded 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