Inequalities in information theory

Short description: Concept in information theory

Inequalities are very important in the study of information theory. There are a number of different contexts in which these inequalities appear.

## Contents

* 1 Entropic inequalities
* 2 Lower bounds for the Kullback–Leibler divergence
* 2.1 Gibbs' inequality
* 2.2 Kullback's inequality
* 2.3 Pinsker's inequality
* 3 Other inequalities
* 3.1 Hirschman uncertainty
* 3.2 Tao's inequality
* 4 Machine based proof checker of information-theoretic inequalities
* 5 See also
* 6 References
* 7 External links

## Entropic inequalities

Main article: Entropic vector

Consider a tuple X1,X2,…,Xn of n finitely (or at most countably) supported random variables on the same probability space. There are 2n subsets, for which (joint) entropies can be computed. For example, when n = 2, we may consider the entropies H(X1), H(X2), and H(X1,X2). They satisfy the following inequalities (which together characterize the range of the marginal and joint entropies of two random variables):

* H(X1)≥0
* H(X2)≥0
* H(X1)≤H(X1,X2)
* H(X2)≤H(X1,X2)
* H(X1,X2)≤H(X1)+H(X2).

In fact, these can all be expressed as special cases of a single inequality involving the conditional mutual information, namely

I(A;B|C)≥0,

where A, B, and C each denote the joint distribution of some arbitrary (possibly empty) subset of our collection of random variables. Inequalities that can be derived as linear combinations of this are known as Shannon-type inequalities.

For larger n there are further restrictions on possible values of entropy. To make this precise, a vector h in ℝ2n indexed by subsets of {1,…,n} is said to be entropic if there is a joint, discrete distribution of n random variables X1,…,Xn such that hI=H(Xi:i∈I) is their joint entropy, for each subset I. The set of entropic vectors is denoted Γn*, following the notation of Yeung.[1] It is not closed nor convex for n≥3, but its topological closure Γn*‾ is known to be convex and hence it can be characterized by the (infinitely many) linear inequalities satisfied by all entropic vectors, called entropic inequalities.

The set of all vectors that satisfy Shannon-type inequalities (but not necessarily other entropic inequalities) contains Γn*‾. This containment is strict for n≥4 and further inequalities are known as non-Shannon type inequalities. Zhang and Yeung reported the first non-Shannon-type inequality,[2] often referred to as the Zhang-Yeung inequality. Matus[3] proved that no finite set of inequalities can characterize (by linear combinations) all entropic inequalities. In other words, the region Γn*‾ is not a polytope.

## Lower bounds for the Kullback–Leibler divergence

A great many important inequalities in information theory are actually lower bounds for the Kullback–Leibler divergence. Even the Shannon-type inequalities can be considered part of this category, since the interaction information can be expressed as the Kullback–Leibler divergence of the joint distribution with respect to the product of the marginals, and thus these inequalities can be seen as a special case of Gibbs' inequality.

On the other hand, it seems to be much more difficult to derive useful upper bounds for the Kullback–Leibler divergence. This is because the Kullback–Leibler divergence DKL(P||Q) depends very sensitively on events that are very rare in the reference distribution Q. DKL(P||Q) increases without bound as an event of finite non-zero probability in the distribution P becomes exceedingly rare in the reference distribution Q, and in fact DKL(P||Q) is not even defined if an event of non-zero probability in P has zero probability in Q. (Hence the requirement that P be absolutely continuous with respect to Q.)

### Gibbs' inequality

Main article: Gibbs' inequality

This fundamental inequality states that the Kullback–Leibler divergence is non-negative.

### Kullback's inequality

Main article: Kullback's inequality

Another inequality concerning the Kullback–Leibler divergence is known as Kullback's inequality.[4] If P and Q are probability distributions on the real line with P absolutely continuous with respect to Q, and whose first moments exist, then

DKL(P∥Q)≥ΨQ*(μ'1(P)),

where ΨQ* is the large deviations rate function, i.e. the convex conjugate of the cumulant-generating function, of Q, and μ'1(P) is the first moment of P.

The Cramér–Rao bound is a corollary of this result.

### Pinsker's inequality

Main article: Pinsker's inequality

Pinsker's inequality relates Kullback-Leibler divergence and total variation distance. It states that if P, Q are two probability distributions, then

12DKL(e)(P∥Q)≥sup⁡{|P(A)−Q(A)|:A is an event to which probabilities are assigned.}.

where

DKL(e)(P∥Q)

is the Kullback-Leibler divergence in nats and

supA|P(A)−Q(A)|

is the total variation distance.

## Other inequalities

### Hirschman uncertainty

In 1957,[5] Hirschman showed that for a (reasonably well-behaved) function f:ℝ->ℂ such that ∫−∞∞|f(x)|2dx=1, and its Fourier transform g(y)=∫−∞∞f(x)e−2πixydx, the sum of the differential entropies of |f|2 and |g|2 is non-negative, i.e.

−∫−∞∞|f(x)|2log⁡|f(x)|2dx−∫−∞∞|g(y)|2log⁡|g(y)|2dy≥0.

Hirschman conjectured, and it was later proved,[6] that a sharper bound of log⁡(e/2), which is attained in the case of a Gaussian distribution, could replace the right-hand side of this inequality. This is especially significant since it implies, and is stronger than, Weyl's formulation of Heisenberg's uncertainty principle.

### Tao's inequality

Given discrete random variables X, Y, and Y′, such that X takes values only in the interval [−1, 1] and Y′ is determined by Y (such that H(Y′|Y)=0), we have[7][8]

E⁡(|E⁡(X|Y′)−E⁡(X∣Y)|)≤I(X;Y∣Y′)2log⁡2,

relating the conditional expectation to the conditional mutual information. This is a simple consequence of Pinsker's inequality. (Note: the correction factor log 2 inside the radical arises because we are measuring the conditional mutual information in bits rather than nats.)

## Machine based proof checker of information-theoretic inequalities

Several machine based proof checker algorithms are now available. Proof checker algorithms typically verify the inequalities as either true or false. More advanced proof checker algorithms can produce proof or counterexamples.[9] Quantum information-theoretic inequalities can be checked by the contraction map proof method.[10]

## See also

* Data processing inequality
* Cramér–Rao bound
* Entropy power inequality
* Entropic vector
* Fano's inequality
* Jensen's inequality
* Kraft inequality
* Pinsker's inequality

## References

1. ↑ Yeung, R.W. (1997). "A framework for linear information inequalities". IEEE Transactions on Information Theory 43 (6): 1924–1934. doi:10.1109/18.641556. )
2. ↑ Zhang, Z.; Yeung, R. W. (1998). "On characterization of entropy function via information inequalities". IEEE Transactions on Information Theory 44 (4): 1440–1452. doi:10.1109/18.681320.
3. ↑ Matus, F. (2007). "Infinitely many information inequalities". 2007 IEEE International Symposium on Information Theory.
4. ↑ Fuchs, Aimé; Letta, Giorgio (1970). "L'Inégalité de KULLBACK. Application à la théorie de l'estimation". Séminaire de Probabilités IV Université de Strasbourg. Lecture Notes in Mathematics. 124. Strasbourg. pp. 108–131. doi:10.1007/bfb0059338. ISBN 978-3-540-04913-5. http://www.numdam.org/item/SPS_1970__4__108_0/.
5. ↑ Hirschman, I. I. (1957). "A Note on Entropy". American Journal of Mathematics 79 (1): 152–156. doi:10.2307/2372390.
6. ↑ Beckner, W. (1975). "Inequalities in Fourier Analysis". Annals of Mathematics 102 (6): 159–182. doi:10.2307/1970980.
7. ↑ Tao, T. (2006). "Szemerédi's regularity lemma revisited". Contrib. Discrete Math. 1: 8–28. Bibcode: 2005math......4472T.
8. ↑ Ahlswede, Rudolf (2007). "The final form of Tao's inequality relating conditional expectation and conditional mutual information". Advances in Mathematics of Communications 1 (2): 239–242. doi:10.3934/amc.2007.1.239.
9. ↑ Ho, S.W.; Ling, L.; Tan, C.W.; Yeung, R.W. (2020). "Proving and Disproving Information Inequalities: Theory and Scalable Algorithms". IEEE Transactions on Information Theory 66 (9): 5525–5536. doi:10.1109/TIT.2020.2982642.
10. ↑ Bao, N; Naskar, J;, "Properties of the contraction map for holographic entanglement entropy inequalities" , J. High Energ. Phys. 06(2024), 3, DOI: https://doi.org/10.1007/JHEP06(2024)039, 07 June 2024.

## External links

* Thomas M. Cover, Joy A. Thomas. Elements of Information Theory, Chapter 16, "Inequalities in Information Theory" John Wiley & Sons, Inc. 1991 Print ISBN 0-471-06259-6 Online ISBN 0-471-20061-1
* Amir Dembo, Thomas M. Cover, Joy A. Thomas. Information Theoretic Inequalities. IEEE Transactions on Information Theory, Vol. 37, No. 6, November 1991. pdf
* ITIP: http://user-www.ie.cuhk.edu.hk/~ITIP/
* XITIP: http://xitip.epfl.ch
* N. R. Pai, Suhas Diggavi, T. Gläßle, E. Perron, R.Pulikkoonattu, R. W. Yeung, Y. Yan, oXitip: An Online Information Theoretic Inequalities Prover http://www.oxitip.com
* Siu Wai Ho, Lin Ling, Chee Wei Tan and Raymond W. Yeung, AITIP (Information Theoretic Inequality Prover): https://aitip.org
* Nivedita Rethnakar, Suhas Diggavi, Raymond. W. Yeung, InformationInequalities.jl: Exploring Information-Theoretic Inequalities, Julia Package, 2021 [1]

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Inequalities in information theory. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Inequalities_in_information_theory&oldid=4154146"