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

3749\label{app:notation}3750\small\raggedright3751\setlength{\parskip}{0pt}3752\begin{description}[leftmargin=2em,style=nextline,itemsep=.31\baselineskip]3753\item[$I$, $\Delta(I)$, $x_i$] Type set, its probability simplex,3754  and mass assigned to type $i$. See Chapter~\ref{ch:population}.3755\item[$f(x)$, $\langle x,f(x)\rangle$] The current fitness vector3756  and its mean under $x$.3757\item[$R_f(x)$, $M(x)$] The replicator field and the matrix3758  $\operatorname{diag}(x)-xx^\top$ that converts a payoff3759  covector into a selection direction. See Chapters~\ref{ch:replicator}3760  and~\ref{ch:stochastic-compression}.3761\item[$D(p\Vert x)$] Relative entropy of a comparator $p$ from3762  the state $x$, finite when the support of $p$ is contained in3763  that of $x$. See Chapters~\ref{ch:lyapunov} and~\ref{ch:agent-learning}.3764\item[$\operatorname{supp}(x)$] The types with positive mass in $x$.3765  The associated support face contains trajectories from $x$ for3766  the replicator field without mutation.3767\item[$P$, $Q$] In stochastic chapters, transition kernels or3768  generator matrices with conventions specified at their use.3769  In parametrized games, $P$ can also denote a parameter object.3770\item[$A^\top$, $C_A(x)$] The pullback of payoff vectors along3771  a column-stochastic channel $A$, and its conditional covariance3772  $\operatorname{diag}(Ax)-A\operatorname{diag}(x)A^\top$.3773  See Chapter~\ref{ch:stochastic-compression}.3774\item[$(X,S)$, $(Y,R)$] Forward and backward types of an open-game3775  interface. See Chapter~\ref{ch:open-games}.3776\item[$\mathcal E_{/B}$, $P\times_B X$]3777  The slice over a context object $B$ and its fiber product.3778  See Chapter~\ref{ch:contextual-games}.3779\item[$BG$, $X//G$] The delooping of an internal group object and3780  the homotopy quotient of a $G$-object. See Chapter~\ref{ch:higher-equivariance}.3781\end{description}3782\chapter{Machine-checked selection identities}3783\label{app:formalization}3784 3785The accompanying Lean project formalizes the algebra that makes3786deterministic aggregation compatible with selection. It uses Lean~4.19.0,3787pinned mathlib, and 23 audited theorems. The index types are arbitrary3788finite types. The statements apply uniformly to every cardinality,3789including reindexing along a map that leaves some target coordinates3790empty. See \cite{lean4} for the proof assistant.3791 3792\section{Drift and the normalized update}3793 3794Let $x,u:I\to R$, where $I$ has a finite type structure. The3795formal definitions are3796\[3797  m(x)=\sum_i x_i,\qquad3798  \mu_x(u)=\sum_i x_i u_i,\qquad3799  F(x,u)_i=x_i\big(u_i-\mu_x(u)\big).3800\]3801Over a commutative ring the kernel checks3802\[3803  \sum_i F(x,u)_i=(1-m(x))\mu_x(u).3804\]3805It follows that the drift is tangent to the mass-one hyperplane.3806The zero-coordinate property, invariance under adding a common payoff3807on that hyperplane, and linearity under uniform payoff scaling are3808also checked. These are identities of algebraic expressions used in3809Chapter~\ref{ch:replicator}.3810 3811Over a field the project defines the reproductive update3812\[3813  S(x,u)_i=\frac{x_i u_i}{\mu_x(u)}.3814\]3815It verifies unit mass when the denominator is nonzero. Over a linearly3816ordered field with $x$ in the simplex and strictly positive fitness3817$u$, Lean derives positivity of the denominator and proves that the3818output lies in the simplex. For affine reproductive weights3819$w_i=1+\eta u_i$, under $m(x)=1$ and $1+\eta\mu_x(u)\ne0$, it also checks3820the exact discrete-to-drift identity3821\[3822  S(x,w)_i-x_i3823  =\frac{\eta}{1+\eta\mu_x(u)}F(x,u)_i .3824\]3825No time limit is needed to obtain this equality.3826 3827\section{Deterministic aggregation}3828 3829For a map $q:I\to J$, the Lean definition of aggregation is3830$(q_*x)_j=\sum_{q(i)=j}x_i$. The project proves preservation of mass3831and of simplex membership, functoriality under composition, and the3832pullback-pushforward pairing3833\[3834  \mu_x(v\circ q)=\mu_{q_*x}(v).3835\]3836For $v:J\to R$ it proves the two commutation identities3837\[3838  q_*F(x,v\circ q)=F(q_*x,v),\qquad3839  q_*S(x,v\circ q)=S(q_*x,v).3840\]3841A state-dependent form and a specialization to pullbacks of payoff3842matrices make the first equation applicable to the deterministic3843semiconjugacy of Chapter~\ref{ch:semiconjugacy}. Each result uses3844finite sums and function extensionality. The second identity is3845algebraic as an equality of field terms. Its population interpretation3846uses the nonzero normalizer as in the preceding section.3847 3848\section{Reproducing the check}