Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Relative entropy decreases when a positive trace-nonincreasing map preserves the first input trace

Open
QAlgorithms.Papers.Independent.Intakethird100.P46.relative_entropy_monotonicity_trace_nonincreasing

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

prove2quantum

Let H,H′H,H'H,H′ be complex separable Hilbert spaces, and let Φ:T(H)→T(H′)\Phi:\mathcal T(H)\to\mathcal T(H')Φ:T(H)→T(H′) be complex-linear, positive, and trace-nonincreasing on every positive trace-class input. Let ρ,σ≥0\rho,\sigma\ge0ρ,σ≥0 be trace-class operators satisfying only the additional local equality tr⁡Φ(ρ)=tr⁡ρ\operatorname{tr}\Phi(\rho)=\operatorname{tr}\rhotrΦ(ρ)=trρ. Then

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

The divergence DDD is the unnormalized natural-log Umegaki relative entropy, with extended values and D(0∥σ)=0D(0\Vert\sigma)=0D(0∥σ)=0. No trace condition is imposed on σ\sigmaσ, no global trace preservation is required, and no support or entropy-finiteness assumption is made. This identifies the input-dependent trace condition that suffices beyond trace-preserving maps.

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.3, Theorem 1', (6).
Global trace nonincrease is supplemented by trace preservation only at rho.
Neither global trace preservation nor preservation at sigma is assumed. -/
theorem relative_entropy_monotonicity_trace_nonincreasing
    {I J : Type*} [Countable I] [Countable J]
    (b : HilbertBasis I ℂ H) (c : HilbertBasis J ℂ K)
    (Phi : (H →L[ℂ] H) → (K →L[ℂ] K))
    (hPhi : PositiveTraceNonincreasingBetween b c Phi)
    (rho sigma : TraceClass H) (hrho : IsPositive rho.val) (hsigma : IsPositive sigma.val)
    (hTrace : operatorTrace c (Phi rho.val) = operatorTrace b rho.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. 3, Theorem 1′: relative-entropy monotonicity for trace-nonincreasing maps preserving tr(ρ)
Read-back

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

Let HHH and KKK be complete complex inner product spaces, let I,JI,JI,J be countable index types, and let 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​ be Hilbert bases of HHH and KKK, respectively. Here a bounded complex linear operator TTT is called trace class if there exist sequences ur,vru_r,v_rur​,vr​ such that ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ converges and Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ for every xxx; write Tr⁡b(T)=∑i⟨bi,Tbi⟩\operatorname{Tr}_b(T)=\sum_i\langle b_i,Tb_i\rangleTrb​(T)=∑i​⟨bi​,Tbi​⟩, and call TTT positive when T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for every xxx. Let Φ\PhiΦ map bounded complex linear operators on HHH to such operators on KKK. Assume that Φ\PhiΦ maps trace-class operators to trace-class operators, is additive and complex homogeneous on trace-class operators, and, for every positive trace-class TTT, satisfies Φ(T)≥0\Phi(T)\ge0Φ(T)≥0 and Re⁡Tr⁡c(Φ(T))≤Re⁡Tr⁡b(T)\operatorname{Re}\operatorname{Tr}_c(\Phi(T))\le\operatorname{Re}\operatorname{Tr}_b(T)ReTrc​(Φ(T))≤ReTrb​(T). Let ρ,σ\rho,\sigmaρ,σ be positive trace-class operators, and assume the complex trace equality Tr⁡c(Φ(ρ))=Tr⁡b(ρ)\operatorname{Tr}_c(\Phi(\rho))=\operatorname{Tr}_b(\rho)Trc​(Φ(ρ))=Trb​(ρ). To specify the asserted quantity, for positive semidefinite finite matrices X,YX,YX,Y, put

F(X,Y)={max⁡ ⁣{0,Re⁡tr⁡ ⁣(f(X)−Xlog⁡Y−X+Y)},ker⁡Y⊆ker⁡X,+∞,otherwise,f(t)=tlog⁡t,F(X,Y)= \begin{cases} \max\!\left\{0,\operatorname{Re}\operatorname{tr}\!\left(f(X)-X\log Y-X+Y\right)\right\}, &\ker Y\subseteq\ker X,\\ +\infty,&\text{otherwise}, \end{cases} \qquad f(t)=t\log t,F(X,Y)={max{0,Retr(f(X)−XlogY−X+Y)},+∞,​kerY⊆kerX,otherwise,​f(t)=tlogt,

where the matrix functions use continuous functional calculus and the logarithm is natural, with its total real convention log⁡0=0\log0=0log0=0. For trace-class R,SR,SR,S on either space, define

R(R,S)=sup⁡n∈Nv0,…,vn−1 orthonormalF ⁣([⟨vi,Rvj⟩]i,j,[⟨vi,Svj⟩]i,j),Lb(R,S)=R(R,S)−(Re⁡Tr⁡b(S)−Re⁡Tr⁡b(R)).\mathcal R(R,S)= \sup_{\substack{n\in\mathbb N\\v_0,\ldots,v_{n-1}\text{ orthonormal}}} F\!\left( [\langle v_i,Rv_j\rangle]_{i,j}, [\langle v_i,Sv_j\rangle]_{i,j} \right), \qquad L_b(R,S)=\mathcal R(R,S) -\left(\operatorname{Re}\operatorname{Tr}_b(S)-\operatorname{Re}\operatorname{Tr}_b(R)\right).R(R,S)=n∈Nv0​,…,vn−1​ orthonormal​sup​F([⟨vi​,Rvj​⟩]i,j​,[⟨vi​,Svj​⟩]i,j​),Lb​(R,S)=R(R,S)−(ReTrb​(S)−ReTrb​(R)).

The supremum defining R\mathcal RR is taken in [0,+∞][0,+\infty][0,+∞], and LbL_bLb​ is valued in the extended real numbers. Then

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

Neither input is required to have trace one or to be nonzero; zero-dimensional spaces and the empty orthonormal family n=0n=0n=0 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