Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem (Robinson 1951) — for every vector system, min U(t)/t → v and max V(t)/t → v

Proved
RobinsonFP.Convergence.robinson_theorem

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

fictitious-playgame-theorymatrix-gamep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A=(aij)A = (a_{ij})A=(aij​) be a real m×nm \times nm×n matrix with m,n≥1m, n \ge 1m,n≥1, the pay-off matrix of a finite two-person zero-sum game, and let vvv be its value, given by a solution (X,Y)(X, Y)(X,Y) of the game. If (U,V)(U, V)(U,V) is a vector system for AAA (Definition 1), then

lim⁡t→∞min⁡U(t)t  =  lim⁡t→∞max⁡V(t)t  =  v.\lim_{t\to\infty} \frac{\min U(t)}{t} \;=\; \lim_{t\to\infty} \frac{\max V(t)}{t} \;=\; v .t→∞lim​tminU(t)​=t→∞lim​tmaxV(t)​=v.

This is the convergence of Brown's iterative method (fictitious play) for zero-sum matrix games: when each player in turn plays a best pure reply to the accumulated play of the opponent, the lower and upper estimates of the value obtained from the accumulated payoffs both converge to the value of the game. The statement holds for arbitrary initial vectors with min⁡U(0)=max⁡V(0)\min U(0) = \max V(0)minU(0)=maxV(0) and for every tie-breaking rule.

Formalization Note Rows and columns are indexed by finite nonempty types. The value vvv enters through IsSolution A x y v (probability vectors xxx, yyy with min⁡j∑iaijxi=v=max⁡i∑jaijyj\min_j \sum_i a_{ij}x_i = v = \max_i \sum_j a_{ij} y_jminj​∑i​aij​xi​=v=maxi​∑j​aij​yj​), as defined on p. 296; a solution exists for every matrix by the minimax theorem (proved on Prove2Me as MatousekLP.ZeroSum.minimax_equality, in another encoding), so the hypothesis is satisfiable. The two limits are stated as Tendsto … atTop (𝓝 v) along t∈Nt \in \mathbb Nt∈N. The paper's closing display on p. 301 prints lim⁡min⁡V(t)/t\lim \min V(t)/tlimminV(t)/t; the intended reading, confirmed by the statement of the Theorem on p. 297 and the lim sup display just above it, is lim⁡min⁡U(t)/t\lim \min U(t)/tlimminU(t)/t, which is what is stated here.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_RobinsonFP_Convergence_VectorSystem

open Filter Topology
Formal statement
namespace RobinsonFP.Convergence

variable {ι κ : Type*} [Fintype ι] [Fintype κ]

/-- Robinson (1951), p. 297, Theorem: if `(U, V)` is a vector system for `A`, then
`lim_{t→∞} min U(t)/t = lim_{t→∞} max V(t)/t = v`, the value of the game. -/
theorem robinson_theorem [Nonempty ι] [Nonempty κ] (A : Matrix ι κ ℝ)
    (U : ℕ → κ → ℝ) (V : ℕ → ι → ℝ) (hUV : IsVectorSystem A U V)
    (x : ι → ℝ) (y : κ → ℝ) (v : ℝ) (hsol : IsSolution A x y v) :
    Tendsto (fun t : ℕ => vmin (U t) / t) atTop (𝓝 v) ∧
      Tendsto (fun t : ℕ => vmax (V t) / t) atTop (𝓝 v) := by sorry

end RobinsonFP.Convergence
Source
Robinson, An Iterative Method of Solving a Game, Ann. of Math. 54(2) (1951), p. 297, Theorem
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me