BanditAlgorithm.bernoulli_relative_entropy_pinsker
Provedinequalitiesinformation-theory
(Pinsker's inequality for Bernoulli distributions, L&S Lemma 10.2(b)) For and :
(The book states Lemma 10.2 for ; at the inequality is the contentless , resp. , which the real-valued junk convention cannot express, hence . Lemma 10.2's other parts — convexity of and with unique minimizers at resp. , and part (c): — 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