AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.exists_xx_lam0

theoremverifiedformalizationimported Lean

There exists a mixed strategy xx whose column-payoffs all dominate lam0 A. Compactness + continuity gives a maximiser of lam.aux; that maximiser realises the supremum and beats every pure-column expectation.

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.exists_xx_lam0 (A : I → J → ℝ) :
    ∃ xx : stdSimplex ℝ I, ∀ j, lam0 A ≤ wsum xx (fun i => A i j)
Formalizes
EconCSLib, `MinimaxLoomis.exists_xx_lam0`
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 7
Used by 2

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/-- There exists a mixed strategy `xx` whose column-payoffs all dominate `lam0 A`. Compactness + continuity gives a maximiser of `lam.aux`; that maximiser realises the supremum and beats every pure-column expectation. -/theorem MinimaxLoomis.exists_xx_lam0 (A : I → J → ℝ) :    ∃ xx : stdSimplex ℝ I, ∀ j, lam0 A ≤ wsum xx (fun i => A i j) := by  obtain ⟨xx, _, hxx⟩ :=    isCompact_univ.exists_isMaxOn (α := ℝ) (β := stdSimplex ℝ I)      Set.univ_nonempty (lam.aux.continuous A).continuousOn  rw [isMaxOn_iff] at hxx  refine ⟨xx, fun j => ?_⟩  have h1 : lam0 A ≤ lam.aux A xx := ciSup_le fun y => hxx y (Set.mem_univ _)  have h2 : lam.aux A xx ≤ wsum xx (fun i => A i j) :=    Finset.inf'_le _ (Finset.mem_univ j)  exact h1.trans h2
See it in the graphDiscuss this resultChallenge it