Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Relative entropy decreases under positive trace-preserving maps

Open
QAlgorithms.Papers.Independent.Intakethird100.P46.relative_entropy_monotonicity

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let HHH and H′H'H′ be complex separable Hilbert spaces, let T(H)\mathcal T(H)T(H) denote all trace-class operators, and let Φ:T(H)→T(H′)\Phi:\mathcal T(H)\to\mathcal T(H')Φ:T(H)→T(H′) be complex-linear, positive, and trace-preserving on every positive trace-class input. For arbitrary positive trace-class operators ρ,σ\rho,\sigmaρ,σ, with no trace normalization, support, or finite-entropy assumption,

D(Φ(ρ)∥Φ(σ))≤D(ρ∥σ).D(\Phi(\rho)\Vert\Phi(\sigma))\le D(\rho\Vert\sigma).D(Φ(ρ)∥Φ(σ))≤D(ρ∥σ).

Here DDD is the literal unnormalized Umegaki relative entropy tr⁡[ρ(log⁡ρ−log⁡σ)]\operatorname{tr}[\rho(\log\rho-\log\sigma)]tr[ρ(logρ−logσ)] in natural units, interpreted as +∞+\infty+∞ on support failure or a divergent logarithmic expectation, and D(0∥σ)=0D(0\Vert\sigma)=0D(0∥σ)=0. This gives data processing under positivity alone.

Formalization Note Arbitrary countable Hilbert bases represent the two separable spaces. The accepted corrected extended divergence is embedded in the extended reals and only the finite correction tr⁡σ−tr⁡ρ\operatorname{tr}\sigma-\operatorname{tr}\rhotrσ−trρ is subtracted.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P46
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

namespace QAlgorithms.Papers.Independent.Intakethird100.P46

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms

open QAlgorithms.Papers.Independent.Dependency50.P13
  (IsTraceClass TraceClass IsPositive operatorTrace)

open QAlgorithms.Papers.Independent.Dependency50.P35 (Dominates)

open QAlgorithms.Papers.Independent.Bridge50.P49 (beigiSandwichedDivergence)

variable {H K : Type*}
  [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
  [NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]

/-- Müller-Hermes–Reeb, arXiv:1512.06117v3, PDF p.2, Theorem 1, (3).
Countable arbitrary Hilbert bases represent exactly the separable Hilbert-space
setting; no eigenbasis, normalization, support, or finite-entropy premise is used. -/
theorem relative_entropy_monotonicity {I J : Type*} [Countable I] [Countable J]
    (b : HilbertBasis I ℂ H) (c : HilbertBasis J ℂ K)
    (Phi : (H →L[ℂ] H) → (K →L[ℂ] K))
    (hPhi : PositiveTracePreservingBetween b c Phi)
    (rho sigma : TraceClass H) (hrho : IsPositive rho.val) (hsigma : IsPositive sigma.val) :
    literalTraceClassRelativeEntropy c
        (traceClassImage Phi hPhi.1 rho) (traceClassImage Phi hPhi.1 sigma) ≤
      literalTraceClassRelativeEntropy b rho sigma := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P46

end
Source
Monotonicity of the Quantum Relative Entropy Under Positive Maps, arXiv:1512.06117v3, PDF p. 2, Theorem 1: monotonicity of quantum relative entropy under positive trace-preserving maps
Read-back

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

For complex Hilbert spaces H,KH,KH,K, countable index types I,JI,JI,J, Hilbert bases b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ and c=(cj)j∈Jc=(c_j)_{j\in J}c=(cj​)j∈J​, and a function Φ\PhiΦ between bounded complex-linear operators, suppose Φ\PhiΦ preserves trace-class operators, is additive and complex homogeneous on them, and maps every positive trace-class operator to a positive operator with the same complex basis trace. Then, for every pair of positive trace-class operators ρ,σ\rho,\sigmaρ,σ on HHH,

Lc(Φ(ρ),Φ(σ))≤Lb(ρ,σ).L_c\bigl(\Phi(\rho),\Phi(\sigma)\bigr)\le L_b(\rho,\sigma).Lc​(Φ(ρ),Φ(σ))≤Lb​(ρ,σ).

Here trace class means admitting Tx=∑r∈N⟨vr,x⟩urTx=\sum_{r\in\mathbb N}\langle v_r,x\rangle u_rTx=∑r∈N​⟨vr​,x⟩ur​ with ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ summable; positivity means T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for every xxx; the basis trace is Tr⁡bT=∑i⟨bi,Tbi⟩\operatorname{Tr}_bT=\sum_i\langle b_i,Tb_i\rangleTrb​T=∑i​⟨bi​,Tbi​⟩; and Lb(X,Y)=R(X,Y)−(Re⁡Tr⁡bY−Re⁡Tr⁡bX)L_b(X,Y)=R(X,Y)-(\operatorname{Re}\operatorname{Tr}_bY-\operatorname{Re}\operatorname{Tr}_bX)Lb​(X,Y)=R(X,Y)−(ReTrb​Y−ReTrb​X). The value R(X,Y)R(X,Y)R(X,Y) is the supremum in [0,∞][0,\infty][0,∞] over all finite orthonormal families, including the empty family, of the compressed-matrix quantity: for compressions Aij=⟨vi,Xvj⟩A_{ij}=\langle v_i,Xv_j\rangleAij​=⟨vi​,Xvj​⟩, Bij=⟨vi,Yvj⟩B_{ij}=\langle v_i,Yv_j\rangleBij​=⟨vi​,Yvj​⟩, take +∞+\infty+∞ when ker⁡B⊈ker⁡A\ker B\nsubseteq\ker AkerB⊈kerA, and otherwise take max⁡{0,Re⁡Tr⁡(f(A)−Alog⁡B−A+B)}\max\{0,\operatorname{Re}\operatorname{Tr}(f(A)-A\log B-A+B)\}max{0,ReTr(f(A)−AlogB−A+B)}, where f(x)=xlog⁡xf(x)=x\log xf(x)=xlogx and matrix functions use continuous functional calculus. The outputs in the inequality carry the trace-class membership supplied by Φ\PhiΦ. Neither input must have trace one or be nonzero, and infinite entropy values are included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me