The Theorem
Theorem 11.4 is the chain rule for conditional entropies. Let and be random variables, each with finitely many values. The uncertainty about the whole string once is known is counted one variable at a time: the uncertainty about given , plus that about given and , and so on up to , given and all the variables before it.✦
Distributions and Entropy
A random variable with values in a finite set is a function from a finite sample space to , where each point of carries a real weight . The law of , the image of under , is the distribution on that gives each value the total weight of the points where takes it: (1)✦
Random variables taken together form one random variable, with the list of their values: for a second random variable with values in a finite set , the law of the pair is the joint distribution of and on .
The Shannon entropy of a distribution on a finite set is (2)✦ with the natural logarithm, so that it is measured in nats.
The second marginal of a joint distribution on is the distribution of the second variable alone, obtained by summing out the first: (3)✦
For random variables, is their joint distribution ; subtracting the entropy of its second marginal from that of gives the conditional entropy : (4)✦ A list of random variables on either side of the bar, as in , is the one random variable the list forms.
The Claim
Theorem 1. Let be a finite sample space with real weights , let be random variables on with values in a finite set , and let be a random variable on with values in a finite set . Then for every natural number , (5)✦
For a probability distribution on this is Theorem 11.4.
What Is Checked
The claim is stated over the law (1) of a random variable on a finite sample space and over the conditional entropy (4) of the joint laws so formed, which rests on the Shannon entropy (2) and the second marginal (3). What the library proves about these constructions is the chain rule (5) itself.