Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(17:E) — specially strictly determined iff both players have a pure good strategy

Proved
TheoryOfGames.Minimax.speciallyStrictlyDetermined_iff_pure_good

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

game-theorymixed-strategiesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1strictly-determinedzero-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Γ with β1≥1\beta_1 \ge 1β1​≥1 and β2≥1\beta_2 \ge 1β2​≥1 pure strategies. The game is specially strictly determined, i.e.

v1=Max⁡τ1Min⁡τ2H(τ1,τ2)=Min⁡τ2Max⁡τ1H(τ1,τ2)=v2,v_1 = \operatorname{Max}_{\tau_1} \operatorname{Min}_{\tau_2} \mathcal H(\tau_1, \tau_2) = \operatorname{Min}_{\tau_2} \operatorname{Max}_{\tau_1} \mathcal H(\tau_1, \tau_2) = v_2,v1​=Maxτ1​​Minτ2​​H(τ1​,τ2​)=Minτ2​​Maxτ1​​H(τ1​,τ2​)=v2​,

if and only if there exists for each player a good strategy which is a pure strategy: some coordinate vector δτ1\delta^{\tau_1}δτ1​ belongs to Aˉ\bar AAˉ and some coordinate vector δτ2\delta^{\tau_2}δτ2​ belongs to Bˉ\bar BBˉ.

The result ties the pure-strategy notion of strict determinateness of §14 to the mixed-strategy solution of §17.

Formalization Note δτ\delta^{\tau}δτ is pureVec τ, the vector with a 111 in coordinate τ\tauτ and 000 elsewhere; pure strategies are indexed from 000.

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

/-- (17:E), p. 161: a normalized zero-sum two-person game with `β₁, β₂ ≥ 1` pure strategies is
specially strictly determined (`v₁ = v₂`, 17.5.1) if and only if each player has a good
strategy which is a pure strategy: some `δ^{τ₁}` belongs to `Ā` and some `δ^{τ₂}` belongs
to `B̄`. -/
theorem speciallyStrictlyDetermined_iff_pure_good {β₁ β₂ : ℕ} (hβ₁ : 0 < β₁) (hβ₂ : 0 < β₂)
    (H : Fin β₁ → Fin β₂ → ℝ) :
    SpeciallyStrictlyDetermined H ↔
      (∃ τ₁ : Fin β₁, pureVec τ₁ ∈ goodA H) ∧ (∃ τ₂ : Fin β₂, pureVec τ₂ ∈ goodB H) := by sorry

end TheoryOfGames.Minimax
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 161, (17:E); definition of special strict determinateness p. 150, 17.5.1
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