AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.lam.aux_gt_iff_gt

theoremverifiedformalizationimported Lean

lam.aux A x > c iff every pure-column expected payoff exceeds c.

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_gt_iff_gt (A : I → J → ℝ) (c : ℝ) (x : stdSimplex ℝ I) :
    c < lam.aux A x ↔ ∀ j, c < wsum x (fun i => A i j)
Formalizes
EconCSLib, `MinimaxLoomis.lam.aux_gt_iff_gt`
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 3
  • 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_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.

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 x > c` iff every pure-column expected payoff exceeds `c`. -/theorem MinimaxLoomis.lam.aux_gt_iff_gt (A : I → J → ℝ) (c : ℝ) (x : stdSimplex ℝ I) :    c < lam.aux A x ↔ ∀ j, c < wsum x (fun i => A i j) := by  simp [lam.aux, Finset.lt_inf'_iff]
See it in the graphDiscuss this resultChallenge it