Lemma 1: multipartite subadditivity and its equality case
OpenQAlgorithms.Papers.Independent.Intakethird100.P63.lemma1_subadditivityAll states below are positive trace-class density operators of trace one on completed complex Hilbert tensor products, represented in countable orthonormal coordinates. Finite dimensional systems are included. Entropies use natural logarithms and the convention . Every subsystem entropy occurring in an entropy difference is finite; this is the proof-supported finite-entropy reading of the source, and imposes no finite Hilbert dimension.
Let , let be an -party state, and let be its actual marginal on party . Then
Thus equality characterizes complete absence of correlations among the parties.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P63
noncomputable section
open scoped ENNReal BigOperators
namespace QAlgorithms.Papers.Independent.Intakethird100.P63
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the accepted nuclear trace-class, positive, trace-one predicate verbatim.
open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity)
open QAlgorithms.Papers.Independent.Dependency50.P13 (finiteRelativeEntropy)
/-- Lemma 1, PDF p.2, (1): multipartite subadditivity and its full equality case.
Finite subsystem entropies make the source's equality characterization meaningful. -/
theorem lemma1_subadditivity {n : ℕ} (hn : 2 ≤ n)
(rho : (Matrix (Fin n → ℕ) (Fin n → ℕ) ℂ)) (hrho : IsDensity rho)
(hfinite : FiniteSubsystemEntropies rho) :
herbutMarginalEntropy rho Finset.univ ≤ ∑ i : Fin n, herbutMarginalEntropy rho {i} ∧
(herbutMarginalEntropy rho Finset.univ = ∑ i : Fin n, herbutMarginalEntropy rho {i} ↔
rho = tensorMarginals rho) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P63
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and complex kernel on , assume that for some with , that every finite quadratic form is real and nonnegative for finite and arbitrary , and that the real diagonal of is summable with sum . For each coordinate set , let , where joining configurations uses on and on . Define as the infimum, in , of over representations with nonnegative summable weights of total mass and square-summable vectors that have norm and are pairwise orthogonal at distinct positive-weight indices; an empty collection of representations gives . Assume for every , including the empty and full coordinate sets, and write . Then
In the last expression, denote configurations on the singleton ; all infinite kernel sums use the total-sum convention.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.