Unnumbered specialization of (5) and (6) to two parties
ProvedQAlgorithms.Papers.Independent.Support50.P09.twoParty_specializationLet 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.
Specialize to . For every , the inner family of subset inequalities is equivalent to
The outer family is equivalent to these same two singleton inequalities together with
where is half the infimum of conditional mutual information over all finite extensions.
This records both exact two-party reductions without asserting a new FQSW theorem.
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
/-- Unnumbered two-party specialization, PDF p.7: EXACT reductions of both
(5) and (6), including the singleton mutual-information inequalities. -/
theorem twoParty_specialization {D : Fin 2 → Type} [∀ i, Fintype (D i)]
[∀ i, Nonempty (D i)] {R : Type} [Fintype R] [Nonempty R]
(phi : EuclideanSpace ℂ (RegisterBasis D × R)) (hphi : ‖phi‖ = 1) (Q : Fin 2 → ℝ) :
let rho := pureDensity phi
let a := forgetEnvironment rho
let H1 := entropyAt (trivialExtension a) {0}
let H2 := entropyAt (trivialExtension a) {1}
let I1 := H1 + vnEntropy (traceLeft rho) - entropyAt rho {0}
let I2 := H2 + vnEntropy (traceLeft rho) - entropyAt rho {1}
(Q ∈ entropyPolyhedron rho ↔ I1/2 ≤ Q 0 ∧ I2/2 ≤ Q 1 ∧
(H1 + H2 + vnEntropy a)/2 ≤ Q 0 + Q 1) ∧
(Q ∈ outerPolyhedron rho ↔ I1/2 ≤ Q 0 ∧ I2/2 ≤ Q 1 ∧
(H1 + H2 + vnEntropy a)/2 - halfExtensionSquashed .total a ≤ Q 0 + Q 1) := by sorry
end QAlgorithms.Papers.Independent.Support50.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty bases, let be a finite nonempty reference basis, let satisfy , and let . Set , , , , , and , where the subscripts specify retained systems and , with , , applied by continuous functional calculus. For each subset , define ; put , and for nonempty let be one half the real infimum of over all positive finite auxiliary dimensions and all positive semidefinite trace-one extensions of . Write . Then both equivalences hold:
The subset quantifiers include the empty subset, and no separate nonnegativity condition is imposed on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.