Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.8.4 (Refined Monotonicity of Relative Entropy) — D(p∥q)−D(Np∥Nq)≥D(p∥RNp)D(p\|q)-D(Np\|Nq)\ge D(p\|RNp)D(p∥q)−D(Np∥Nq)≥D(p∥RNp)

Proved
WildeQIT.PinskerRefined.theorem_10_8_4

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

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

Let ppp be a probability distribution on a finite alphabet X\mathcal XX, let q:X→[0,∞)q:\mathcal X\to[0,\infty)q:X→[0,∞) satisfy supp(p)⊆supp(q)\mathrm{supp}(p)\subseteq\mathrm{supp}(q)supp(p)⊆supp(q), and let N(y∣x)N(y|x)N(y∣x) be a classical channel from X\mathcal XX to a finite alphabet Y\mathcal YY, with (Np)(y)=∑xN(y∣x)p(x)(Np)(y)=\sum_x N(y|x)p(x)(Np)(y)=∑x​N(y∣x)p(x) and (Nq)(y)=∑xN(y∣x)q(x)(Nq)(y)=\sum_x N(y|x)q(x)(Nq)(y)=∑x​N(y∣x)q(x). Let R(x∣y)R(x|y)R(x∣y) be a recovery channel from Y\mathcal YY to X\mathcal XX defined by

R(x∣y) (Nq)(y)=N(y∣x) q(x)for all x,y,(10.165)R(x|y)\,(Nq)(y)=N(y|x)\,q(x)\quad\text{for all }x,y, \tag{10.165}R(x∣y)(Nq)(y)=N(y∣x)q(x)for all x,y,(10.165)

and let (RNp)(x)=∑y,x′R(x∣y)N(y∣x′)p(x′)(RNp)(x)=\sum_{y,x'}R(x|y)N(y|x')p(x')(RNp)(x)=∑y,x′​R(x∣y)N(y∣x′)p(x′). Then

D(p∥q)−D(Np∥Nq)≥D(p∥RNp).(10.164)D(p\|q)-D(Np\|Nq)\ge D(p\|RNp). \tag{10.164}D(p∥q)−D(Np∥Nq)≥D(p∥RNp).(10.164)

If the loss of relative entropy under NNN is small, then the recovery channel RRR (Bayes' rule when qqq is a probability distribution) nearly restores ppp from NpNpNp. It gives the saturation clause of Corollary 10.7.2.

Formalization Note DDD is relEntropy (bits, extended reals); under supp(p)⊆supp(q)\mathrm{supp}(p)\subseteq\mathrm{supp}(q)supp(p)⊆supp(q) the three relative entropies are finite, so the difference is the real difference. The theorem holds for every channel RRR satisfying (10.165).

Differences from the source:

  • reading: "the recovery channel R(x|y) … is defined by" (10.165) → every channel R satisfying (10.165); reason: (10.165) does not determine R(·|y) where (Nq)(y) = 0; the statement is asserted for each such R, which is the stronger reading
Preamble
import Definitions.Def_WildeQIT_relEntropy
import Definitions.Def_WildeQIT_Channel
Formal statement
namespace WildeQIT.PinskerRefined

open WildeQIT

/-- **Theorem 10.8.4 (Refined Monotonicity of Relative Entropy)**, Wilde, *From Classical to Quantum Shannon Theory*, arXiv:1106.1445v8, p. 315: let `p` be a
probability distribution on a finite alphabet `𝒳`, `q : 𝒳 → [0, ∞)` with `supp(p) ⊆ supp(q)`, and
`N(y|x)` a classical channel. For the recovery channel `R(x|y)` defined by (10.165),
`R(x|y) (Nq)(y) = N(y|x) q(x)`, `D(p‖q) − D(Np‖Nq) ≥ D(p‖RNp)` (10.164).

**Formalization Note** `D` is the published `relEntropy` (bits, `EReal`, `+∞` off support,
Definition 10.5.2); `Np` is `N.apply p`, `Nq` is `N.applyFun q`, and `RNp` is `R.apply (N.apply p)`,
with mass `∑_{y,x'} R(x|y) N(y|x') p(x')` at `x`. Equations (10.165) do not determine `R(·|y)` where
`(Nq)(y) = 0`, so the theorem is stated for every channel `R` satisfying them. Under
`supp(p) ⊆ supp(q)` all three relative entropies are finite, so the `EReal` difference is the real
difference. -/
theorem theorem_10_8_4 {α β : Type} [Fintype α] [Fintype β]
    (p : FinDist α) (q : α → ℝ) (hq : ∀ x, 0 ≤ q x)
    (hsupp : Function.support p.prob ⊆ Function.support q)
    (N : Channel α β) (R : Channel β α)
    (hR : ∀ x y, (R y).prob x * N.applyFun q y = (N x).prob y * q x) :
    relEntropy p (R.apply (N.apply p)).prob ≤
      relEntropy p q - relEntropy (N.apply p) (N.applyFun q) := by sorry

end WildeQIT.PinskerRefined
Source
Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, Theorem 10.8.4, p. 315, Eqs. (10.164)–(10.165)
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