Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem II.2: squashed-entanglement outer bound

Open
QAlgorithms.Papers.Independent.Support50.P09.distributedCompression_outer

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

prove2quantum

Let m≥1m\ge1m≥1 and let ∣ϕ⟩A1⋯AmR|\phi\rangle^{A_1\cdots A_mR}∣ϕ⟩A1​⋯Am​R be a normalized pure state on finite nonzero Hilbert spaces. All entropies are von Neumann entropies in bits of marginals of this same state. For K⊆[m]K\subseteq[m]K⊆[m], write AK=⨂i∈KAiA_K=\bigotimes_{i\in K}A_iAK​=⨂i∈K​Ai​ and

Cϕ(K)=12(∑i∈KH(Ai)+H(R)−H(AKR)).C_\phi(K)=\frac12\left(\sum_{i\in K}H(A_i)+H(R)-H(A_KR)\right).Cϕ​(K)=21​(i∈K∑​H(Ai​)+H(R)−H(AK​R)).

Let Rϕ\mathcal R_\phiRϕ​ be the closure of achievable nonnegative rate tuples: for every ϵ>0\epsilon>0ϵ>0, every sufficiently large positive blocklength admits independent local CPTP encoders and a joint receiver CPTP decoder, with log⁡2dim⁡Ci≤nQi\log_2\dim C_i\le nQ_ilog2​dimCi​≤nQi​ and squared fidelity at least 1−ϵ1-\epsilon1−ϵ with the entire original pure state on AnRnA^nR^nAnRn. The reference is untouched; no auxiliary communication or supplied shared entanglement is allowed.

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.

Every tuple in the closed operational rate region satisfies

∀K⊆[m],∑i∈KQi≥Cϕ(K)−Esq(ϕAK).\forall K\subseteq[m],\qquad \sum_{i\in K}Q_i\ge C_\phi(K)-E_{\rm sq}(\phi^{A_K}).∀K⊆[m],i∈K∑​Qi​≥Cϕ​(K)−Esq​(ϕAK​).

The correction is evaluated on the actual AKA_KAK​ marginal and lies outside the factor 1/21/21/2 in CϕC_\phiCϕ​. For K=∅K=\varnothingK=∅ its value is defined to be zero.

This is the necessary rate bound, extended to the closure by continuity of the linear inequalities.

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

section Compression

variable {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)] [hD : ∀ i, Nonempty (D i)]

variable {R : Type} [Fintype R] [hR : Nonempty R]

variable (phi : EuclideanSpace ℂ (RegisterBasis D × R)) (hphi : ‖phi‖ = 1)

include hphi hD hR

/-- Theorem II.2, PDF p.6: the unrestricted-extension correction lies outside 1/2.
The necessary inequalities extend to the closed rate region. -/
theorem distributedCompression_outer (hm : 0 < m) :
    multipartyCompressionRegion (pureDensity phi) ⊆ outerPolyhedron (pureDensity phi) := by sorry

end Compression

end QAlgorithms.Papers.Independent.Support50.P09

end
Source
Distributed Compression and Multiparty Squashed Entanglement, arXiv:0707.2792v2, PDF p. 6, Theorem II.2: squashed-entanglement outer bound
Read-back

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

Let m>0m>0m>0, let DiD_iDi​ and RRR be the ambient finite register and reference bases, and put ρxy=ϕxϕy‾\rho_{xy}=\phi_x\overline{\phi_y}ρxy​=ϕx​ϕy​​ for the ambient vector ϕ∈C(∏iDi)×R\phi\in\mathbb C^{(\prod_iD_i)\times R}ϕ∈C(∏i​Di​)×R. For any matrix XXX, use S(X)=−Re⁡Tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{Tr}[f(X)]S(X)=−ReTr[f(X)], with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x, f(0)=0f(0)=0f(0)=0, applied by continuous functional calculus. Let C(ρ)\mathcal C(\rho)C(ρ) be the closure of the nonnegative rate vectors QQQ such that, for every ε>0\varepsilon>0ε>0, all sufficiently large positive integers sss admit positive compressed dimensions cic_ici​, independent encoders Ei\mathcal E_iEi​, and a joint decoder D\mathcal DD, satisfying log⁡2ci≤sQi\log_2c_i\le sQ_ilog2​ci​≤sQi​ and

1−ε≤Re⁡Tr⁡[Ωs(id⁡Rs⊗(D∘⨂iEi))(Ωs)],1-\varepsilon\le\operatorname{Re}\operatorname{Tr} \left[\Omega_s(\operatorname{id}_{R^s}\otimes(\mathcal D\circ\textstyle\bigotimes_i\mathcal E_i))(\Omega_s)\right],1−ε≤ReTr[Ωs​(idRs​⊗(D∘⨂i​Ei​))(Ωs​)],

where Ωs=ρ⊗s\Omega_s=\rho^{\otimes s}Ωs​=ρ⊗s, reordered to put the reference copies first, and every encoder and decoder has a finite Kraus representation with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. Write ρKR\rho_{KR}ρKR​ for the marginal retaining registers in KKK and RRR, and ρK\rho_KρK​ for the marginal retaining KKK alone. Define E(∅)=0E(\varnothing)=0E(∅)=0; for nonempty KKK, define

E(K)=12inf⁡σ[∑i∈KS(σiE)−S(σKE)−(∣K∣−1)S(σE)],E(K)=\frac12\inf_{\sigma} \left[ \sum_{i\in K}S(\sigma_{iE})-S(\sigma_{KE})-(|K|-1)S(\sigma_E) \right],E(K)=21​σinf​[i∈K∑​S(σiE​)−S(σKE​)−(∣K∣−1)S(σE​)],

where the infimum ranges over every positive integer eee and every positive semidefinite trace-one matrix σ\sigmaσ on the selected registers and an auxiliary basis E={0,…,e−1}E=\{0,\ldots,e-1\}E={0,…,e−1}, with Tr⁡Eσ=ρK\operatorname{Tr}_E\sigma=\rho_KTrE​σ=ρK​. Every Q∈C(ρ)Q\in\mathcal C(\rho)Q∈C(ρ) satisfies, for every subset KKK, including the empty subset,

∑i∈KS(ρi)+S(ρR)−S(ρKR)2−E(K)≤∑i∈KQi.\frac{\sum_{i\in K}S(\rho_i)+S(\rho_R)-S(\rho_{KR})}{2}-E(K) \le\sum_{i\in K}Q_i.2∑i∈K​S(ρi​)+S(ρR​)−S(ρKR​)​−E(K)≤i∈K∑​Qi​.

These infima are real-valued infima, whose value on an empty candidate set is 000; the displayed declaration does not assume ∥ϕ∥=1\|\phi\|=1∥ϕ∥=1.

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