AFTD Auto-Formalizing Theoretical Domains

Loomis.muB.aux.bddBelow

theoremverifiedformalizationimported Lean

muB.aux A B is bounded below on the simplex.

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.bddBelow {A B : I → J → ℝ} (hB : IsPositive B) :
    ∃ C, ∀ y, C ≤ muB.aux A B y
Formalizes
EconCSLib, `Loomis.muB.aux.bddBelow`
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 4
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • Loomis.muB.aux.continuousmuB.aux A B is continuous on the simplex.
  • 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.muB.auxPlayer II's Loomis-ratio cap under mixed strategy y: supremum over pure rows.
Used by 8

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/-- `muB.aux A B` is bounded below on the simplex. -/theorem Loomis.muB.aux.bddBelow {A B : I → J → ℝ} (hB : IsPositive B) :    ∃ C, ∀ y, C ≤ muB.aux A B y := by  obtain ⟨C, hC⟩ :=    (isCompact_univ.image (muB.aux.continuous hB)).bddBelow  refine ⟨C, fun y => hC ⟨y, Set.mem_univ _, rfl⟩⟩
See it in the graphDiscuss this resultChallenge it