Indexed text attachment
evolutionary-game-theory-in-higher-categories.tex
Source for Evolutionary Game Theory in Higher Categories
View paper · Download original file
Lines 1657–1756 of 2037. Source text is displayed literally.
1657the covering functor of \Cref{thm:covering} be extended from coverings to fibrations and to stochastic update1658rules, so that it applies to the Moran process on graphs and explains amplifiers as it explains waves? (4) Is1659there a setting in which the two limits of \Cref{rem:limits} are the two legs of one universal construction?1660 1661\section*{Notes}1662 1663For the source's own assessment of what evolutionary models explain, see its concluding section. A treatment of1664classical game theory in the style of this volume is \cite{GIHC}; relative entropy as a functor, used in1665\Cref{ch:replicator}, is developed in \cite{ESCHC}; the index theory used in \Cref{ch:index} is in1666\cite{DTHC}.1667%% ---- end ch/08-coda.tex ----1668\appendix1669%% ---- begin ch/A-toolkit.tex ----1670\chapter{Toolkit}\label{app:toolkit}1671 1672This appendix collects the general notions used in the text, in the order in which they are needed.1673 1674\paragraph{Categories and functors.} A category has objects, morphisms and an associative composition with1675identities; a functor preserves them. A statement of the form ``the construction $X\mapsto F(X)$ is natural''1676means that $F$ is a functor: every map $X\to Y$ of the relevant kind induces a map $F(X)\to F(Y)$, compatibly1677with composition. A group acting on $X$ then acts on $F(X)$, a subobject of $X$ gives an invariant subobject of1678$F(X)$, and a quotient of $X$ gives a quotient of $F(X)$.1679 1680\paragraph{Convex spaces and the distribution monad.} For a finite set $S$, $\Dist(S)$ is the simplex of1681probability distributions on $S$. A map $f\colon S\to T$ induces the pushforward $f_*\colon\Dist(S)\to\Dist(T)$, and1682$\Dist$ is a monad on finite sets whose algebras are convex spaces \cite{Fri09}. A map $\Dist(S)\to\R$ is affine1683exactly when it is the expectation of a function on $S$; a payoff is a function on $S\times S$, and its1684biaffine extension is the mixed extension.1685 1686\paragraph{Stochastic maps.} $\FinStoch$ is the category of finite sets and stochastic matrices. A Markov1687chain on a finite set is an endomorphism in it. A state is absorbing if its row is a point mass; a function1688is harmonic if it is fixed by the matrix acting on functions.1689 1690\paragraph{Dynamical systems.} A flow on a compact space $X$ is a continuous action of $\R$; a map of flows is1691a continuous map commuting with the actions. A rest point is \emph{Lyapunov stable} if orbits starting near it1692stay near it and \emph{asymptotically stable} if in addition they converge to it. A \emph{Lyapunov function}1693is a function that decreases along orbits; a strict one certifies asymptotic stability.1694 1695\paragraph{Index and Euler characteristic.} For a vector field with non-degenerate zeros on a compact1696manifold with boundary on which it points outward, the sum over zeros of the sign of the determinant of the1697derivative is the Euler characteristic (Poincar\'e--Hopf). A simplex is contractible, so its Euler1698characteristic is $1$.1699 1700\paragraph{Cochains on a graph.} A $0$-cochain is a function on vertices and a $1$-cochain an antisymmetric1701function on ordered pairs of adjacent vertices. The differential sends $r$ to $(i,j)\mapsto r_i-r_j$. A1702$1$-cochain is closed if its sum around every triangle vanishes. On the complete graph every closed1703$1$-cochain is a differential.1704 1705\paragraph{Coverings and symmetries.} A covering of graphs is a homomorphism bijective on the neighbourhood1706of each vertex. An automorphism of a graph is a covering of the graph by itself. A map between dynamical1707systems on configuration spaces that commutes with the updates sends orbits to orbits, periodic orbits to1708periodic orbits of period dividing the original, and invariant sets to invariant sets.1709%% ---- end ch/A-toolkit.tex ----1710%% ---- begin ch/B-concordance.tex ----1711\chapter{Concordance with the Source}\label{app:concordance}1712 1713The table lists the sections of J.~McKenzie Alexander, \emph{Evolutionary Game Theory} \cite{Alex23}, with the1714place in this volume where their content is treated and the form it takes there. The source was read from a1715text extraction of its PDF; its definitions and theorems were located by search and read in context, and the1716remaining text was read selectively, section by section. Figures were not consulted except through their1717captions and the surrounding discussion.1718 1719{\small1720\begin{longtable}{@{}>{\raggedright}p{0.29\textwidth}>{\raggedright}p{0.19\textwidth}>{\raggedright\arraybackslash}p{0.44\textwidth}@{}}1721\toprule1722Source & Here & Form\\1723\midrule1724\endhead17251.1 Rock, Paper, Scissors (Lizard, Spock) & \Cref{ex:rps} & circulant games; their automorphism groups\\17261.2--1.3 Game theory; fundamentals & \Cref{ch:games} & the distribution monad; the category $\Game$; Nash's theorem for symmetric games\\17272.1 Basic concepts (Definitions 1--4) & \Cref{thm:essequiv} & one quadratic form $Q_x$; the ray identity \eqref{eq:ray}\\17282.1 Drift game; Hawk--Dove & \Cref{ex:hd}, \Cref{ch:replicator} & $Q=C(p-q)^2/2$; escape time from a neutrally stable state\\17292.2 Properties (Theorems 1--5) & \Cref{thm:essprops} & stated with proofs or references; the Bishop--Cannings bound\\17302.3 Evolutionarily stable sets & \Cref{thm:esset} & pullback along clone maps preserves stable sets and destroys stable points\\17313.1 Introduction & \Cref{ch:replicator} & the category $\Dyn$\\17323.2 Replicator dynamics (Definition 11) & \Cref{prop:quotient}, \Cref{thm:natural} & quotient of the growth equation; functoriality\\17333.2.1 Biological derivation & \Cref{prop:quotient} & as stated\\17343.2.2 Cultural derivation & \Cref{prop:ppi} & mean dynamic of an imitative revision protocol\\17353.2.3 Simple games & \Cref{ch:replicator}, two strategies & one normal form with three generic cases\\17363.2.4 Stability (Theorems 6, 7) & \Cref{thm:kl}, \Cref{thm:folk}, \Cref{thm:elim} & relative entropy as Lyapunov function; elimination with its rate\\17373.2.4 Rock--Paper--Scissors variants & \Cref{thm:zerosum}, \Cref{prop:grps}, \Cref{thm:hodge} & conserved quantity; eigenvalues; cyclic part of a game\\17383.2.4 Classification for three strategies & \Cref{ch:replicator} & cited only\\17393.2.5 Chaos & \Cref{ch:coda} & not treated\\17403.3 Other dynamics (Theorem 8) & \Cref{thm:hs}, \Cref{prop:names} & naturality separates imitation from innovation\\17413.4 Multipopulation games & \Cref{thm:selten} & two boxes and a wiring\\17424.1 Birth--death process & \Cref{thm:fix}, \Cref{prop:limit}, \Cref{rem:limits} & the source's table recomputed; two limits\\17434.2 Local interaction & \Cref{thm:covering} & functoriality for coverings\\17444.2.1 Rock--Paper--Scissors on a ring & \Cref{prop:ring} & twisted symmetry; rotating wave\\17454.2.2 Prisoner's Dilemma on graphs & \Cref{prop:thresholds} & thresholds; the source's run reproduced\\17464.2.3 Centipede game & \Cref{ch:local}, Notes & not reproduced\\17475 Conclusion & \Cref{ch:coda} & what naturality contributes to robustness\\1748--- & \Cref{thm:index}, \Cref{thm:conley}, \Cref{thm:conleyindex} & added: index theorem, chain recurrence, Conley index\\1749--- & \Cref{thm:kurtz}, \Cref{thm:third} & added: mean-field limit, one-third law\\1750--- & \Cref{thm:iso} & added: isothermal theorem, amplifiers and suppressors\\1751\bottomrule1752\end{longtable}}1753%% ---- end ch/B-concordance.tex ----1754%% ---- begin ch/C-computations.tex ----1755\chapter{Computations}\label{app:computations}1756