Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — nonnegative minimax criterion

Proved
HartSchmeidler.Finite.minimax_nonneg_criterion

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

finite-gamesminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1zero-sum-games

Let XXX and YYY be finite, nonempty pure-strategy sets and A:X×Y→RA:X\times Y\to\mathbb RA:X×Y→R a payoff matrix. Suppose that against every lottery yyy on YYY, the maximizing player has some lottery xxx on XXX whose expected payoff is nonnegative:

∀y∈Δ(Y), ∃x∈Δ(X):∑a∈X∑b∈Yx(a)y(b)A(a,b)≥0.\forall y\in\Delta(Y),\ \exists x\in\Delta(X): \sum_{a\in X}\sum_{b\in Y}x(a)y(b)A(a,b)\ge0.∀y∈Δ(Y), ∃x∈Δ(X):a∈X∑​b∈Y∑​x(a)y(b)A(a,b)≥0.

Then one lottery xxx guarantees nonnegative expected payoff against every lottery yyy on YYY. This is the criterion for the auxiliary game that Hart and Schmeidler draw from the finite minimax theorem.

Formalization Note Both pure-strategy sets are nonempty so that their lottery sets exist. The paper's auxiliary game has this property when there is at least one player; the playerless boundary of the goal requires its own immediate case.

Preamble
import Definitions.Def_agt_games
import Mathlib
Formal statement
namespace HartSchmeidler.Finite

open Finset

/-- Proof of Theorem 1, p. 19: the finite minimax theorem turns a response
to each column lottery into one row lottery guaranteeing nonnegative payoff. -/
theorem minimax_nonneg_criterion {X Y : Type*} [Fintype X] [Fintype Y]
    [Nonempty X] [Nonempty Y] (A : X → Y → ℝ)
    (hA : ∀ y : Y → ℝ, AGT.IsLottery y →
      ∃ x : X → ℝ, AGT.IsLottery x ∧
        0 ≤ ∑ a, ∑ b, x a * y b * A a b) :
    ∃ x : X → ℝ, AGT.IsLottery x ∧
      ∀ y : Y → ℝ, AGT.IsLottery y →
        0 ≤ ∑ a, ∑ b, x a * y b * A a b := by sorry

end HartSchmeidler.Finite
Source
Hart and Schmeidler, Existence of Correlated Equilibria, Math. Oper. Res. 14 (1989), p. 19, proof of Theorem 1 (‘By the Minimax Theorem’); https://doi.org/10.1287/moor.14.1.18
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