Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

lemma15

Proved
QAlgorithms.Papers.Independent.Support50.P15.lemma15

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

prove2quantum

For each integer d≥2d\ge2d≥2, let N(d)=max⁡0<r<1/2r(1−r)[log⁡(((1−r)/r)(d−1))]2N(d)=\max_{0<r<1/2}r(1-r)[\log(((1-r)/r)(d-1))]^2N(d)=max0<r<1/2​r(1−r)[log(((1−r)/r)(d−1))]2 and Nd=14log⁡2(d−1)+1N_d=\tfrac14\log^2(d-1)+1Nd​=41​log2(d−1)+1. Then

Nd−1=14log⁡2(d−1)<N(d)<Nd,N(d)<log⁡2d.N_d-1=\tfrac14\log^2(d-1)<N(d)<N_d,\qquad N(d)<\log^2d.Nd​−1=41​log2(d−1)<N(d)<Nd​,N(d)<log2d.

All inequalities are strict, including at d=2d=2d=2 where log⁡(d−1)=0\log(d-1)=0log(d−1)=0 but N(2)>0N(2)>0N(2)>0. These provide computable upper and lower estimates for the optimal variance and relative-entropy constants.

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)

/-- Lemma 15, Eqs. (85)--(86), PDF pp.23--24, with strict bounds also at d=2. -/
theorem lemma15 {d : ℕ} (hd : 2 ≤ d) :
    (Real.log ((d : ℝ) - 1)) ^ 2 / 4 < maxVariance d ∧
    maxVariance d < easyVariance d ∧ maxVariance d < (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. 23, lemma15
Read-back

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

For every natural number d≥2d\ge2d≥2, using natural logarithms, define

Vd=sup⁡0<r<1/2r(1−r)[log⁡ ⁣(1−rr(d−1))]2.V_d=\sup_{0<r<1/2}r(1-r)\left[\log\!\left(\frac{1-r}{r}(d-1)\right)\right]^2.Vd​=0<r<1/2sup​r(1−r)[log(r1−r​(d−1))]2.

Then all three strict inequalities hold:

[log⁡(d−1)]24<Vd,Vd<[log⁡(d−1)]24+1,Vd<(log⁡d)2.\frac{[\log(d-1)]^2}{4}<V_d,\qquad V_d<\frac{[\log(d-1)]^2}{4}+1,\qquad V_d<(\log d)^2.4[log(d−1)]2​<Vd​,Vd​<4[log(d−1)]2​+1,Vd​<(logd)2.
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