MatrixGame.support
defimported Lean
Support of a mixed strategy: the indices with positive probability.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators 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 noncomputable def MatrixGame.support {๐ : Type} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] [DecidableEq I] (xx : stdSimplex ๐ I) : Finset I
- Defined in
- EconCSLib, `MatrixGame.support`
- 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.MatrixGame.support← MatrixGame.support (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:150): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
i : I, Player II chooses columnj : J. Payoff to Player I isg i jโฆ
- MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators 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 /-- **Support** of a mixed strategy: the indices with positive probability. -/ noncomputable def MatrixGame.support {๐ : Type} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] [DecidableEq I] (xx : stdSimplex ๐ I) : Finset I := Finset.univ.filter (fun i => 0 < xx.val i)