Lean, informalized

Nielsen & Chuang · Chapter 11, Entropy and information · p. 507

Exercise 11.6 - Strong subadditivity of the Shannon entropy and its case of equality

Strong subadditivity is tight exactly for Markov chains.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Exercise

Three random variables XX, YY and ZZ take finitely many values, with a joint distribution pp. Strong subadditivity of the Shannon entropy says that the entropy of all three, plus the entropy of the middle variable YY, is at most the sum of the entropies of the two pairs (X,Y)(X,Y) and (Y,Z)(Y,Z) that share YY.✦ The exercise asks for this inequality and for the case of equality, which occurs exactly when Z→Y→XZ \to Y \to X is a Markov chain.

The library states both the inequality and the condition for equality, for random variables with values in finite sets.

Distributions and Entropy

A joint distribution pp of XX, YY, ZZ on finite sets 𝒳\mathcal{X}, 𝒴\mathcal{Y}, 𝒵\mathcal{Z} is a real function on 𝒳×𝒴×𝒵\mathcal{X} \times \mathcal{Y} \times \mathcal{Z}, nonnegative at every triple (x,y,z)(x,y,z), whose values sum to one.

The Shannon entropy H(q)H(q) of a distribution qq on a finite set 𝒜\mathcal{A} is the sum over outcomes of −q(a)log⁡q(a)-q(a)\log q(a), H(q)=−∑a∈𝒜q(a)log⁡q(a),H(q) = -\sum_{a \in \mathcal{A}} q(a) \log q(a),(1)✦ with the natural logarithm, so that it is measured in nats.

Marginals

The marginal pXYp_{XY} of pp is the joint distribution of XX and YY, obtained by summing out ZZ: pXY(x,y)=∑z∈𝒵p(x,y,z).p_{XY}(x,y) = \sum_{z \in \mathcal{Z}} p(x,y,z).(2)✦

The marginal pYZp_{YZ} of pp is the joint distribution of YY and ZZ, obtained by summing out XX: pYZ(y,z)=∑xp(x,y,z).p_{YZ}(y,z) = \sum_{x} p(x,y,z).(3)✦

The marginal pYp_Y of pp is the distribution of YY alone, obtained by summing pYZp_{YZ} over zz: pY(y)=∑zpYZ(y,z)=∑x,zp(x,y,z).p_Y(y) = \sum_{z} p_{YZ}(y,z) = \sum_{x,z} p(x,y,z).(4)✦

The entropies of the exercise are those of pp and its marginals: H(X,Y,Z)=H(p)H(X,Y,Z) = H(p), H(X,Y)=H(pXY)H(X,Y) = H(p_{XY}), H(Y,Z)=H(pYZ)H(Y,Z) = H(p_{YZ}) and H(Y)=H(pY)H(Y) = H(p_Y).

The Markov Condition

The random variables XX, YY, ZZ with joint distribution pp form a Markov chain Z→Y→XZ \to Y \to X when XX and ZZ are conditionally independent given YY: p(x,y,z)pY(y)=pXY(x,y)pYZ(y,z)for all x,y,z.p(x,y,z)\, p_Y(y) = p_{XY}(x,y)\, p_{YZ}(y,z) \quad \text{for all } x, y, z.(5)✦ The condition is symmetric in XX and ZZ, so it says equally that X→Y→ZX \to Y \to Z is a Markov chain.

The Claim

Theorem 1. Let pp be a joint distribution of random variables XX, YY, ZZ with values in finite sets 𝒳\mathcal{X}, 𝒴\mathcal{Y}, 𝒵\mathcal{Z}. Then H(X,Y,Z)+H(Y)≤H(X,Y)+H(Y,Z),H(X,Y,Z) + H(Y) \le H(X,Y) + H(Y,Z),(6)✦ and H(X,Y,Z)+H(Y)=H(X,Y)+H(Y,Z)if and only ifZ→Y→X.H(X,Y,Z) + H(Y) = H(X,Y) + H(Y,Z) \quad \text{if and only if} \quad Z \to Y \to X .(7)✦

What Is Checked

The theorem is stated over a joint distribution pp of three random variables on finite sets, the Shannon entropy (1) of pp and of its marginals (2), (3) and (4), and the Markov condition (5).

For every such distribution the library proves strong subadditivity (6) and the characterization (7) of its case of equality.