AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none listed
Used by 23

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]⟩
See it in the graphDiscuss this resultChallenge it