Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition V.5: continuity of multipartite squashed entanglement

Open
QAlgorithms.Papers.Independent.Support50.P09.squashed_continuous

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

prove2quantum

For a normalized state ρX1⋯Xm\rho^{X_1\cdots X_m}ρX1​⋯Xm​ with m≥1m\ge1m≥1 finite nonzero local systems, define

Esq(ρ)=12inf⁡ρ~:Tr⁡Eρ~=ρ[∑i=1mH(Xi∣E)ρ~−H(X1⋯Xm∣E)ρ~].E_{\rm sq}(\rho)=\frac12\inf_{\widetilde\rho:\operatorname{Tr}_E\widetilde\rho=\rho} \left[\sum_{i=1}^m H(X_i\mid E)_{\widetilde\rho}-H(X_1\cdots X_m\mid E)_{\widetilde\rho}\right].Esq​(ρ)=21​ρ​:TrE​ρ​=ρinf​[i=1∑m​H(Xi​∣E)ρ​​−H(X1​⋯Xm​∣E)ρ​​].

Entropies are in bits. The infimum ranges over all normalized extensions and every positive finite dimension of EEE, with no dimension bound or attainment assumption. One-party inputs use this same entropy expression and have value zero.

On each fixed honest-party space the function EsqE_{\rm sq}Esq​ is continuous. More explicitly, let di=dim⁡Xid_i=\dim X_idi​=dimXi​ and

ω(ϵ)=16ϵlog⁡2(∏idi)+2(m+1)h2(2ϵ),\omega(\epsilon)=16\sqrt\epsilon\log_2\left(\prod_i d_i\right)+2(m+1)h_2(2\sqrt\epsilon),ω(ϵ)=16ϵ​log2​(i∏​di​)+2(m+1)h2​(2ϵ​),

where h2(p)=−plog⁡2p−(1−p)log⁡2(1−p)h_2(p)=-p\log_2p-(1-p)\log_2(1-p)h2​(p)=−plog2​p−(1−p)log2​(1−p) and 0log⁡20=00\log_20=00log2​0=0. For all density operators ρ,σ\rho,\sigmaρ,σ on that space, if ϵ≥0\epsilon\ge0ϵ≥0, 2ϵ≤12\sqrt\epsilon\le12ϵ​≤1 and the full trace norm satisfies ∥ρ−σ∥1≤ϵ\|\rho-\sigma\|_1\le\epsilon∥ρ−σ∥1​≤ϵ, then

∣Esq(ρ)−Esq(σ)∣≤ω(ϵ),lim⁡ϵ↓0ω(ϵ)=0.|E_{\rm sq}(\rho)-E_{\rm sq}(\sigma)|\le\omega(\epsilon),\qquad \lim_{\epsilon\downarrow0}\omega(\epsilon)=0.∣Esq​(ρ)−Esq​(σ)∣≤ω(ϵ),ϵ↓0lim​ω(ϵ)=0.

This preserves the printed equation (67), with no extension-dimension dependence. The small-error restriction applies to the explicit modulus; qualitative continuity has no proximity restriction.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P09
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P09

open QAlgorithms.Papers.Independent.Claimed50.P33

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Proposition V.5, PDF pp.18–19: continuity on every fixed honest-party
space, plus the PRINTED (67) modulus on 2 sqrt(eps)<=1. Full trace norm is
used, unlike Lemma V.4's local half-trace convention. No cap on E is imposed. -/
theorem squashed_continuous {m : ℕ} (hm : 0 < m) {D : Fin m → Type}
    [∀ i, Fintype (D i)] [∀ i, Nonempty (D i)] :
    Continuous (fun rho : {rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ //
      IsDensityMatrix rho} => halfExtensionSquashed .total rho.val) ∧
    (∀ (rho sigma : Matrix (RegisterBasis D) (RegisterBasis D) ℂ),
      IsDensityMatrix rho → IsDensityMatrix sigma → ∀ eps : ℝ,
      0 ≤ eps → 2 * Real.sqrt eps ≤ 1 → traceNorm (rho-sigma) ≤ eps →
      |halfExtensionSquashed .total rho - halfExtensionSquashed .total sigma| ≤
        continuityModulus D eps) ∧
    Filter.Tendsto (continuityModulus D) (nhdsWithin 0 (Set.Ici 0)) (nhds 0) := by sorry

end QAlgorithms.Papers.Independent.Support50.P09

end
Source
Distributed Compression and Multiparty Squashed Entanglement, arXiv:0707.2792v2, PDF p. 18, Proposition V.5: continuity of multipartite squashed entanglement
Read-back

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

For every positive natural number mmm and every family of finite nonempty sets DiD_iDi​, i<mi<mi<m, define, for density matrices ρ\rhoρ on ∏iDi\prod_iD_i∏i​Di​,

Em(ρ)=12inf⁡e>0, σ a density matrixTr⁡Eσ=ρ[∑i=0m−1S(σiE)−S(σ)−(m−1)S(σE)],E_m(\rho)=\frac12\inf_{\substack{e>0,\ \sigma\ \text{a density matrix}\\ \operatorname{Tr}_{E}\sigma=\rho}} \left[\sum_{i=0}^{m-1}S(\sigma_{iE})-S(\sigma)-(m-1)S(\sigma_E)\right],Em​(ρ)=21​e>0, σ a density matrixTrE​σ=ρ​inf​[i=0∑m−1​S(σiE​)−S(σ)−(m−1)S(σE​)],

where density matrices are positive semidefinite with trace 111, eee ranges over positive integer environment dimensions, and S(X)=−Re⁡tr⁡(f(X))S(X)=-\operatorname{Re}\operatorname{tr}(f(X))S(X)=−Retr(f(X)) with f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t and f(0)=0f(0)=0f(0)=0. Set d=∏i∣Di∣d=\prod_i|D_i|d=∏i​∣Di​∣, let h2(p)=−plog⁡2p−(1−p)log⁡2(1−p)h_2(p)=-p\log_2p-(1-p)\log_2(1-p)h2​(p)=−plog2​p−(1−p)log2​(1−p), with zero terms interpreted as zero, and define

ωD(ε)=16εlog⁡2d+2(m+1)h2(2ε).\omega_D(\varepsilon) =16\sqrt{\varepsilon}\log_2d +2(m+1)h_2(2\sqrt{\varepsilon}).ωD​(ε)=16ε​log2​d+2(m+1)h2​(2ε​).

The function ρ↦Em(ρ)\rho\mapsto E_m(\rho)ρ↦Em​(ρ) is continuous on the space of density matrices with its induced finite-dimensional matrix topology; for every pair of density matrices ρ,σ\rho,\sigmaρ,σ and every real ε\varepsilonε satisfying 0≤ε0\le\varepsilon0≤ε, 2ε≤12\sqrt{\varepsilon}\le12ε​≤1, and ∥ρ−σ∥1≤ε\|\rho-\sigma\|_1\le\varepsilon∥ρ−σ∥1​≤ε, one has ∣Em(ρ)−Em(σ)∣≤ωD(ε)|E_m(\rho)-E_m(\sigma)|\le\omega_D(\varepsilon)∣Em​(ρ)−Em​(σ)∣≤ωD​(ε); and ωD(ε)→0\omega_D(\varepsilon)\to0ωD​(ε)→0 as ε→0\varepsilon\to0ε→0 through nonnegative real values. Here ∥M∥1=Re⁡tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}∥M∥1​=RetrM†M​. The bound includes ε=0\varepsilon=0ε=0 and ε=1/4\varepsilon=1/4ε=1/4, and the declaration includes m=1m=1m=1 and singleton local sets.

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