Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Thm 3 (App. D.1), p. 46 — Pinsker for n-fold products: ‖P₁ⁿ − P₂ⁿ‖²_TV ≤ (n/2) D_kl(P₂‖P₁)

Proved
UniformDRO.LowerBound.pinsker_display

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

kl-divergenceminimax-lower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pinskertotal-variation

Let n≥0n \ge 0n≥0, let P1P_1P1​ and P2P_2P2​ be the laws on {0,M}\{0, M\}{0,M} with masses p1∈(0,1)p_1 \in (0,1)p1​∈(0,1) and p2∈[0,1]p_2 \in [0,1]p2​∈[0,1] at MMM, and let P1n,P2nP_1^n, P_2^nP1n​,P2n​ be their nnn-fold products. Then

∥P1n−P2n∥TV2≤n2 Dkl(P2∥P1).\|P_1^n - P_2^n\|_{\mathrm{TV}}^2 \le \frac n2\, D_{\mathrm{kl}}(P_2\|P_1).∥P1n​−P2n​∥TV2​≤2n​Dkl​(P2​∥P1​).

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 ∥P1n−P2n∥TV≤12\|P_1^n - P_2^n\|_{\mathrm{TV}} \le \tfrac12∥P1n​−P2n​∥TV​≤21​ needed in (37).

Formalization Note. The total variation is the half-ℓ1\ell^1ℓ1 distance on {0,M}n\{0,M\}^n{0,M}n from the mission's definition file, and Dkl(P2∥P1)D_{\mathrm{kl}}(P_2\|P_1)Dkl​(P2​∥P1​) is the platform's Bernoulli relative entropy d(p2,p1)d(p_2, p_1)d(p2​,p1​). The hypothesis p1∈(0,1)p_1 \in (0,1)p1​∈(0,1) 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).

Preamble
import Mathlib
import Definitions.Def_bernoulliRelativeEntropy
import Definitions.Def_UniformDRO_LowerBound_Setting
Formal statement
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
Source
Duchi & Namkoong, arXiv:1810.08750v6, proof of Theorem 3 (App. D.1), p. 46, Pinsker step
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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