AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.lam0

defimported Lean

Player I's maxmin value (the row player's best guarantee).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
noncomputable def MinimaxLoomis.lam0 (A : I → J → ℝ) : ℝ
Defined in
EconCSLib, `MinimaxLoomis.lam0`
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
  • MinimaxLoomis.lam.auxPlayer I's guaranteed payoff from mixed strategy x: the minimum over pure columns of the expected payoff.
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
Used by 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
/-- Player I's maxmin value (the row player's best guarantee). -/
noncomputable def MinimaxLoomis.lam0 (A : I → J → ℝ) : ℝ := iSup (lam.aux A)
See it in the graphDiscuss this resultChallenge it