AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.exists_yy_mu0

theoremverifiedformalizationimported Lean

There exists a mixed strategy yy whose row-payoffs are all dominated by mu0 A.

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_yy_mu0 (A : I → J → ℝ) :
    ∃ yy : stdSimplex ℝ J, ∀ i, wsum yy (fun j => A i j) ≤ mu0 A
Formalizes
EconCSLib, `MinimaxLoomis.exists_yy_mu0`
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 `yy` whose row-payoffs are all dominated by `mu0 A`. -/theorem MinimaxLoomis.exists_yy_mu0 (A : I → J → ℝ) :    ∃ yy : stdSimplex ℝ J, ∀ i, wsum yy (fun j => A i j) ≤ mu0 A := by  obtain ⟨yy, _, hyy⟩ :=    isCompact_univ.exists_isMinOn (α := ℝ) (β := stdSimplex ℝ J)      Set.univ_nonempty (mu.aux.continuous A).continuousOn  rw [isMinOn_iff] at hyy  refine ⟨yy, fun i => ?_⟩  have h1 : mu.aux A yy ≤ mu0 A := le_ciInf fun z => hyy z (Set.mem_univ _)  have h2 : wsum yy (fun j => A i j) ≤ mu.aux A yy :=    Finset.le_sup' (f := fun i => wsum yy (fun j => A i j)) (Finset.mem_univ i)  exact h2.trans h1
See it in the graphDiscuss this resultChallenge it