Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — lim inf (max V(t) − min U(t))/t ≥ 0

Proved
RobinsonFP.Convergence.lemma1

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 (U,V)(U, V)(U,V) be a vector system for AAA (Definition 1). Then

lim inf⁡t→∞max⁡V(t)−min⁡U(t)t  ≥  0.\liminf_{t\to\infty} \frac{\max V(t) - \min U(t)}{t} \;\ge\; 0 .t→∞liminf​tmaxV(t)−minU(t)​≥0.

The gap max⁡V(t)−min⁡U(t)\max V(t) - \min U(t)maxV(t)−minU(t) is, after division by ttt, the difference between the upper and lower estimates of the value produced by the iteration; Lemma 1 says it cannot become negative at a linear rate. Together with Lemma 4 it shows that the gap is o(t)o(t)o(t).

Formalization Note The lim inf is stated in ε\varepsilonε-form: for every ε>0\varepsilon > 0ε>0 there is TTT with (max⁡V(t)−min⁡U(t))/t≥−ε(\max V(t) - \min U(t))/t \ge -\varepsilon(maxV(t)−minU(t))/t≥−ε for all integers t≥Tt \ge Tt≥T. This is equivalent to the extended-real lim inf being ≥0\ge 0≥0 and needs no boundedness assumption. At t=0t = 0t=0 Lean's division gives 000; this does not affect an eventual statement.

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, Lemma 1: `lim inf_{t→∞} (max V(t) − min U(t))/t ≥ 0`, stated in
ε-form: for every `ε > 0`, eventually `(max V(t) − min U(t))/t ≥ −ε`. -/
theorem lemma1 [Nonempty ι] [Nonempty κ] (A : Matrix ι κ ℝ)
    (U : ℕ → κ → ℝ) (V : ℕ → ι → ℝ) (hUV : IsVectorSystem A U V) :
    ∀ ε : ℝ, 0 < ε → ∀ᶠ t : ℕ in atTop, -ε ≤ (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. 297, Lemma 1
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