Proposition III.7 (Existence of a maximal chain)
ProvedQAlgorithms.Papers.Independent.Support50.P09.vertex_maximalChainLet 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 vertex of , there is a chain
such that the entire solution set of its nonempty-set equations is exactly the vertex:
Vertices are extreme points of the feasible convex set.
The chain equations replace any defining independent system while preserving its singleton solution set.
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
/-- Proposition III.7, PDF p.12: a feasible vertex has m chain equations
whose ENTIRE solution set is the original singleton, not extra constraints. -/
theorem vertex_maximalChain (hm : 0 < m) (Q : Fin m → ℝ)
(hvertex : Q ∈ (entropyPolyhedron (pureDensity phi)).extremePoints ℝ) :
∃ K : Fin (m+1) → Finset (Fin m), IsMaximalChain K ∧
{x | chainEquations (pureDensity phi) K x} = {Q} := 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 , set . Let retain registers and , let retain register alone, and write , with , , applied by continuous functional calculus. Define and
For every that is an extreme point of , there exist subsets with , , and for every , such that
The solution set here ranges over all real vectors, without an additional requirement that they belong to ; no norm-one hypothesis on appears in the displayed declaration.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.