Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pinsker inequality for bounded expectations

Proved
BanditAlgorithm.pinsker_squared_bounded_expectation_difference

by Harry_Xu · Aug 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

banditsinformation-theorypinsker

Let PPP and QQQ be probability measures and let fff be a measurable function with values in [0,1][0,1][0,1]. If D(P ∥ Q)D(P\,\|\,Q)D(P∥Q) is finite, then

2(EQ[f]−EP[f])2≤D(P ∥ Q).2\left(\mathbb E_Q[f]-\mathbb E_P[f]\right)^2 \le D(P\,\|\,Q).2(EQ​[f]−EP​[f])2≤D(P∥Q).

This is the bounded-expectation form of Pinsker’s inequality used in the one-step Thompson-sampling information-ratio argument.

Preamble
import Mathlib.InformationTheory.KullbackLeibler.Basic

open MeasureTheory InformationTheory
open scoped ENNReal
Formal statement
theorem BanditAlgorithm.pinsker_squared_bounded_expectation_difference
    {Omega : Type} {mOmega : MeasurableSpace Omega}
    (P Q : Measure Omega) [IsProbabilityMeasure P] [IsProbabilityMeasure Q]
    (f : Omega → ℝ) (hf : Measurable f)
    (hf0 : ∀ x, 0 ≤ f x) (hf1 : ∀ x, f x ≤ 1)
    (hD : klDiv P Q ≠ ∞) :
    2 * ((∫ x, f x ∂Q) - ∫ x, f x ∂P) ^ 2 ≤ (klDiv P Q).toReal := by
  sorry
Source
Lattimore and Szepesvári, Bandit Algorithms (Cambridge UP, 2020), https://tor-lattimore.com/downloads/book/book.pdf, printed p. 470 (PDF p. 479), proof of Lemma 36.7, first inequality after the definition of Δ_t; the extension from events to [0,1]-valued rewards is the standard layer-cake form of Pinsker.
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 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