stdSimplex.mix
defimported Lean
Convex combination of two simplex points: mix α hα₀ hα₁ x y = α·x + (1-α)·y. This is the basic vocabulary for compound lotteries and for any inductive argument that interpolates between two mixed strategies (Loomis, Sion, fictitious play). The hypotheses are passed as plain (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1) rather than via a unit-interval subtype to match Mathlib idioms and to keep call sites lightweight.
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.mix (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1) (x y : stdSimplex 𝕜 I) : stdSimplex 𝕜 I
- Defined in
- EconCSLib, `stdSimplex.mix`
- 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.mix← stdSimplex.mix (EconCSLib/Math/Simplex.lean:156): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 18
- VNM.NotContinuous.not_continuousVNM.NotContinuous.not_continuous
- wsum_mix_gt_of_ge_gt
wsumversion oflinear_comb_gt_of_ge_gt. - Loomis.loomis_value_eq_auxLoomis induction:
lamB0 A B = muB0 A Bfor any finite positive-Bmatrix pair with2 ≤ |I| + |J|, by strong induction on the… - wsum_mix_lt_of_le_lt
wsumversion oflinear_comb_lt_of_le_lt. - VNM.NotComplete.independentVNM.NotComplete.independent
- wsum_mixBilinearity of
wsumoverstdSimplex.mix:wsum (mix α x y) f = α · wsum x f + (1-α) · wsum y f. - VNM.NotContinuous.independentVNM.NotContinuous.independent
- Loomis.rowOffset_mixConvex combination linearity for
rowOffsetin the simplex argument. - VNM.NotTransitive.independentVNM.NotTransitive.independent
- VNM.NotComplete.continuousVNM.NotComplete.continuous
- VNM.NotIndependent.not_independentVNM.NotIndependent.not_independent
- VNM.NotTransitive.continuousVNM.NotTransitive.continuous
- Lottery.mixConvex combination of two lotteries: the compound lottery
[α(L₁), (1-α)(L₂)]after simplification. [MSZ Axiom 2.16] Alias of… - stdSimplex.mix_applystdSimplex.mix_apply
- 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]…
- VNM.sure_thing_principleThe Sure-Thing Principle [MSZ Ex 2.12]: The common lottery in a mixture does not affect strict preference. If Independence holds, then…
- Loomis.colOffset_mixConvex combination linearity for
colOffsetin the simplex argument. - VNM.NotIndependent.continuousVNM.NotIndependent.continuous
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 /-- Convex combination of two simplex points: `mix α hα₀ hα₁ x y = α·x + (1-α)·y`. This is the basic vocabulary for compound lotteries and for any inductive argument that interpolates between two mixed strategies (Loomis, Sion, fictitious play). The hypotheses are passed as plain `(α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)` rather than via a unit-interval subtype to match Mathlib idioms and to keep call sites lightweight. -/ def stdSimplex.mix (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1) (x y : stdSimplex 𝕜 I) : stdSimplex 𝕜 I where val i := α * x.val i + (1 - α) * y.val i property := by refine ⟨fun i => ?_, ?_⟩ · have hx := x.property.1 i have hy := y.property.1 i have hα' : 0 ≤ 1 - α := by linarith have h₁ : 0 ≤ α * x.val i := mul_nonneg hα₀ hx have h₂ : 0 ≤ (1 - α) * y.val i := mul_nonneg hα' hy linarith · have hxsum := x.property.2 have hysum := y.property.2 have : (∑ i, (α * x.val i + (1 - α) * y.val i)) = α * (∑ i, x.val i) + (1 - α) * (∑ i, y.val i) := by rw [Finset.sum_add_distrib, ← Finset.mul_sum, ← Finset.mul_sum] rw [this, hxsum, hysum]; ring