MinimaxLoomis.mu.aux
defimported Lean
Player II's maximum loss against mixed strategy y: the maximum over pure rows 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.mu.aux (A : I → J → ℝ) (y : stdSimplex ℝ J) : ℝ
- Defined in
- EconCSLib, `MinimaxLoomis.mu.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.mu.aux← MinimaxLoomis.mu.aux (EconCSLib/Math/Minimax/MinimaxLoomis.lean:130): 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… - Loomis.muB0_oneLoomis.muB0_one
- MinimaxLoomis.mu.aux.continuous
mu.aux Ais continuous as a function of the simplex point. - MinimaxLoomis.mu.aux_lt_iff_lt
mu.aux A y < ciff every pure-row expected payoff is belowc. - MinimaxLoomis.mu0Player II's minmax value (the column player's best cap).
- MinimaxLoomis.mu.aux.bddBelow
mu.aux Ais uniformly bounded below on the simplex. - MinimaxLoomis.exists_yy_mu0There exists a mixed strategy
yywhose row-payoffs are all dominated bymu0 A. - Loomis.muB.aux_oneLoomis.muB.aux_one
- 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
- MatrixGame.mem_optimalColumnStrategies_iff_E_leA column strategy is optimal iff against every mixed row it caps payoff at the value.
- MinimaxLoomis.mu.aux.ge_mu0The infimum
mu0is dominated by everymu.auxvalue. - MatrixGame.optimalColumnSet_nonemptyMatrixGame.optimalColumnSet_nonempty
- 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 II's maximum loss against mixed strategy `y`: the maximum over pure rows of the expected payoff. -/ noncomputable def MinimaxLoomis.mu.aux (A : I → J → ℝ) (y : stdSimplex ℝ J) : ℝ := Finset.sup' Finset.univ Finset.univ_nonempty (fun i => wsum y (fun j => A i j))