Proof of Thm 3 (App. D.1), p. 46 — Pinsker for n-fold products: ‖P₁ⁿ − P₂ⁿ‖²_TV ≤ (n/2) D_kl(P₂‖P₁)
ProvedUniformDRO.LowerBound.pinsker_displayLet , let and be the laws on with masses and at , and let be their -fold products. Then
This is Pinsker's inequality combined with the additivity of the Kullback–Leibler divergence over independent coordinates; it converts the one-observation bounds of the two KL displays into the bound needed in (37).
Formalization Note. The total variation is the half- distance on from the mission's definition file, and is the platform's Bernoulli relative entropy . The hypothesis keeps the divergence finite, where the real-valued formula is the true divergence; it holds wherever the page applies the inequality (in the second branch the roles of the two laws are exchanged, which the symmetry of total variation allows).
import Mathlib import Definitions.Def_bernoulliRelativeEntropy import Definitions.Def_UniformDRO_LowerBound_Setting
namespace UniformDRO.LowerBound
theorem pinsker_display (n : ℕ) (p₁ p₂ : ℝ) (hp₁ : p₁ ∈ Set.Ioo (0 : ℝ) 1)
(hp₂ : p₂ ∈ Set.Icc (0 : ℝ) 1) :
tvDist n p₁ p₂ ^ 2 ≤ n / 2 * BanditAlgorithm.bernoulliRelativeEntropy p₂ p₁ := by sorry
end UniformDRO.LowerBound
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.