Indexed text attachment
evolutionary-game-theory-in-higher-categories.tex
Source for Evolutionary Game Theory in Higher Categories
View paper · Download original file
Lines 2801–2900 of 3949. Source text is displayed literally.
2801cancels it and gives the composite steady equation.2802Conversely suppose the composite steady equation holds and2803restrict the concentrations to \(S,T\). Form the two local2804residuals including their external fluxes but omitting the2805shared flux. These residuals lie in the kernel of the sum2806of the two pushforwards to \(P\). The sequence2807\[2808 \mathbb R^O2809 \xrightarrow{(o_*,-i'_*)}2810 \mathbb R^S\oplus\mathbb R^T2811 \xrightarrow{(j_S)_*+(j_T)_*}2812 \mathbb R^P\longrightarrow 02813\]2814is exact since the free vector space functor preserves the2815pushout. Thus the residuals are obtained from some common2816flux with opposite signs, giving two local steady equations.2817This proves the relation formula for unrestricted real port2818fluxes. Additional inequalities on fluxes require their own2819feasibility check for such a factorization. The relation2820records possible external observations of steady states.2821Trajectories and the conditions for reaching those states2822remain part of the dynamical description.2823\par2824\chapter{Semiconjugacy and deterministic aggregation}2825\label{ch:semiconjugacy}2826 2827An aggregate description of selection groups several strategies2828under the same observed label. Its exactness is a differential2829question. For every microscopic population with a given aggregate,2830the instantaneous aggregate velocity must agree. A coarse field2831that fits a single trajectory need not describe nearby microscopic2832states with the same observed population.2833 2834\section{Flow maps and projectable fields}2835 2836Let \(F\) and \(G\) be smooth vector fields on \(M\) and \(N\) and2837let \(q:M\to N\) be smooth. We call \(q\) a \emph{semiconjugacy}2838when it carries solution curves of \(F\) to solution curves of2839\(G\) with the same time parameter. This is equivalent to2840\begin{equation}2841 Dq_x F(x)=G(q(x))\qquad (x\in M).2842 \label{eq:exact-semiconjugacy}2843\end{equation}2844Indeed, for a source solution \(x(t)\), the chain rule makes2845\(q(x(t))\) a solution of the target initial-value problem.2846Uniqueness then gives commutation of the two flow maps on their2847common time domain. Conversely, differentiating this commutation2848at zero gives \eqref{eq:exact-semiconjugacy}. On simplices we use2849smooth fields on relative neighborhoods whose forward flows2850preserve the simplices. In this case the derivative at zero may2851be taken from the right.2852\[2853\begin{tikzcd}[column sep=large,row sep=large]2854 M \arrow[r,"\Phi_t"{above}] \arrow[d,"q"']2855 & M \arrow[d,"q"]\\2856 N \arrow[r,"\Psi_t"{above}]2857 & N2858\end{tikzcd}2859\]2860 2861A complete forward flow determines a functor2862\(B(\mathbb R_{\geq 0},+)\to\mathbf{Set}\). Here \(B\) makes2863the monoid of nonnegative times into a one-object category, and2864the functor sends addition of times to composition of evolution2865maps. The square says precisely that \(q\) is the component2866of a natural transformation. Smooth semiconjugacies form a2867category with ordinary identities and composition. The naturality2868condition uses a common clock. A state-dependent time change such2869as the positive rescaling in Chapter~\ref{ch:compositional-games}2870requires a separate description.2871 2872Given \(F\) and a surjective submersion \(q\), a suitable \(G\)2873exists exactly when \(Dq_xF(x)\) is constant on every fiber2874\(q^{-1}(y)\), as a vector in \(T_yN\). Necessity is immediate2875from \eqref{eq:exact-semiconjugacy}. For sufficiency, define the2876candidate at \(y\) to be this common value. A local smooth section2877of the submersion expresses it as a smooth field on a neighborhood2878of \(y\), and the expressions from different sections agree.2879Surjectivity also gives uniqueness. For an affine quotient of2880simplices by a partition, a global affine section is available.2881Choose a probability vector supported in each block and lift2882coarse masses to these fixed proportions. Evaluating \(Dq F\)2883on that section gives the smooth candidate whenever the2884fiber condition holds. The candidate preserves the coarse2885simplex whenever the original flow preserves the fine simplex,2886by applying the chain rule to a source solution through2887a lift of each coarse initial state.2888 2889\section{Partition quotients of selection}2890 2891Let \(b:S\twoheadrightarrow T\) be a partition map and let2892\(B_{\alpha i}\) be \(1\) if \(b(i)=\alpha\), and \(0\)2893otherwise. Write \(z=Bp\) for the image of the population2894\(p\), so \(z_\alpha=\sum_{b(i)=\alpha}p_i\). Let2895\(F_i(p)=p_i(f_i(p)-\bar f(p))\) with2896\(\bar f(p)=\sum_i p_i f_i(p)\). For every block with2897\(z_\alpha>0\) define2898\[2899 \widehat f_\alpha(p)2900 =\frac{1}{z_\alpha}\sum_{b(i)=\alpha}p_i f_i(p).