Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

remark9

Proved
QAlgorithms.Papers.Independent.Support50.P15.remark9

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

prove2quantum

For every integer d≥2d\ge2d≥2, put Nd=14log⁡2(d−1)+1N_d=\tfrac14\log^2(d-1)+1Nd​=41​log2(d−1)+1 and let N(d)N(d)N(d) be Eq. (7). Then

Nd−1<N(d)<Nd.N_d-1<N(d)<N_d.Nd​−1<N(d)<Nd​.

Its optimizing parameter rdr_drd​ is the unique root in (0,1/2)(0,1/2)(0,1/2) of (1−2r)log⁡(((1−r)/r)(d−1))=2(1-2r)\log(((1-r)/r)(d-1))=2(1−2r)log(((1−r)/r)(d−1))=2. There are C>0C>0C>0 and an integer d0≥3d_0\ge3d0​≥3 such that, for all d≥d0d\ge d_0d≥d0​,

0≤Nd−N(d)≤Clog⁡2d,∣rd−(12−1log⁡(d−1))∣≤Clog⁡2d.0\le N_d-N(d)\le\frac C{\log^2d},\qquad\left|r_d-\left(\frac12-\frac1{\log(d-1)}\right)\right|\le\frac C{\log^2d}.0≤Nd​−N(d)≤log2dC​,​rd​−(21​−log(d−1)1​)​≤log2dC​.

The root is strictly interior, so the real logarithm and divisions do not create endpoint roots. These formulas provide a scalar method to evaluate the optimal variance bound.

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 9, PDF p.8, root characterization on p.25 and bounds on pp.23--24.
Asymptotic constants and thresholds precede dimension. -/
theorem remark9 :
    (∀ d : ℕ, 2 ≤ d → easyVariance d - 1 < maxVariance d ∧ maxVariance d < easyVariance d ∧
      (∃! r : ℝ, r ∈ Set.Ioo 0 (1 / 2) ∧
        (1 - 2 * r) * Real.log ((1 - r) / r * ((d : ℝ) - 1)) = 2) ∧
      (1 - 2 * optimalMass d) * Real.log ((1 - optimalMass d) / optimalMass d * ((d : ℝ) - 1)) = 2) ∧
    (∃ c > 0, ∃ d0 : ℕ, 3 ≤ d0 ∧ ∀ d ≥ d0,
      0 ≤ easyVariance d - maxVariance d ∧
      easyVariance d - maxVariance d ≤ c / (Real.log d) ^ 2 ∧
      |optimalMass d - (1 / 2 - 1 / Real.log ((d : ℝ) - 1))| ≤ c / (Real.log d) ^ 2) := by sorry

end QAlgorithms.Papers.Independent.Support50.P15

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

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

For each natural ddd, define

vd(r)=r(1−r)[log⁡ ⁣(1−rr(d−1))]2,Vd=sup⁡0<r<1/2vd(r),Ed=[log⁡(d−1)]24+1,v_d(r)=r(1-r)\left[\log\!\left(\frac{1-r}{r}(d-1)\right)\right]^2,\qquad V_d=\sup_{0<r<1/2}v_d(r),\qquad E_d=\frac{[\log(d-1)]^2}{4}+1,vd​(r)=r(1−r)[log(r1−r​(d−1))]2,Vd​=0<r<1/2sup​vd​(r),Ed​=4[log(d−1)]2​+1,

and let rdr_drd​ be the classically chosen real from the condition 0<rd<1/20<r_d<1/20<rd​<1/2 and vd(rd)=Vdv_d(r_d)=V_dvd​(rd​)=Vd​, with an unspecified choice if no such real exists. For every natural d≥2d\ge2d≥2, Ed−1<Vd<EdE_d-1<V_d<E_dEd​−1<Vd​<Ed​, there exists exactly one r∈(0,1/2)r\in(0,1/2)r∈(0,1/2) satisfying

(1−2r)log⁡ ⁣(1−rr(d−1))=2,(1-2r)\log\!\left(\frac{1-r}{r}(d-1)\right)=2,(1−2r)log(r1−r​(d−1))=2,

and the chosen rdr_drd​ satisfies this equation. Furthermore, there exist a real c>0c>0c>0 and a natural d0≥3d_0\ge3d0​≥3 such that for every natural d≥d0d\ge d_0d≥d0​,

0≤Ed−Vd≤c(log⁡d)2,∣rd−(12−1log⁡(d−1))∣≤c(log⁡d)2.0\le E_d-V_d\le\frac{c}{(\log d)^2}, \qquad \left|r_d-\left(\frac12-\frac1{\log(d-1)}\right)\right| \le\frac{c}{(\log d)^2}.0≤Ed​−Vd​≤(logd)2c​,​rd​−(21​−log(d−1)1​)​≤(logd)2c​.

All logarithms are natural.

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