THEOREM 1 (§III case), pp. 1831–1833 — near Jordan's game Γ₀, no uncoupled dynamic is Nash-convergent
ProvedUncoupledDyn.Finite.theorem_1Consider three-player games in which each player has two strategies, with mixed-strategy state space , and let be Jordan's game: player gets for playing against the next player's , for playing against the next player's , and otherwise (indices mod 3).
Let be a family of such games with the single-Nash-equilibrium property (every has exactly one Nash equilibrium), and suppose that for some every game of Jordan's family in the -neighborhood of belongs to . Let be an uncoupled dynamic for . Then
That is, there is a game with Nash equilibrium such that one of the following fails: ; is on ; every eigenvalue of the Jacobian of at has negative real part; every solution of converges to .
This is the paper's Theorem 1 ("Let be a family of games containing a neighborhood of the game . Then every uncoupled dynamic for is not Nash-convergent") for the finite game of §III: adaptive dynamics in which each player's motion depends only on its own payoff function cannot be guaranteed to converge to Nash equilibrium, even in a family where every game has a unique equilibrium and the coupled dynamic does converge.
Formalization Note. The page's hypothesis " contains a neighborhood of " is replaced by the weaker " contains every game of in some fn.-7 neighborhood of "; the page's hypothesis implies it, so the formal statement is at least as strong as the page's, and the Appendix (p. 1835) explicitly reads the neighborhood relative to . The single-Nash-equilibrium property of , a standing assumption of §I, is a hypothesis. Solutions are required to stay in , and the C¹ and hyperbolic-stability requirements that §I places on the dynamics are clauses of Nash-convergence. Players are 0-based.
import Mathlib import Definitions.Def_FatkhullinPolyak_Discrete_Matrix import Definitions.Def_UncoupledDyn_Finite_Setting
namespace UncoupledDyn.Finite
theorem theorem_1 (U : Set Game) (hU : ∀ G ∈ U, ∃! x, IsNash G x)
(F : (Fin 3 → ℝ) → Game → (Fin 3 → ℝ))
(hnbhd : ∃ η > 0, ∀ a : Fin 3 → ℝ, IsNear (jordanGame a) Gamma0 η → jordanGame a ∈ U)
(hF : Uncoupled U F) :
¬ NashConvergent U F := by sorry
end UncoupledDyn.Finite
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.