Theorem II.1: multiparty distributed compression inner bound (seed paper result)
OpenQAlgorithms.Papers.Independent.Support50.P09.distributedCompression_innerLet and let 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 , write and
Let be the closure of achievable nonnegative rate tuples: for every , every sufficiently large positive blocklength admits independent local CPTP encoders and a joint receiver CPTP decoder, with and squared fidelity at least with the entire original pure state on . The reference is untouched; no auxiliary communication or supplied shared entanglement is allowed.
Every real tuple satisfying all subset inequalities belongs to the closed operational region:
This is the sufficient rate region obtained by multiparty distributed compression. Boundary membership follows the source’s closure convention.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P09
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.1, PDF p.5: sufficient rates belong to the CLOSED region
(Definition II.1 and the limiting proof, pp.3,8–9). -/
theorem distributedCompression_inner (hm : 0 < m) :
entropyPolyhedron (pureDensity phi) ⊆ multipartyCompressionRegion (pureDensity phi) := by sorry
end Compression
end QAlgorithms.Papers.Independent.Support50.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let be the finite basis of register , let be the finite reference basis, and let be the vector appearing in the statement. Put , and write for the matrix obtained by tracing out all registers outside , while retaining , and for the marginal of register alone. Write , where , applied by continuous functional calculus with , and define
Every real vector satisfying for every subset , including the empty subset, belongs to the closure in of the following set of rates: for every , and for every there is such that for every integer with , there are positive integers , independent encoders from the copies of register to , and a joint decoder back to all sender registers, with and
Here , reordered as ; each encoder and decoder must have a finite Kraus representation with . The displayed declaration imposes no normalization condition on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.