Jump to content

Joint entropy: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
delete inequility without symmetry on X, Y
m convert special characters found by Wikipedia:Typo Team/moss (via WP:JWB)
 
(97 intermediate revisions by 69 users not shown)
Line 1: Line 1:
{{Short description|Measure of information in probability and information theory}}
{{unreferenced|date=August 2006}}
{{Information theory}}
The '''joint entropy''' is an [[information entropy|entropy measure]] used in [[information theory]]. The joint entropy measures how much [[entropy (information theory)|entropy]] is contained in a joint system of two [[random variables]]. If the random variables are <math>X</math> and <math>Y</math>, the joint entropy is written <math>H(X,Y)</math>. Like other entropies, the joint entropy is measured in [[bit]]s.


[[Image:Entropy-mutual-information-relative-entropy-relation-diagram.svg|thumb|256px|right|A misleading<ref>{{Cite book|author=D.J.C. Mackay|title= Information theory, inferences, and learning algorithms|year= 2003|bibcode= 2003itil.book.....M}}{{rp|141}}</ref> [[Venn diagram]] showing additive, and subtractive relationships between various [[Quantities of information|information measures]] associated with correlated variables X and Y. The area contained by both circles is the joint entropy H(X,Y). The circle on the left (red and violet) is the [[Entropy (information theory)|individual entropy]] H(X), with the red being the [[conditional entropy]] H(X{{pipe}}Y). The circle on the right (blue and violet) is H(Y), with the blue being H(Y{{pipe}}X). The violet is the [[mutual information]] I(X;Y).]]
==Background==
Given a random variable <math>X</math>, the entropy <math>H(X)</math> describes our uncertainty about the value of <math>X</math>. If <math>X</math> consists of several events <math>x</math>, which each occur with probability <math>p_x</math>, then the entropy of <math>X</math> is


In [[information theory]], '''joint [[entropy (information theory)|entropy]]''' is a measure of the uncertainty associated with a set of [[random variables|variables]].<ref name=korn>{{cite book |author1=Theresa M. Korn|author1-link= Theresa M. Korn |author2=Korn, Granino Arthur |title=Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review |date= January 2000 |publisher=Dover Publications |location=New York |isbn=0-486-41147-8 }}</ref>
:<math>H(X) = -\sum_x p_x \log(p_x) \!</math>


==Definition==
Consider another random variable <math>Y</math>, containing [[event (probability theory)|event]]s <math>y</math> occurring with probabilities <math>p_y</math>. <math>Y</math> has entropy <math>H(Y)</math>.
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<ref name=cover1991>{{cite book |author1=Thomas M. Cover |author2=Joy A. Thomas |title=Elements of Information Theory |date=18 July 2006 |publisher=Wiley |location=Hoboken, New Jersey |isbn=0-471-24195-4}}</ref>{{rp|16}}


{{Equation box 1
However, if <math>X</math> and <math>Y</math> describe related events, the total entropy of the system may not be <math>H(X)+H(Y)</math>. For example, imagine we choose an [[integer]] between 1 and 8, with equal probability for each integer. Let <math>X</math> represent whether the integer is [[even and odd numbers|even]], and <math>Y</math> represent whether the integer is [[prime number|prime]]. One-half of the integers between 1 and 8 are even, and one-half are prime, so <math>H(X)=H(Y)=1</math>. However, if we know that the integer is even, there is only a 1 in 4 chance that it is also prime; the distributions are related. The total entropy of the system is less than 2 bits. We need a way of measuring the total entropy of both systems.
|indent =
|title=
|equation = {{NumBlk||<math>\Eta(X,Y) = -\sum_{x\in\mathcal X} \sum_{y\in\mathcal Y} P(x,y) \log_2[P(x,y)]</math>|{{EquationRef|Eq.1}}}}
|cellpadding= 6
|border
|border colour = #0073CF}}


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>.
==Definition==
We solve this by considering each ''pair'' of possible outcomes <math>(x,y)</math>. If each pair of outcomes occurs with probability <math>p_{x,y}</math>, the joint entropy is defined as


For more than two random variables <math>X_1, ..., X_n</math> this expands to
:<math>H(X,Y) = -\sum_{x,y} p_{x,y} \log(p_{x,y}) \!</math>

{{Equation box 1
|indent =
|title=
|equation = {{NumBlk||<math>\Eta(X_1, ..., X_n) =
-\sum_{x_1 \in\mathcal X_1} ... \sum_{x_n \in\mathcal X_n} P(x_1, ..., x_n) \log_2[P(x_1, ..., x_n)]</math>|{{EquationRef|Eq.2}}}}
|cellpadding= 6
|border
|border colour = #0073CF}}

where <math>x_1,...,x_n</math> are particular values of <math>X_1,...,X_n</math>, respectively, <math>P(x_1, ..., x_n)</math> is the probability of these values occurring together, and <math>P(x_1, ..., x_n) \log_2[P(x_1, ..., x_n)]</math> is defined to be 0 if <math>P(x_1, ..., x_n)=0</math>.


==Properties==
==Properties==
===Greater than subsystem entropies===
The joint entropy is always at least equal to the entropies of the original system; adding a new system can never reduce the available uncertainty.


===Nonnegativity===
:<math>H(X,Y) \geq H(X)</math>


The joint entropy of a set of random variables is a nonnegative number.
The first inequality is an equality if and only if <math>Y</math> is a (deterministic) [[function (mathematics)|function]] of <math>X</math>.


:<math>\Eta(X,Y) \geq 0</math>
===Subadditivity===


:<math>\Eta(X_1,\ldots, X_n) \geq 0</math>
Two systems, considered together, can never have more entropy than the sum of the entropy in each of them. This is an example of [[subadditivity]].


===Greater than individual entropies===
:<math>H(X,Y) \leq H(X) + H(Y)</math>


The joint entropy of a set of variables is greater than or equal to the maximum of all of the individual entropies of the variables in the set.
This inequality is an equality if and only if <math>X</math> and <math>Y</math> are [[statistically independent]].


:<math>\Eta(X,Y) \geq \max \left[\Eta(X),\Eta(Y) \right]</math>
===Bounds===


:<math>\Eta \bigl(X_1,\ldots, X_n \bigr) \geq \max_{1 \le i \le n}
Like other entropies, <math>H(X,Y) \geq 0</math> always.
\Bigl\{ \Eta\bigl(X_i\bigr) \Bigr\}</math>


===Less than or equal to the sum of individual entropies===
==Relations to Other Entropy Measures==


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 <math>X</math> and <math>Y</math> are [[statistically independent]].<ref name=cover1991 />{{rp|30}}
The joint entropy is used in the definitions of the [[conditional entropy]]:


:<math>H(X|Y) = H(X,Y) - H(Y)</math>
:<math>\Eta(X,Y) \leq \Eta(X) + \Eta(Y)</math>


:<math>\Eta(X_1,\ldots, X_n) \leq \Eta(X_1) + \ldots + \Eta(X_n)</math>
and the [[mutual information]]:


==Relations to other entropy measures==
:<math>I(X;Y) = H(X) + H(Y) - H(X,Y)</math>

Joint entropy is used in the definition of [[conditional entropy]]<ref name=cover1991 />{{rp|22}}

:<math>\Eta(X|Y) = \Eta(X,Y) - \Eta(Y)\,</math>,

and

:<math>\Eta(X_1,\dots,X_n) = \sum_{k=1}^n \Eta(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>\operatorname{I}(X;Y) = \Eta(X) + \Eta(Y) - \Eta(X,Y)\,</math>.


In [[quantum information theory]], the joint entropy is generalized into the [[joint quantum entropy]].
In [[quantum information theory]], the joint entropy is generalized into the [[joint quantum entropy]].


==Joint differential entropy==
[[Category:Entropy]]
===Definition===
The above definition is for discrete random variables and just as valid in the case of continuous random variables. The continuous version of discrete joint entropy is called ''joint differential (or continuous) entropy''. Let <math>X</math> and <math>Y</math> be a continuous random variables with a [[joint probability density function]] <math>f(x,y)</math>. The differential joint entropy <math>h(X,Y)</math> is defined as<ref name=cover1991 />{{rp|249}}

{{Equation box 1
|indent =
|title=
|equation = {{NumBlk||<math>h(X,Y) = -\int_{\mathcal X , \mathcal Y} f(x,y)\log f(x,y)\,dx dy</math>|{{EquationRef|Eq.3}}}}
|cellpadding= 6
|border
|border colour = #0073CF}}

For more than two continuous random variables <math>X_1, ..., X_n</math> the definition is generalized to:

{{Equation box 1
|indent =
|title=
|equation = {{NumBlk||<math>h(X_1, \ldots,X_n) = -\int f(x_1, \ldots,x_n)\log f(x_1, \ldots,x_n)\,dx_1 \ldots dx_n</math>|{{EquationRef|Eq.4}}}}
|cellpadding= 6
|border
|border colour = #0073CF}}

The [[integral]] is taken over the support of <math>f</math>. 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:
:<math>h(X_1,X_2, \ldots,X_n) \le \sum_{i=1}^n h(X_i)</math><ref name=cover1991 />{{rp|253}}

The following chain rule holds for two random variables:
:<math>h(X,Y) = h(X|Y) + h(Y)</math>
In the case of more than two random variables this generalizes to:<ref name=cover1991 />{{rp|253}}
:<math>h(X_1,X_2, \ldots,X_n) = \sum_{i=1}^n h(X_i|X_1,X_2, \ldots,X_{i-1})</math>
Joint differential entropy is also used in the definition of the [[mutual information]] between continuous random variables:
:<math>\operatorname{I}(X,Y)=h(X)+h(Y)-h(X,Y)</math>

== References ==
{{Reflist}}

[[Category:Entropy and information]]


[[de:Blockentropie]]
[[de:Bedingte Entropie#Blockentropie]]

Latest revision as of 03:22, 10 November 2024

A misleading[1] Venn diagram showing additive, and subtractive relationships between various information measures associated with correlated variables X and Y. The area contained by both circles is the joint entropy H(X,Y). The circle on the left (red and violet) is the individual entropy H(X), with the red being the conditional entropy H(X|Y). The circle on the right (blue and violet) is H(Y), with the blue being H(Y|X). The violet is the mutual information I(X;Y).

In information theory, joint entropy is a measure of the uncertainty associated with a set of variables.[2]

Definition

[edit]

The joint Shannon entropy (in bits) of two discrete random variables and with images and is defined as[3]: 16 

(Eq.1)

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

(Eq.2)

where are particular values of , respectively, is the probability of these values occurring together, and is defined to be 0 if .

Properties

[edit]

Nonnegativity

[edit]

The joint entropy of a set of random variables is a nonnegative number.

Greater than individual entropies

[edit]

The joint entropy of a set of variables is greater than or equal to the maximum of all of the individual entropies of the variables in the set.

Less than or equal to the sum of individual entropies

[edit]

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.[3]: 30 

Relations to other entropy measures

[edit]

Joint entropy is used in the definition of conditional entropy[3]: 22 

,

and

.

It is also used in the definition of mutual information[3]: 21 

.

In quantum information theory, the joint entropy is generalized into the joint quantum entropy.

Joint differential entropy

[edit]

Definition

[edit]

The above definition is for discrete random variables and just as 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[3]: 249 

(Eq.3)

For more than two continuous random variables the definition is generalized to:

(Eq.4)

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

[edit]

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:

[3]: 253 

The following chain rule holds for two random variables:

In the case of more than two random variables this generalizes to:[3]: 253 

Joint differential entropy is also used in the definition of the mutual information between continuous random variables:

References

[edit]
  1. ^ D.J.C. Mackay (2003). Information theory, inferences, and learning algorithms. Bibcode:2003itil.book.....M.: 141 
  2. ^ Theresa M. Korn; Korn, Granino Arthur (January 2000). Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review. New York: Dover Publications. ISBN 0-486-41147-8.
  3. ^ a b c d e f g Thomas M. Cover; Joy A. Thomas (18 July 2006). Elements of Information Theory. Hoboken, New Jersey: Wiley. ISBN 0-471-24195-4.