Corollary 2: discarding an independent tensor factor preserves cluster mutual information
OpenQAlgorithms.Papers.Independent.Intakethird100.P63.corollary2_independentDiscardAll 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 , and suppose the -party state satisfies , with both factors its actual marginals. Let be disjoint nonempty clusters such that and is nonempty. For every subset ,
where . Each tensor block can itself be correlated. This allows removal of none or all of the independent tail.
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)
/-- Corollary 2, PDF p.4: discarding any part of an independent tail preserves
cluster mutual information. The two tensor blocks need not factor internally. -/
theorem corollary2_independentDiscard {n M : ℕ} (hM : 1 ≤ M) (hMn : M < n)
(rho : (Matrix (Fin n → ℕ) (Fin n → ℕ) ℂ)) (hrho : IsDensity rho)
(hfinite : FiniteSubsystemEntropies rho)
(hproduct : rho = productAcross rho (Finset.univ.filter (fun i => i.val < M)))
(A L D : Cluster n) (hA : A.Nonempty) (hL : L.Nonempty)
(hdisjoint : Disjoint A L)
(htail : Finset.univ.filter (fun i : Fin n => M ≤ i.val) ⊆ L)
(hretained : (L \ Finset.univ.filter (fun i : Fin n => M ≤ i.val)).Nonempty)
(hD : D ⊆ Finset.univ.filter (fun i : Fin n => M ≤ i.val)) :
clusterMutualInformation rho A L = clusterMutualInformation rho A (L \ D) := 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 natural numbers with , let be a complex kernel on admitting an entrywise expansion with square-summable vectors and , having real nonnegative finite quadratic forms for every finite and arbitrary complex , and having summable real diagonal of sum . For , define . Define as the infimum in of over representations with nonnegative summable weights of sum and square-summable vectors that are unit and pairwise orthogonal at distinct positive-weight indices; an empty infimum is . Assume for every , including the empty set, and write . Put and , and assume, for every ,
For any coordinate sets such that and are nonempty and disjoint, , is nonempty, and , the conclusion is
Here joining configurations uses their specified coordinates, and the reduction sums are total infinite sums; the discarded set may be empty or all of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.