Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VI, unnumbered scalar profile estimates and endpoint divergence

Proved
QAlgorithms.Papers.Independent.Gap48.P40.binaryProfileBounds

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

prove2quantum

For 0≤x<10\le x<10≤x<1, define s(x)=inf⁡0<r<1−xD(diag⁡(r+x,1−r−x)∥diag⁡(r,1−r))s(x)=\inf_{0<r<1-x}D(\operatorname{diag}(r+x,1-r-x)\|\operatorname{diag}(r,1-r))s(x)=inf0<r<1−x​D(diag(r+x,1−r−x)∥diag(r,1−r)), and set s(1)=+∞s(1)=+\inftys(1)=+∞. For every 0≤x<10\le x<10≤x<1,

2x2≤s(x)≤−log⁡(1−x),lim⁡x↑1s(x)=+∞.2x^2\le s(x)\le-\log(1-x),\qquad\lim_{x\uparrow1}s(x)=+\infty.2x2≤s(x)≤−log(1−x),x↑1lim​s(x)=+∞.

Moreover s(1)=+∞s(1)=+\inftys(1)=+∞, and if Cx2≤s(x)Cx^2\le s(x)Cx2≤s(x) for every 0<x<10<x<10<x<1, then C≤2C\le2C≤2.

The lower coefficient 2 is optimal among global quadratic bounds; the upper estimate gives the stated endpoint comparison.

The boundary value of the binary objective is retained explicitly: for each 0≤x<10≤x<10≤x<1, as rrr increases to 1−x1-x1−x through 0<r<1−x0<r<1-x0<r<1−x, its relative entropy tends to −log⁡(1−x)-\log(1-x)−log(1−x).

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.7: profile estimates, sharp quadratic coefficient, and endpoint divergence. -/
theorem binaryProfileBounds :
    (∀ x : ℝ, 0 ≤ x → x < 1 →
      ((2 * x ^ 2 : ℝ) : EReal) ≤ binaryProfile x ∧
        binaryProfile x ≤ ((-Real.log (1 - x) : ℝ) : EReal) ∧
        Tendsto (fun r : ℝ => relativeEntropy (Matrix.diagonal ![((r + x : ℝ) : ℂ), ((1 - r - x : ℝ) : ℂ)])
      (Matrix.diagonal ![(r : ℂ), ((1 - r : ℝ) : ℂ)]))
          (nhdsWithin (1 - x) (Set.Ioo 0 (1 - x)))
          (nhds ((-Real.log (1 - x) : ℝ) : EReal))) ∧
    Tendsto binaryProfile (nhdsWithin 1 (Set.Iio 1)) (nhds ⊤) ∧
    binaryProfile 1 = ⊤ ∧
    (∀ C : ℝ, (∀ x : ℝ, 0 < x → x < 1 →
      ((C * x ^ 2 : ℝ) : EReal) ≤ binaryProfile x) → C ≤ 2) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P40

end
Source
Continuity bounds on the quantum relative entropy, arXiv:quant-ph/0503218v3, PDF p. 7, §VI, unnumbered scalar profile estimates and endpoint divergence
Read-back

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

For 0≤x<10\le x<10≤x<1, define the extended-real quantity

H(x)=inf⁡0<r<1−xD ⁣(diag⁡(r+x,1−r−x) ∥ diag⁡(r,1−r)),H(x)=\inf_{0<r<1-x} D\!\left(\operatorname{diag}(r+x,1-r-x)\,\middle\|\,\operatorname{diag}(r,1-r)\right),H(x)=0<r<1−xinf​D(diag(r+x,1−r−x)∥diag(r,1−r)),

where, for such rrr,

D=(r+x)log⁡r+xr+(1−r−x)log⁡1−r−x1−r,D= (r+x)\log\frac{r+x}{r} +(1-r-x)\log\frac{1-r-x}{1-r},D=(r+x)logrr+x​+(1−r−x)log1−r1−r−x​,

and log⁡\loglog is natural. Then every real xxx with 0≤x<10\le x<10≤x<1 satisfies

2x2≤H(x)≤−log⁡(1−x),2x^2\le H(x)\le-\log(1-x),2x2≤H(x)≤−log(1−x),

with real quantities embedded into the extended reals, and the displayed relative entropy converges to −log⁡(1−x)-\log(1-x)−log(1−x) as rrr approaches 1−x1-x1−x from within 0<r<1−x0<r<1-x0<r<1−x. In addition, H(x)→+∞H(x)\to+\inftyH(x)→+∞ as x→1x\to1x→1 from below, and H(1)=+∞H(1)=+\inftyH(1)=+∞, since its defining interval 0<r<00<r<00<r<0 is empty. Finally, every real constant CCC for which Cx2≤H(x)Cx^2\le H(x)Cx2≤H(x) holds for every 0<x<10<x<10<x<1 must satisfy C≤2C\le2C≤2. The first bounds and the limit in rrr include x=0x=0x=0.

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