Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VII.B, Lemma 11: adding the same positive operator decreases relative entropy

Proved
QAlgorithms.Papers.Independent.Gap48.P40.addPositiveDecreasesEntropy

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let A,B,CA,B,CA,B,C be arbitrary positive semidefinite complex matrices on the same positive finite-dimensional space. They need not be normalized. With signed support-aware Umegaki relative entropy,

D(A+C∥B+C)≤D(A∥B).D(A+C\|B+C)\le D(A\|B).D(A+C∥B+C)≤D(A∥B).

Adding the same positive operator to both arguments decreases this unnormalized relative entropy.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P40
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder Topology Matrix.Norms.L2Operator

open Filter MeasureTheory Asymptotics

open QAlgorithms

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P50 (IsUINorm)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P60 (copies)

open QAlgorithms.Papers.Independent.Information100.P44 (Mat)

namespace QAlgorithms.Papers.Independent.Gap48.P40

/-- PDF p.10, Lemma 11: unnormalized PSD arguments and signed extended entropy. -/
theorem addPositiveDecreasesEntropy {d : ℕ} (hd : 0 < d) (A B C : Mat d)
    (hA : A.PosSemidef) (hB : B.PosSemidef) (hC : C.PosSemidef) :
    relativeEntropy (A + C) (B + C) ≤ relativeEntropy A B := by sorry

end QAlgorithms.Papers.Independent.Gap48.P40

end
Source
Continuity bounds on the quantum relative entropy, arXiv:quant-ph/0503218v3, PDF p. 10, §VII.B, Lemma 11: adding the same positive operator decreases relative entropy
Read-back

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

For every positive natural number ddd and every three positive semidefinite complex d×dd\times dd×d matrices A,B,CA,B,CA,B,C,

D(A+C∥B+C)≤D(A∥B)D(A+C\|B+C)\le D(A\|B)D(A+C∥B+C)≤D(A∥B)

in the extended real numbers, where

D(R∥S)={Re⁡tr⁡ ⁣(f(R)−Rlog⁡S),ker⁡S⊆ker⁡R,+∞,otherwise,f(x)=xlog⁡x.D(R\|S)= \begin{cases} \operatorname{Re}\operatorname{tr}\!\bigl(f(R)-R\log S\bigr),&\ker S\subseteq\ker R,\\ +\infty,&\text{otherwise}, \end{cases} \qquad f(x)=x\log x.D(R∥S)={Retr(f(R)−RlogS),+∞,​kerS⊆kerR,otherwise,​f(x)=xlogx.

The matrix functions use functional calculus with natural logarithms and log⁡0=f(0)=0\log0=f(0)=0log0=f(0)=0. No trace-one or nonzero condition is imposed on A,B,CA,B,CA,B,C; zero matrices and singular matrices are included, and the expression has no additional trace correction terms.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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