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 3049–3148 of 3949. Source text is displayed literally.

3049 3050Let $B$ be a smooth manifold and let $p:S\to B$ be a smooth3051locally constant finite covering, with all fibers nonempty.3052Its sheets over an open set give types in that context. The3053set of types is a sheaf of finite sets over $B$. Think of an3054open subset as a stage on which type labels may be observed.3055On a trivializing open set $U$, the probability state space3056over $U$ is $U\times\Delta(I_U)$, where $I_U$ indexes the3057local sheets and3058\[3059 \Delta(I_U)=\left\{x\in\mathbb R^{I_U}:3060           x_i\geq0,\quad \sum_i x_i=1\right\}.3061\]3062On an overlap the sheets are related by a locally constant3063permutation $\sigma_{UV}(b):I_V\to I_U$. The transition3064$(b,x)\mapsto (b,\sigma_{UV}(b)x)$ carries faces to faces3065and preserves both the mass and the nonnegativity conditions.3066The transitions assemble a simplex bundle over $B$. Equivalently,3067the simplex is a sheaf of states, using smooth plots on each3068context. The closed fibers have corners. Smoothness of a3069fitness map on such a fiber means that its local components3070extend smoothly to a neighborhood in the affine span.3071 3072A fitness operator is a section of the relative function object3073from the simplex bundle to the bundle of real type-indexed3074vectors. Concretely it is a collection of functions3075$f_U(b,x)\in\mathbb R^{I_U}$ with3076\[3077 f_U(b,\sigma_{UV}(b)x)=\sigma_{UV}(b)f_V(b,x).3078\]3079This is a descent condition on maps between bundles. It can be3080applied equally to restricted subfamilies of fitness operators.3081For instance a collection of pairwise payoff matrices3082$A_U(b)$ gives the operators $A_U(b)x$ when the matrices satisfy3083$A_U(b)\sigma_{UV}(b)=\sigma_{UV}(b)A_V(b)$. A constant affine shift3084of all payoffs leaves the replicator field unchanged, as in3085Chapter~\ref{ch:payoff-equivalence}. It can be convenient to3086take the corresponding quotient of fitness data before imposing3087compatibility.3088 3089\section{Local generators and their gluing}3090 3091For each context $b$ and a local vector $x$, the replicator3092operator assigns3093\[3094 R_{f_U}(b,x)_i=x_i\bigl(f_U(b,x)_i-3095                 \langle x,f_U(b,x)\rangle\bigr).3096\]3097Its values are tangent to the affine hyperplane of mass one.3098Every zero coordinate remains zero in that field. These3099identities are pointwise in $b$ and are independent of the3100trivialization.3101 3102\begin{proposition}[Descent of replicator fields]3103\label{prop:replicator-descent}3104Under the fitness transition law above, the replicator fields3105glue to a vertical vector field on the simplex bundle.3106The flow on any fiber is compatible with relabeling and with3107restriction to context opens. If the fitness fields are smooth3108up to the boundary in the specified sense, the flows exist3109for all nonnegative times on each simplex fiber.3110\end{proposition}3111 3112\begin{proof}3113A permutation $\sigma$ preserves the Euclidean pairing,3114preserves coordinatewise multiplication, and fixes the3115all-ones vector. Therefore3116\[3117 R_{f_U}(b,\sigma x)=\sigma R_{f_V}(b,x).3118\]3119The derivative of the transition in the vertical coordinate3120is $\sigma$, so these equations are exactly the gluing3121condition for a vertical field. The equality is preserved3122under further open restriction.3123 3124Because the fitness is smooth in an affine neighborhood,3125the local differential equation has unique solutions.3126A solution for the $V$-presentation, carried across the3127overlap, is a solution in the $U$-presentation with the same3128initial condition as the one in that chart. Uniqueness gives3129the flow comparison. The normalized mass and support3130identities of Chapter~\ref{ch:replicator} keep each trajectory3131in its compact simplex. The continuation theorem for smooth3132ordinary differential equations then gives existence for all3133nonnegative time at every fixed $b$. The mass calculation only3134uses the finite set indexing the simplex. It does not require3135a distinguished order on that set.3136\end{proof}3137 3138The commutative square records how a transition acts on the3139whole flow, rather than on its rest points alone:3140\[3141 \begin{tikzcd}[column sep=large,row sep=large]3142   \Delta(I_V) \arrow[r,"\Phi^V_t"]\arrow[d,"\sigma"'] &3143   \Delta(I_V)\arrow[d,"\sigma"]\\3144   \Delta(I_U) \arrow[r,"\Phi^U_t"] & \Delta(I_U).3145 \end{tikzcd}3146\]3147Here $t$ is elapsed time in a fixed context, not a path in $B$.3148A model in which context itself changes with time needs a