Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.5 (second bullet): DH2(P,Q)≤DKL(P∥Q)D^2_{\mathrm H}(P,Q)\le D_{\mathrm{KL}}(P\|Q)DH2​(P,Q)≤DKL​(P∥Q)

Proved
HellingerSubadd.lemmaA5_hellingerSq_le_klDiv

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

hellinger-distanceinformation-theoryinteractive-decision-makingprobability

Let PPP and QQQ be probability measures on a measurable space. Then

DH2(P,Q)≤DKL(P ∥ Q),D^2_{\mathrm H}(P,Q)\le D_{\mathrm{KL}}(P\,\|\,Q),DH2​(P,Q)≤DKL​(P∥Q),

where DKL(P∥Q)=∫log⁡(dP/dQ) dPD_{\mathrm{KL}}(P\|Q)=\int\log(dP/dQ)\,dPDKL​(P∥Q)=∫log(dP/dQ)dP if P≪QP\ll QP≪Q and +∞+\infty+∞ otherwise.

In the proof of Lemma A.13 this turns the squared Hellinger distances of Terms I and II into KL divergences, to which the chain rule applies.

Differences from the source:

  • encoding: D_KL(P ∥ Q) as defined on p. 10, real or +∞ → Mathlib's klDiv μ ν : ℝ≥0∞, compared in ℝ≥0∞; reason: for probability measures klDiv equals the paper's definition (a non-integrable log-likelihood ratio has integral +∞)
Preamble
import Mathlib
import Definitions.Def_HellingerSubadd_hellingerSq

open MeasureTheory InformationTheory
open scoped ENNReal
Formal statement
namespace HellingerSubadd

/-- **Lemma A.5, second bullet: squared Hellinger distance is at most KL divergence.**
Foster, Kakade, Qian & Rakhlin, *The Statistical Complexity of Interactive Decision Making*,
arXiv:2112.13487v3, Lemma A.5, second bullet, p. 71: "D²_H(P, Q) ≤ D_KL(P ∥ Q)".

For probability measures `μ, ν` on one measurable space, `D²_H(μ, ν) ≤ D_KL(μ ∥ ν)`.

**Formalization Note.** KL divergence is Mathlib's `klDiv` (value `∞` off absolute continuity and
off integrability of the log-likelihood ratio; for probability measures this is the paper's
definition, p. 10). Both sides in `ℝ≥0∞`. -/
theorem lemmaA5_hellingerSq_le_klDiv {α : Type*} [MeasurableSpace α] (μ ν : Measure α)
    [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] :
    hellingerSq μ ν ≤ klDiv μ ν := by sorry

end HellingerSubadd
Source
Foster, Kakade, Qian & Rakhlin, The Statistical Complexity of Interactive Decision Making, arXiv:2112.13487v3, Lemma A.5, second bullet, p. 71

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