Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pinsker's inequality: 12(∫∣g−g′∣)2≤K(g,g′)\frac12\left(\int|g-g'|\right)^2\le K(g,g')21​(∫∣g−g′∣)2≤K(g,g′)

Proved
StabGen.Entropy.pinsker_L1

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

information-theoryp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1pinskerrelative-entropy

Let ν\nuν be a σ-finite measure on Θ\ThetaΘ and let g,g′g,g'g,g′ be probability densities with respect to ν\nuν. Then

12(∫Θ∣g(θ)−g′(θ)∣ dθ)2≤K(g,g′),\frac12\left(\int_\Theta|g(\theta)-g'(\theta)|\,d\theta\right)^2\le K(g,g'),21​(∫Θ​∣g(θ)−g′(θ)∣dθ)2≤K(g,g′),

where K(g,g′)∈[0,∞]K(g,g')\in[0,\infty]K(g,g′)∈[0,∞] is the relative entropy (Kullback–Leibler divergence) of g νg\,\nugν from g′ νg'\,\nug′ν.

This is Pinsker's inequality in its L1L^1L1 form, quoted in the proof of Theorem 24 to convert a bound on relative entropies into a bound on the L1L^1L1 distance between two posteriors.

Formalization Note The inequality is stated in [0,∞][0,\infty][0,∞], the left side entering through ENNReal.ofReal, so no finiteness hypothesis on KKK is needed (when K=∞K=\inftyK=∞ it holds trivially). The page says "for any g,g′g, g'g,g′"; they are taken in the class FFF of probability densities, the only setting in which KKK is defined in §5.2.3.

Preamble
import Mathlib
import Definitions.Def_StabGen_Entropy_Model
Formal statement
namespace StabGen.Entropy

open MeasureTheory

/-- Proof of Theorem 24, p. 518 (Pinsker's inequality, `L¹` form): for probability densities
`g, g'` with respect to `ν`, `½ (∫_Θ |g(θ) − g'(θ)| dθ)² ≤ K(g, g')`, in `[0, ∞]`. -/
theorem pinsker_L1 {Θ : Type*} [MeasurableSpace Θ] (ν : Measure Θ) [SigmaFinite ν]
    (g g' : Θ → ℝ) (hg : IsDensity ν g) (hg' : IsDensity ν g') :
    ENNReal.ofReal ((1 / 2) * (∫ θ, |g θ - g' θ| ∂ν) ^ 2) ≤ relEntropy ν g g' := by sorry

end StabGen.Entropy
Source
Bousquet & Elisseeff, Stability and Generalization, JMLR 2 (2002), p. 518, proof of Theorem 24 (property of the relative entropy, citing Cover and Thomas 1991)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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