Log sum inequality

In mathematics, the log sum inequality is an inequality which is useful for proving several theorems in information theory.

Statement

Let and be nonnegative numbers. Denote the sum of all s by and the sum of all s by . The log sum inequality states that

with equality if and only if are equal for all .

Proof

Notice that after setting we have

where the inequality follows from Jensen's inequality since , , and is convex.

Applications

The log sum inequality can be used to prove several inequalities in information theory such as Gibbs' inequality or the convexity of Kullback-Leibler divergence.

For example, to prove Gibbs' inequality it is enough to substitute s for s, and s for s to get

Generalizations

The inequality remains valid for provided that and . The proof above holds for any function such that is convex, such as all continuous non-decreasing functions. Generalizations to convex functions other than the logarithm is given in Csiszár, 2004.

References

This article is issued from Wikipedia - version of the 6/18/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.