Lemma III.6 (No co-occurrence)
ProvedQAlgorithms.Papers.Independent.Support50.P09.noCooccurrenceLet 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.
Let . Suppose the real linear system for has exactly one solution, including existence. Then
No feasibility condition on that solution is required.
This is the incidence-column obstruction used in the vertex analysis. The source’s word “pair” is read as two distinct elements, following its proof.
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.6, PDF p.11: "pair" means DISTINCT elements, as its
column-dependence proof requires. Unique solvability includes existence. -/
theorem noCooccurrence (hm : 0 < m) (L : Fin m → Finset (Fin m))
(hunique : ∃! Q : Fin m → ℝ,
∀ j, (∑ i ∈ L j, Q i) = entropyThreshold (pureDensity phi) (L j)) :
¬ ∃ j k : Fin m, j ≠ k ∧ ∀ i, (j ∈ L i ↔ k ∈ L i) := 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 . For a subset of the register indices, let retain and , let retain register alone, and put , where , , , is defined by continuous functional calculus. Let be arbitrary subsets of . If there exists exactly one real vector satisfying for every , then
Thus no two distinct register indices have identical membership in every . The uniqueness hypothesis ranges over all real vectors, without requiring any additional subset inequalities or nonnegative coordinates; when , the conclusion already holds because there are no distinct indices. No normalization condition on appears in the displayed declaration.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.