§IV, unnumbered: operational strong subadditivity
ProvedQAlgorithms.Papers.Independent.Gap48.P38.strongSubadditivityLet be an arbitrary unit vector on nonempty finite complex registers, permitting trivial one-dimensional subsystems. Compute all marginals by partial trace and all entropies in bits. Then
This is the strong-subadditivity conclusion established operationally in Section IV, not merely an intermediate finite-block communication bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P38
noncomputable section
open MeasureTheory
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Gap48.P38
/-- Section IV's main result, PDF pp.8--9: strong subadditivity for every
normalized pure ABCD, with actual marginals and finite entropy in bits. -/
theorem strongSubadditivity
(I : Fin 4 → Type) [∀ i, Fintype (I i)] [∀ i, Nonempty (I i)]
(psi : EuclideanSpace ℂ (∀ i, I i)) (hpsi : ‖psi‖ = 1) :
0 ≤ registerCMI I (pureDensity psi) {2} {3} {1} := by sorry
end QAlgorithms.Papers.Independent.Gap48.P38
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every family of four finite, nonempty index sets , each of which may be a singleton, and every complex vector indexed by with , put . For a set of registers , let be the reduced matrix whose entries are , where ranges over assignments to the complementary registers and denotes the combined assignment. Write , where is applied by continuous functional calculus, with , and abbreviate register sets by their digits. Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.