Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered main consequence: optimality for zero-squashed sources

Open
QAlgorithms.Papers.Independent.Support50.P09.zeroSquashed_optimal

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.

Let Pout={Q:∑i∈KQi≥Cϕ(K)−Esq(ϕAK) for every K⊆[m]}P_{\rm out}=\{Q:\sum_{i\in K}Q_i\ge C_\phi(K)-E_{\rm sq}(\phi^{A_K})\text{ for every }K\subseteq[m]\}Pout​={Q:∑i∈K​Qi​≥Cϕ​(K)−Esq​(ϕAK​) for every K⊆[m]} and PH={Q:∑i∈KQi≥Cϕ(K) for every K⊆[m]}P_H=\{Q:\sum_{i\in K}Q_i\ge C_\phi(K)\text{ for every }K\subseteq[m]\}PH​={Q:∑i∈K​Qi​≥Cϕ​(K) for every K⊆[m]}. Then

Esq(ϕA1⋯Am)=0⟹Rϕ=PHandPout=PH.E_{\rm sq}(\phi^{A_1\cdots A_m})=0\quad\Longrightarrow\quad \mathcal R_\phi=P_H\quad\text{and}\quad P_{\rm out}=P_H.Esq​(ϕA1​⋯Am​)=0⟹Rϕ​=PH​andPout​=PH​.

No separate zero-measure hypothesis is imposed on the subsets.

This identifies the optimal distributed-compression region for zero-squashed sources.

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

/-- Unnumbered optimality consequence, PDF pp.6,24 (also p.1): zero of the
FULL sender measure suffices; zero of every subset is not assumed. -/
theorem zeroSquashed_optimal (hm : 0 < m)
    (hzero : halfExtensionSquashed .total (forgetEnvironment (pureDensity phi)) = 0) :
    multipartyCompressionRegion (pureDensity phi) = entropyPolyhedron (pureDensity phi) ∧
    outerPolyhedron (pureDensity phi) = entropyPolyhedron (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, Unnumbered main consequence: optimality for zero-squashed sources
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 bases, and set ρxy=ϕxϕy‾\rho_{xy}=\phi_x\overline{\phi_y}ρxy​=ϕx​ϕy​​ and τ=Tr⁡Rρ\tau=\operatorname{Tr}_R\rhoτ=TrR​ρ. Write S(X)=−Re⁡Tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{Tr}[f(X)]S(X)=−ReTr[f(X)], where f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x, f(0)=0f(0)=0f(0)=0, is applied by continuous functional calculus. For nonempty K⊆{0,…,m−1}K\subseteq\{0,\ldots,m-1\}K⊆{0,…,m−1}, let

E(K)=12inf⁡e>0, σ≥0, Tr⁡σ=1Tr⁡Eσ=τK[∑i∈KS(σiE)−S(σKE)−(∣K∣−1)S(σE)],E(K)=\frac12\inf_{\substack{e>0,\ \sigma\ge0,\ \operatorname{Tr}\sigma=1\\ \operatorname{Tr}_E\sigma=\tau_K}} \left[\sum_{i\in K}S(\sigma_{iE})-S(\sigma_{KE})-(|K|-1)S(\sigma_E)\right],E(K)=21​e>0, σ≥0, Trσ=1TrE​σ=τK​​inf​[i∈K∑​S(σiE​)−S(σKE​)−(∣K∣−1)S(σE​)],

where eee is a natural number and EEE has eee basis elements; put E(∅)=0E(\varnothing)=0E(∅)=0. Assume E({0,…,m−1})=0E(\{0,\ldots,m-1\})=0E({0,…,m−1})=0. Define F(K)=(∑i∈KS(τi)+S(ρR)−S(ρKR))/2F(K)=(\sum_{i\in K}S(\tau_i)+S(\rho_R)-S(\rho_{KR}))/2F(K)=(∑i∈K​S(τi​)+S(ρR​)−S(ρKR​))/2, and let P={Q:∀K, F(K)≤∑i∈KQi}\mathcal P=\{Q:\forall K,\ F(K)\le\sum_{i\in K}Q_i\}P={Q:∀K, F(K)≤∑i∈K​Qi​} and O={Q:∀K, F(K)−E(K)≤∑i∈KQi}\mathcal O=\{Q:\forall K,\ F(K)-E(K)\le\sum_{i\in K}Q_i\}O={Q:∀K, F(K)−E(K)≤∑i∈K​Qi​}, with both quantifiers including the empty subset and with no separate nonnegativity condition in these definitions. Let C\mathcal CC be the closure of all nonnegative QQQ such that for every ε>0\varepsilon>0ε>0, all sufficiently large positive integers sss admit positive integers cic_ici​, independent encoders Ei:Dis→{0,…,ci−1}\mathcal E_i:D_i^s\to\{0,\ldots,c_i-1\}Ei​:Dis​→{0,…,ci​−1}, and a joint decoder D\mathcal DD, satisfying log⁡2ci≤sQi\log_2c_i\le sQ_ilog2​ci​≤sQi​ and Re⁡Tr⁡[Ωs(id⁡Rs⊗(D∘⨂iEi))(Ωs)]≥1−ε\operatorname{Re}\operatorname{Tr}[\Omega_s(\operatorname{id}_{R^s}\otimes(\mathcal D\circ\bigotimes_i\mathcal E_i))(\Omega_s)]\ge1-\varepsilonReTr[Ωs​(idRs​⊗(D∘⨂i​Ei​))(Ωs​)]≥1−ε, where Ωs=ρ⊗s\Omega_s=\rho^{\otimes s}Ωs​=ρ⊗s is reordered with reference copies first and the maps have finite Kraus representations with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. Then

C=PandO=P.\mathcal C=\mathcal P\qquad\text{and}\qquad\mathcal O=\mathcal P.C=PandO=P.

The infima defining E(K)E(K)E(K) are taken in R\mathbb RR, with empty-set infimum 000; no norm-one assumption on ϕ\phiϕ appears in the displayed declaration.

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