Additivity across arbitrary product partitions
ProvedQAlgorithms.Papers.Independent.Support50.P43.alternative_product_partitionAll entropies are von Neumann entropies in bits, with zero eigenvalues contributing zero. For a normalized positive semidefinite state on nonzero finite-dimensional local complex spaces, write for the marginal entropy, , and . Define
Let be any partition of into nonempty disjoint blocks, with , and suppose after regrouping the registers. For a nonempty block , put , using . Then
This includes singleton blocks, whose information is zero, and products across any partition of the physical parties.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P43
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- These accepted register types are definitionally the required finite tensor bases.
open QAlgorithms.Papers.Independent.Claimed50.P33 (RegisterBasis SubBasis)
open QAlgorithms.Papers.Independent.Information100.P21 (ghzKet)
/-- Theorem 5 and (15), PDF p.4: additivity across ANY partition of the parties
on which the density matrix factors, allowing singleton blocks. -/
theorem alternative_product_partition {n m : ℕ} (hn : 2 ≤ n) (hm : 1 ≤ m)
{D : Fin n → Type} [∀ i, Fintype (D i)] [∀ i, Nonempty (D i)]
(rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) (hrho : IsDensityMatrix rho)
(blocks : Fin m → Finset (Fin n))
(hne : ∀ j, (blocks j).Nonempty)
(hdis : ∀ j k, j ≠ k → Disjoint (blocks j) (blocks k))
(hcover : Finset.univ.biUnion blocks = Finset.univ)
(hprod : IsProductAcross rho blocks) :
alternativeOn rho Finset.univ = ∑ j, alternativeOn rho (blocks j) := by sorry
end QAlgorithms.Papers.Independent.Support50.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of natural numbers and , every family of finite nonempty sets indexed by , and every positive semidefinite trace-one complex matrix indexed by , define its marginals by , and put , with applied by continuous functional calculus. Suppose are nonempty, pairwise disjoint subsets of whose union is , and suppose that, for every pair of full register labels ,
For , define
Then . This includes the one-block partition and partitions containing singleton blocks; a singleton block contributes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.