Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10.8.1 — aln⁡ab+(1−a)ln⁡1−a1−b≥2(a−b)2a\ln\frac ab+(1-a)\ln\frac{1-a}{1-b}\ge 2(a-b)^2alnba​+(1−a)ln1−b1−a​≥2(a−b)2

Proved
WildeQIT.PinskerRefined.lemma_10_8_1

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

entropy-inequalitiesinformation-theoryp2o-gran-per-chapterp2o-plan-bookp2o-v1pinsker

Let a,b∈[0,1]a,b\in[0,1]a,b∈[0,1]. Then

aln⁡ab+(1−a)ln⁡1−a1−b≥2(a−b)2.a\ln\frac ab+(1-a)\ln\frac{1-a}{1-b}\ge 2(a-b)^2 .alnba​+(1−a)ln1−b1−a​≥2(a−b)2.

The left side is the binary relative entropy of (a,1−a)(a,1-a)(a,1−a) with respect to (b,1−b)(b,1-b)(b,1−b) in nats, with the conventions 0ln⁡(0/c)=00\ln(0/c)=00ln(0/c)=0 and cln⁡(c/0)=+∞c\ln(c/0)=+\inftycln(c/0)=+∞ for c>0c>0c>0; for b∈{0,1}b\in\{0,1\}b∈{0,1} and a≠ba\ne ba=b it is +∞+\infty+∞ and the inequality holds trivially, as the book notes. This is the two-point case of Pinsker's inequality, to which the general case is reduced by a coarse-graining channel.

Formalization Note The left side is written as ln⁡2⋅D(p∥q)\ln 2\cdot D(p\|q)ln2⋅D(p∥q) with the published relEntropy (bits, extended reals, +∞+\infty+∞ off support) on the two-point alphabet Fin 2, where p=(a,1−a)p=(a,1-a)p=(a,1−a) is an arbitrary probability distribution on Fin 2 (so a=p(0)a=p(0)a=p(0) ranges over [0,1][0,1][0,1]) and q=(b,1−b)q=(b,1-b)q=(b,1−b).

Differences from the source:

  • encoding: a ln(a/b) + (1 − a) ln((1 − a)/(1 − b)) for a, b ∈ [0, 1], +∞ when b ∈ {0, 1} and a ≠ b → ln 2 · relEntropy p ![b, 1 − b] in EReal, with p any FinDist on Fin 2 and a = p(0); reason: relEntropy carries the book’s support convention (Definition 10.5.2) so the endpoints b ∈ {0, 1} keep their extended values; ln 2 converts bits to nats; every a ∈ [0, 1] is p(0) for p = (a, 1 − a)
Preamble
import Definitions.Def_WildeQIT_relEntropy
Formal statement
namespace WildeQIT.PinskerRefined

open WildeQIT

/-- **Lemma 10.8.1**, Wilde, *From Classical to Quantum Shannon Theory*, arXiv:1106.1445v8, p. 311: for `a, b ∈ [0, 1]`,
`a ln(a/b) + (1 − a) ln((1 − a)/(1 − b)) ≥ 2 (a − b)²`.

**Formalization Note** The left side is the binary relative entropy in nats, with the book's
conventions at `b ∈ {0, 1}` (`0 ln(0/·) = 0`, and `+∞` when `a ≠ b = 0` or `a ≠ b = 1`, the case the
book calls trivial). It is stated as `ln 2 · D(p‖q)` with the published `relEntropy` (bits, `EReal`,
`+∞` off support, Definition 10.5.2) on the two-point alphabet `Fin 2`, where `p = (a, 1 − a)` is any
probability distribution on `Fin 2` (`a = p(0)`, so `a` ranges over all of `[0, 1]`) and
`q = (b, 1 − b)`. In `EReal`, `ln 2 · (+∞) = +∞`. -/
theorem lemma_10_8_1 (p : FinDist (Fin 2)) (b : ℝ) (hb0 : 0 ≤ b) (hb1 : b ≤ 1) :
    ((2 * (p.prob 0 - b) ^ 2 : ℝ) : EReal) ≤
      ((Real.log 2 : ℝ) : EReal) * relEntropy p ![b, 1 - b] := by sorry

end WildeQIT.PinskerRefined
Source
Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, Lemma 10.8.1, p. 311
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 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