MinimaxLoomis.mu.aux_lt_iff_lt
theoremverifiedformalizationimported Lean
mu.aux A y < c iff every pure-row expected payoff is below c.
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.mu.aux_lt_iff_lt (A : I → J → ℝ) (c : ℝ) (y : stdSimplex ℝ J) : mu.aux A y < c ↔ ∀ i, wsum y (fun j => A i j) < c
- Formalizes
- EconCSLib, `MinimaxLoomis.mu.aux_lt_iff_lt`
- 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_lt_iff_lt← MinimaxLoomis.mu.aux_lt_iff_lt (EconCSLib/Math/Minimax/MinimaxLoomis.lean:137): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- 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.
- wsumWeighted sum of
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/-- `mu.aux A y < c` iff every pure-row expected payoff is below `c`. -/theorem MinimaxLoomis.mu.aux_lt_iff_lt (A : I → J → ℝ) (c : ℝ) (y : stdSimplex ℝ J) : mu.aux A y < c ↔ ∀ i, wsum y (fun j => A i j) < c := by simp [mu.aux, Finset.sup'_lt_iff]