Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — if all rows and columns are eligible in (s, s+t), max U − min U ≤ 2at and max V − min V ≤ 2at

Proved
RobinsonFP.Convergence.lemma2

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, let aaa be a number with ∣aij∣≤a|a_{ij}| \le a∣aij​∣≤a for all i,ji, ji,j, and let (U,V)(U, V)(U,V) be a vector system for AAA. Let s,ts, ts,t be nonnegative integers. If every row and every column of AAA is eligible in the interval (s,s+t)(s, s+t)(s,s+t) (Definition 2), then

max⁡U(s+t)−min⁡U(s+t)≤2atandmax⁡V(s+t)−min⁡V(s+t)≤2at.\max U(s+t) - \min U(s+t) \le 2at \qquad\text{and}\qquad \max V(s+t) - \min V(s+t) \le 2at .maxU(s+t)−minU(s+t)≤2atandmaxV(s+t)−minV(s+t)≤2at.

Once every row and column has been played during a window of length ttt, the spread of each accumulated payoff vector is at most linear in ttt, whatever the initial vectors were. Lemma 3 combines the two bounds.

Formalization Note The paper states the lemma with a=max⁡i,j∣aij∣a = \max_{i,j} |a_{ij}|a=maxi,j​∣aij​∣; we state it for every upper bound aaa on the ∣aij∣|a_{ij}|∣aij​∣. This contains the paper's statement (take a=max⁡i,j∣aij∣a = \max_{i,j}|a_{ij}|a=maxi,j​∣aij​∣) and follows from it, since the right-hand side grows with aaa.

Preamble
import Mathlib
import Definitions.Def_RobinsonFP_Convergence_VectorSystem
Formal statement
namespace RobinsonFP.Convergence

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

/-- Robinson (1951), p. 298, Lemma 2: if every row and every column is eligible in `(s, s + t)`,
then `max U(s+t) − min U(s+t) ≤ 2at` and `max V(s+t) − min V(s+t) ≤ 2at`, for any `a` bounding
every `|a_ij|` (in particular `a = max_{i,j} |a_ij|`). -/
theorem lemma2 [Nonempty ι] [Nonempty κ] (A : Matrix ι κ ℝ) (a : ℝ) (ha : ∀ i j, |A i j| ≤ a)
    (U : ℕ → κ → ℝ) (V : ℕ → ι → ℝ) (hUV : IsVectorSystem A U V) (s t : ℕ)
    (hrow : ∀ i, RowEligible V i s (s + t)) (hcol : ∀ j, ColEligible U j s (s + t)) :
    vmax (U (s + t)) - vmin (U (s + t)) ≤ 2 * a * t ∧
      vmax (V (s + t)) - vmin (V (s + t)) ≤ 2 * a * t := by sorry

end RobinsonFP.Convergence
Source
Robinson, An Iterative Method of Solving a Game, Ann. of Math. 54(2) (1951), p. 298, Lemma 2
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