Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Maximum of the shifted relative entropy

Proved
QAlgorithms.Papers.Independent.Support50.P17.regularisedMaximum

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

prove2quantum

Let ρ\rhoρ and σ\sigmaσ be density matrices on the same nonzero finite-dimensional complex Hilbert space. Write III for the identity and S(A∥B)=Tr⁡A(log⁡A−log⁡B)S(A\|B)=\operatorname{Tr}A(\log A-\log B)S(A∥B)=TrA(logA−logB) for the unnormalised Umegaki relative entropy, with natural logarithms, zero spectral weights contributing zero, and value +∞+\infty+∞ on failure of support containment. Then

S(ρ+I∥σ+I)≤log⁡2.S(\rho+I\|\sigma+I)\le\log 2.S(ρ+I∥σ+I)≤log2.

Equality holds whenever both densities have rank one and ρσ=0\rho\sigma=0ρσ=0. Such orthogonal pure densities attaining equality exist in every dimension d≥2d\ge2d≥2. The inequality also holds in dimension one.

This identifies the global maximum before any normalization constant is applied; the shifted matrices are not divided by their trace.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P17
Formal statement
noncomputable section

open MeasureTheory

open scoped Matrix ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Support50.P17

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse the exact frozen support predicate and signed, unnormalised entropy.

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

/-- PDF p.2, Section I: the global log 2 maximum and equality for orthogonal pure
states. Such witnesses exist in every dimension d≥2; dimension one retains the bound. -/
theorem regularisedMaximum :
    (∀ {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
      (rho sigma : Matrix I I ℂ), IsDensityMatrix rho → IsDensityMatrix sigma →
      relativeEntropy (rho + 1) (sigma + 1) ≤ (Real.log 2 : EReal) ∧
        (rho.rank = 1 → sigma.rank = 1 → rho * sigma = 0 →
          relativeEntropy (rho + 1) (sigma + 1) = (Real.log 2 : EReal))) ∧
    (∀ d : ℕ, 2 ≤ d → ∃ rho sigma : Matrix (Fin d) (Fin d) ℂ,
      IsDensityMatrix rho ∧ IsDensityMatrix sigma ∧
      rho.rank = 1 ∧ sigma.rank = 1 ∧ rho * sigma = 0 ∧
      relativeEntropy (rho + 1) (sigma + 1) = (Real.log 2 : EReal)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P17

end
Source
Continuity bounds on the quantum relative entropy - II, arXiv:1105.2656v3, PDF p. 2, §I, unnumbered: maximum of the shifted relative entropy
Read-back

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

For every finite, nonempty index type III with decidable equality and every pair of complex matrices ρ,σ\rho,\sigmaρ,σ indexed by III that are positive semidefinite and have trace 111, the extended real relative entropy satisfies D(ρ+1∥σ+1)≤log⁡2D(\rho+\mathbf1\|\sigma+\mathbf1)\le\log2D(ρ+1∥σ+1)≤log2; if additionally ρ\rhoρ and σ\sigmaσ both have rank 111 and ρσ=0\rho\sigma=0ρσ=0, equality holds. Moreover, for every natural number d≥2d\ge2d≥2, there exist such positive semidefinite, trace-one d×dd\times dd×d matrices of rank 111 with ρσ=0\rho\sigma=0ρσ=0 and equality. Here D(X∥Y)D(X\|Y)D(X∥Y) is Re⁡tr⁡((x↦xlog⁡x)(X)−X(log⁡)(Y))\operatorname{Re}\operatorname{tr}((x\mapsto x\log x)(X)-X(\log)(Y))Retr((x↦xlogx)(X)−X(log)(Y)) when ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise, with matrix functions defined by continuous functional calculus. The shifts here are positive definite. The first assertion includes one-dimensional spaces, where its additional rank-one orthogonality hypotheses cannot all hold.

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

    Confirmed by the moderator at approval.

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