Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(17:C:f) — ξ∈Aˉ\xi \in \bar Aξ∈Aˉ and η∈Bˉ\eta \in \bar Bη∈Bˉ iff ξ,η\xi, \etaξ,η is a saddle point of KKK

Proved
TheoryOfGames.Minimax.good_iff_saddlePoint

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

game-theorymixed-strategiesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1saddle-pointzero-sum-games

Let H(τ1,τ2)\mathcal H(\tau_1, \tau_2)H(τ1​,τ2​) be the matrix of a normalized zero-sum two-person game Γ\GammaΓ, K(ξ,η)K(\xi, \eta)K(ξ,η) the bilinear form (17:2), and Aˉ⊆Sβ1\bar A \subseteq S_{\beta_1}Aˉ⊆Sβ1​​, Bˉ⊆Sβ2\bar B \subseteq S_{\beta_2}Bˉ⊆Sβ2​​ the sets of good strategies (17:B:a), (17:B:b). For all mixed strategies ξ∈Sβ1\xi \in S_{\beta_1}ξ∈Sβ1​​ and η∈Sβ2\eta \in S_{\beta_2}η∈Sβ2​​,

ξ∈Aˉ and η∈Bˉ  ⟺  ξ,η is a saddle point of K(ξ,η),\xi \in \bar A \text{ and } \eta \in \bar B \iff \xi, \eta \text{ is a saddle point of } K(\xi, \eta),ξ∈Aˉ and η∈Bˉ⟺ξ,η is a saddle point of K(ξ,η),

that is, iff K(ξ′,η)≤K(ξ,η)≤K(ξ,η′)K(\xi', \eta) \le K(\xi, \eta) \le K(\xi, \eta')K(ξ′,η)≤K(ξ,η)≤K(ξ,η′) for all ξ′∈Sβ1\xi' \in S_{\beta_1}ξ′∈Sβ1​​, η′∈Sβ2\eta' \in S_{\beta_2}η′∈Sβ2​​.

In the book's words: both players play Γ\GammaΓ well if and only if ξ,η\xi, \etaξ,η is a saddle point of KKK. It is (13:D*) applied to KKK, which is legitimate because a saddle point of KKK always exists by the minimax theorem (17:6).

Preamble
import Mathlib
import Definitions.Def_TheoryOfGames_Minimax_MixedStrategy
Formal statement
namespace TheoryOfGames.Minimax

/-- (17:C:f), p. 159: for mixed strategies `ξ ∈ S_{β₁}`, `η ∈ S_{β₂}` of the normalized
zero-sum two-person game with matrix `ℋ`, `ξ ∈ Ā` and `η ∈ B̄` if and only if `ξ, η` is a
saddle point of `K(ξ, η)`. -/
theorem good_iff_saddlePoint {β₁ β₂ : ℕ} (H : Fin β₁ → Fin β₂ → ℝ)
    (ξ : Fin β₁ → ℝ) (η : Fin β₂ → ℝ)
    (hξ : ξ ∈ stdSimplex ℝ (Fin β₁)) (hη : η ∈ stdSimplex ℝ (Fin β₂)) :
    (ξ ∈ goodA H ∧ η ∈ goodB H) ↔ IsMixedSaddlePoint H ξ η := by sorry

end TheoryOfGames.Minimax
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 159, (17:C:f)
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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