MinimaxLoomis.lam.aux
defimported Lean
Player I's guaranteed payoff from mixed strategy x: the minimum over pure columns of the expected payoff.
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.lam.aux (A : I → J → ℝ) (x : stdSimplex ℝ I) : ℝ
- Defined in
- EconCSLib, `MinimaxLoomis.lam.aux`
- 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.MinimaxLoomis.lam.aux← MinimaxLoomis.lam.aux (EconCSLib/Math/Minimax/MinimaxLoomis.lean:61): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- wsumWeighted sum of
- Used by 13
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs ↔ saddle points. A pair of mixed strategies is in the product
X(A) × Y(A)of optimal strategy sets iff it is a saddle… - MinimaxLoomis.lam.aux_gt_iff_gt
lam.aux A x > ciff every pure-column expected payoff exceedsc. - MinimaxLoomis.lam.aux.le_lam0The supremum
lam0dominates everylam.auxvalue. - Loomis.lamB.aux_oneLoomis.lamB.aux_one
- MinimaxLoomis.lam.aux.continuous
lam.aux Ais continuous as a function of the simplex point. - MinimaxLoomis.exists_xx_lam0There exists a mixed strategy
xxwhose column-payoffs all dominatelam0 A. Compactness + continuity gives a maximiser oflam.aux;… - MinimaxLoomis.lam.aux.bddAbove
lam.aux Ais uniformly bounded above on the simplex. - MatrixGame.common_guarantee_eq_valueCommon guarantee gives the value. If both players guarantee the same scalar
w, thenwequals the game value. - MatrixGame.optimalRowSet_nonemptyMatrixGame.optimalRowSet_nonempty
- Loomis.lamB0_oneLoomis.lamB0_one
- MatrixGame.mem_optimalRowStrategies_iff_E_geA row strategy is optimal iff against every mixed column it secures the value.
- MatrixGame.optimalColumnSet_nonemptyMatrixGame.optimalColumnSet_nonempty
- MinimaxLoomis.lam0Player I's maxmin value (the row player's best guarantee).
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs ↔ saddle points. A pair of mixed strategies is in the product
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 guaranteed payoff from mixed strategy `x`: the minimum over pure columns of the expected payoff. -/ noncomputable def MinimaxLoomis.lam.aux (A : I → J → ℝ) (x : stdSimplex ℝ I) : ℝ := Finset.inf' Finset.univ Finset.univ_nonempty (fun j => wsum x (fun i => A i j))