Indexed text attachment
evolutionary-game-theory-in-higher-categories.tex
Source for Evolutionary Game Theory in Higher Categories
View paper · Download original file
Lines 681–780 of 3949. Source text is displayed literally.
681Injectivity then gives invertibility on the682finite-dimensional space \(T_I\).683For any fixed \(b\) in the affine hull of the simplex,684the unique solution of \(\Pi A p=0\) in that affine hull685is686\[687 p_A=b-(\Pi A|_{T_I})^{-1}\Pi A b .688\]689The expression varies continuously with \(A\) near a690matrix for which the operator is invertible.691Strict positivity of each coordinate is open. Negative692definiteness is also open, by taking the maximum of693\(Q_A\) over the compact unit sphere in \(T_I\)694when \(T_I\ne0\). Thus an interior ESS satisfying695this test persists through sufficiently small payoff696perturbations, and in that neighborhood the displayed697formula gives the unique Nash state. Relabeling commutes698with the zero-mean projection, and uniqueness makes699these locally computed states agree wherever the labels700change. This is an explicit instance of transport of a701solution in a parameter family.702 703\section{A local margin and continuation on a face}704 705The compact-direction argument yields a useful quantitative706version. If \(p\) is an ESS and the feasible unit set is707nonempty, there are constants \(c,\delta>0\) such that708\[709 u_A(p,x)-u_A(x,x)\ \geq\ c\|x-p\|^2710 \qquad(\|x-p\|<\delta).711\]712Indeed, if the critical unit set is nonempty, choose \(a>0\)713with \(Q_A\leq-a\) there. On the directions where714\(Q_A<-a/2\), the difference at \(v=rw\) is at least715\((a/2)r^2\). On the closed complement the minimum of716\(L_p\) is some \(m>0\). For717\(r<\min\{1,m/(2(1+M))\}\), the difference is at least718\((m/2)r\geq(m/2)r^2\). If either region is empty only719the other bound is needed. When the critical unit set720is empty the second estimate applies on all directions.721The lower bound is an estimate on payoffs. Its use722as an estimate on motion requires a dynamics whose723drift is related to those payoffs.724 725At a Nash point, let \(B_p=\{i:(Ap)_i=M_p\}\), where726\(M_p=\max_i(Ap)_i\). Since \(\sum_i v_i=0\), one has727\[728 L_p(v)=\sum_{i\notin B_p}\bigl(M_p-(Ap)_i\bigr)v_i .729\]730All terms on the right are nonnegative for feasible731directions because every omitted index has zero weight732in \(p\). Consequently \(v\in K_p\) precisely when733\(v\in C_p\) and \(v_i=0\) outside \(B_p\).734If every absent type has a strictly lower payoff,735then \(B_p=\operatorname{supp}(p)=S\). The critical736cone is simply the tangent space to \(\Delta(S)\).737An ESS of this kind with a strict quadratic test on that738tangent space persists on the same face under small739matrix perturbations: solve the interior equation for740the restricted matrix, extend by zero, and use continuity741to preserve the payoff gaps to all absent types.742Any Nash state sufficiently near \(p\) for a sufficiently743small perturbation still has positive coordinates on744\(S\), and the same payoff gaps prevent extra positive745coordinates outside \(S\). Its uniqueness therefore follows746from the restricted affine equation. Here the strict gaps747and the curvature on the face control different aspects of748the same continuation.749\par750\chapter{Payoff equivalence and spaces of games}751\label{ch:payoff-equivalence}752 753The payoff array contains information about the absolute score754of each encounter. The static comparisons in Chapter~\ref{ch:ess}755and the usual replicator field use only relative scores against756the same population. This difference suggests an equivalence757relation on games with fixed type labels. Once labels are also758allowed to vary, the resulting space of games has a groupoid759presentation. Its arrows identify numerical presentations of760the same relative-fitness model.761 762\section{The quotient by common fitness increments}763 764Fix a nonempty finite type set \(I\), put \(n=|I|\), and765write \(\mathbf 1\) for its constant vector. Let766\[767 \mathcal A_I=\operatorname{End}(\mathbb R^I),768 \qquad W_I=\{\mathbf 1 b^{\mathsf T}:b\in\mathbb R^I\}.769\]770If \(B=A+\mathbf 1 b^{\mathsf T}\), then771\[772 Bx=Ax+(b^{\mathsf T}x)\mathbf 1 .773\]774The increment is common to every row type, though its775size can depend on the opponent distribution \(x\).776For \(p,q,x\) in the simplex we have777\((p-q)^{\mathsf T}(B-A)x=0\), since \(p,q\) have the778same total mass. Thus comparing \(p\) and \(q\) against779\(x\) gives identical advantage in the two games.780This includes both comparisons in the ESS test.