Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BanditAlgorithm.bernoulli_relative_entropy_pinsker

Proved

by Shuze Chen · Jul 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

inequalitiesinformation-theory

(Pinsker's inequality for Bernoulli distributions, L&S Lemma 10.2(b)) For p∈[0,1]p \in [0,1]p∈[0,1] and q∈(0,1)q \in (0,1)q∈(0,1):

d(p,q)≥2(p−q)2.d(p,q) \ge 2(p-q)^2.d(p,q)≥2(p−q)2.

(The book states Lemma 10.2 for p,q∈[0,1]p,q \in [0,1]p,q∈[0,1]; at q∈{0,1}q \in \{0,1\}q∈{0,1} the inequality is the contentless ∞≥2(p−q)2\infty \ge 2(p-q)^2∞≥2(p−q)2, resp. 0≥00 \ge 00≥0, which the real-valued junk convention cannot express, hence q∈(0,1)q \in (0,1)q∈(0,1). Lemma 10.2's other parts — convexity of d(⋅,q)d(\cdot,q)d(⋅,q) and d(p,⋅)d(p,\cdot)d(p,⋅) with unique minimizers at qqq resp. ppp, and part (c): p≤q−ε≤q⇒d(p,q−ε)≤d(p,q)−2ε2p \le q-\varepsilon \le q \Rightarrow d(p,q-\varepsilon) \le d(p,q) - 2\varepsilon^2p≤q−ε≤q⇒d(p,q−ε)≤d(p,q)−2ε2 — are recorded in the Lemma 10.2 milestone.)

Preamble
import Definitions.Def_bernoulliRelativeEntropy
Formal statement
theorem BanditAlgorithm.bernoulli_relative_entropy_pinsker (p q : ℝ)
    (hp : p ∈ Set.Icc (0 : ℝ) 1) (hq : q ∈ Set.Ioo (0 : ℝ) 1) :
    2 * (p - q) ^ 2 ≤ bernoulliRelativeEntropy p q := by
  sorry
Source
L&S Lemma 10.2, p.135

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