BanditAlgorithm.pinsker_inequality_total_variation
Provedinequalitiesinformation-theory
(Pinsker, event form Eq. (14.13)) For probability measures on with klDiv P Q finite and any measurable :
This is the bandit-usable form of Pinsker's inequality (Eq. (14.12))
the sup-form follows by instantiating the theorem at and rearranging with , so no expressiveness is lost. BOUNDARY: the hypothesis is REQUIRED — at the junk value (∞).toReal = 0 makes the left-hand side , but can be (e.g. , , ). The book's form is trivially true at .
Preamble
import Mathlib.InformationTheory.KullbackLeibler.Basic open MeasureTheory InformationTheory Real open scoped ENNReal
Formal statement
theorem BanditAlgorithm.pinsker_inequality_total_variation {Ω : Type} {mΩ : MeasurableSpace Ω}
(P Q : Measure Ω) [IsProbabilityMeasure P] [IsProbabilityMeasure Q]
{A : Set Ω} (hA : MeasurableSet A) (hD : klDiv P Q ≠ ∞) :
1 - Real.sqrt ((klDiv P Q).toReal / 2) ≤ P.real A + Q.real Aᶜ := by
sorry
Source
L&S Ch 14.3 Note 5, Eqs. (14.12)-(14.13), p.193
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.