World Library  
Flag as Inappropriate
Email this Article

Gibbs' inequality

Article Id: WHEBN0002035678
Reproduction Date:

Title: Gibbs' inequality  
Author: World Heritage Encyclopedia
Language: English
Subject: Josiah Willard Gibbs, Kullback's inequality, Coding theory, Information theory
Collection: Articles Containing Proofs, Coding Theory, Inequalities, Information Theory
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Gibbs' inequality

In information theory, Gibbs' inequality is a statement about the mathematical entropy of a discrete probability distribution. Several other bounds on the entropy of probability distributions are derived from Gibbs' inequality, including Fano's inequality. It was first presented by J. Willard Gibbs in the 19th century.

Contents

  • Gibbs' inequality 1
  • Proof 2
  • Alternative proofs 3
  • Corollary 4
  • See also 5

Gibbs' inequality

Suppose that

P = \{ p_1 , \ldots , p_n \}

is a probability distribution. Then for any other probability distribution

Q = \{ q_1 , \ldots , q_n \}

the following inequality between positive quantities (since the pi and qi are positive numbers less than one) holds

- \sum_{i=1}^n p_i \log_2 p_i \leq - \sum_{i=1}^n p_i \log_2 q_i

with equality if and only if

p_i = q_i \,

for all i. Put in words, the information entropy of a distribution P is less than or equal to its cross entropy with any other distribution Q.

The difference between the two quantities is the KullbackÔÇôLeibler divergence or relative entropy, so the inequality can also be written:

D_{\mathrm{KL}}(P\|Q) \equiv \sum_{i=1}^n p_i \log_2 \frac{p_i}{q_i} \geq 0.

Note that the use of base-2 logarithms is optional, and allows one to refer to the quantity on each side of the inequality as an "average surprisal" measured in bits.

Proof

Since

\log_2 a = \frac{ \ln a }{ \ln 2 }

it is sufficient to prove the statement using the natural logarithm (ln). Note that the natural logarithm satisfies

\ln x \leq x-1

for all x > 0 with equality if and only if x=1.

Let I denote the set of all i for which pi is non-zero. Then

- \sum_{i \in I} p_i \ln \frac{q_i}{p_i} \geq - \sum_{i \in I} p_i \left( \frac{q_i}{p_i} - 1 \right)
= - \sum_{i \in I} q_i + \sum_{i \in I} p_i
= - \sum_{i \in I} q_i + 1 \geq 0.

So

- \sum_{i \in I} p_i \ln q_i \geq - \sum_{i \in I} p_i \ln p_i

and then trivially

- \sum_{i=1}^n p_i \ln q_i \geq - \sum_{i=1}^n p_i \ln p_i

since the right hand side does not grow, but the left hand side may grow or may stay the same.

For equality to hold, we require:

  1. \frac{q_i}{p_i} = 1 for all i \in I so that the approximation \ln \frac{q_i}{p_i} = \frac{q_i}{p_i} -1 is exact.
  2. \sum_{i \in I} q_i = 1 so that equality continues to hold between the third and fourth lines of the proof.

This can happen if and only if

p_i = q_i

for i = 1, ..., n.

Alternative proofs

The result can alternatively be proved using Jensen's inequality or log sum inequality.

Corollary

The entropy of P is bounded by:

H(p_1, \ldots , p_n) \leq \log n.

The proof is trivial - simply set q_i = 1/n for all i.

See also

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.