Corollary III.5: tight sets closed under union and intersection
ProvedQAlgorithms.Papers.Independent.Support50.P09.tightSets_unionIntersectionLet 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.
Let and let satisfy and . Then both conclusions hold:
Feasibility makes the collection of tight subsets closed under union and intersection.
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
/-- Corollary III.5, PDF p.10: feasibility is retained; both tightness equations
for the union and intersection are conclusions. -/
theorem tightSets_unionIntersection (hm : 0 < m) (Q : Fin m → ℝ)
(hQ : Q ∈ entropyPolyhedron (pureDensity phi)) (K L : Finset (Fin m))
(hK : (∑ i ∈ K, Q i) = entropyThreshold (pureDensity phi) K)
(hL : (∑ i ∈ L, Q i) = entropyThreshold (pureDensity phi) L) :
(∑ i ∈ K ∪ L, Q i) = entropyThreshold (pureDensity phi) (K ∪ L) ∧
(∑ i ∈ K ∩ L, Q i) = entropyThreshold (pureDensity phi) (K ∩ 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 register and reference bases , and the ambient vector , set . Write for the marginal retaining and , for the marginal of register alone, and , with , , applied by continuous functional calculus. Define . Suppose a real vector satisfies for every subset , and suppose subsets , which may be empty, satisfy and . Then both equalities hold:
There is no separate 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.