Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — there is t₀, uniform over vector systems, with max V(t) − min U(t) < εt for t ≥ t₀

Proved
RobinsonFP.Convergence.lemma4

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

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

Let AAA be a real m×nm \times nm×n matrix with m,n≥1m, n \ge 1m,n≥1 and let ε>0\varepsilon > 0ε>0. There is a nonnegative integer t0t_0t0​, depending only on AAA and ε\varepsilonε, such that every vector system (U,V)(U, V)(U,V) for AAA satisfies

max⁡V(t)−min⁡U(t)  <  εtfor all t≥t0.\max V(t) - \min U(t) \;<\; \varepsilon t \qquad\text{for all } t \ge t_0 .maxV(t)−minU(t)<εtfor all t≥t0​.

The point is the uniformity: one t0t_0t0​ serves every vector system, whatever its initial vectors and tie-breaking, which is what lets the proof proceed by induction over submatrices. With Lemma 1 it gives (max⁡V(t)−min⁡U(t))/t→0(\max V(t) - \min U(t))/t \to 0(maxV(t)−minU(t))/t→0.

Formalization Note The order of quantifiers is ∃t0 ∀(U,V) ∀t≥t0\exists t_0\ \forall (U, V)\ \forall t \ge t_0∃t0​ ∀(U,V) ∀t≥t0​, as in the paper. The matrix is fixed in the statement; a proof will typically generalize over the index types to run the induction over submatrices.

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

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

/-- Robinson (1951), p. 299, Lemma 4: for every matrix `A` and `ε > 0` there is `t₀`, depending
only on `A` and `ε`, such that every vector system `(U, V)` for `A` satisfies
`max V(t) − min U(t) < εt` for all `t ≥ t₀`. -/
theorem lemma4 [Nonempty ι] [Nonempty κ] (A : Matrix ι κ ℝ) (ε : ℝ) (hε : 0 < ε) :
    ∃ t₀ : ℕ, ∀ (U : ℕ → κ → ℝ) (V : ℕ → ι → ℝ), IsVectorSystem A U V →
      ∀ t : ℕ, t₀ ≤ t → vmax (V t) - vmin (U t) < ε * t := by sorry

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