Loomis.lamB.aux.bddAbove
theoremverifiedformalizationimported Lean
lamB.aux A B is bounded above on the simplex (continuous function on a compact set).
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 Loomis.lamB.aux.bddAbove {A B : I → J → ℝ} (hB : IsPositive B) : ∃ C, ∀ x, lamB.aux A B x ≤ C
- Formalizes
- EconCSLib, `Loomis.lamB.aux.bddAbove`
- 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.Loomis.lamB.aux.bddAbove← Loomis.lamB.aux.bddAbove (EconCSLib/Math/Minimax/Loomis.lean:176): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- Loomis.lamB.aux.continuous
lamB.aux A Bis continuous on the simplex. - Loomis.lamB.auxPlayer I's guaranteed Loomis ratio under mixed strategy
x: infimum over pure columns. - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.IsPositiveA matrix
B : I → J → ℝis entrywise positive if every entry is> 0. This is the hypothesis driving the general Loomis theorem, and…
- Loomis.lamB.aux.continuous
- Used by 6
- 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.le_lam0The supremum
lam0dominates everylam.auxvalue. - Loomis.lamB.aux.le_lamB0Every
lamB.auxvalue is bounded by the supremumlamB0. - 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.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
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/-- `lamB.aux A B` is bounded above on the simplex (continuous function on a compact set). -/theorem Loomis.lamB.aux.bddAbove {A B : I → J → ℝ} (hB : IsPositive B) : ∃ C, ∀ x, lamB.aux A B x ≤ C := by obtain ⟨C, hC⟩ := (isCompact_univ.image (lamB.aux.continuous hB)).bddAbove refine ⟨C, fun x => hC ⟨x, Set.mem_univ _, rfl⟩⟩