MinimaxLoomis.lam.aux.continuous
theoremverifiedformalizationimported Lean
lam.aux A is continuous as a function of the simplex point.
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.lam.aux.continuous (A : I → J → ℝ) : Continuous (lam.aux A)
- Formalizes
- EconCSLib, `MinimaxLoomis.lam.aux.continuous`
- 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.continuous← MinimaxLoomis.lam.aux.continuous (EconCSLib/Math/Minimax/MinimaxLoomis.lean:73): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- Loomis.lamB.aux.continuous
lamB.aux A Bis continuous on the simplex. - wsum_continuous
wsum (·) fis continuous on the standard simplex over ℝ. - wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - 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.
- Loomis.muB.aux.continuous
muB.aux A Bis continuous on the simplex.
- Loomis.lamB.aux.continuous
- Used by 1
- MinimaxLoomis.exists_xx_lam0There exists a mixed strategy
xxwhose column-payoffs all dominatelam0 A. Compactness + continuity gives a maximiser oflam.aux;…
- MinimaxLoomis.exists_xx_lam0There exists a mixed strategy
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/-- `lam.aux A` is continuous as a function of the simplex point. -/theorem MinimaxLoomis.lam.aux.continuous (A : I → J → ℝ) : Continuous (lam.aux A) := by refine Continuous.finset_inf'_apply Finset.univ_nonempty ?_ intro j _ exact wsum_continuous (fun i => A i j)