Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3), proof of Lemma 4 — if some row or column is not eligible in (s, s+t*), the gap grows by less than ½εt*

Proved
RobinsonFP.Convergence.eq3

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 ε>0\varepsilon > 0ε>0, and let t∗t^*t∗ be a nonnegative integer with the following property: for every submatrix A′A'A′ obtained from AAA by deleting one row or one column (and still having at least one row and one column), every vector system (U′,V′)(U', V')(U′,V′) for A′A'A′ satisfies

max⁡V′(t)−min⁡U′(t)<12εtwhenever t≥t∗.\max V'(t) - \min U'(t) < \tfrac12 \varepsilon t \qquad\text{whenever } t \ge t^* .maxV′(t)−minU′(t)<21​εtwhenever t≥t∗.

Let (U,V)(U, V)(U,V) be a vector system for AAA and sss a nonnegative integer. If some row or some column of AAA is not eligible in the interval (s,s+t∗)(s, s+t^*)(s,s+t∗), then

max⁡V(s+t∗)−min⁡U(s+t∗)  <  max⁡V(s)−min⁡U(s)+12εt∗.\max V(s+t^*) - \min U(s+t^*) \;<\; \max V(s) - \min U(s) + \tfrac12 \varepsilon t^* .maxV(s+t∗)−minU(s+t∗)<maxV(s)−minU(s)+21​εt∗.

This is the induction step of the proof of Lemma 4: over a window in which some pure strategy is never a best reply, the vector system behaves like one for a smaller matrix, so the gap grows by less than 12εt∗\tfrac12\varepsilon t^*21​εt∗.

Formalization Note The paper chooses t∗t^*t∗ for all submatrices A′A'A′ of AAA; we assume the bound only for the submatrices obtained by deleting a single row or a single column, the ones its argument uses, so our statement is at least as strong. The paper writes out the row case only ("Suppose, for example, that the kkk-th row is not eligible", p. 300); the statement covers both cases, as (3) does. Deleting row kkk gives the rows indexed by {i≠k}\{i \ne k\}{i=k}, and the bound is assumed only when this index set is nonempty, because max⁡\maxmax needs at least one component; an ineligible row kkk forces another row to exist, so nothing is lost.

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

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

/-- Robinson (1951), p. 299, display (3) in the proof of Lemma 4: let `t*` be such that every
vector system `(U', V')` of a submatrix `A'` obtained by deleting one row or one column of `A`
satisfies `max V'(t) − min U'(t) < ½εt` for `t ≥ t*`. If some row or some column of `A` is not
eligible in `(s, s + t*)` for the vector system `(U, V)`, then
`max V(s+t*) − min U(s+t*) < max V(s) − min U(s) + ½εt*`. -/
theorem eq3 [DecidableEq ι] [DecidableEq κ] [Nonempty ι] [Nonempty κ] (A : Matrix ι κ ℝ)
    (ε : ℝ) (hε : 0 < ε) (tstar : ℕ)
    (hrowIH : ∀ k : ι, ∀ (_ : Nonempty {i // i ≠ k}) (U' : ℕ → κ → ℝ)
      (V' : ℕ → {i // i ≠ k} → ℝ),
      IsVectorSystem (A.submatrix Subtype.val id) U' V' →
        ∀ t : ℕ, tstar ≤ t → vmax (V' t) - vmin (U' t) < ε / 2 * t)
    (hcolIH : ∀ k : κ, ∀ (_ : Nonempty {j // j ≠ k}) (U' : ℕ → {j // j ≠ k} → ℝ)
      (V' : ℕ → ι → ℝ),
      IsVectorSystem (A.submatrix id Subtype.val) U' V' →
        ∀ t : ℕ, tstar ≤ t → vmax (V' t) - vmin (U' t) < ε / 2 * t)
    (U : ℕ → κ → ℝ) (V : ℕ → ι → ℝ) (hUV : IsVectorSystem A U V) (s : ℕ)
    (hnot : (∃ i, ¬ RowEligible V i s (s + tstar)) ∨ (∃ j, ¬ ColEligible U j s (s + tstar))) :
    vmax (V (s + tstar)) - vmin (U (s + tstar)) <
      vmax (V s) - vmin (U s) + ε / 2 * tstar := by sorry

end RobinsonFP.Convergence
Source
Robinson, An Iterative Method of Solving a Game, Ann. of Math. 54(2) (1951), p. 299, display (3) in the proof of Lemma 4
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