Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered specialization of (5) and (6) to two parties

Proved
QAlgorithms.Papers.Independent.Support50.P09.twoParty_specialization

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.

Specialize to m=2m=2m=2. For every Q∈R2Q\in\mathbb R^2Q∈R2, the inner family of subset inequalities is equivalent to

Q1≥12I(A1;R),Q2≥12I(A2;R),Q1+Q2≥12[H(A1)+H(A2)+H(A1A2)].Q_1\ge\tfrac12 I(A_1;R),\qquad Q_2\ge\tfrac12 I(A_2;R),\qquad Q_1+Q_2\ge\tfrac12[H(A_1)+H(A_2)+H(A_1A_2)].Q1​≥21​I(A1​;R),Q2​≥21​I(A2​;R),Q1​+Q2​≥21​[H(A1​)+H(A2​)+H(A1​A2​)].

The outer family is equivalent to these same two singleton inequalities together with

Q1+Q2≥12[H(A1)+H(A2)+H(A1A2)]−Esq(ϕA1A2),Q_1+Q_2\ge\tfrac12[H(A_1)+H(A_2)+H(A_1A_2)]-E_{\rm sq}(\phi^{A_1A_2}),Q1​+Q2​≥21​[H(A1​)+H(A2​)+H(A1​A2​)]−Esq​(ϕA1​A2​),

where EsqE_{\rm sq}Esq​ is half the infimum of conditional mutual information over all finite extensions.

This records both exact two-party reductions without asserting a new FQSW theorem.

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

/-- Unnumbered two-party specialization, PDF p.7: EXACT reductions of both
(5) and (6), including the singleton mutual-information inequalities. -/
theorem twoParty_specialization {D : Fin 2 → Type} [∀ i, Fintype (D i)]
    [∀ i, Nonempty (D i)] {R : Type} [Fintype R] [Nonempty R]
    (phi : EuclideanSpace ℂ (RegisterBasis D × R)) (hphi : ‖phi‖ = 1) (Q : Fin 2 → ℝ) :
    let rho := pureDensity phi
    let a := forgetEnvironment rho
    let H1 := entropyAt (trivialExtension a) {0}
    let H2 := entropyAt (trivialExtension a) {1}
    let I1 := H1 + vnEntropy (traceLeft rho) - entropyAt rho {0}
    let I2 := H2 + vnEntropy (traceLeft rho) - entropyAt rho {1}
    (Q ∈ entropyPolyhedron rho ↔ I1/2 ≤ Q 0 ∧ I2/2 ≤ Q 1 ∧
      (H1 + H2 + vnEntropy a)/2 ≤ Q 0 + Q 1) ∧
    (Q ∈ outerPolyhedron rho ↔ I1/2 ≤ Q 0 ∧ I2/2 ≤ Q 1 ∧
      (H1 + H2 + vnEntropy a)/2 - halfExtensionSquashed .total a ≤ Q 0 + Q 1) := by sorry

end QAlgorithms.Papers.Independent.Support50.P09

end
Source
Distributed Compression and Multiparty Squashed Entanglement, arXiv:0707.2792v2, PDF p. 7, Unnumbered specialization of (5) and (6) to two parties
Read-back

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

Let D0,D1D_0,D_1D0​,D1​ be finite nonempty bases, let RRR be a finite nonempty reference basis, let ϕ∈C(D0×D1)×R\phi\in\mathbb C^{(D_0\times D_1)\times R}ϕ∈C(D0​×D1​)×R satisfy ∥ϕ∥=1\|\phi\|=1∥ϕ∥=1, and let Q=(Q0,Q1)∈R2Q=(Q_0,Q_1)\in\mathbb R^2Q=(Q0​,Q1​)∈R2. Set ρxy=ϕxϕy‾\rho_{xy}=\phi_x\overline{\phi_y}ρxy​=ϕx​ϕy​​, a=Tr⁡Rρa=\operatorname{Tr}_R\rhoa=TrR​ρ, H1=S(a0)H_1=S(a_0)H1​=S(a0​), H2=S(a1)H_2=S(a_1)H2​=S(a1​), I1=H1+S(ρR)−S(ρ0R)I_1=H_1+S(\rho_R)-S(\rho_{0R})I1​=H1​+S(ρR​)−S(ρ0R​), and I2=H2+S(ρR)−S(ρ1R)I_2=H_2+S(\rho_R)-S(\rho_{1R})I2​=H2​+S(ρR​)−S(ρ1R​), where the subscripts specify retained systems and 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. For each subset K⊆{0,1}K\subseteq\{0,1\}K⊆{0,1}, define F(K)=(∑i∈KS(ai)+S(ρR)−S(ρKR))/2F(K)=(\sum_{i\in K}S(a_i)+S(\rho_R)-S(\rho_{KR}))/2F(K)=(∑i∈K​S(ai​)+S(ρR​)−S(ρKR​))/2; put E(∅)=0E(\varnothing)=0E(∅)=0, and for nonempty KKK let E(K)E(K)E(K) be one half the real infimum of ∑i∈KS(σiE)−S(σKE)−(∣K∣−1)S(σE)\sum_{i\in K}S(\sigma_{iE})-S(\sigma_{KE})-(|K|-1)S(\sigma_E)∑i∈K​S(σiE​)−S(σKE​)−(∣K∣−1)S(σE​) over all positive finite auxiliary dimensions and all positive semidefinite trace-one extensions σ\sigmaσ of aKa_KaK​. Write E(a)=E({0,1})E(a)=E(\{0,1\})E(a)=E({0,1}). Then both equivalences hold:

(∀K, F(K)≤∑i∈KQi)  ⟺  I12≤Q0 ∧ I22≤Q1 ∧ H1+H2+S(a)2≤Q0+Q1,(∀K, F(K)−E(K)≤∑i∈KQi)  ⟺  I12≤Q0 ∧ I22≤Q1 ∧ H1+H2+S(a)2−E(a)≤Q0+Q1.\begin{aligned} \bigl(\forall K,\ F(K)\le\textstyle\sum_{i\in K}Q_i\bigr) &\iff \frac{I_1}{2}\le Q_0\ \land\ \frac{I_2}{2}\le Q_1\ \land\ \frac{H_1+H_2+S(a)}{2}\le Q_0+Q_1,\\ \bigl(\forall K,\ F(K)-E(K)\le\textstyle\sum_{i\in K}Q_i\bigr) &\iff \frac{I_1}{2}\le Q_0\ \land\ \frac{I_2}{2}\le Q_1\ \land\ \frac{H_1+H_2+S(a)}{2}-E(a)\le Q_0+Q_1. \end{aligned}(∀K, F(K)≤∑i∈K​Qi​)(∀K, F(K)−E(K)≤∑i∈K​Qi​)​⟺2I1​​≤Q0​ ∧ 2I2​​≤Q1​ ∧ 2H1​+H2​+S(a)​≤Q0​+Q1​,⟺2I1​​≤Q0​ ∧ 2I2​​≤Q1​ ∧ 2H1​+H2​+S(a)​−E(a)≤Q0​+Q1​.​

The subset quantifiers include the empty subset, and no separate nonnegativity condition is imposed on QQQ.

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