Independent scholarship · Open accessThe monthly digest

Indexed text attachment

entropy-sources-and-channels-in-higher-categories.tex

Source for Entropy, Sources, and Channels in Higher Categories

View paper · Download original file

Lines 1521–1620 of 4249. Source text is displayed literally.

1521 1522The failure in the stochastic case is not a technicality. An equivariant kernel $\nu\colon\AZ\to\BZ$1523consists of its time-zero marginal $\AZ\to B$ and, in addition, of the dependence among the output letters1524for a fixed input. The first part is what Khinchin's notion of the memory of a channel controls. The1525second is not controlled by it, and we shall see in \cref{ch:channels} that this is exactly where his1526treatment of ergodicity has a gap.1527 1528\section{Markov chains}1529 1530Let $Q=(q_{ab})$ be a stochastic matrix on $A$ and $\pi$ a stationary distribution, $\pi Q=\pi$. The1531\term{stationary Markov source} has block laws $\mu_n(x_1\dots x_n)=\pi(x_1)\,q_{x_1x_2}\cdots q_{x_{n-1}x_n}$.1532 1533\begin{proposition}\label{prop:markov}1534\Scl[\cite{Sha48}; \cite{Khi53}, \S3] The entropy of the stationary Markov source is1535\[ H(\mu)=\sum_a\pi(a)\,H(q_{a\,\cdot})=-\sum_{a,b}\pi(a)\,q_{ab}\log q_{ab}. \]1536\end{proposition}1537 1538\begin{proof}1539By the Markov property $c_n=H(x_0\st x_{-1})$ for all $n\ge1$.1540\end{proof}1541 1542\begin{example}\label{ex:markov}1543Let $A=\{0,1\}$ with $q_{01}=0.1$ and $q_{10}=0.3$. Then $\pi=(0.75,0.25)$ and1544$H(\mu)=0.75\,\hb(0.1)+0.25\,\hb(0.3)\approx0.572$ bits per letter. A source emitting independent letters with the1545same marginal has entropy $\hb(0.25)\approx0.811$. The difference is what the memory of the chain is worth to1546someone predicting it.1547\end{example}1548 1549\section{Finite-state sources as coalgebras}1550 1551A Markov chain is the simplest machine that emits a sequence. The general finite machine has a finite set1552$S$ of internal states and, at each step, emits a letter and moves to a new state, the pair being drawn1553from a distribution that depends on the current state. That is a morphism1554\[ c\colon S\longrightarrow A\times S\quad\text{in }\FinStoch, \]1555a coalgebra for the functor $A\times-$. With an initial distribution on $S$ it generates a process, called1556a hidden Markov source or a function of a Markov chain.1557 1558\begin{theorem}\label{thm:trace}1559\Sli[\cite{KK13}; cf.\ \cite{HJS07}] In $\BorelStoch$ the space $A^{\N}$ of one-sided sequences, with the1560isomorphism $A^{\N}\iso A\times A^{\N}$ splitting off the first letter, is the final coalgebra of the functor1561$A\times-$. For a coalgebra $c\colon S\to A\times S$ the unique coalgebra morphism $S\to A^{\N}$ assigns to1562each state the law of the sequence emitted from it.1563\end{theorem}1564 1565Uniqueness is the extension theorem again: a coalgebra morphism is determined on cylinders by induction on1566their length. If the initial distribution $\sigma$ is invariant for the state process, the emitted1567one-sided process is stationary and extends uniquely to a stationary source on $\AZ$.1568 1569The entropy of such a source is not given by a formula in terms of $c$ and $\sigma$ in general, but there1570is a case where it is. Call $c$ \term{unifilar} if the next state is a function of the current state and1571the emitted letter, $c(a,s'\st s)=e_s(a)\,[s'=\tau(s,a)]$.1572 1573\begin{proposition}\label{prop:unifilar}1574\Scl[\cite{Sha48}] For a unifilar coalgebra with invariant state distribution $\sigma$,1575$H(\mu)=\sum_s\sigma(s)\,H(e_s)$.1576\end{proposition}1577 1578\begin{proof}1579Let $s_0$ be the initial state. Given $s_0$ and $x_0,\dots,x_{n-1}$ the state $s_n$ is determined, so1580$H(x_n\st x_0,\dots,x_{n-1},s_0)=\sum_s\sigma(s)H(e_s)$ for every $n$. Hence $H_n\ge H(x_0\dots x_{n-1}\st s_0)=n\sum_s\sigma(s)H(e_s)$ and1581$H_n\le H(s_0)+H(x_0\dots x_{n-1}\st s_0)$. Divide by $n$.1582\end{proof}1583 1584A general coalgebra can be made unifilar at the cost of enlarging the state space. Replace the state by the1585\term{belief}, the conditional distribution $b\in\Delta(S)$ of the current state given the letters emitted1586so far. The belief emits a letter with distribution $e_b=\sum_sb(s)\,c(\,\cdot\,,S\st s)$ and is then updated1587by Bayes' rule to a new belief $\tau(b,a)$ that is a function of $b$ and the letter. This is the1588determinization of the coalgebra in the sense of the generalized powerset construction \cite{SBBR13},1589carried out for the distribution monad instead of the powerset.1590 1591\begin{theorem}[Blackwell]\label{thm:blackwell}1592\Srf[\cite{Bla57}] Let $\beta$ be a stationary distribution of the belief process on $\Delta(S)$ arising from1593the invariant initial distribution $\sigma$. Then1594\[ H(\mu)=\int_{\Delta(S)}H(e_b)\,d\beta(b), \]1595which is the formula of \cref{prop:unifilar} for the determinized coalgebra. For every $n\ge1$,1596\[ H(x_n\st x_0,\dots,x_{n-1},s_0)\ \le\ H(\mu)\ \le\ H(x_n\st x_0,\dots,x_{n-1}), \]1597and both bounds converge to $H(\mu)$.1598\end{theorem}1599 1600The measure $\beta$ can be singular and is not computable in closed form in general; that is the sense in1601which the entropy of a hidden Markov source has no formula. The bounds are effective.1602 1603\begin{example}\label{ex:hmm}1604Let the state follow the chain of \cref{ex:markov} and let the emitted letter be the state passed through a1605binary symmetric channel with flip probability $0.2$. The lower and upper bounds of \cref{thm:blackwell} are1606$0.9033$ and $0.9055$ at $n=4$ and agree to four places, at $0.9052$, from $n=8$ on. Hiding the state behind1607noise has raised the entropy from $0.572$ to $0.905$ bits per letter.1608\end{example}1609 1610\section{Entropy as an invariant}1611 1612Let $\phi\colon(\AZ,\mu)\to(\BZ,\eta)$ be a stationary code with $\phi\circ\mu=\eta$; one says that $\eta$ is a1613\term{factor} of $\mu$.1614 1615\begin{theorem}[Kolmogorov--Sinai]\label{thm:KS}1616\Scl[\cite{Kol58,Sin59}] If $\eta$ is a factor of $\mu$ then $H(\eta)\le H(\mu)$. In particular isomorphic1617stationary sources have the same entropy.1618\end{theorem}1619 1620\begin{proof}[Proof for sliding block codes]