Equation (19): the six directed SSA excesses agree in three pairs
OpenQAlgorithms.Papers.Independent.Intakethird100.P63.eq19_pairedExcessesAll 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 be any tripartite state, and let be any permutation of its three parties. Write for mutual information of disjoint clusters. Then
This pairs the six directed SSA excesses into three equal pairs. Each displayed side expands to ; the statement does not equate all six excesses.
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)
/-- Unnumbered (19), PDF pp.7–8: the six directed SSA excesses pair up under party
permutations. This states every permutation; it does not equate all six excesses. -/
theorem eq19_pairedExcesses (rho : (Matrix (Fin 3 → ℕ) (Fin 3 → ℕ) ℂ)) (hrho : IsDensity rho)
(hfinite : FiniteSubsystemEntropies rho) (p : Equiv.Perm (Fin 3)) :
clusterMutualInformation rho {p 0} {p 1, p 2} - clusterMutualInformation rho {p 0} {p 1} =
clusterMutualInformation rho {p 0, p 1} {p 2} - clusterMutualInformation rho {p 1} {p 2} := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P63
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a complex kernel on that admits an entrywise expansion with square-summable vectors and , whose every finite quadratic form is real and nonnegative, and whose real diagonal is summable with sum . For each , define , where and combines their coordinates. For any kernel , define as the infimum of over all entrywise expansions with nonnegative summable weights of sum and square-summable vectors whose positive-weight members are unit and pairwise orthogonal; zero-weight vectors are unrestricted, , and an empty infimum is . Assume for every , including the empty set. Set and , with the conversion convention . For every permutation of ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.