stdSimplex.mix_apply
theoremverifiedformalizationimported Lean
stdSimplex.mix_apply
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.mix_apply (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1) (x y : stdSimplex 𝕜 I) (i : I) : (stdSimplex.mix α hα₀ hα₁ x y).val i = α * x.val i + (1 - α) * y.val i
- Formalizes
- EconCSLib, `stdSimplex.mix_apply`
- 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_apply← stdSimplex.mix_apply (EconCSLib/Math/Simplex.lean:175): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- stdSimplex.mixConvex combination of two simplex points:
mix α hα₀ hα₁ x y = α·x + (1-α)·y. This is the basic vocabulary for compound lotteries and for…
- stdSimplex.mixConvex combination of two simplex points:
- Used by 28
- VNM.NotTransitive.transitivity_independentVNM.NotTransitive.transitivity_independent
- VNM.IndependenceIndependence: mixing both sides with a common lottery preserves preference.
L₁ ≿ L₂ ↔ [α L₁, (1-α) N] ≿ [α L₂, (1-α) N]forα > 0. - VNM.NotContinuous.continuity_independentVNM.NotContinuous.continuity_independent
- IsLinearUtilityA utility function
uis linear (in the vNM sense) if it respects compound lottery simplification:… - VNM.NotContinuous.not_continuousVNM.NotContinuous.not_continuous
- wsum_mix_gt_of_ge_gt
wsumversion oflinear_comb_gt_of_ge_gt. - Lottery.expectedValue_mixLinearity of expected value under convex combination.
E[mix α L₁ L₂] = α · E[L₁] + (1-α) · E[L₂]This is the key property… - VNM.NotIndependent.independence_independentVNM.NotIndependent.independence_independent
- expectedValue_isLinearUtilityExpected value (with respect to a fixed payoff function) is a linear utility.
- 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… - VNM.ContinuityContinuity (Archimedean / MSZ Axiom 2.12): for
L₁ ≿ L₂ ≿ L₃, there existsθ ∈ [0,1]such thatL₂ ∼ [θ L₁, (1-θ) L₃]. - 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.NotComplete.completeness_independentVNM.NotComplete.completeness_independent
- 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… - 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…
- IsRiskNeutral.isAffineRisk neutrality implies affine utility. [MSZ 2.27, hard direction] Requires
|I| ≥ 2so that non-trivial distributions exist. - Loomis.colOffset_mixConvex combination linearity for
colOffsetin the simplex argument. - VNM.NotIndependent.continuousVNM.NotIndependent.continuous
- VNM.axioms_independentExercise 2.5 [MSZ]: The four vNM axioms are independent. For each axiom, there exists a preference relation on lotteries that violates…
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 @[simp] theorem stdSimplex.mix_apply (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1) (x y : stdSimplex 𝕜 I) (i : I) : (stdSimplex.mix α hα₀ hα₁ x y).val i = α * x.val i + (1 - α) * y.val i := rfl