Unnumbered main consequence: optimality for zero-squashed sources
OpenQAlgorithms.Papers.Independent.Support50.P09.zeroSquashed_optimalLet 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.
For a normalized state with finite nonzero local systems, define
Entropies are in bits. The infimum ranges over all normalized extensions and every positive finite dimension of , with no dimension bound or attainment assumption. One-party inputs use this same entropy expression and have value zero.
Let and . Then
No separate zero-measure hypothesis is imposed on the subsets.
This identifies the optimal distributed-compression region for zero-squashed sources.
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
/-- 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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let and be the ambient finite bases, and set and . Write , where , , is applied by continuous functional calculus. For nonempty , let
where is a natural number and has basis elements; put . Assume . Define , and let and , with both quantifiers including the empty subset and with no separate nonnegativity condition in these definitions. Let be the closure of all nonnegative such that for every , all sufficiently large positive integers admit positive integers , independent encoders , and a joint decoder , satisfying and , where is reordered with reference copies first and the maps have finite Kraus representations with . Then
The infima defining are taken in , with empty-set infimum ; no norm-one assumption on appears in the displayed declaration.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.