Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1) — min_j Σ_i a_ij x_i ≤ max_i Σ_j a_ij y_j for all mixed strategies

Proved
RobinsonFP.Convergence.ineq1

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 pay-off matrix with m,n≥1m, n \ge 1m,n≥1. For every probability vector x=(x1,…,xm)x = (x_1,\dots,x_m)x=(x1​,…,xm​) of the first player (xi≥0x_i \ge 0xi​≥0, ∑ixi=1\sum_i x_i = 1∑i​xi​=1) and every probability vector y=(y1,…,yn)y = (y_1, \dots, y_n)y=(y1​,…,yn​) of the second player (yj≥0y_j \ge 0yj​≥0, ∑jyj=1\sum_j y_j = 1∑j​yj​=1),

min⁡j∑iaijxi  ≤  max⁡i∑jaijyj.\min_j \sum_i a_{ij} x_i \;\le\; \max_i \sum_j a_{ij} y_j .jmin​i∑​aij​xi​≤imax​j∑​aij​yj​.

The left side is the payoff the first player guarantees with xxx, the right side the loss the second player concedes at most with yyy. This weak duality inequality is used in Lemma 1, in Lemma 3 (for the transpose of AAA), and at the end of the proof of the Theorem.

Formalization Note Probability vectors are elements of Mathlib's stdSimplex. Rows and columns are indexed by finite nonempty types.

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

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

/-- Robinson (1951), p. 296, inequality (1): for all probability vectors `x` (over rows) and `y`
(over columns), `min_j Σ_i a_ij x_i ≤ max_i Σ_j a_ij y_j`. -/
theorem ineq1 [Nonempty ι] [Nonempty κ] (A : Matrix ι κ ℝ) :
    ∀ x ∈ stdSimplex ℝ ι, ∀ y ∈ stdSimplex ℝ κ,
      vmin (fun j => ∑ i, A i j * x i) ≤ vmax (fun i => ∑ j, A i j * y j) := by sorry

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