Lemma III.2: corner points lie in the rate region
OpenQAlgorithms.Papers.Independent.Support50.P09.corners_inRegionLet 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.
Define . For a permutation , let be its last participants and define the corner by . Write ; different permutations may give the same point.
All computed corners belong to the closed operational region:
These rates supply the vertices used for time sharing and resource wasting.
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
/-- Lemma III.2, PDF pp.7–8: computed suffix-based corners are in the closed region. -/
theorem corners_inRegion (hm : 0 < m) :
compressionCorners (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
For , the ambient finite bases , and the ambient vector , put . Write for the marginal retaining and , for the marginal of register alone, and , with , , applied by continuous functional calculus. For each permutation of , let and define the real vector
Every such vector belongs to the closure of the nonnegative rate vectors for which, for every , all sufficiently large positive integers admit positive dimensions , independent encoders , and a joint decoder , satisfying and . Here is reordered as , and each map has a finite Kraus representation with ; each encoder outputs a -dimensional system and the decoder returns all sender registers. No norm-one hypothesis on appears in the displayed declaration.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.