Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1 (5.6)–(5.15): von Neumann entropy structure

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.vonNeumann_structure

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All 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 Q~α=Tr⁡(σ(1−α)/(2α)ρσ(1−α)/(2α))α\widetilde Q_\alpha=\operatorname{Tr}(\sigma^{(1-\alpha)/(2\alpha)}\rho\sigma^{(1-\alpha)/(2\alpha)})^\alphaQ​α​=Tr(σ(1−α)/(2α)ρσ(1−α)/(2α))α and Q‾α=Tr⁡(ρασ1−α)\overline Q_\alpha=\operatorname{Tr}(\rho^\alpha\sigma^{1-\alpha})Q​α​=Tr(ρασ1−α); the divergences include division by Tr⁡ρ\operatorname{Tr}\rhoTrρ inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation ρ≪σ\rho\ll\sigmaρ≪σ 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 H(A∣B)=H(AB)−H(B)H(A|B)=H(AB)-H(B)H(A∣B)=H(AB)−H(B) 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.

H(ABC)+H(B)≤H(AB)+H(BC),H(A∣B)=−D(ρAB∥IA⊗ρB)=max⁡σB∈S∘−D(ρAB∥IA⊗σB).H(ABC)+H(B)\le H(AB)+H(BC),\qquad H(A|B)=-D(\rho_{AB}\|I_A\otimes\rho_B)=\max_{\sigma_B\in\mathcal S_\circ}-D(\rho_{AB}\|I_A\otimes\sigma_B).H(ABC)+H(B)≤H(AB)+H(BC),H(A∣B)=−D(ρAB​∥IA​⊗ρB​)=σB​∈S∘​max​−D(ρAB​∥IA​⊗σB​).

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
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
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 76, §5.1 (5.6)–(5.15): von Neumann entropy structure
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For any nonempty finite types A,B,C,DA,B,C,DA,B,C,D, equipped with decidable equality, let a density matrix mean a positive semidefinite matrix of complex trace 111, and define

S(X)=−Re⁡tr⁡[g(X)],g(t)=tlog⁡2t,S(X)=-\operatorname{Re}\operatorname{tr}\bigl[g(X)\bigr], \qquad g(t)=t\log_2 t,S(X)=−Retr[g(X)],g(t)=tlog2​t,

using functional calculus and the total real logarithm, for which log⁡20=0\log_2 0=0log2​0=0. For a bipartite matrix XXX on U×VU\times VU×V, write XU=Tr⁡VXX_U=\operatorname{Tr}_V XXU​=TrV​X, XV=Tr⁡UXX_V=\operatorname{Tr}_U XXV​=TrU​X, where partial traces sum the matching row and column indices of the discarded factor, and put H(U∣V)X=S(X)−S(XV)H(U\mid V)_X=S(X)-S(X_V)H(U∣V)X​=S(X)−S(XV​). Every density matrix rrr indexed by (A×B)×C(A\times B)\times C(A×B)×C satisfies

S(r)+S(rB)≤S(rAB)+S(rBC),S(r)−S(rBC)≤S(rAB)−S(rB),S(r)+S(r_B)\le S(r_{AB})+S(r_{BC}), \qquad S(r)-S(r_{BC})\le S(r_{AB})-S(r_B),S(r)+S(rB​)≤S(rAB​)+S(rBC​),S(r)−S(rBC​)≤S(rAB​)−S(rB​),

where

(rAB)(a,b),(a′,b′)=∑cr((a,b),c),((a′,b′),c),(rBC)(b,c),(b′,c′)=∑ar((a,b),c),((a,b′),c′),(r_{AB})_{(a,b),(a',b')}=\sum_c r_{((a,b),c),((a',b'),c)},\qquad (r_{BC})_{(b,c),(b',c')}=\sum_a r_{((a,b),c),((a,b'),c')},(rAB​)(a,b),(a′,b′)​=c∑​r((a,b),c),((a′,b′),c)​,(rBC​)(b,c),(b′,c′)​=a∑​r((a,b),c),((a,b′),c′)​,

and rB=Tr⁡CrBCr_B=\operatorname{Tr}_C r_{BC}rB​=TrC​rBC​; the second inequality regards rrr as a matrix on A×(B×C)A\times(B\times C)A×(B×C) by reindexing. Every density matrix rrr on A×BA\times BA×B and every complex-linear, completely positive map E:B→DE:B\to DE:B→D that preserves the complex trace of every matrix satisfy

H(A∣B)r≤H(A∣D)(idA⊗E)(r).H(A\mid B)_r\le H(A\mid D)_{(\mathrm{id}_A\otimes E)(r)}.H(A∣B)r​≤H(A∣D)(idA​⊗E)(r)​.

The tensor action applies EEE separately to each block indexed by a pair of AAA-indices, and complete positivity requires positivity of all finite amplifications, including the zero-dimensional one. Finally, every density matrix rrr on A×BA\times BA×B satisfies

∣S(rA)−S(rB)∣≤S(r),S(r)≤S(rA)+S(rB),|S(r_A)-S(r_B)|\le S(r),\qquad S(r)\le S(r_A)+S(r_B),∣S(rA​)−S(rB​)∣≤S(r),S(r)≤S(rA​)+S(rB​),

and, as equalities and inequalities in the extended real numbers,

H(A∣B)r=−D(r∥1A⊗rB),H(A\mid B)_r=-D(r\|1_A\otimes r_B),H(A∣B)r​=−D(r∥1A​⊗rB​), ∃s⪰0, tr⁡s=1:H(A∣B)r=−D(r∥1A⊗s),∀s⪰0, tr⁡s=1:−D(r∥1A⊗s)≤H(A∣B)r.\exists s\succeq0,\ \operatorname{tr}s=1: \quad H(A\mid B)_r=-D(r\|1_A\otimes s), \qquad \forall s\succeq0,\ \operatorname{tr}s=1: \quad -D(r\|1_A\otimes s)\le H(A\mid B)_r.∃s⪰0, trs=1:H(A∣B)r​=−D(r∥1A​⊗s),∀s⪰0, trs=1:−D(r∥1A​⊗s)≤H(A∣B)r​.

Here D(X∥Y)=+∞D(X\|Y)=+\inftyD(X∥Y)=+∞ unless ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX; when this inclusion holds,

D(X∥Y)=Re⁡tr⁡(X(L(X)−L(Y)))Re⁡tr⁡X,L(X)=(t↦log⁡2t)(X),D(X\|Y)= \frac{\operatorname{Re}\operatorname{tr}\bigl(X(L(X)-L(Y))\bigr)} {\operatorname{Re}\operatorname{tr}X}, \qquad L(X)=(t\mapsto\log_2 t)(X),D(X∥Y)=RetrXRetr(X(L(X)−L(Y)))​,L(X)=(t↦log2​t)(X),

with the real quotient embedded into the extended reals.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me