Loomis.muB.aux.ge_muB0
theoremverifiedformalizationimported Lean
Every muB.aux value dominates the infimum muB0.
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.muB.aux.ge_muB0 {A B : I → J → ℝ} (hB : IsPositive B) (y : stdSimplex ℝ J) : muB0 A B ≤ muB.aux A B y
- Formalizes
- EconCSLib, `Loomis.muB.aux.ge_muB0`
- 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.muB.aux.ge_muB0← Loomis.muB.aux.ge_muB0 (EconCSLib/Math/Minimax/Loomis.lean:198): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- Loomis.muB0Minmax Loomis scalar
μ₀ = inf_y μ_aux(y). - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.muB.aux.bddBelow
muB.aux A Bis bounded below on the simplex. - 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.muB.auxPlayer II's Loomis-ratio cap under mixed strategy
y: supremum over pure rows.
- Loomis.muB0Minmax Loomis scalar
- Used by 1
- Loomis.loomis_value_eq_auxLoomis induction:
lamB0 A B = muB0 A Bfor any finite positive-Bmatrix pair with2 ≤ |I| + |J|, by strong induction on the…
- Loomis.loomis_value_eq_auxLoomis induction:
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/-- Every `muB.aux` value dominates the infimum `muB0`. -/theorem Loomis.muB.aux.ge_muB0 {A B : I → J → ℝ} (hB : IsPositive B) (y : stdSimplex ℝ J) : muB0 A B ≤ muB.aux A B y := ciInf_le (bddBelow_def.2 (by obtain ⟨C, hC⟩ := muB.aux.bddBelow hB exact ⟨C, by rintro r ⟨y, rfl⟩; exact hC y⟩)) y