Loomis.lamB.aux
defimported Lean
Player I's guaranteed Loomis ratio under mixed strategy x: infimum over pure columns.
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 noncomputable def Loomis.lamB.aux (A B : I → J → ℝ) (x : stdSimplex ℝ I) : ℝ
- Defined in
- EconCSLib, `Loomis.lamB.aux`
- 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← Loomis.lamB.aux (EconCSLib/Math/Minimax/Loomis.lean:114): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- Loomis.colRatioRow player's per-column Loomis ratio
(xA)_j / (xB)_j. - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.colRatioRow player's per-column Loomis ratio
- Used by 11
- Loomis.exists_xx_lamB0Attainment of
lamB0: there exists a mixed strategyxxwith(xA xx)_j ≥ lamB0 · (xB xx)_jfor every column. - Loomis.lamB.aux.continuous
lamB.aux A Bis continuous on the simplex. - Loomis.lamB.aux_oneLoomis.lamB.aux_one
- Loomis.lamB.aux.le_lamB0Every
lamB.auxvalue is bounded by the supremumlamB0. - 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.lamB.aux_gt_of_colOffset_pos
lamB.aux A B xstrictly exceedslamiff every offsetcolOffsetis strictly positive atx. - Loomis.lamB.aux_gt_iff_gtCharacterisation:
lamB.aux A B x > ciff every column ratio exceedsc. - Loomis.loomis_value_IJ_2Base case of the Loomis induction: a 1×1 matrix pair has the single ratio
A i₀ j₀ / B i₀ j₀as the common Loomis value. - Loomis.lamB0_oneLoomis.lamB0_one
- Loomis.lamB.aux.bddAbove
lamB.aux A Bis bounded above on the simplex (continuous function on a compact set). - Loomis.lamB0Maxmin Loomis scalar
λ₀ = sup_x λ_aux(x).
- Loomis.exists_xx_lamB0Attainment of
Lean source view module on GitHub
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 /-- Player I's guaranteed Loomis ratio under mixed strategy `x`: infimum over pure columns. -/ noncomputable def Loomis.lamB.aux (A B : I → J → ℝ) (x : stdSimplex ℝ I) : ℝ := Finset.inf' Finset.univ Finset.univ_nonempty (fun j => colRatio A B x j)