Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of the Theorem, p. 301 — lim sup min U(t)/t ≤ v and lim inf max V(t)/t ≥ v

Proved
RobinsonFP.Convergence.limsup_liminf_value

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, let (X,Y)(X, Y)(X,Y) be a solution of the game AAA with value vvv, and let (U,V)(U, V)(U,V) be a vector system for AAA. Then

lim sup⁡t→∞min⁡U(t)t≤v,lim inf⁡t→∞max⁡V(t)t≥v.\limsup_{t\to\infty} \frac{\min U(t)}{t} \le v, \qquad \liminf_{t\to\infty} \frac{\max V(t)}{t} \ge v .t→∞limsup​tminU(t)​≤v,t→∞liminf​tmaxV(t)​≥v.

The lower estimate cannot exceed the value and the upper estimate cannot fall below it, asymptotically; with the previous step this pins both limits at vvv.

Formalization Note Both are stated together in ε\varepsilonε-form: for every ε>0\varepsilon > 0ε>0, for all sufficiently large ttt, min⁡U(t)/t≤v+ε\min U(t)/t \le v + \varepsilonminU(t)/t≤v+ε and max⁡V(t)/t≥v−ε\max V(t)/t \ge v - \varepsilonmaxV(t)/t≥v−ε. The value vvv is tied to a solution (X,Y)(X, Y)(X,Y) through IsSolution A x y v, exactly as the paper defines it on p. 296; such a solution exists for every matrix by the minimax theorem (proved on Prove2Me as MatousekLP.ZeroSum.minimax_equality, in another encoding).

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 sup_{t→∞} min U(t)/t ≤ v` and
`lim inf_{t→∞} max V(t)/t ≥ v`, where `v` is the value of the game, stated in ε-form. -/
theorem limsup_liminf_value [Nonempty ι] [Nonempty κ] (A : Matrix ι κ ℝ)
    (U : ℕ → κ → ℝ) (V : ℕ → ι → ℝ) (hUV : IsVectorSystem A U V)
    (x : ι → ℝ) (y : κ → ℝ) (v : ℝ) (hsol : IsSolution A x y v) :
    ∀ ε : ℝ, 0 < ε → ∀ᶠ t : ℕ in atTop,
      vmin (U t) / t ≤ v + ε ∧ v - ε ≤ vmax (V t) / t := 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 (second 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