AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.pinsker_inequality_of_ac_of_integrable

theoremverifiedimported Lean

Pinsker's inequality under absolute continuity. Let $\mu$ and $\nu$ be probability measures on a measurable space $\Omega$, and suppose $\mu$ is absolutely continuous with respect to $\nu$ and that the log-likelihood ratio $\log\frac{d\mu}{d\nu}$ is $\mu$-integrable. Then, as an inequality in the extended nonnegative reals $\bbr_{\ge 0} \cup \{\infty\}$, \[ 2\,\mathrm{TV}(\mu,\nu)^2 \;\le\; \mathrm{KL}(\mu \,\|\, \nu), \] where $\mathrm{TV}(\mu,\nu)$ is the total variation distance between $\mu$ and $\nu$ and $\mathrm{KL}(\mu \,\|\, \nu)$ is the Kullback–Leibler divergence of $\mu$ from $\nu$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
open ProbabilityTheory in
open scoped ENNReal in
theorem CommunicationComplexity.pinsker_inequality_of_ac_of_integrable
    {Ω : Type*} [MeasurableSpace Ω]
    (μ ν : Measure Ω) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν]
    (h_ac : μ ≪ ν)
    (h_int : Integrable (llr μ ν) μ) :
    ENNReal.ofReal (2 * tvDistance μ ν ^ 2) ≤
      InformationTheory.klDiv μ ν
Source
TCSlib, `CommunicationComplexity.pinsker_inequality_of_ac_of_integrable`
Lean proof
By Lucy Horowitz, Timothe Kasriel, Mihir Singhal, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Lucy Horowitz, Timothe Kasriel, and Mihir Singhal. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory inopen ProbabilityTheory inopen scoped ENNReal in/-- Pinsker's inequality in `ℝ≥0∞` form under `μ ≪ ν` and integrability of the log-likelihood ratio: `2 · TV(μ, ν)² ≤ KL(μ ‖ ν)`. -/theorem CommunicationComplexity.pinsker_inequality_of_ac_of_integrable    {Ω : Type*} [MeasurableSpace Ω]    (μ ν : Measure Ω) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν]    (h_ac : μ ≪ ν)    (h_int : Integrable (llr μ ν) μ) :    ENNReal.ofReal (2 * tvDistance μ ν ^ 2) ≤      InformationTheory.klDiv μ ν := by  rw [InformationTheory.klDiv_of_ac_of_integrable h_ac h_int]  apply ENNReal.ofReal_le_ofReal  have h_real := real_pinsker_inequality_of_ac_of_integrable μ ν h_ac h_int  simpa using h_real
See it in the graphDiscuss this resultChallenge it