AFTD Auto-Formalizing Theoretical Domains

MatrixGame.IsMinimax

defimported Lean

v is a minimax value of A: some column strategy caps player I's payoff at v (existence), and no strictly smaller cap is achievable (minimality).

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 ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable (A : MatrixGame I J ๐•œ) in
def MatrixGame.IsMinimax (A : MatrixGame I J ๐•œ) (v : ๐•œ) : Prop
Defined in
EconCSLib, `MatrixGame.IsMinimax`
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.EiExpected payoff when pure row i faces Player II's mixed strategy y.
  • 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โ€ฆ

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 ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable (A : MatrixGame I J ๐•œ) in
/-- `v` is a **minimax value** of `A`: some column strategy caps player I's payoff at `v` (existence), and no strictly smaller cap is achievable (minimality). -/
def MatrixGame.IsMinimax (A : MatrixGame I J ๐•œ) (v : ๐•œ) : Prop :=
  (โˆƒ y : stdSimplex ๐•œ J, โˆ€ i, A.Ei i y โ‰ค v) โˆง
  (โˆ€ w, (โˆƒ y : stdSimplex ๐•œ J, โˆ€ i, A.Ei i y โ‰ค w) โ†’ v โ‰ค w)
See it in the graphDiscuss this resultChallenge it