Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — local refinement of Pinsker's inequality

Proved
ExploreFirst.Absolute.lemma_6

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

kullback-leiblermulti-armed-banditsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regret-lower-bound

For Bernoulli parameters 0≤p<q≤10\le p<q\le10≤p<q≤1, let M=max⁡x∈[p,q]x(1−x)M=\max_{x\in[p,q]}x(1-x)M=maxx∈[p,q]​x(1−x). Then

kl(p,q)≥(p−q)22M≥(p−q)22q.\mathrm{kl}(p,q)\ge\frac{(p-q)^2}{2M}\ge\frac{(p-q)^2}{2q}.kl(p,q)≥2M(p−q)2​≥2q(p−q)2​.

This local refinement retains the interval-dependent factor used in the small-horizon bound. It includes p=0p=0p=0 and q=1q=1q=1, where the divergence may be infinite.

Formalization Note The maximum is encoded by the supremum of the image of the nonempty compact interval [p,q][p,q][p,q]; its value is positive because p<qp<qp<q.

Preamble
import Mathlib
import Definitions.Def_ExploreFirst_Absolute_Setting
Formal statement
namespace ExploreFirst.Absolute

/-- Garivier–Ménard–Stoltz, Lemma 6, p. 20. -/
theorem lemma_6 (p q : ℝ) (hp : 0 ≤ p) (hpq : p < q) (hq : q ≤ 1) :
    ENNReal.ofReal ((p - q) ^ 2 /
      (2 * sSup ((fun x : ℝ => x * (1 - x)) '' Set.Icc p q))) ≤ ExploreFirst.FundIneq.klBer p q ∧
    (p - q) ^ 2 / (2 * q) ≤
      (p - q) ^ 2 / (2 * sSup ((fun x : ℝ => x * (1 - x)) '' Set.Icc p q)) := by sorry

end ExploreFirst.Absolute
Source
Garivier, Ménard, Stoltz, Explore First, Exploit Next, arXiv:1602.07182v3, p. 20, Lemma 6
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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