entropy example 3
From Scholarpedia
| Tomasz Downarowicz (2007), Scholarpedia, 2(11):3901. | revision #25684 [link to/cite this article] | |||||||||||||||||||
Consider the unit square representing the space
, where the probability is the Lebesgue measure (i.e., the
surface area), and the partition
into four sets
of probabilities
, respectively,
as shown in Figure 1.
The information function equals
on
and
,
on
and
on
.
The entropy of
equals
The arrangement of questions that optimizes the expected value of the number of questions asked is the following (see Figure 2):
- Question 1. Are you in the left half?
The answer no, locates
in
using one bit. Otherwise the next question is:
- Question 2. Are you in the central square of the left half?
The yes answer locates
in
using two bits. If not, the last question is:
- Question 3. Are you in the top half of the whole square?
Now yes and no locate
in
or
, respectively.
This takes three bits.
In this example the number of questions equals exactly the information function at every point
and the expected number of question equals the entropy
. There does not exist a better
arrangement of questions. Of course such accuracy is possible only when the probabilities of the
sets
are powers of
.

