Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.3 (5.44): pure-state von Neumann duality

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.vonNeumann_duality

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 every normalized pure ABC state, H(A|B)+H(A|C)=0, with actual reduced states.

H(A∣B)ρ+H(A∣C)ρ=0.H(A|B)_\rho+H(A|C)_\rho=0.H(A∣B)ρ​+H(A∣C)ρ​=0.

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.vnduality
§5.3 (5.44): pure-state von Neumann duality, arXiv:1504.00233v5, PDF p.81. -/
theorem vonNeumann_duality [Nonempty A] [Nonempty B] [Nonempty C] (r : paperMat ((A × B) × C))
    (hr : IsDensityMatrix r) (hp : paperPure r) : conditionalVN (traceRight r)+conditionalVN (paperTraceMiddle r) = 0 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 81, §5.3 (5.44): pure-state von Neumann duality
Read-back

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

Let A,B,CA,B,CA,B,C be finite nonempty index types with decidable equality, and let rrr be a complex matrix on (A×B)×C(A\times B)\times C(A×B)×C that is positive semidefinite, has trace one, and has rank exactly one. Define

(rAB)(u,b),(u′,b′)=∑cr((u,b),c),((u′,b′),c),(rAC)(u,c),(u′,c′)=∑br((u,b),c),((u′,b),c′).(r_{AB})_{(u,b),(u',b')}=\sum_c r_{((u,b),c),((u',b'),c)},\qquad (r_{AC})_{(u,c),(u',c')}=\sum_b r_{((u,b),c),((u',b),c')}.(rAB​)(u,b),(u′,b′)​=c∑​r((u,b),c),((u′,b′),c)​,(rAC​)(u,c),(u′,c′)​=b∑​r((u,b),c),((u′,b),c′)​.

For any matrix XXX, set S(X)=−Re⁡tr⁡[cfc⁡(x↦xlog⁡2x,X)]S(X)=-\operatorname{Re}\operatorname{tr}[\operatorname{cfc}(x\mapsto x\log_2x,X)]S(X)=−Retr[cfc(x↦xlog2​x,X)], using the total real logarithm, for which log⁡20=0\log_2 0=0log2​0=0. For XXX on E×FE\times FE×F, set H(X)=S(X)−S(XF)H(X)=S(X)-S(X_F)H(X)=S(X)−S(XF​), where (XF)v,w=∑uX(u,v),(u,w)(X_F)_{v,w}=\sum_uX_{(u,v),(u,w)}(XF​)v,w​=∑u​X(u,v),(u,w)​. Then

H(rAB)+H(rAC)=0,H(r_{AB})+H(r_{AC})=0,H(rAB​)+H(rAC​)=0,

that is, the entropy of rABr_{AB}rAB​ minus the entropy of its BBB marginal, plus the entropy of rACr_{AC}rAC​ minus the entropy of its CCC marginal, equals zero.

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