Indexed text attachment
evolutionary-game-theory-in-higher-categories.tex
Source for Evolutionary Game Theory in Higher Categories
View paper · Download original file
Lines 1617–1716 of 2037. Source text is displayed literally.
1617attractor is a chain component with a non-trivial Conley index. Bomze's classification of the phase1618portraits for three strategies is likewise only cited. The centipede simulation is not reproduced. And the1619source's philosophical conclusion, that these models give how-possibly explanations whose robustness must be1620argued case by case \src{\S5}, is one that the present treatment supports in a specific way and does not1621replace: naturality tells you which features of a model cannot matter, and so narrows the list of those that1622might.1623 1624\section{How much of this is higher}1625 1626\begin{center}\small1627\begin{tabular}{@{}>{\raggedright}p{0.29\textwidth}>{\raggedright}p{0.31\textwidth}>{\raggedright\arraybackslash}p{0.31\textwidth}@{}}1628\toprule1629Source & Structure used here & Level\\1630\midrule1631\S2 stable strategies and sets & $\Game$; pullback along clone maps & $1$-categorical\\1632\S3.2 replicator dynamics & the functor $\Rep\colon\Game\to\Dyn$ & $1$-categorical\\1633\S3.2.4 stability, cycles & index theorem; Conley index & homotopy types\\1634\S3.2.4 Rock--Paper--Scissors & Hodge decomposition & cohomology in degree $1$\\1635\S3.3 other dynamics & naturality and its failure & $1$-categorical\\1636\S3.3--3.4 dynamics, populations & open systems and wirings & operadic; a double category\\1637\S4.1 birth--death process & $\FinStoch$; a non-commuting square & $1$-categorical\\1638\S4.2 local interaction & coverings; equivariance & $1$-categorical, with groupoids of symmetries\\1639\bottomrule1640\end{tabular}1641\end{center}1642 1643\noindent In summary, the subject at the level of the source is mostly ordinary category theory. Three things point beyond it. Games modulo column shifts and positive rescalings form a groupoid over1644each strategy set, and $\Rep$ is invariant along it up to reparametrization of time; treating these1645equivalences as $2$-cells is the natural setting for \Cref{prop:shift}. The Conley index is a homotopy type,1646functorial for the inclusions of a Morse decomposition, and its continuation invariance is a statement about1647families of games. And the first cohomology that vanishes for the complete comparison graph does not vanish1648for partial comparisons, which is where the decomposition of \Cref{thm:hodge} acquires a harmonic part.1649 1650\section{Programme}1651 1652\Spg Four questions seem worth the effort. (1) Is there a homotopy-invariant of a game, computable from the1653payoff matrix, that determines the Conley indices of the chain components of its replicator flow, as the1654index of \Cref{thm:index} determines their Euler characteristics? (2) Which dynamics, among those arising from1655revision protocols, are functors on $\Game$? \Cref{prop:names} shows that all imitative ones are; a1656characterization would say what naturality costs in terms of the properties of \Cref{thm:hs}. (3) Can1657the 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 their