AFTD Auto-Formalizing Theoretical Domains

stdSimplex.affineCombination

defimported Lean

Affine combination of a finite family of points using simplex weights. This is a thin wrapper around Mathlib's Finset.affineCombination, specialized to weights coming from stdSimplex.

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
noncomputable def stdSimplex.affineCombination {k V P I : Type*}
    [Ring k] [PartialOrder k] [Fintype I]
    [AddCommGroup V] [Module k V] [AddTorsor V P]
    (x : stdSimplex k I) (p : I β†’ P) : P
Defined in
EconCSLib, `stdSimplex.affineCombination`
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 1

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
/-- Affine combination of a finite family of points using simplex weights. This is a thin wrapper around Mathlib's `Finset.affineCombination`, specialized to weights coming from `stdSimplex`. -/
noncomputable def stdSimplex.affineCombination {k V P I : Type*}
    [Ring k] [PartialOrder k] [Fintype I]
    [AddCommGroup V] [Module k V] [AddTorsor V P]
    (x : stdSimplex k I) (p : I β†’ P) : P :=
  Finset.univ.affineCombination k p x
See it in the graphDiscuss this resultChallenge it