§5.1 (5.6)–(5.15): von Neumann entropy structure
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.vonNeumann_structureAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation denotes conditional von Neumann entropy.
For normalized states: SSA, full side-information CPTP DPI, |H(A)−H(B)|≤H(AB)≤H(A)+H(B), and H(A|B)=−D(ρ_AB||I_A⊗ρ_B)=max_{density σ_B}−D(ρ_AB||I_A⊗σ_B), with optimizer ρ_B.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#5.vn
§5.1 (5.6)–(5.15): von Neumann entropy structure, arXiv:1504.00233v5, PDF p.76. -/
theorem vonNeumann_structure [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] :
(∀ r : paperMat ((A × B) × C), IsDensityMatrix r →
vnEntropy r+vnEntropy (traceRight (paperMarginalBC r)) ≤ vnEntropy (traceRight r)+vnEntropy (paperMarginalBC r) ∧
conditionalVN (paperRegroup r) ≤ conditionalVN (traceRight r)) ∧
(∀ r : paperMat (A × B), IsDensityMatrix r → ∀ E : paperMat B →ₗ[ℂ] paperMat D, paperCPTP E →
conditionalVN r ≤ conditionalVN (idTensorSuperop E r)) ∧
(∀ r : paperMat (A × B), IsDensityMatrix r →
|vnEntropy (traceRight r)-vnEntropy (traceLeft r)| ≤ vnEntropy r ∧
vnEntropy r ≤ vnEntropy (traceRight r)+vnEntropy (traceLeft r) ∧
(conditionalVN r:EReal) = -paperRelativeD r (Matrix.kronecker (1:paperMat A) (traceLeft r)) ∧
(∃ s : paperMat B, IsDensityMatrix s ∧ (conditionalVN r:EReal) = -paperRelativeD r (Matrix.kronecker (1:paperMat A) s)) ∧
(∀ s : paperMat B, IsDensityMatrix s → -paperRelativeD r (Matrix.kronecker (1:paperMat A) s) ≤ (conditionalVN r:EReal))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any nonempty finite types , equipped with decidable equality, let a density matrix mean a positive semidefinite matrix of complex trace , and define
using functional calculus and the total real logarithm, for which . For a bipartite matrix on , write , , where partial traces sum the matching row and column indices of the discarded factor, and put . Every density matrix indexed by satisfies
where
and ; the second inequality regards as a matrix on by reindexing. Every density matrix on and every complex-linear, completely positive map that preserves the complex trace of every matrix satisfy
The tensor action applies separately to each block indexed by a pair of -indices, and complete positivity requires positivity of all finite amplifications, including the zero-dimensional one. Finally, every density matrix on satisfies
and, as equalities and inequalities in the extended real numbers,
Here unless ; when this inclusion holds,
with the real quotient embedded into the extended reals.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.