VNM.Independence
defimported Lean
Independence: mixing both sides with a common lottery preserves preference. L₁ ≿ L₂ ↔ [α L₁, (1-α) N] ≿ [α L₂, (1-α) N] for α > 0.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in variable {O : Type*} [Fintype O] in def VNM.Independence (pref : Lottery 𝕜 O → Lottery 𝕜 O → Prop) : Prop
- Defined in
- EconCSLib, `VNM.Independence`
- 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.VNM.Independence← VNM.Independence (EconCSLib/Foundation/Utility/VNMAxioms.lean:50): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- LotteryA lottery over outcomes
O: a probability distribution. JuststdSimplex 𝕜 Owith a game-theoretic name. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - 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
- LotteryA lottery over outcomes
- Used by 10
- VNM.NotTransitive.transitivity_independentVNM.NotTransitive.transitivity_independent
- VNM.NotContinuous.continuity_independentVNM.NotContinuous.continuity_independent
- VNM.NotIndependent.independence_independentVNM.NotIndependent.independence_independent
- VNM.NotComplete.independentVNM.NotComplete.independent
- VNM.NotContinuous.independentVNM.NotContinuous.independent
- VNM.NotComplete.completeness_independentVNM.NotComplete.completeness_independent
- VNM.NotTransitive.independentVNM.NotTransitive.independent
- VNM.NotIndependent.not_independentVNM.NotIndependent.not_independent
- 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…
- 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 in variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in variable {O : Type*} [Fintype O] in /-- **Independence**: mixing both sides with a common lottery preserves preference. `L₁ ≿ L₂ ↔ [α L₁, (1-α) N] ≿ [α L₂, (1-α) N]` for `α > 0`. -/ def VNM.Independence (pref : Lottery 𝕜 O → Lottery 𝕜 O → Prop) : Prop := ∀ (L₁ L₂ N : Lottery 𝕜 O) (α : 𝕜) (hα₀ : 0 < α) (hα₁ : α ≤ 1), pref L₁ L₂ ↔ pref (Lottery.mix α (le_of_lt hα₀) hα₁ L₁ N) (Lottery.mix α (le_of_lt hα₀) hα₁ L₂ N)