Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.7, p. 71 — D²_H(Ber(p), Ber(q)) ≤ (p−q)²(1/(p+q) + 1/(2−p−q)); D²_H(Ber(1/2+Δ), Ber(1/2)) ≤ 3Δ²; D²_H(Ber(1/2+Δ), Ber(1/2+2Δ)) ≤ 5Δ²

Proved
StatComplexityDM.MAB.bernoulli_hellinger_bounds

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

bernoulli-distributionhellinger-distanceinformation-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let DH2(P,Q)=∑y(P(y)−Q(y))2D^2_{\mathrm{H}}(P,Q) = \sum_y (\sqrt{P(y)} - \sqrt{Q(y)})^2DH2​(P,Q)=∑y​(P(y)​−Q(y)​)2 be the squared Hellinger distance and Ber(q)\mathrm{Ber}(q)Ber(q) the Bernoulli distribution with mean qqq. Then:

  1. For all p,q∈[0,1]p, q \in [0,1]p,q∈[0,1],
DH2(Ber(p),Ber(q))≤(p−q)2⋅(1p+q+11−p+1−q).D^2_{\mathrm{H}}\bigl(\mathrm{Ber}(p), \mathrm{Ber}(q)\bigr) \le (p - q)^2 \cdot \left( \frac{1}{p + q} + \frac{1}{1 - p + 1 - q} \right).DH2​(Ber(p),Ber(q))≤(p−q)2⋅(p+q1​+1−p+1−q1​).
  1. For all Δ∈(0,12)\Delta \in (0, \tfrac12)Δ∈(0,21​),  DH2(Ber(12+Δ),Ber(12))≤3Δ2\ D^2_{\mathrm{H}}\bigl(\mathrm{Ber}(\tfrac12 + \Delta), \mathrm{Ber}(\tfrac12)\bigr) \le 3\Delta^2 DH2​(Ber(21​+Δ),Ber(21​))≤3Δ2.
  2. For all Δ∈(0,14)\Delta \in (0, \tfrac14)Δ∈(0,41​),  DH2(Ber(12+Δ),Ber(12+2Δ))≤5Δ2\ D^2_{\mathrm{H}}\bigl(\mathrm{Ber}(\tfrac12 + \Delta), \mathrm{Ber}(\tfrac12 + 2\Delta)\bigr) \le 5\Delta^2 DH2​(Ber(21​+Δ),Ber(21​+2Δ))≤5Δ2.

The second bound is the information property of the hard family in the multi-armed bandit lower bound (Proposition 5.3); the third enters the gap-dependent variant.

Formalization Note The Hellinger distance carries no factor 12\tfrac1221​, as in the paper's (5). At p=q=0p = q = 0p=q=0 (resp. p=q=1p = q = 1p=q=1) the term 1/(p+q)1/(p+q)1/(p+q) (resp. 1/(1−p+1−q)1/(1-p+1-q)1/(1−p+1−q)) has a zero denominator; Lean evaluates x/0=0x/0 = 0x/0=0, and the left side is also 000 there, so the first bound is stated for all of [0,1]2[0,1]^2[0,1]2 as on the page.

Preamble
import Mathlib
import Definitions.Def_FoundationsRL_GeneralDM_Divergences
import Definitions.Def_StatComplexityDM_MAB_Bernoulli
Formal statement
namespace StatComplexityDM.MAB

open FoundationsRL.GeneralDM

/-- Lemma A.7 (arXiv:2112.13487v3, p. 71), divergence for Bernoulli distributions:
for all `p, q ∈ [0, 1]`, `D²_H(Ber(p), Ber(q)) ≤ (p − q)² · (1/(p + q) + 1/(1 − p + 1 − q))`;
for all `Δ ∈ (0, 1/2)`, `D²_H(Ber(1/2 + Δ), Ber(1/2)) ≤ 3Δ²`; and for all `Δ ∈ (0, 1/4)`,
`D²_H(Ber(1/2 + Δ), Ber(1/2 + 2Δ)) ≤ 5Δ²`. `D²_H` is `hellingerSq` (no factor `1/2`, (5), p. 10).
At `p = q = 0` and `p = q = 1` a denominator vanishes; Lean's `x / 0 = 0` makes the right side `0`,
which the left side also equals there. -/
theorem bernoulli_hellinger_bounds :
    (∀ p q : ℝ, 0 ≤ p → p ≤ 1 → 0 ≤ q → q ≤ 1 →
      hellingerSq (ber p) (ber q) ≤ (p - q) ^ 2 * (1 / (p + q) + 1 / (1 - p + (1 - q)))) ∧
    (∀ Δ : ℝ, 0 < Δ → Δ < 1 / 2 →
      hellingerSq (ber (1 / 2 + Δ)) (ber (1 / 2)) ≤ 3 * Δ ^ 2) ∧
    (∀ Δ : ℝ, 0 < Δ → Δ < 1 / 4 →
      hellingerSq (ber (1 / 2 + Δ)) (ber (1 / 2 + 2 * Δ)) ≤ 5 * Δ ^ 2) := by sorry

end StatComplexityDM.MAB
Source
arXiv:2112.13487v3, Lemma A.7, p. 71
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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