Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.7.2 (Data-Processing Inequality) — I(X;Y)≥I(X;Z)I(X;Y)\ge I(X;Z)I(X;Y)≥I(X;Z) for X→Y→ZX\to Y\to ZX→Y→Z

Proved
WildeQIT.PinskerRefined.theorem_10_7_2

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

data-processingentropy-inequalitiesinformation-theoryp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let X,Y,ZX,Y,ZX,Y,Z be discrete random variables on finite alphabets forming a Markov chain X→Y→ZX\to Y\to ZX→Y→Z, that is, pZ∣Y,X(z∣y,x)=pZ∣Y(z∣y)p_{Z|Y,X}(z|y,x)=p_{Z|Y}(z|y)pZ∣Y,X​(z∣y,x)=pZ∣Y​(z∣y) (10.55). Then

I(X;Y)≥I(X;Z).(10.56)I(X;Y)\ge I(X;Z). \tag{10.56}I(X;Y)≥I(X;Z).(10.56)

Processing YYY into ZZZ by a stochastic map that does not look at XXX cannot increase the information about XXX; this is the form of data processing used in converse proofs.

Formalization Note Alphabets are finite types, as throughout the book; a random variable is represented by its distribution, and a triple (X,Y,Z)(X,Y,Z)(X,Y,Z) by its joint distribution on X×Y×Z\mathcal X\times\mathcal Y\times\mathcal ZX×Y×Z. Entropies, mutual informations and relative entropies are the published WildeQIT definitions, in bits. The Markov chain is the published IsMarkovChain: p(x,y,z) pY(y)=pXY(x,y) pYZ(y,z)p(x,y,z)\,p_Y(y)=p_{XY}(x,y)\,p_{YZ}(y,z)p(x,y,z)pY​(y)=pXY​(x,y)pYZ​(y,z) for all x,y,zx,y,zx,y,z.

Differences from the source:

  • encoding: X → Y → Z, p_{Z|Y,X}(z|y,x) = p_{Z|Y}(z|y) (10.55) → IsMarkovChain: p(x,y,z) p_Y(y) = p_XY(x,y) p_YZ(y,z) for all x, y, z; reason: division-free form; conditionals are undefined where p_XY(x,y) = 0 and both forms agree wherever defined
Preamble
import Definitions.Def_WildeQIT_mutualInfo
import Definitions.Def_WildeQIT_IsMarkovChain
Formal statement
namespace WildeQIT.PinskerRefined

open WildeQIT

/-- **Theorem 10.7.2 (Data-Processing Inequality)**, Wilde, *From Classical to Quantum Shannon Theory*, arXiv:1106.1445v8, p. 302: if `X → Y → Z` is a Markov
chain, then `I(X;Y) ≥ I(X;Z)` (10.56).

**Formalization Note** Alphabets are finite types (`Fintype`), as throughout the book; a random variable is represented by its distribution (`FinDist`), a triple `(X, Y, Z)` by its joint law on `α × β × γ` = `α × (β × γ)`. Entropies, mutual informations and relative entropies are the published `WildeQIT` definitions, in bits (`Real.logb 2`, `0 log 0 = 0`). The Markov chain is the published `IsMarkovChain`
(`p(x,y,z) p_Y(y) = p_{XY}(x,y) p_{YZ}(y,z)`, the division-free form of (10.55)); `I(X;Y)` and
`I(X;Z)` are `mutualInfo` of the marginals `p_{XY}` and `p_{XZ}`. -/
theorem theorem_10_7_2 {α β γ : Type} [Fintype α] [Fintype β] [Fintype γ]
    (p : FinDist (α × β × γ)) (hp : p.IsMarkovChain) :
    mutualInfo p.margXZ ≤ mutualInfo p.margXY := by sorry

end WildeQIT.PinskerRefined
Source
Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, Theorem 10.7.2, p. 302, Eq. (10.56)
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