Unnumbered main geometric result: P_H=P_V, vertices and recession cone
ProvedQAlgorithms.Papers.Independent.Support50.P09.polyhedral_descriptionLet 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 . Define . Then
The recession cone is retained, as in equations (14), (15) and Step 3; the prose on page 11 that omits it is corrected.
This is the paper’s geometric description of its sufficient rate region; it makes no distinctness or irredundancy claim.
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 geometric result, PDF pp.9,11–13, (14),(15),(32):
P_H=P_V, its vertices are precisely the corners, and its recession cone is
nonnegative. Correction: p.11's prose omits the cone; pp.9,13 include it. -/
theorem polyhedral_description (hm : 0 < m) :
entropyPolyhedron (pureDensity phi) = vertexPolyhedron (pureDensity phi) ∧
(entropyPolyhedron (pureDensity phi)).extremePoints ℝ = compressionCorners (pureDensity phi) ∧
rateRecession (entropyPolyhedron (pureDensity phi)) = positiveCone m := 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 ambient vector , put . Let retain and , let retain register alone, and use , with , , applied by continuous functional calculus. Define , and let consist of all real satisfying for every subset , including the empty subset. For a permutation , put and , and let . Then all three set equalities hold:
Here is the real convex hull and denotes extreme points. No normalization condition on appears in the displayed declaration.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.