Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.6.1 (Strong Subadditivity) — I(X;Y∣Z)≥0I(X;Y|Z)\ge 0I(X;Y∣Z)≥0, with equality iff X−Z−YX-Z-YX−Z−Y is Markov

Proved
WildeQIT.PinskerRefined.theorem_10_6_1

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

entropy-inequalitiesinformation-theoryp2o-gran-per-chapterp2o-plan-bookp2o-v1strong-subadditivity

Let X,Y,ZX,Y,ZX,Y,Z be discrete random variables on finite alphabets with joint distribution pXYZp_{XYZ}pXYZ​, and let I(X;Y∣Z)=H(Y∣Z)−H(Y∣X,Z)I(X;Y|Z)=H(Y|Z)-H(Y|X,Z)I(X;Y∣Z)=H(Y∣Z)−H(Y∣X,Z) be their conditional mutual information (Definition 10.6.1). Then

I(X;Y∣Z)≥0,(10.38)I(X;Y|Z)\ge 0, \tag{10.38}I(X;Y∣Z)≥0,(10.38)

and equality holds if and only if X−Z−YX - Z - YX−Z−Y is a Markov chain, that is, pX,Y∣Z(x,y∣z)=pX∣Z(x∣z) pY∣Z(y∣z)p_{X,Y|Z}(x,y|z)=p_{X|Z}(x|z)\,p_{Y|Z}(y|z)pX,Y∣Z​(x,y∣z)=pX∣Z​(x∣z)pY∣Z​(y∣z) for every zzz with pZ(z)>0p_Z(z)>0pZ​(z)>0.

This is the classical strong subadditivity of entropy, with its saturation condition; Theorem 10.8.3 refines both parts quantitatively.

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 condition is the published IsMarkovChain applied to the regrouped triple (X,Z,Y)(X,Z,Y)(X,Z,Y), which unfolds to p(x,y,z) pZ(z)=pXZ(x,z) pYZ(y,z)p(x,y,z)\,p_Z(z)=p_{XZ}(x,z)\,p_{YZ}(y,z)p(x,y,z)pZ​(z)=pXZ​(x,z)pYZ​(y,z) for all x,y,zx,y,zx,y,z.

Differences from the source:

  • encoding: p_{X,Y|Z}(x,y|z) = p_{X|Z}(x|z) p_{Y|Z}(y|z) → IsMarkovChain of the regrouped triple (X, Z, Y), i.e. p(x,y,z) p_Z(z) = p_XZ(x,z) p_YZ(y,z) for all x, y, z; reason: multiplying by p_Z(z) removes the undefined conditionals at p_Z(z) = 0, where both sides vanish; same condition wherever the book’s is defined
Preamble
import Definitions.Def_WildeQIT_condMutualInfo
import Definitions.Def_WildeQIT_IsMarkovChain
Formal statement
namespace WildeQIT.PinskerRefined

open WildeQIT

/-- **Theorem 10.6.1 (Strong Subadditivity)**, Wilde, *From Classical to Quantum Shannon Theory*, arXiv:1106.1445v8, pp. 297–298: the conditional mutual
information is non-negative, `I(X;Y|Z) ≥ 0` (10.38), and the inequality is saturated if and only if
`X − Z − Y` is a Markov chain, i.e. `p_{X,Y|Z}(x,y|z) = p_{X|Z}(x|z) p_{Y|Z}(y|z)`.

**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`). `I(X;Y|Z)` is the published `condMutualInfo` (Definition 10.6.1).
"`X − Z − Y` is a Markov chain" is the published `IsMarkovChain` (`X → Y → Z` with the middle
component screening off) applied to the regrouped triple `(X, Z, Y)`; unfolded, it says
`p(x,y,z) p_Z(z) = p_{XZ}(x,z) p_{YZ}(y,z)` for all `x, y, z`, the division-free form of the book's
condition (both sides vanish when `p_Z(z) = 0`, where the conditionals are undefined). -/
theorem theorem_10_6_1 {α β γ : Type} [Fintype α] [Fintype β] [Fintype γ]
    (p : FinDist (α × β × γ)) :
    0 ≤ condMutualInfo p ∧
      (condMutualInfo p = 0 ↔
        (p.comap (Equiv.prodCongr (Equiv.refl α) (Equiv.prodComm γ β))).IsMarkovChain) := by sorry

end WildeQIT.PinskerRefined
Source
Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, Theorem 10.6.1, pp. 297–298, Eq. (10.38)
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