AFTD Auto-Formalizing Theoretical Domains

Loomis.lamB0

defimported Lean

Maxmin Loomis scalar λ₀ = sup_x λ_aux(x).

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.lamB0 (A B : I → J → ℝ) : ℝ
Defined in
EconCSLib, `Loomis.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.
Verified
08 Oct 2026
Axioms
none listed
Built on 2
  • 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.
Used by 9
  • Loomis.exists_xx_lamB0Attainment of lamB0: there exists a mixed strategy xx with (xA xx)_j ≥ lamB0 · (xB xx)_j for every column.
  • Loomis.lamB.aux.le_lamB0Every lamB.aux value is bounded by the supremum lamB0.
  • Loomis.minmax_from_generalSimplified Loomis as a corollary of the general theorem: the finite von Neumann minimax MinimaxLoomis.lam0 A = MinimaxLoomis.mu0 A…
  • Loomis.loomis_value_eq_auxLoomis induction: lamB0 A B = muB0 A B for any finite positive-B matrix pair with 2 ≤ |I| + |J|, by strong induction on the…
  • Loomis.lamB0_le_muB0Weak duality for the Loomis scalars: lamB0 ≤ muB0.
  • 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.loomis_value_eqLoomis scalar equality: every finite positive-B matrix pair over ℝ has equal maxmin and minmax Loomis ratios.
  • Loomis.loomis_theoremLoomis Theorem [MFoGT, Theorem 2.5.1]. For any pair of matrices A B : I → J → ℝ with B entrywise positive, there exist mixed…
  • Loomis.lamB0_oneLoomis.lamB0_one

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
/-- Maxmin Loomis scalar `λ₀ = sup_x λ_aux(x)`. -/
noncomputable def Loomis.lamB0 (A B : I → J → ℝ) : ℝ := iSup (lamB.aux A B)
See it in the graphDiscuss this resultChallenge it