AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.mu.aux.bddBelow

theoremverifiedformalizationimported Lean

mu.aux A is uniformly 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 MinimaxLoomis.mu.aux.bddBelow (A : I → J → ℝ) :
    ∃ C, ∀ y, C ≤ mu.aux A y
Formalizes
EconCSLib, `MinimaxLoomis.mu.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 6
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝ᵥ: definitionally equal,…
  • wsum_le_wsumWeighted sum is monotone: pointwise ≤ implies wsum ≤.
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • MinimaxLoomis.mu.auxPlayer II's maximum loss against mixed strategy y: the maximum over pure rows of the expected payoff.
  • Loomis.muB.aux.bddBelowmuB.aux A B is bounded below on the simplex.
  • 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/-- `mu.aux A` is uniformly bounded below on the simplex. -/theorem MinimaxLoomis.mu.aux.bddBelow (A : I → J → ℝ) :    ∃ C, ∀ y, C ≤ mu.aux A y := by  classical  let C0 : ℝ :=    Finset.inf' Finset.univ Finset.univ_nonempty      (fun j => Finset.inf' Finset.univ Finset.univ_nonempty (fun i => A i j))  have hAij : ∀ i j, C0 ≤ A i j := by    intro i j    calc C0        ≤ Finset.inf' Finset.univ Finset.univ_nonempty (fun i => A i j) :=          Finset.inf'_le _ (Finset.mem_univ _)      _ ≤ A i j := Finset.inf'_le _ (Finset.mem_univ _)  refine ⟨C0, fun y => ?_⟩  obtain ⟨i₀⟩ := ‹Nonempty I›  have hrow : C0 ≤ wsum y (fun j => A i₀ j) := by    calc C0 = wsum y (fun _ => C0) := (wsum_const y C0).symm      _ ≤ wsum y (fun j => A i₀ j) := wsum_le_wsum y (fun j => hAij i₀ j)  exact hrow.trans (Finset.le_sup' (fun i => wsum y (fun j => A i j))    (Finset.mem_univ i₀))
See it in the graphDiscuss this resultChallenge it