Joint entropy: Difference between revisions
References with page numbers. |
References for theorems. Summation over support set. |
||
Line 4: | Line 4: | ||
==Definition== |
==Definition== |
||
The joint [[Shannon entropy]] (in [[bit]]s) of two discrete [[random variable|random variables]] <math>X</math> and <math>Y</math> is defined as |
The joint [[Shannon entropy]] (in [[bit]]s) of two discrete [[random variable|random variables]] <math>X</math> and <math>Y</math> with images <math>\mathcal X</math> and <math>\mathcal Y</math> is defined as |
||
:<math>H(X,Y) = -\sum_{x} \sum_{y} P(x,y) \log_2[P(x,y)] \!</math> <ref name=cover1991>{{cite book |author1=Thomas M. Cover |author2=Joy A. Thomas |title=Elements of Information Theory |publisher=Wiley |location=Hoboken, New Jersey |year= |isbn=0-471-24195-4}}</ref>{{rp|16}} |
:<math>H(X,Y) = -\sum_{x\in\mathcal X} \sum_{y\in\mathcal Y} P(x,y) \log_2[P(x,y)] \!</math> <ref name=cover1991>{{cite book |author1=Thomas M. Cover |author2=Joy A. Thomas |title=Elements of Information Theory |publisher=Wiley |location=Hoboken, New Jersey |year= |isbn=0-471-24195-4}}</ref>{{rp|16}} |
||
where <math>x</math> and <math>y</math> are particular values of <math>X</math> and <math>Y</math>, respectively, <math>P(x,y)</math> is the [[joint probability]] of these values occurring together, and <math>P(x,y) \log_2[P(x,y)]</math> is defined to be 0 if <math>P(x,y)=0</math>. |
where <math>x</math> and <math>y</math> are particular values of <math>X</math> and <math>Y</math>, respectively, <math>P(x,y)</math> is the [[joint probability]] of these values occurring together, and <math>P(x,y) \log_2[P(x,y)]</math> is defined to be 0 if <math>P(x,y)=0</math>. |
||
Line 44: | Line 44: | ||
==Relations to other entropy measures== |
==Relations to other entropy measures== |
||
Joint entropy is used in the definition of [[conditional entropy]] |
Joint entropy is used in the definition of [[conditional entropy]]<ref name=cover1991 />{{rp|22}} |
||
:<math>H(X|Y) = H(Y,X) - H(Y)\,</math>, |
:<math>H(X|Y) = H(Y,X) - H(Y)\,</math>, |
||
and <math display="block">H(X_1,\dots,X_n) = \sum_{k=1}^n H(X_k|X_{k-1},\dots, X_1)</math>It is also used in the definition of [[mutual information]] |
and <math display="block">H(X_1,\dots,X_n) = \sum_{k=1}^n H(X_k|X_{k-1},\dots, X_1)</math>It is also used in the definition of [[mutual information]]<ref name=cover1991 />{{rp|21}} |
||
:<math>I(X;Y) = H(X) + H(Y) - H(X,Y)\,</math> |
:<math>I(X;Y) = H(X) + H(Y) - H(X,Y)\,</math> |
Revision as of 09:46, 8 October 2018
In information theory, joint entropy is a measure of the uncertainty associated with a set of variables.[1]
Definition
The joint Shannon entropy (in bits) of two discrete random variables and with images and is defined as
- [2]: 16
where and are particular values of and , respectively, is the joint probability of these values occurring together, and is defined to be 0 if .
For more than two random variables this expands to
where are particular values of , respectively, is the probability of these values occurring together, and is defined to be 0 if .
Properties
Nonnegativity
The joint entropy of a set of random variables is a nonnegative number.
Greater than individual entropies
The joint entropy of a set of variables is greater than or equal to all of the individual entropies of the variables in the set.
Less than or equal to the sum of individual entropies
The joint entropy of a set of variables is less than or equal to the sum of the individual entropies of the variables in the set. This is an example of subadditivity. This inequality is an equality if and only if and are statistically independent.[2]: 30
Relations to other entropy measures
Joint entropy is used in the definition of conditional entropy[2]: 22
- ,
and It is also used in the definition of mutual information[2]: 21
In quantum information theory, the joint entropy is generalized into the joint quantum entropy.
Joint differential entropy
Definition
The above definition is for discrete random variables and no more valid in the case of continuous random variables. The continuous version of discrete joint entropy is called joint differential (or continuous) entropy. Let and be a continuous random variables with a joint probability density function . The differential joint entropy is defined as
- .[2]: 249
For more than two continuous random variables the definition is generalized to:
- .
The integral is taken over the support of . It is possible that the integral does not exist in which case we say that the differential entropy is not defined.
Properties
As in the discrete case the joint differential entropy of a set of random variables is smaller or equal than the sum of the entropies of the individual random variables:
- [2]: 253
The following chain rule holds for two random variables:
In the case of more than two random variables this generalizes to:[2]: 253
Joint differential entropy is also used in the definition of the mutual information between continuous random variables:
References
- ^ Theresa M. Korn; Korn, Granino Arthur. Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review. New York: Dover Publications. ISBN 0-486-41147-8.
- ^ a b c d e f g Thomas M. Cover; Joy A. Thomas. Elements of Information Theory. Hoboken, New Jersey: Wiley. ISBN 0-471-24195-4.