Indexed text attachment
evolutionary-game-theory-in-higher-categories.tex
Source for Evolutionary Game Theory in Higher Categories
View paper · Download original file
Lines 3321–3420 of 3949. Source text is displayed literally.
3321second channel and the covariance of its conditional means3322induced by the first. This is the law of total covariance3323for the original sampling sequence. The formula treats3324loss of a selection signal as a two-stage correlation3325calculation.3326 3327The two summands are positive semidefinite. If the final3328fitness is $v\in\mathbb R^K$, exact pushforward through3329the composite holds at $x$ precisely when3330$C_B(Ax)v=0$ and $C_A(x)B^\top v=0$. To see this,3331test the displayed expression in the quadratic form at3332$v$. It is a sum of two nonnegative numbers, each with the3333zero criterion of Theorem~\ref{thm:channel-defect}.3334The two equality conditions correspond to asking that3335the final payoff be constant on the occupied conditional3336supports of the second stage and that its first-stage3337conditional mean be constant on the relevant supports of the3338first. This criterion can be applied before composing the3339channels.3340 3341\[3342 \begin{tikzcd}[column sep=large,row sep=large]3343 \Delta(I) \arrow[r,"A"] \arrow[dr,"BA"'] &3344 \Delta(J) \arrow[d,"B"]\\3345 &\Delta(K)3346 \end{tikzcd}3347\]3348If each step is deterministic, the maps and the exact3349fitness pullbacks compose without defect. This yields a3350class of morphisms of selection systems. The same category3351of stochastic maps can be used for compression with a3352nonzero defect. In that case the formula identifies the3353specific obstruction to the map being a morphism of3354replicator dynamics.3355 3356\section{Trajectory error on a bounded time interval}3357 3358Write $x(t)$ for the fine solution and $z(t)$ for the3359coarse solution starting at $Ax(0)$. Suppose both remain3360on their simplices and that $R_g$ is Lipschitz there with3361constant $L$ for a fixed norm. Define3362$c_t=C_A(x(t))g(Ax(t))$. The projected fine solution3363satisfies3364\[3365 \frac{d}{dt}Ax(t)=R_g(Ax(t))-c_t .3366\]3367Subtracting the coarse equation and applying the3368integral form of Gr\"onwall's inequality yields3369\[3370 \|Ax(t)-z(t)\|3371 \leq\int_0^t e^{L(t-s)}\|c_s\|\,ds .3372\]3373One derivation is to integrate the difference of the3374two derivatives, bound the target field difference by3375$L\|Ax-z\|$, and iterate the resulting integral inequality.3376Its Volterra series sums to the displayed exponential.3377If the defect is identically zero, uniqueness gives exact3378semiconjugacy. If the defect is merely small, the estimate3379controls finite-time approximation. It does not give a3380uniform long-time guarantee when the bound grows with $t$.3381For other mechanisms that yield semiconjugacy and3382lumpability, see Chapters~\ref{ch:aggregation}3383and~\ref{ch:semiconjugacy}.3384 3385\section{The tangent and cotangent interpretation}3386 3387On the relative interior of a simplex, the metric3388\[3389 \langle v,w\rangle_x=\sum_i \frac{v_iw_i}{x_i},3390 \qquad \sum_i v_i=\sum_i w_i=03391\]3392identifies the centered payoff covector with its3393replicator vector. In fact3394$\langle R_f(x),v\rangle_x=\sum_i f_i(x)v_i$.3395The metric is the familiar Shahshahani metric3396\cite{shahshahani}. Its inverse on covectors modulo3397constant vectors has matrix $M(x)$. If $Ax$ is on the3398boundary of the target simplex, the same construction applies3399on the relative interior of its support face, with its inverse3400metric represented in the full coordinates by zero extension.3401The difference between the target inverse metric and the3402pushforward of the source inverse metric is $C_A(x)$. The covariance is thus also the change in the3403quadratic form used to convert a payoff into a selection3404direction. This observation explains why contraction3405of information under sampling need not make evolution3406commute with sampling. The statement proved here3407uses ordinary finite-dimensional distributions and3408an exact payoff pullback, which are strong enough to3409identify the defect in closed form.3410\par3411\chapter{Action groupoids and symmetric selection}3412\label{ch:higher-equivariance}3413 3414A permutation group can act on a game by relabeling its types.3415The resulting symmetry has a fixed locus, an orbit space, and3416an action groupoid. Each answers a different question. This3417chapter puts these constructions alongside the probability3418simplex and uses them to separate symmetry of a state from3419the quotient of a family of states.3420