Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pinsker inequality in the source full-L1/nats convention

Open
QAlgorithms.Papers.Independent.Intake100.P73.pinsker_full_l1

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

prove2quantum

For any probability mass functions p and q on an arbitrary discrete alphabet, full L1 distance d(p,q)=sum_y |p(y)-q(y)| and extended KL divergence D(p||q) in natural logarithms satisfy d(p,q)^2/2 <= D(p||q). Support mismatch gives infinite divergence; zero-mass summands follow the standard continuous convention. The printed coefficient 1 is corrected to 1/2.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P73
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intake100.P73

open Filter

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable Classical.decEq

universe u

/-- Hayashi PDF p.10, background Pinsker inequality. Printed: D>=full-L1^2.
Changed: D>=full-L1^2/2, because the source uses full L1 and natural logarithms.
No finite-alphabet or absolute-continuity restriction is added. -/
theorem pinsker_full_l1 {Omega : Type*} (p q : PMF Omega) :
    fullL1 p q ^ 2 / 2 ≤ discreteKLDivergence p q := by sorry

end QAlgorithms.Papers.Independent.Intake100.P73

end
Source
General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel, arXiv:cs/0503088v2, PDF p. 10, §VI.A: Pinsker inequality (normalization audit)
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For any type Ω\OmegaΩ and any two probability mass functions p,q:Ω→[0,∞]p,q:\Omega\to[0,\infty]p,q:Ω→[0,∞], one has

(∑ω∈Ω∣p(ω)−q(ω)∣)22 ≤ ∑ω∈ΩK(p(ω),q(ω)),K(a,b)={b,a=0,+∞,a>0, b=0,b max⁡ ⁣{ablog⁡ab−ab+1, 0},a>0, b>0.\frac{\left(\displaystyle\sum_{\omega\in\Omega}|p(\omega)-q(\omega)|\right)^2}{2} \ \le\ \sum_{\omega\in\Omega}K(p(\omega),q(\omega)), \qquad K(a,b)= \begin{cases} b,&a=0,\\ +\infty,&a>0,\ b=0,\\ b\,\max\!\left\{\dfrac ab\log\dfrac ab-\dfrac ab+1,\ 0\right\},&a>0,\ b>0. \end{cases}2(ω∈Ω∑​∣p(ω)−q(ω)∣)2​ ≤ ω∈Ω∑​K(p(ω),q(ω)),K(a,b)=⎩⎨⎧​b,+∞,bmax{ba​logba​−ba​+1, 0},​a=0,a>0, b=0,a>0, b>0.​

The logarithm is the natural logarithm, and the inequality and sums are interpreted in the extended nonnegative reals. Each value of a probability mass function is finite, so the absolute difference here is exactly the sum of the two truncated differences used in the definition. No finiteness assumption is imposed on Ω\OmegaΩ, and zero masses are allowed: K(0,0)=0K(0,0)=0K(0,0)=0, whereas p(ω)>0=q(ω)p(\omega)>0=q(\omega)p(ω)>0=q(ω) makes the right-hand side infinite. The existence of p,qp,qp,q excludes an empty Ω\OmegaΩ.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 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