AFTD Auto-Formalizing Theoretical Domains

MatrixGame.optimalRowSet_nonempty

theoremverifiedformalizationimported Lean

MatrixGame.optimalRowSet_nonempty

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MatrixGame in
open Finset BigOperators Set in
set_option linter.unusedSectionVars false in
universe u in
variable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable (A : MatrixGame I J ℝ) in
theorem MatrixGame.optimalRowSet_nonempty : A.optimalRowSet.Nonempty
Formalizes
EconCSLib, `MatrixGame.optimalRowSet_nonempty`
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 24
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen MatrixGame inopen Finset BigOperators Set inset_option linter.unusedSectionVars false inuniverse u invariable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] invariable (A : MatrixGame I J ℝ) intheorem MatrixGame.optimalRowSet_nonempty : A.optimalRowSet.Nonempty := by  obtain ⟨xx, yy, v, Hxx, Hyy⟩ := A.minimax_optimal_strategies  refine ⟨xx.val, xx.property, ?_⟩  rw [mem_iInter]  intro j  -- We need: A.value ≤ ∑ i, xx.val i * A.g i j = A.Ej xx j.  have hv : v = A.value := by    have h_le : v ≤ A.maximin := by      have hxx_guarantee : v ≤ A.guarantee_I xx := by        show v ≤ Finset.inf' Finset.univ Finset.univ_nonempty (fun j => A.Ej xx j)        rw [Finset.le_inf'_iff]; intro j _; exact Hxx j      have hg_le : A.guarantee_I xx ≤ A.maximin :=        le_ciSup (bddAbove_def.2 (by          obtain ⟨C, hC⟩ := MinimaxLoomis.lam.aux.bddAbove A.g          exact ⟨C, by rintro r ⟨z, rfl⟩; exact hC z⟩)) xx      linarith    have h_ge_min : A.minimax ≤ v := by      have hyy_guarantee : A.guarantee_II yy ≤ v := by        show Finset.sup' Finset.univ Finset.univ_nonempty (fun i => A.Ei i yy) ≤ v        rw [Finset.sup'_le_iff]; intro i _; exact Hyy i      have hg_ge : A.minimax ≤ A.guarantee_II yy := by        have hbb : BddBelow (Set.range (A.guarantee_II)) := by          obtain ⟨C, hC⟩ := MinimaxLoomis.mu.aux.bddBelow A.g          exact ⟨C, by rintro r ⟨z, rfl⟩; exact hC z⟩        exact ciInf_le hbb yy      linarith    have hmm : A.maximin ≤ A.minimax := A.maximin_le_minimax    have : v = A.maximin := by linarith    rw [this, ← A.value_eq_maximin]  show A.value ≤ ∑ i, xx.val i * A.g i j  have h1 : A.value ≤ A.Ej xx j := by rw [← hv]; exact Hxx j  exact h1
See it in the graphDiscuss this resultChallenge it