Indexed text attachment
evolutionary-game-theory-in-higher-categories.tex
Source for Evolutionary Game Theory in Higher Categories
View paper · Download original file
Lines 3101–3200 of 3949. Source text is displayed literally.
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 a3149rule for that motion. A connection or transition process would3150be additional data.3151 3152\section{Parametrization and effective descent}3153 3154In an $\infty$-topos $\mathcal E$, let $X,Y,P$ be objects over a3155base $B$. A family of evaluations from $X$ to $Y$ with parameter3156$P$ is a morphism $P\times_B X\to Y$. By the adjunction3157for the exponential in $\mathcal E_{/B}$, such a family is3158classified by $P\to[Y^X]_B$, where $[Y^X]_B$ denotes the3159fiberwise exponential. An inverse-image or presentation change3160can preserve evaluation while changing parameter coordinates.3161The pullback formula follows by applying the functor3162composing structure maps to the exponential adjunction:3163for $q:C\to B$ and $T\to C$,3164\[3165 q_!(T\times_C q^*X)\simeq q_!T\times_B X .3166\]3167Thus $q^*[Y^X]_B\simeq[(q^*Y)^{q^*X}]_C$ by Yoneda.3168If $U\to B$ is an effective epimorphism with \v{C}ech nerve3169$U_\bullet$, then3170\[3171 \mathcal E_{/B}\simeq3172 \lim_{[n]\in\boldsymbol\Delta}\mathcal E_{/U_n}.3173\]3174This is descent for slices in an $\infty$-topos3175\cite[\S6.1.3]{lurie-htt}. Objects and morphisms over $B$3176can thus be specified locally along with a homotopy-coherent3177chain of overlap comparisons. The comparison extends to3178evaluation families since their parameter maps land in the3179compatible exponential object.3180 3181This gives a semantics for local games. A family can be observed3182by changing the base, and the result of interpreting that family3183is independent of a selected cover. For the concrete smooth3184model the relevant gluing equations reduce to equalities; for3185spaces with groupoid-valued states a commuting triangle may3186instead carry an invertible comparison. One must still specify3187which points are probability states and which maps define3188fitness. The categorical descent theorem glues these structures3189once they are defined in the chosen semantics. It does not3190supply a probability law from the base topos.3191 3192\section{Monodromy and restricted parameter choices}3193 3194A loop in $B$ transports its strategy fiber by a permutation.3195The image of the resulting representation of the fundamental3196group is a monodromy group $M$. In a connected component,3197a flat state is a locally constant probability vector in the3198trivializations. It is specified by a vector $x$ at one base3199point that is fixed by every permutation in $M$. To prove it,3200transport a choice from that point along paths. This is independent