stdSimplex.affineCombination_eq_linearCombination
theoremverifiedformalizationimported Lean
In a module, simplex affine combinations are Mathlib finite linear combinations.
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 @[simp] theorem stdSimplex.affineCombination_eq_linearCombination {k V I : Type*} [Ring k] [PartialOrder k] [Fintype I] [AddCommGroup V] [Module k V] (x : stdSimplex k I) (p : I โ V) : affineCombination x p = Fintype.linearCombination k p x
- Formalizes
- EconCSLib, `stdSimplex.affineCombination_eq_linearCombination`
- 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.affineCombination_eq_linearCombination← stdSimplex.affineCombination_eq_linearCombination (EconCSLib/Math/Simplex.lean:71): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- stdSimplex.affineCombinationAffine combination of a finite family of points using simplex weights. This is a thin wrapper around Mathlib's
Finset.affineCombination,โฆ
- stdSimplex.affineCombinationAffine combination of a finite family of points using simplex weights. This is a thin wrapper around Mathlib's
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators Matrix invariable {๐ : Type*} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] invariable {I : Type*} [Fintype I] inset_option linter.unusedSectionVars false in/-- In a module, simplex affine combinations are Mathlib finite linear combinations. -/@[simp]theorem stdSimplex.affineCombination_eq_linearCombination {k V I : Type*} [Ring k] [PartialOrder k] [Fintype I] [AddCommGroup V] [Module k V] (x : stdSimplex k I) (p : I โ V) : affineCombination x p = Fintype.linearCombination k p x := by simp [affineCombination, Fintype.linearCombination_apply, Finset.affineCombination_eq_linear_combination, stdSimplex.sum_eq_one x]