Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

remark5

Open
QAlgorithms.Papers.Independent.Support50.P15.remark5

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

prove2quantum

For each finite d≥2d\ge2d≥2, the sharp entropy-difference bound M(Δ,d)M(\Delta,d)M(Δ,d) is strictly decreasing on [−log⁡d,0][-\log d,0][−logd,0] and strictly increasing on [0,log⁡d][0,\log d][0,logd]. More precisely, for 0<λ<10<\lambda<10<λ<1 and nonzero Δ∈[−log⁡d,log⁡d]\Delta\in[-\log d,\log d]Δ∈[−logd,logd],

M(λΔ,d)<λM(Δ,d).M(\lambda\Delta,d)<\lambda M(\Delta,d).M(λΔ,d)<λM(Δ,d).

The comparison is in the extended real order and includes M(log⁡d,d)=+∞M(\log d,d)=+\inftyM(logd,d)=+∞. This describes both monotonicity branches and a strict scaling inequality.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P15
Formal statement
noncomputable section

attribute [local instance] Classical.propDecidable

open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

namespace QAlgorithms.Papers.Independent.Support50.P15

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

/-- Remark 5, PDF pp.5--6, including strict scaling at the infinite endpoint. -/
theorem remark5 (d : ℕ) (hd : 2 ≤ d) :
    StrictAntiOn (tightBound d) (Set.Icc (-Real.log d) 0) ∧
    StrictMonoOn (tightBound d) (Set.Icc 0 (Real.log d)) ∧
    (∀ delta ∈ Set.Icc (-Real.log d) (Real.log d), delta ≠ 0 →
      ∀ t ∈ Set.Ioo (0 : ℝ) 1, tightBound d (t * delta) < (t : EReal) * tightBound d delta) := by sorry

end QAlgorithms.Papers.Independent.Support50.P15

end
Source
Tight bound on relative entropy by entropy difference, arXiv:1304.0036v3, PDF p. 5, remark5
Read-back

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

For every natural number d≥2d\ge2d≥2, let h(s)=−slog⁡s−(1−s)log⁡(1−s)h(s)=-s\log s-(1-s)\log(1-s)h(s)=−slogs−(1−s)log(1−s), with 0log⁡0=00\log0=00log0=0, and Hd(s)=h(s)+slog⁡(d−1)H_d(s)=h(s)+s\log(d-1)Hd​(s)=h(s)+slog(d−1). Set K(p,q)=0K(p,q)=0K(p,q)=0 when p=0p=0p=0, K(p,q)=+∞K(p,q)=+\inftyK(p,q)=+∞ when p≠0,q=0p\ne0,q=0p=0,q=0, and K(p,q)=plog⁡(p/q)K(p,q)=p\log(p/q)K(p,q)=plog(p/q) otherwise, and define the extended-real function

Td(δ)=inf⁡{K(s,r)+K(1−s,1−r):s,r∈[0,d−1d], Hd(s)−Hd(r)=δ}.T_d(\delta)=\inf\left\{ K(s,r)+K(1-s,1-r): s,r\in\left[0,\frac{d-1}{d}\right],\ H_d(s)-H_d(r)=\delta \right\}.Td​(δ)=inf{K(s,r)+K(1−s,1−r):s,r∈[0,dd−1​], Hd​(s)−Hd​(r)=δ}.

The infimum of an empty feasible set is +∞+\infty+∞. This function is strictly decreasing on [−log⁡d,0][-\log d,0][−logd,0] and strictly increasing on [0,log⁡d][0,\log d][0,logd]. Furthermore, for every nonzero δ∈[−log⁡d,log⁡d]\delta\in[-\log d,\log d]δ∈[−logd,logd] and every real t∈(0,1)t\in(0,1)t∈(0,1),

Td(tδ)<t Td(δ),T_d(t\delta)<t\,T_d(\delta),Td​(tδ)<tTd​(δ),

where the multiplication and comparison take place in the extended reals.

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