Lemma IV.2 (Merging of multiparty information terms)
ProvedQAlgorithms.Papers.Independent.Support50.P09.information_mergingLet be one normalized density operator on finitely many finite nonzero registers. All named systems below are disjoint groups of these registers, and every entropy is computed from the corresponding marginal of . Define , with logarithms to base two; omitting denotes unconditional information. Empty groups represent one-dimensional systems.
Let be disjoint systems, allowing . Then
The register is merged into , preserving its correlations.
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
/-- Lemma IV.2, PDF p.14, (36): merge A and B without discarding B.
There may be zero other X registers. -/
theorem information_merging {n m : ℕ} {D : Fin n → Type}
[∀ i, Fintype (D i)] [∀ i, Nonempty (D i)]
(rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) (hrho : IsDensityMatrix rho)
(a b : Finset (Fin n)) (x : Fin m → Finset (Fin n))
(hdis : DisjointRegisters (Fin.cons a (Fin.cons b x)) ∅) :
info .total rho (Fin.cons a (Fin.cons b x)) ∅ - info .total rho ![a,b] ∅ =
info .total rho (Fin.cons (a ∪ b) x) ∅ := by sorry
end QAlgorithms.Papers.Independent.Support50.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers , let be finite nonempty sets, and let be a positive semidefinite complex matrix of trace , indexed by . For a set of register indices, let be the matrix obtained by tracing out all registers outside , and write for its von Neumann entropy in bits. Explicitly, the entropy of a density matrix is , where , with , and is defined by functional calculus. For a nonempty list of register sets, define . For any register sets that are pairwise disjoint, the following identity holds:
The register sets may be empty and need not exhaust all registers; and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.