Loomis.muB.aux_lt_of_rowOffset_pos
theoremverifiedformalizationimported Lean
muB.aux A B y is strictly below mu iff every offset rowOffset is strictly positive at y.
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_lt_of_rowOffset_pos {A B : I → J → ℝ} (hB : IsPositive B) {mu : ℝ} {y : stdSimplex ℝ J} (H : ∀ i, 0 < rowOffset A B mu y i) : muB.aux A B y < mu
- Formalizes
- EconCSLib, `Loomis.muB.aux_lt_of_rowOffset_pos`
- 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_lt_of_rowOffset_pos← Loomis.muB.aux_lt_of_rowOffset_pos (EconCSLib/Math/Minimax/Loomis.lean:437): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- Loomis.ByColumn-vector product
(By)_i = ∑ⱼ Bᵢⱼ yⱼ. - Loomis.AyColumn-vector product
(Ay)_i = ∑ⱼ Aᵢⱼ yⱼ. - Loomis.rowOffsetLinearised row constraint:
rowOffset A B μ y i = μ · (By)_i - (Ay)_i. - 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.By_posPositivity of the column aggregate when
Bis entrywise positive. - Loomis.rowRatioColumn player's per-row Loomis ratio
(Ay)_i / (By)_i. - Loomis.muB.aux_lt_iff_ltCharacterisation:
muB.aux A B y < ciff every row ratio is belowc. - Loomis.muB.auxPlayer II's Loomis-ratio cap under mixed strategy
y: supremum over pure rows.
- Loomis.ByColumn-vector product
- 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/-- `muB.aux A B y` is strictly below `mu` iff every offset `rowOffset` is strictly positive at `y`. -/theorem Loomis.muB.aux_lt_of_rowOffset_pos {A B : I → J → ℝ} (hB : IsPositive B) {mu : ℝ} {y : stdSimplex ℝ J} (H : ∀ i, 0 < rowOffset A B mu y i) : muB.aux A B y < mu := by rw [muB.aux_lt_iff_lt] intro i unfold rowRatio rw [div_lt_iff₀ (By_pos hB y i)] have := H i unfold rowOffset at this linarith