Lean, informalized

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

Theorem 11.1 - The classical relative entropy of two distributions is zero only when they are equal

Relative entropy vanishes exactly when the distributions agree.

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

An experiment has finitely many outcomes xx, and two probability distributions pp and qq assign them the probabilities pxp_x and qxq_x; every outcome that is impossible under qq is impossible under pp as well. The relative entropy D(p∥q)D(p\|q) of pp to qq is then zero exactly when the two distributions are the same, px=qxp_x = q_x for every outcome.✦

Relative Entropy

The relative entropy D(p∥q)D(p\|q) of two families p=(px)p = (p_x) and q=(qx)q = (q_x) of real numbers on a finite set XX is the real number D(p∥q)=∑x∈Xpx(logpx−logqx),D(p\|q) = \sum_{x \in X} p_x \left( \log p_x - \log q_x \right),(1)✦ with log\log the natural logarithm.

The Claim

The library states the theorem for families of nonnegative numbers with the same total.

Theorem 1. Let pp and qq be families of nonnegative real numbers on a finite set XX with equal totals, ∑xpx=∑xqx\sum_x p_x = \sum_x q_x, and with px=0p_x = 0 wherever qx=0q_x = 0. Then their relative entropy vanishes exactly when they are equal: D(p∥q)=0⇔p=q.D(p\|q) = 0 \iff p = q.(2)✦

For probability distributions, whose totals are both 11, this is the exercise.

What Is Checked

The claim is stated over the relative entropy (1) of two real families on a finite set, and what the library proves about it is the equivalence (2) of the theorem above.