Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of the Theorem, p. 301 — (max V(t) − min U(t))/t → 0

Proved
RobinsonFP.Convergence.gap_ratio_tendsto_zero

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. Then

lim⁡t→∞max⁡V(t)−min⁡U(t)t=0.\lim_{t\to\infty} \frac{\max V(t) - \min U(t)}{t} = 0 .t→∞lim​tmaxV(t)−minU(t)​=0.

This is the first step of the conclusion of the proof of the Theorem, obtained from Lemmas 1 and 4: the upper estimate max⁡V(t)/t\max V(t)/tmaxV(t)/t and the lower estimate min⁡U(t)/t\min U(t)/tminU(t)/t of the value come together.

Formalization Note Time runs over the natural numbers and the limit is along t→∞t \to \inftyt→∞; the value at t=0t = 0t=0 (where Lean's division gives 000) does not matter.

Preamble
import Mathlib
import Definitions.Def_RobinsonFP_Convergence_VectorSystem

open Filter Topology
Formal statement
namespace RobinsonFP.Convergence

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

/-- Robinson (1951), p. 301, proof of the Theorem: `lim_{t→∞} (max V(t) − min U(t))/t = 0`. -/
theorem gap_ratio_tendsto_zero [Nonempty ι] [Nonempty κ] (A : Matrix ι κ ℝ)
    (U : ℕ → κ → ℝ) (V : ℕ → ι → ℝ) (hUV : IsVectorSystem A U V) :
    Tendsto (fun t : ℕ => (vmax (V t) - vmin (U t)) / t) atTop (𝓝 0) := by sorry

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