Lemma III.4 (Superadditivity): entropy set-function supermodularity
ProvedQAlgorithms.Papers.Independent.Support50.P09.entropyThreshold_supermodularLet 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 any subsets ,
Overlapping, disjoint and empty subsets are included.
This is supermodularity of the entropy set function, called “Superadditivity” in the source.
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.4 (source name: Superadditivity), PDF p.10, (18):
supermodularity for overlapping, disjoint and empty subsets of the SAME source. -/
theorem entropyThreshold_supermodular (hm : 0 < m) (K L : Finset (Fin m)) :
entropyThreshold (pureDensity phi) K + entropyThreshold (pureDensity phi) L ≤
entropyThreshold (pureDensity phi) (K ∪ L) +
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 bases , finite reference basis , ambient vector , and any subsets , including empty subsets, put . Let be the marginal retaining and , let be the marginal of register alone, and define , where , , is applied by continuous functional calculus. With
the assertion is
In particular ; the displayed declaration imposes no normalization condition on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.