Lemma IV.4 (Chain-type Rule)
ProvedQAlgorithms.Papers.Independent.Support50.P09.conditionalInformation_chainLet 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.
For disjoint , with ,
This transfers the removed register into the conditioning system. It is distinct from disposal with unchanged conditioning.
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.4, PDF p.15, (38): move A' into the conditioning system.
Includes zero X registers, when both one-party expressions vanish. -/
theorem conditionalInformation_chain {n m : ℕ} {D : Fin n → Type}
[∀ i, Fintype (D i)] [∀ i, Nonempty (D i)]
(rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) (hrho : IsDensityMatrix rho)
(a ap e : Finset (Fin n)) (x : Fin m → Finset (Fin n))
(hdis : DisjointRegisters (Fin.cons a (Fin.cons ap x)) e) :
info .total rho (Fin.cons a x) (ap ∪ e) ≤
info .total rho (Fin.cons (a ∪ ap) x) e := 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 on . Let denote the von Neumann entropy in bits of the marginal on the registers in , where , , and . For a nonempty list, set . For all register sets , if are pairwise disjoint and each is disjoint from , then
The sets may be empty and need not cover the registers; and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.