stdSimplex.pure
defimported Lean
Point-mass simplex element at i₀.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in variable {I : Type*} [Fintype I] in set_option linter.unusedSectionVars false in def stdSimplex.pure [DecidableEq I] (i₀ : I) : stdSimplex 𝕜 I
- Defined in
- EconCSLib, `stdSimplex.pure`
- 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.stdSimplex.pure← stdSimplex.pure (EconCSLib/Math/Simplex.lean:308): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 23
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs ↔ saddle points. A pair of mixed strategies is in the product
X(A) × Y(A)of optimal strategy sets iff it is a saddle… - is_approx_nash_equilibriumA strategy profile x : (j : Fin n) → stdSimplex ℝ (A j) in an n-player normal-form game with payoff function u : Fin n → ((j : Fin n) → A…
- MatrixGame.image_optimalColumnStrategies_eqMatrixGame.image_optimalColumnStrategies_eq
- VNM.NotContinuous.not_continuousVNM.NotContinuous.not_continuous
- MatrixGame.support_complementarity_columnSupport complementarity (column). For an optimal pair
(xx, yy), every columnjwith positive probability underyyis a best… - le_iff_simplex_le
f ≤ vpointwise iff every simplex weighted sum is≤ v. - is_pure_best_response_lastIn an (r+1)-player game with payoff function u : Fin (r + 1) → ((j : Fin (r + 1)) → A j) → ℝ and action types A, pure action b : A…
- wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- EconCSLib.StrategicGame.evaluate_at_mixed_linear
evaluate_at_mixed G iis linear in thei-th mixed strategy: for anyτ : stdSimplex ℝ (G.strategy i),… - MatrixGame.mem_optimalColumnStrategies_iff_E_leA column strategy is optimal iff against every mixed row it caps payoff at the value.
- Lottery.pureA pure (degenerate) lottery: outcome
o₀with probability 1. Alias ofstdSimplex.pure. - stdSimplex.pure_applystdSimplex.pure_apply
- MatrixGame.image_optimalRowStrategies_eqThe image of the row-optimal subtype set equals the H-representation polytope
A.optimalRowSet. - EconCSLib.StrategicGame.g_functionAugmented weight for pure strategy
aof playeriat mixed profileσ: the original probabilityσ_i(a)plus the positive part of the… - EconCSLib.StrategicGame.g_function_cont
g_function G i (· ) ais continuous in the mixed profile (fixedi,a). - EconCSLib.StrategicGame.sigma_le_g_functionThe augmented weight is at least
σ_i(a). - wsum_pureWeighted sum with point mass at
i₀equalsf i₀. Legacy form using the inline anonymous-structure point mass. New code should prefer… - MatrixGame.mem_optimalRowStrategies_iff_E_geA row strategy is optimal iff against every mixed column it secures the value.
- one_player_extension_approx_nashIn an (r+1)-player normal-form game with payoff functions u : Fin (r + 1) → ((j : Fin (r + 1)) → A j) → ℝ taking values in [0, 1]…
- MatrixGame.support_complementarity_rowSupport complementarity (row). For an optimal pair
(xx, yy), every rowiwith positive probability underxxis a best response… - IsRiskNeutral.isAffineRisk neutrality implies affine utility. [MSZ 2.27, hard direction] Requires
|I| ≥ 2so that non-trivial distributions exist. - EconCSLib.StrategicGame.evaluate_at_mixed_update_cont
σ ↦ evaluate_at_mixed G i (update σ i (stdSimplex.pure a))is continuous. - ge_iff_simplex_ge
f ≥ vpointwise iff every simplex weighted sum is≥ v.
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs ↔ saddle points. A pair of mixed strategies is in the product
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in variable {I : Type*} [Fintype I] in set_option linter.unusedSectionVars false in /-- Point-mass simplex element at `i₀`. -/ def stdSimplex.pure [DecidableEq I] (i₀ : I) : stdSimplex 𝕜 I where val i := if i = i₀ then 1 else 0 property := ⟨fun i => by simp only; split_ifs <;> norm_num, by simp [Finset.sum_ite_eq', Finset.mem_univ]⟩