Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Relative entropy bound using both smallest eigenvalues

Open
QAlgorithms.Papers.Independent.Support50.P17.relativeEntropyUpperBound

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

prove2quantum

Let ρ,σ\rho,\sigmaρ,σ be density matrices on the same nonzero finite-dimensional complex Hilbert space. Put α=λmin⁡(ρ)\alpha=\lambda_{\min}(\rho)α=λmin​(ρ), β=λmin⁡(σ)\beta=\lambda_{\min}(\sigma)β=λmin​(σ) and T=12∥ρ−σ∥1T=\tfrac12\|\rho-\sigma\|_1T=21​∥ρ−σ∥1​. Always,

T≥∣α−β∣.T\ge|\alpha-\beta|.T≥∣α−β∣.

If β>0\beta>0β>0, then, with q(0,T)=0q(0,T)=0q(0,T)=0 and q(α,T)=−αlog⁡(1+T/α)q(\alpha,T)=-\alpha\log(1+T/\alpha)q(α,T)=−αlog(1+T/α) for α>0\alpha>0α>0,

S(ρ∥σ)≤(β+T)log⁡(1+T/β)+q(α,T).S(\rho\|\sigma)\le(\beta+T)\log(1+T/\beta)+q(\alpha,T).S(ρ∥σ)≤(β+T)log(1+T/β)+q(α,T).

Thus the positive-α\alphaα formula (17) and the singular-ρ\rhoρ extension (18) are both retained. The separation statement includes singular σ\sigmaσ; no finite entropy bound is asserted when β=0\beta=0β=0.

This is the main continuity bound advertised in the abstract. The separate dimensional-necessity remark is not included.

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.8, Theorem 1, (17)–(18): both minimum eigenvalues are computed from
the densities. Separation also holds for singular sigma. The finite entropy bound
retains beta>0 and includes singular rho through the zero-alpha correction. -/
theorem relativeEntropyUpperBound {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
    (rho sigma : Matrix I I ℂ) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
    let alpha := minEigenvalue rho
    let beta := minEigenvalue sigma
    let T := traceDistance rho sigma
    |alpha - beta| ≤ T ∧
      (0 < beta → relativeEntropy rho sigma ≤
        (((beta + T) * Real.log (1 + T / beta) +
          zeroExtendedLogCorrection alpha T : ℝ) : EReal)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P17

end
Source
Continuity bounds on the quantum relative entropy - II, arXiv:1105.2656v3, PDF p. 8, Theorem 1: upper bound with both minimum eigenvalues (17)–(18)
Read-back

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

For every nonempty finite 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, let α\alphaα and β\betaβ be their respective smallest eigenvalues, counted with multiplicity, and set T=12Re⁡tr⁡(ρ−σ)†(ρ−σ)T=\tfrac12\operatorname{Re}\operatorname{tr}\sqrt{(\rho-\sigma)^\dagger(\rho-\sigma)}T=21​Retr(ρ−σ)†(ρ−σ)​, using continuous functional calculus for the square root. Define the extended-real quantity D(ρ∥σ)D(\rho\Vert\sigma)D(ρ∥σ) to equal Re⁡tr⁡[ρlog⁡ρ−ρlog⁡σ]\operatorname{Re}\operatorname{tr}[\rho\log\rho-\rho\log\sigma]Retr[ρlogρ−ρlogσ] when ker⁡σ⊆ker⁡ρ\ker\sigma\subseteq\ker\rhokerσ⊆kerρ, and +∞+\infty+∞ otherwise; the matrix functions use continuous functional calculus with the scalar convention log⁡0=0\log0=0log0=0. Then ∣α−β∣≤T|\alpha-\beta|\le T∣α−β∣≤T, and, if β>0\beta>0β>0, D(ρ∥σ)≤(β+T)log⁡(1+T/β)+C(α,T)D(\rho\Vert\sigma)\le(\beta+T)\log(1+T/\beta)+C(\alpha,T)D(ρ∥σ)≤(β+T)log(1+T/β)+C(α,T), with the real right-hand side embedded into the extended reals, where C(α,T)=0C(\alpha,T)=0C(α,T)=0 if α=0\alpha=0α=0 and C(α,T)=−αlog⁡(1+T/α)C(\alpha,T)=-\alpha\log(1+T/\alpha)C(α,T)=−αlog(1+T/α) otherwise. All logarithms are natural. Singular ρ\rhoρ, coincident matrices, and one-dimensional matrices are included; when β=0\beta=0β=0, only the eigenvalue-difference inequality is asserted.

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