Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§II, unnumbered logarithmic upper bound (5)

Proved
QAlgorithms.Papers.Independent.Gap48.P40.simpleUpperBound

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

prove2quantum

All matrices act on a complex Hilbert space of positive finite dimension ddd. A state is positive semidefinite with trace one. All logarithms are natural, and D(ρ∥σ)D(\rho\|\sigma)D(ρ∥σ) denotes support-aware Umegaki relative entropy, with value +∞+\infty+∞ when support containment fails. For states ρ,σ\rho,\sigmaρ,σ with β=λmin⁡(σ)>0\beta=\lambda_{\min}(\sigma)>0β=λmin​(σ)>0, let H(ρ)=−Tr⁡(ρlog⁡ρ)H(\rho)=-\operatorname{Tr}(\rho\log\rho)H(ρ)=−Tr(ρlogρ). Then

D(ρ∥σ)≤−H(ρ)−log⁡β≤−log⁡β.D(\rho\|\sigma)\le-H(\rho)-\log\beta\le-\log\beta.D(ρ∥σ)≤−H(ρ)−logβ≤−logβ.

Both preliminary upper inequalities are retained.

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.2, Eq.(5): both preliminary logarithmic upper inequalities. -/
theorem simpleUpperBound {d : ℕ} (hd : 0 < d) (rho sigma : Mat d)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (hbeta : 0 < minEigenvalue sigma) :
    relativeEntropy rho sigma ≤ ((-entropy rho - Real.log (minEigenvalue sigma) : ℝ) : EReal) ∧
    -entropy rho - Real.log (minEigenvalue sigma) ≤ -Real.log (minEigenvalue sigma) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P40

end
Source
Continuity bounds on the quantum relative entropy, arXiv:quant-ph/0503218v3, PDF p. 2, §II, unnumbered logarithmic upper bound (5)
Read-back

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

For every natural number d>0d>0d>0 and positive-semidefinite complex d×dd\times dd×d matrices ρ,σ\rho,\sigmaρ,σ with trace one and λmin⁡(σ)>0\lambda_{\min}(\sigma)>0λmin​(σ)>0, define

H(ρ)=−Re⁡tr⁡(cfc⁡(t↦tlog⁡t)(ρ))H(\rho)=-\operatorname{Re}\operatorname{tr} \bigl(\operatorname{cfc}(t\mapsto t\log t)(\rho)\bigr)H(ρ)=−Retr(cfc(t↦tlogt)(ρ))

and define S(ρ∣σ)S(\rho\mid\sigma)S(ρ∣σ) to be the extended-real value Re⁡tr⁡(cfc⁡(t↦tlog⁡t)(ρ)−ρ cfc⁡(log⁡)(σ))\operatorname{Re}\operatorname{tr}(\operatorname{cfc}(t\mapsto t\log t)(\rho)-\rho\,\operatorname{cfc}(\log)(\sigma))Retr(cfc(t↦tlogt)(ρ)−ρcfc(log)(σ)) when ker⁡σ⊆ker⁡ρ\ker\sigma\subseteq\ker\rhokerσ⊆kerρ, and +∞+\infty+∞ otherwise. Then both

S(ρ∣σ)≤−H(ρ)−log⁡λmin⁡(σ)and−H(ρ)−log⁡λmin⁡(σ)≤−log⁡λmin⁡(σ)S(\rho\mid\sigma) \le -H(\rho)-\log\lambda_{\min}(\sigma) \quad\text{and}\quad -H(\rho)-\log\lambda_{\min}(\sigma) \le-\log\lambda_{\min}(\sigma)S(ρ∣σ)≤−H(ρ)−logλmin​(σ)and−H(ρ)−logλmin​(σ)≤−logλmin​(σ)

hold, with the first right-hand side embedded in the extended reals. Here functional calculus uses natural logarithms, whose total real definition assigns log⁡0=0\log0=0log0=0. Singular ρ\rhoρ is allowed; the strictly positive smallest eigenvalue of σ\sigmaσ ensures the kernel inclusion.

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