AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.lam.aux.bddAbove

theoremverifiedformalizationimported Lean

lam.aux A is uniformly bounded above 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 MinimaxLoomis.lam.aux.bddAbove (A : I → J → ℝ) :
    ∃ C, ∀ x, lam.aux A x ≤ C
Formalizes
EconCSLib, `MinimaxLoomis.lam.aux.bddAbove`
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
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝ᵥ: definitionally equal,…
  • MinimaxLoomis.lam.auxPlayer I's guaranteed payoff from mixed strategy x: the minimum over pure columns of the expected payoff.
  • wsum_le_wsumWeighted sum is monotone: pointwise ≤ implies wsum ≤.
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • wsum_constWeighted sum of a constant equals the constant.
Used by 6

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/-- `lam.aux A` is uniformly bounded above on the simplex. -/theorem MinimaxLoomis.lam.aux.bddAbove (A : I → J → ℝ) :    ∃ C, ∀ x, lam.aux A x ≤ C := by  classical  let C0 : ℝ :=    Finset.sup' Finset.univ Finset.univ_nonempty      (fun i => Finset.sup' Finset.univ Finset.univ_nonempty (A i))  have hAij : ∀ i j, A i j ≤ C0 := by    intro i j    calc A i j        ≤ Finset.sup' Finset.univ Finset.univ_nonempty (A i) :=          Finset.le_sup' _ (Finset.mem_univ _)      _ ≤ C0 :=          Finset.le_sup'            (fun i => Finset.sup' Finset.univ Finset.univ_nonempty (A i))            (Finset.mem_univ _)  refine ⟨C0, fun x => ?_⟩  obtain ⟨j₀⟩ := ‹Nonempty J›  have hcol : wsum x (fun i => A i j₀) ≤ C0 := by    calc wsum x (fun i => A i j₀)        ≤ wsum x (fun _ => C0) := wsum_le_wsum x (fun i => hAij i j₀)      _ = C0 := wsum_const x C0  exact (Finset.inf'_le (fun j => wsum x (fun i => A i j))    (Finset.mem_univ j₀)).trans hcol
See it in the graphDiscuss this resultChallenge it