Independent scholarship · Open accessThe monthly digest

Indexed text attachment

evolutionary-game-theory-in-higher-categories.tex

Source for Evolutionary Game Theory in Higher Categories

View paper · Download original file

Lines 1069–1168 of 3949. Source text is displayed literally.

1069after 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 probabilities1129and let \(b_j(x)\ge0\) be an absolute birth rate. With fitness1130used in these units the normalized equation is1131\begin{equation}1132 \dot x_i=\sum_j x_jb_j(x)R_{ji}1133    -x_i\sum_j x_jb_j(x).1134 \label{eq:birth-mutation}1135\end{equation}1136This follows by normalizing the abundance equation with1137incoming births \(\dot n_i=\sum_jn_jb_j(x)R_{ji}\). Setting1138\(R\) equal to the identity recovers selection, and the sum1139of the velocities on the simplex is zero. Under the same1140local Lipschitz hypothesis, forward invariance follows by1141the incoming-rate argument. For that argument the rates1142can be extended off the simplex by their positive parts so1143that incoming forcing remains nonnegative. For the diagonal1144term the coefficient is \(b_iR_{ii}-\sum_jx_jb_j\).1145 1146A common baseline added to \(b_j\) changes1147\eqref{eq:birth-mutation} by \(c\bigl(R^{\mathsf T}x-x\bigr)\).1148This describes mutation occurring during additional births.1149In \eqref{eq:additive-mutation}, the corresponding baseline1150change to \(F\) has no effect. The two conventions therefore1151require different information about which transformations of1152fitness preserve the model. The formulation of an evolution1153operator should specify where mutation enters before passing1154to equivalence classes of payoff data \cite{hofbauer-sigmund}.1155 1156\section{Time changes and the strength of mutation}1157 1158Multiplying a fitness assignment by a positive constant \(a\)1159changes the replicator solution from \(x(t)\) to \(x(at)\).1160The geometric trajectories are the same and their1161parametrizations differ. The same rule holds for a positive1162continuous scalar \(a(x)\) on the simplex. Along a trajectory1163of the rescaled field, the clock for the original field has1164rate \(a(x(t))\). On the compact simplex, the positive1165minimum of \(a\) ensures that this clock advances without1166bound as physical time grows. Thus this kind of rescaling1167preserves forward limit sets as well as rest points.1168