Lemma III.3: suffix-sum characterization of corner points
ProvedQAlgorithms.Papers.Independent.Support50.P09.corner_suffixCharacterizationLet 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.
For every real rate tuple ,
One permutation must witness all nonempty suffix equalities.
This characterizes a corner by a triangular family of saturated constraints.
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.3, PDF pp.8–9: one permutation witnesses ALL nonempty suffixes. -/
theorem corner_suffixCharacterization (hm : 0 < m) (Q : Fin m → ℝ) :
Q ∈ compressionCorners (pureDensity phi) ↔ ∃ pi : Equiv.Perm (Fin m),
∀ l : ℕ, 1 ≤ l → l ≤ m →
(∑ i ∈ senderSuffix pi l, Q i) = entropyThreshold (pureDensity phi) (senderSuffix pi l) := 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 , the ambient vector , and any real vector , set . Let denote the marginal retaining the registers in and , let denote the marginal of register alone, and let , with , , applied by continuous functional calculus. Put . Then equals the vector
for some permutation , if and only if there exists a permutation such that, for every natural number with ,
Thus the equalities concern all nonempty suffixes, including the full set; there is no separate feasibility or nonnegativity hypothesis on , and no norm-one hypothesis on appears in the displayed declaration.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.