The inequality is true for ordinary addition, and also for addition in a group. For any fixed , the translation is injective, so it merely relabels the probability masses in the conditional distribution. Since are independent random variables,Averaging over and using conditioning reduces entropy proves entropy monotonicity under independent addition:There is no requirement that remain in the original finite alphabet. The proof also gives by symmetry. Independence matters: for a nonconstant and , the sum is constant while .
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 30 1 c Solution Created 2026-10-03 Updated 2026-10-14
Fix . Take independent random variables and . Their convolution isby the binomial theorem. Thus has Poisson distribution with parameter . Conditioning on only translates , so . The entropy monotonicity under independent addition yields .
In fact the inequality is strict. The covariance is positive, so and are not independent random variables. Their information entropies are finite, and the equality criterion from part (a) excludes equality. Therefore the Poisson entropy monotonicity gives the stronger conclusion
Poisson entropy monotonicity Created 2026-10-14 Updated 2026-11-05
The information entropy of a Poisson distribution is strictly increasing for . Given , take independent and . Their sum has Poisson distribution with mean , so entropy monotonicity under independent addition gives . All these information entropies are finite, and excludes equality.
// Target: probability-and-statistics.bigb