Loomis.exists_xx_lamB0
theoremverifiedformalizationimported Lean
Attainment of lamB0: there exists a mixed strategy xx with (xA xx)_j ≥ lamB0 · (xB xx)_j for every column.
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.exists_xx_lamB0 (A B : I → J → ℝ) (hB : IsPositive B) : ∃ xx : stdSimplex ℝ I, ∀ j, lamB0 A B * xB B xx j ≤ xA A xx j
- Formalizes
- EconCSLib, `Loomis.exists_xx_lamB0`
- 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.exists_xx_lamB0← Loomis.exists_xx_lamB0 (EconCSLib/Math/Minimax/Loomis.lean:207): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- Loomis.lamB.aux.continuous
lamB.aux A Bis continuous on the simplex. - Loomis.colRatioRow player's per-column Loomis ratio
(xA)_j / (xB)_j. - 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.xBRow-vector product
(xB)_j = ∑ᵢ xᵢ Bᵢⱼ. - Loomis.xARow-vector product
(xA)_j = ∑ᵢ xᵢ Aᵢⱼ. - 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.xB_posPositivity of the row aggregate when
Bis entrywise positive. - Loomis.lamB0Maxmin Loomis scalar
λ₀ = sup_x λ_aux(x).
- Loomis.lamB.aux.continuous
- Used by 3
- 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.lamB0_le_muB0Weak duality for the Loomis scalars:
lamB0 ≤ muB0. - Loomis.loomis_theoremLoomis Theorem [MFoGT, Theorem 2.5.1]. For any pair of matrices
A B : I → J → ℝwithBentrywise positive, there exist mixed…
- 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/-- Attainment of `lamB0`: there exists a mixed strategy `xx` with `(xA xx)_j ≥ lamB0 · (xB xx)_j` for every column. -/theorem Loomis.exists_xx_lamB0 (A B : I → J → ℝ) (hB : IsPositive B) : ∃ xx : stdSimplex ℝ I, ∀ j, lamB0 A B * xB B xx j ≤ xA A xx j := by obtain ⟨xx, _, hxx⟩ := isCompact_univ.exists_isMaxOn (α := ℝ) (β := stdSimplex ℝ I) Set.univ_nonempty (lamB.aux.continuous hB).continuousOn rw [isMaxOn_iff] at hxx refine ⟨xx, fun j => ?_⟩ have h1 : lamB0 A B ≤ lamB.aux A B xx := ciSup_le fun y => hxx y (Set.mem_univ _) have h2 : lamB.aux A B xx ≤ colRatio A B xx j := Finset.inf'_le _ (Finset.mem_univ j) have hxxB : 0 < xB B xx j := xB_pos hB xx j -- lamB0 ≤ xA / xB ⇒ lamB0 * xB ≤ xA (since xB > 0) have hratio : lamB0 A B ≤ colRatio A B xx j := h1.trans h2 unfold colRatio at hratio exact (le_div_iff₀ hxxB).mp hratio