MinimaxLoomis.exists_yy_mu0
theoremverifiedformalizationimported Lean
There exists a mixed strategy yy whose row-payoffs are all dominated by mu0 A.
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 theorem MinimaxLoomis.exists_yy_mu0 (A : I → J → ℝ) : ∃ yy : stdSimplex ℝ J, ∀ i, wsum yy (fun j => A i j) ≤ mu0 A
- Formalizes
- EconCSLib, `MinimaxLoomis.exists_yy_mu0`
- 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.exists_yy_mu0← MinimaxLoomis.exists_yy_mu0 (EconCSLib/Math/Minimax/MinimaxLoomis.lean:178): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- MinimaxLoomis.mu.aux.continuous
mu.aux Ais continuous as a function of the simplex point. - Loomis.lamB.aux.continuous
lamB.aux A Bis continuous on the simplex. - MinimaxLoomis.mu0Player II's minmax value (the column player's best cap).
- 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.
- MinimaxLoomis.mu.auxPlayer II's maximum loss against mixed strategy
y: the maximum over pure rows of the expected payoff. - Loomis.muB.aux.continuous
muB.aux A Bis continuous on the simplex.
- MinimaxLoomis.mu.aux.continuous
- Used by 2
- MatrixGame.minimax_optimal_strategiesExistence of optimal mixed strategies: there exist mixed strategies
xxfor Player I andyyfor Player II and a valuevsuch that: -… - MinimaxLoomis.lam0_le_mu0Weak duality for the two-player zero-sum matrix game: every maxmin value is bounded by every minmax value.
- MatrixGame.minimax_optimal_strategiesExistence of optimal mixed strategies: there exist mixed strategies
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- There exists a mixed strategy `yy` whose row-payoffs are all dominated by `mu0 A`. -/theorem MinimaxLoomis.exists_yy_mu0 (A : I → J → ℝ) : ∃ yy : stdSimplex ℝ J, ∀ i, wsum yy (fun j => A i j) ≤ mu0 A := by obtain ⟨yy, _, hyy⟩ := isCompact_univ.exists_isMinOn (α := ℝ) (β := stdSimplex ℝ J) Set.univ_nonempty (mu.aux.continuous A).continuousOn rw [isMinOn_iff] at hyy refine ⟨yy, fun i => ?_⟩ have h1 : mu.aux A yy ≤ mu0 A := le_ciInf fun z => hyy z (Set.mem_univ _) have h2 : wsum yy (fun j => A i j) ≤ mu.aux A yy := Finset.le_sup' (f := fun i => wsum yy (fun j => A i j)) (Finset.mem_univ i) exact h2.trans h1