AFTD Auto-Formalizing Theoretical Domains

Loomis.lamB.aux.le_lamB0

theoremverifiedformalizationimported Lean

Every lamB.aux value is bounded by the supremum lamB0.

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.lamB.aux.le_lamB0 {A B : I → J → ℝ} (hB : IsPositive B)
    (x : stdSimplex ℝ I) :
    lamB.aux A B x ≤ lamB0 A B
Formalizes
EconCSLib, `Loomis.lamB.aux.le_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
Classical.choiceQuot.soundpropext
Built on 5
  • 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.IsPositiveA matrix B : I → J → ℝ is entrywise positive if every entry is > 0. This is the hypothesis driving the general Loomis theorem, and…
  • Loomis.lamB.aux.bddAbovelamB.aux A B is bounded above on the simplex (continuous function on a compact set).
  • Loomis.lamB0Maxmin Loomis scalar λ₀ = sup_x λ_aux(x).
Used by 1
  • 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…

Lean source view module on GitHub

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 `lamB.aux` value is bounded by the supremum `lamB0`. -/theorem Loomis.lamB.aux.le_lamB0 {A B : I → J → ℝ} (hB : IsPositive B)    (x : stdSimplex ℝ I) :    lamB.aux A B x ≤ lamB0 A B :=  le_ciSup (bddAbove_def.2 (by    obtain ⟨C, hC⟩ := lamB.aux.bddAbove hB    exact ⟨C, by rintro r ⟨x, rfl⟩; exact hC x⟩)) x
See it in the graphDiscuss this resultChallenge it