Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Footnote 18 and Lemma 5.4 — Hellinger divergence is at most KL

Proved
DROReview.PhiDiv.hellinger_le_kl

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

distributionally-robust-optimizationhellingerkullback-leiblerp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1phi-divergence

For any probability measures PPP and P0P_0P0​ on the same measurable space, the Hellinger divergence does not exceed the Kullback–Leibler divergence:

Dϕh(P,P0)≤Dϕkl(P,P0).\mathfrak D^{\phi_h}(P,P_0)\le\mathfrak D^{\phi_{\mathrm{kl}}}(P,P_0).Dϕh​(P,P0​)≤Dϕkl​(P,P0​).

This is the second comparison in (5.10) and is repeated explicitly in footnote 18. It implies that every KL ambiguity ball lies in the Hellinger ball of the same radius.

Formalization Note Both divergences take values in [0,+∞][0,+\infty][0,+∞]. No absolute-continuity assumption is imposed; the extended divergence handles singular pairs.

Preamble
import Definitions.Def_DROReview_PhiDiv_phiDiv
import Definitions.Def_DROReview_PhiDiv_generators
Formal statement
namespace DROReview.PhiDiv

open MeasureTheory

/-- Footnote 18, p. 35, and Lemma 5.4, (5.10), second inequality, p. 34. -/
theorem hellinger_le_kl {Ξ : Type*} [MeasurableSpace Ξ]
    (P P₀ : ProbabilityMeasure Ξ) :
    phiDiv phiH P P₀ ≤
      phiDiv phiKL P P₀ := by sorry

end DROReview.PhiDiv
Source
Rahimian, Mehrotra, Distributionally Robust Optimization: A Review, arXiv:1908.05659v1 (2019), p. 34, Lemma 5.4, (5.10), second inequality; p. 35, footnote 18
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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