AFTD Auto-Formalizing Theoretical Domains

MatrixGame.optimalColumnSet

defimported Lean

H-representation of the column-optimal strategy set in the ambient space J → ℝ.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true 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
def MatrixGame.optimalColumnSet : Set (J → ℝ)
Defined in
EconCSLib, `MatrixGame.optimalColumnSet`
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
none listed
Built on 5
Used by 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true 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
/-- H-representation of the column-optimal strategy set in the ambient space `J → ℝ`. -/
def MatrixGame.optimalColumnSet : Set (J → ℝ) :=
  stdSimplex ℝ J ∩ ⋂ i : I, {g : J → ℝ | ∑ j, g j * A.g i j ≤ A.value}
See it in the graphDiscuss this resultChallenge it