Indexed text attachment
evolutionary-game-theory-in-higher-categories.tex
Source for Evolutionary Game Theory in Higher Categories
View paper · Download original file
Lines 1029–1128 of 3949. Source text is displayed literally.
1029the scalar linear equation along a given solution has the1030zero solution for such an initial value.1031 1032\begin{proposition}[Existence and restriction to faces]1033For the locally Lipschitz assignment just specified,1034\eqref{eq:replicator} has a unique solution for every initial1035state of \(\Delta(S)\), defined for all real times. Throughout1036any finite time interval its support equals the initial1037support. On the face indexed by a nonempty subset \(T\subseteq S\),1038the solution is the replicator solution for the restricted1039assignment on \(\Delta(T)\).1040\end{proposition}1041 1042\begin{proof}1043Local existence and uniqueness follow from the locally1044Lipschitz field. Conservation of mass and1045\eqref{eq:coordinate-factor} keep a solution in the simplex1046throughout its interval of existence, in either direction1047of time. A solution confined to this compact subset of the1048domain can be continued at each finite endpoint. Support1049preservation follows from the positivity of the exponential.1050On the face the terms \(x_jF_j(x)\) with \(j\notin T\) vanish1051from the mean, and each missing coordinate has zero velocity.1052Uniqueness identifies the restricted trajectory with the1053solution calculated directly in the face.1054\end{proof}1055 1056In particular, if \(j_T:\Delta(T)\to\Delta(S)\) extends a1057state by zero, and \(F_T\) restricts \(F\circ j_T\) to the1058coordinates in \(T\), the solution operators obey the1059commutative square1060\[1061\begin{tikzcd}[column sep=large]1062\Delta(T)\arrow[r,"\Phi_t^{F_T}"]\arrow[d,hook] &1063\Delta(T)\arrow[d,hook]\\1064\Delta(S)\arrow[r,"\Phi_t^F"] & \Delta(S).1065\end{tikzcd}1066\]1067Here both vertical maps are \(j_T\). The group law1068\(\Phi_{s+t}=\Phi_s\circ\Phi_t\) follows by uniqueness applied1069after a change of time origin. A relabeling yields the same1070square with the vertical maps replaced by permutations.1071These comparisons fix the sense in which the construction1072respects the data of a game. A map between strategy sets that1073identifies distinct types needs separate hypotheses to carry1074the differential equation through the induced map on states.1075 1076A rest state has equal fitness \(\phi(x)\) on its support.1077This condition is sufficient because the velocity of every1078absent type is already zero. A Nash state also bounds the1079payoffs of absent types above by \(\phi(x)\). The distinction1080is caused by support preservation. In the interior the two1081conditions coincide. For any pair of present types,1082\[1083 \frac{d}{dt}\log\frac{x_i}{x_j}=F_i(x)-F_j(x).1084\]1085Thus a constant lower bound \(\gamma>0\) for the payoff1086difference along an interval \([0,t]\) gives1087\(x_i(t)/x_j(t)\ge e^{\gamma t}x_i(0)/x_j(0)\).1088The inference concerns the relative growth of two present1089types. It yields no positive mass for a type initially absent.1090 1091\section{Two mutation conventions}1092 1093A revision generator \(Q\) has nonnegative off-diagonal1094entries and zero row sums, with \(Q_{ji}\) denoting the rate1095from \(j\) to \(i\) for \(j\ne i\). Independent mutation1096during the evolution of the proportions gives1097\begin{equation}1098 \dot x_i=x_i(F_i(x)-\phi(x))+\sum_jx_jQ_{ji}.1099 \label{eq:additive-mutation}1100\end{equation}1101The generator contributes zero to the mass derivative.1102On the simplex the contribution to a vanishing coordinate1103is the sum of the incoming rates weighted by the masses.1104This property yields forward invariance even when the1105initial state lies on the boundary. To prove it, in the1106ambient equation replace \(x_j\) by \(\max(x_j,0)\) in the1107incoming terms with \(j\ne i\). The modified problem is1108locally Lipschitz. In the equation for coordinate \(i\) the1109terms involving \(x_i\) are linear in \(x_i\) along a given1110solution, and the remaining forcing is nonnegative.1111Variation of constants proves that all coordinates stay1112nonnegative for \(t\ge0\). The modification consequently1113agrees with the original equation on this solution. The1114mass identity then retains \(m=1\), and compactness permits1115global forward continuation.1116 1117For a constant \(Q\), a positive coordinate remains positive1118by the same variation formula. If \(Q_{ji}>0\) and coordinate1119\(j\) is positive for \(t>0\), its forcing makes \(i\) positive1120for \(t>0\) as well. Induction along directed edges shows1121that irreducibility, meaning directed reachability between1122all strategies, produces full support at every strictly1123positive time. Mutations change the invariant face structure1124present in \eqref{eq:replicator}. They also destroy its1125backward invariance on the closed simplex in general.1126 1127Another convention incorporates mutation into reproduction.1128Let \(R\) be a row stochastic matrix of offspring probabilities