AFTD Auto-Formalizing Theoretical Domains

MatrixGame.minimax

defimported Lean

The minimax value: the best guarantee Player II can achieve. minimax = inf_y sup_i E(i, y)

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable {π•œ : Type} [Field π•œ] [ConditionallyCompleteLinearOrder π•œ]
  [IsStrictOrderedRing π•œ] in
variable (A : MatrixGame I J π•œ) in
noncomputable def MatrixGame.minimax : π•œ
Defined in
EconCSLib, `MatrixGame.minimax`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 2
  • MatrixGame.guarantee_IIPlayer II's guaranteed loss using mixed strategy y: the maximum expected payoff (for Player I) over all of Player I's pure responses.
  • MatrixGameA finite two-player zero-sum matrix game. Player I chooses row i : I, Player II chooses column j : J. Payoff to Player I is g i j…
Used by 8

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable {π•œ : Type} [Field π•œ] [ConditionallyCompleteLinearOrder π•œ]
  [IsStrictOrderedRing π•œ] in
variable (A : MatrixGame I J π•œ) in
/-- The minimax value: the best guarantee Player II can achieve. `minimax = inf_y sup_i E(i, y)` -/
noncomputable def MatrixGame.minimax : π•œ :=
  iInf (fun y => A.guarantee_II y)
See it in the graphDiscuss this resultChallenge it