Asymptotic equipartition property explained

In information theory, the asymptotic equipartition property (AEP) is a general property of the output samples of a stochastic source. It is fundamental to the concept of typical set used in theories of data compression.

Roughly speaking, the theorem states that although there are many series of results that may be produced by a random process, the one actually produced is most probably from a loosely defined set of outcomes that all have approximately the same chance of being the one actually realized. (This is a consequence of the law of large numbers and ergodic theory.) Although there are individual outcomes which have a higher probability than any outcome in this set, the vast number of outcomes in the set almost guarantees that the outcome will come from the set. One way of intuitively understanding the property is through Cramér's large deviation theorem, which states that the probability of a large deviation from mean decays exponentially with the number of samples. Such results are studied in large deviations theory; intuitively, it is the large deviations that would violate equipartition, but these are unlikely.

In the field of pseudorandom number generation, a candidate generator of undetermined quality whose output sequence lies too far outside the typical set by some statistical criteria is rejected as insufficiently random. Thus, although the typical set is loosely defined, practical notions arise concerning sufficient typicality.

Definition

Given a discrete-time stationary ergodic stochastic process

X on the probability space (\Omega, B, p) , the asymptotic equipartition property is an assertion that, almost surely,$$-\backslash frac\; \backslash log\; p(X\_1,\; X\_2,\; \backslash dots,\; X\_n)\; \backslash to\; H(X)\; \backslash quad\; \backslash text\; \backslash quad\; n\backslash to\backslash infty$$where H(X) or simply H denotes the entropy rate of X , which must exist for all discrete-time stationary processes including the ergodic ones. The asymptotic equipartition property is proved for finite-valued (i.e. |\Omega| < inf ty ) stationary ergodic stochastic processes in the Shannon–McMillan–Breiman theorem using the ergodic theory and for any i.i.d. sources directly using the law of large numbers in both the discrete-valued case (where H is simply the entropy of a symbol) and the continuous-valued case (where H is the differential entropy instead). The definition of the asymptotic equipartition property can also be extended for certain classes of continuous-time stochastic processes for which a typical set exists for long enough observation time. The convergence is proven almost sure in all cases.

Discrete-time i.i.d. sources

Given

X is an i.i.d. source which may take values in the alphabet l{X} , its time series X _{1,\ldots,X} _{n} is i.i.d. with entropy H(X) . The weak law of large numbers gives the asymptotic equipartition property with convergence in probability,$$\backslash lim\_\backslash Pr\backslash left[\backslash left|-\backslash frac\{1\}\{n\}\; \backslash log\; p(X\_1,\; X\_2,\; \backslash ldots,\; X\_n)\; -\; H(X)\backslash right|>\; \backslash varepsilon\backslash right]=0\; \backslash qquad\; \backslash forall\; \backslash varepsilon\; >\; 0.$$since the entropy is equal to the expectation of $$-\backslash frac\; \backslash log\; p(X\_1,\; X\_2,\; \backslash ldots,\; X\_n).$$

The strong law of large numbers asserts the stronger almost sure convergence,$$\backslash Pr\backslash left[\backslash lim\_\{n\backslash to\backslash infty\}\; -\; \backslash frac\{1\}\{n\}\; \backslash log\; p(X\_1,\; X\_2,\backslash ldots,\; X\_n)\; =\; H(X)\backslash right]=1.$$Convergence in the sense of L1 asserts an even stronger$$\backslash mathbb\; \backslash left[\backslash left|\backslash lim\_\{n\backslash to\backslash infty\}\; -\; \backslash frac\{1\}\{n\}\; \backslash log\; p(X\_1,\; X\_2,\backslash ldots,\; X\_n)\; -\; H(X)\backslash right|\backslash right]=\; 0$$

Discrete-time finite-valued stationary ergodic sources

Consider a finite-valued sample space

\Omega , i.e. |\Omega| < inf ty , for the discrete-time stationary ergodic process X: = \{X _{n\}} defined on the probability space (\Omega, B, p) . The Shannon–McMillan–Breiman theorem, due to Claude Shannon, Brockway McMillan, and Leo Breiman, states that we have convergence in the sense of L1.^[1] Chung Kai-lai generalized this to the case where X may take value in a set of countable infinity, provided that the entropy rate is still finite.^[2]

Non-stationary discrete-time source producing independent symbols

The assumptions of stationarity/ergodicity/identical distribution of random variables is not essential for the asymptotic equipartition property to hold. Indeed, as is quite clear intuitively, the asymptotic equipartition property requires only some form of the law of large numbers to hold, which is fairly general. However, the expression needs to be suitably generalized, and the conditions need to be formulated precisely.

We assume that the source is producing independent symbols, with possibly different output statistics at each instant. We assume that the statistics of the process are known completely, that is, the marginal distribution of the process seen at each time instant is known. The joint distribution is just the product of marginals. Then, under the condition (which can be relaxed) that

Var [ log p(X _{i)]<M} for all i, for some M > 0, the following holds (AEP):where $$\backslash overline\_n(X)=\backslash fracH(X\_1,X\_2,\backslash ldots,X\_n)$$

Applications

The asymptotic equipartition property for non-stationary discrete-time independent process leads us to (among other results) the source coding theorem for non-stationary source (with independent output symbols) and noisy-channel coding theorem for non-stationary memoryless channels.

Measure-theoretic form

$T$ is a measure-preserving map on the probability space $\backslash Omega$.

If $P$ is a finite or countable partition of $\backslash Omega$, then its entropy is

H(P) : = - \sum _{p} \mu(p) ln \mu(p) with the convention that 0ln 0 = 0 .

We only consider partitions with finite entropy: .

If $P$ is a finite or countable partition of $\backslash Omega$, then we construct a sequence of partitions by iterating the map:$$P^\; :=\; P\; \backslash vee\; T^P\; \backslash vee\; \backslash dots\; \backslash vee\; T^P$$where $P\; \backslash vee\; Q$ is the least upper bound partition, that is, the least refined partition that refines both $P$ and $Q$:$$P\backslash vee\; Q\; :=\; \backslash$$Write $P(x)$ to be the set in $P$ where $x$ falls in. So, for example, $P^(x)$ is the $n$ -letter initial segment of the $(P,\; T)$ -name of $x$.

Write $I\_(x)$ to be the information (in units of nats) about $x$ we can recover, if we know which element in the partition $P$ that $x$ falls in:$$I\_\; :=\; -\backslash ln\; \backslash mu(P(x))$$Similarly, the conditional information of partition $P$, conditional on partition $Q$, about $x$, is$$I\_(x)\; :=\; -\backslash ln\; \backslash frac$$$h\_T(P)$ is the Kolmogorov-Sinai entropy$$h\_T(P)\; :=\; \backslash lim\_n\; \backslash frac\; 1n\; H(P^)\; =\; \backslash lim\_n\; E\_\backslash left[\backslash frac\; 1n\; I\_\{P^\{(n)\}\}(x)\backslash right]$$In other words, by definition, we have a convergence in expectation. The SMB theorem states that when $T$ is ergodic, we have convergence in L1.^[3]

If $T$ is not necessarily ergodic, then the underlying probability space would be split up into multiple subsets, each invariant under $T$. In this case, we still have L1 convergence to some function, but that function is no longer a constant function.^[4]

When $T$ is ergodic, $\backslash mathcal\; I$ is trivial, and so the function$$x\; \backslash mapsto\; E\backslash left[\backslash lim\_n\; I\_\{P\; |\; \backslash vee\_\{k\; =\; 1\}^n\; T^\{-k\}P\}\; \backslash big|\backslash ;\; \backslash mathcal\; I\; \backslash right]$$simplifies into the constant function $x\backslash mapsto\; E\backslash left[\backslash lim\_n\; I\_\{P\; |\; \backslash vee\_\{k\; =\; 1\}^n\; T^\{-k\}P\}\; \backslash right]$, which by definition, equals $\backslash lim\_n\; H(P\; |\; \backslash vee\_^n\; T^P)$, which equals $h\_T(P)$ by a proposition.

Continuous-time stationary ergodic sources

Discrete-time functions can be interpolated to continuous-time functions. If such interpolation f is measurable, we may define the continuous-time stationary process accordingly as

\tilde{X}: = f\circ X . If the asymptotic equipartition property holds for the discrete-time process, as in the i.i.d. or finite-valued stationary ergodic cases shown above, it automatically holds for the continuous-time stationary process derived from it by some measurable interpolation. i.e.$$-\backslash frac\; \backslash log\; p(\backslash tilde\_0^\backslash tau)\; \backslash to\; H(X)$$where n corresponds to the degree of freedom in time . and are the entropy per unit time and per degree of freedom respectively, defined by Shannon.

An important class of such continuous-time stationary process is the bandlimited stationary ergodic process with the sample space being a subset of the continuous

l{L} _{2} functions. The asymptotic equipartition property holds if the process is white, in which case the time samples are i.i.d., or there exists T > 1/2W, where W is the nominal bandwidth, such that the T-spaced time samples take values in a finite set, in which case we have the discrete-time finite-valued stationary ergodic process.

Any time-invariant operations also preserves the asymptotic equipartition property, stationarity and ergodicity and we may easily turn a stationary process to non-stationary without losing the asymptotic equipartition property by nulling out a finite number of time samples in the process.

Category theory

P ^{N=P x} … x P of a measure space P, this sequence admits an asymptotically equivalent sequence H_N of homogeneous measure spaces (i.e. all sets have the same measure; all morphisms are invariant under the group of automorphisms, and thus factor as a morphism to the terminal object).

The above requires a definition of asymptotic equivalence. This is given in terms of a distance function, giving how much an injective correspondence differs from an isomorphism. An injective correspondence

\pi: P\to Q is a partially defined map that is a bijection; that is, it is a bijection between a subset P'\subset P and Q'\subset Q . Then define$$|P-Q|\_\backslash pi\; =\; |P\; \backslash setminus\; P\text{'}|\; +\; |Q\; \backslash setminus\; Q\text{'}|,$$where |S| denotes the measure of a set S. In what follows, the measure of P and Q are taken to be 1, so that the measure spaces are probability spaces. This distance |P - Q| _{\pi} is commonly known as the earth mover's distance or Wasserstein metric.

Similarly, define$$|\backslash log\; P:Q|\_\backslash pi\; =\; \backslash frac.$$with

|\operatorname{set}(P)| taken to be the counting measure on P. Thus, this definition requires that P be a finite measure space. Finally, let$$\backslash text\_\backslash pi(P,Q)\; =\; |P-Q|\_\backslash pi\; +|\backslash log\; P:Q|\_\backslash pi.$$

A sequence of injective correspondences

\pi _{N:P} _{N\to} Q _{N} are then asymptotically equivalent when$$\backslash text\_(P\_N,Q\_N)\; \backslash to\; 0\; \backslash quad\backslash text\backslash quad\; N\backslash to\backslash infty.$$

Given a homogenous space sequence H_N that is asymptotically equivalent to P^N, the entropy H(P) of P may be taken as$$H(P)\; =\; \backslash lim\_\backslash frac\; |\backslash operatorname(H\_N)|.$$

See also

• Cramér's theorem (large deviations)
• Noisy-channel coding theorem
• Shannon's source coding theorem

References

Journal articles

• Claude E. Shannon. "A Mathematical Theory of Communication". Bell System Technical Journal, July/October 1948.
• Sergio Verdu and Te Sun Han. "The Role of the Asymptotic Equipartition Property in Noiseless Source Coding." IEEE Transactions on Information Theory, 43(3): 847–857, 1997.

Textbooks

• Book: Cover. Thomas M. . Thomas . Joy A. . Elements of Information Theory . first . Wiley . Hoboken, New Jersey . 978-0-471-24195-9. 1991 .
• Book: MacKay, David J.C. . David J. C. MacKay. Information Theory, Inference, and Learning Algorithms. Cambridge University Press. 2003. 0-521-64298-1.

Notes and References

1. Book: Hawkins, Jane . Ergodic dynamics: from basic theory to applications . 2021 . Springer . 978-3-030-59241-7 . Graduate texts in mathematics . Cham, Switzerland . 204.
2. Algoet . Paul H. . Cover . Thomas M. . A Sandwich Proof of the Shannon-McMillan-Breiman Theorem . The Annals of Probability . 16 . 2 . 899–909 . 1988. 10.1214/aop/1176991794 .
3. Book: Petersen, Karl E. . Ergodic Theory . 1983 . Cambridge University Press . 978-0-521-38997-6 . Cambridge Studies in Advanced Mathematics . Cambridge . 6.2. The Shannon—McMillan—Breiman Theorem.
4. Book: Pollicott . Mark . Dynamical Systems and Ergodic Theory . Yuri . Michiko . 1998 . Cambridge University Press . 978-0-521-57294-1 . London Mathematical Society Student Texts . Cambridge . 12.4. The Shannon-McMillan-Brieman theorem.
5. Misha Gromov, (2012) "In a Search for a Structure, Part 1: On Entropy". (See page 5, where the equipartition property is called the 'Bernoulli approximation theorem'.)