VNM.NotIndependent.not_independent
theoremverifiedformalizationimported Lean
VNM.NotIndependent.not_independent
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in open VNM in theorem VNM.NotIndependent.not_independent : ¬ Independence pref
- Formalizes
- EconCSLib, `VNM.NotIndependent.not_independent`
- 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.NotIndependent.not_independent← VNM.NotIndependent.not_independent (EconCSLib/Foundation/Utility/VNMAxioms.lean:362): adapted
What was changed in
VNM.NotIndependent.not_independent--- EconCSLib/Foundation/Utility/VNMAxioms.lean:362 (VNM.NotIndependent.not_independent) +++ as compiled here @@ -1,2 +1,6 @@ -private theorem not_independent : ¬ Independence pref := by +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Finset BigOperators in +open VNM in +theorem VNM.NotIndependent.not_independent : ¬ Independence pref := by intro h @@ -18,6 +22,6 @@ have h_not : ¬ pref L₁ L₂ := by - simp only [pref]; push_neg; constructor <;> native_decide + simp only [pref]; push_neg; constructor <;> norm_num [L₁, L₂] have h_mix : pref (Lottery.mix (1/2) (by norm_num) (by norm_num) L₁ N) (Lottery.mix (1/2) (by norm_num) (by norm_num) L₂ N) := by - simp only [pref, Lottery.mix, stdSimplex.mix]; left; native_decide + simp only [pref, Lottery.mix, stdSimplex.mix]; left; norm_num [L₁, N] exact h_not ((h L₁ L₂ N (1/2) (by norm_num) (by norm_num)).mpr h_mix) - Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- VNM.IndependenceIndependence: mixing both sides with a common lottery preserves preference.
L₁ ≿ L₂ ↔ [α L₁, (1-α) N] ≿ [α L₂, (1-α) N]forα > 0. - VNM.NotIndependent.prefVNM.NotIndependent.pref
- LotteryA lottery over outcomes
O: a probability distribution. JuststdSimplex 𝕜 Owith a game-theoretic name. - VNM.NotContinuous.prefVNM.NotContinuous.pref
- Lottery.mixConvex combination of two lotteries: the compound lottery
[α(L₁), (1-α)(L₂)]after simplification. [MSZ Axiom 2.16] Alias of… - 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.mix_applystdSimplex.mix_apply
- VNM.IndependenceIndependence: mixing both sides with a common lottery preserves preference.
- Used by 1
- VNM.NotIndependent.independence_independentVNM.NotIndependent.independence_independent
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 inopen VNM intheorem VNM.NotIndependent.not_independent : ¬ Independence pref := by intro h -- L₁ = (2/5, 3/5, 0): L₁(0) = 2/5 < 1/2 (low) -- L₂ = (3/5, 2/5, 0): L₂(0) = 3/5 ≥ 1/2 (high) -- ¬pref L₁ L₂: 2/5 < 1/2 and 3/5 ≥ 1/2 -- N = (4/5, 1/5, 0): N(0) = 4/5 -- mix 1/2 L₁ N: val 0 = 3/5 ≥ 1/2 → pref (mix L₁ N) anything -- So pref (mix L₁ N) (mix L₂ N) but ¬pref L₁ L₂. Independence fails. let L₁ : Lottery ℚ (Fin 3) := ⟨![2/5, 3/5, 0], by refine ⟨fun i => by fin_cases i <;> simp (config := { decide := true }) [*] <;> (try norm_num), ?_⟩ simp [Fin.sum_univ_three]; ring⟩ let L₂ : Lottery ℚ (Fin 3) := ⟨![3/5, 2/5, 0], by refine ⟨fun i => by fin_cases i <;> simp (config := { decide := true }) [*] <;> (try norm_num), ?_⟩ simp [Fin.sum_univ_three]; ring⟩ let N : Lottery ℚ (Fin 3) := ⟨![4/5, 1/5, 0], by refine ⟨fun i => by fin_cases i <;> simp (config := { decide := true }) [*] <;> (try norm_num), ?_⟩ simp [Fin.sum_univ_three]; ring⟩ have h_not : ¬ pref L₁ L₂ := by simp only [pref]; push_neg; constructor <;> norm_num [L₁, L₂] have h_mix : pref (Lottery.mix (1/2) (by norm_num) (by norm_num) L₁ N) (Lottery.mix (1/2) (by norm_num) (by norm_num) L₂ N) := by simp only [pref, Lottery.mix, stdSimplex.mix]; left; norm_num [L₁, N] exact h_not ((h L₁ L₂ N (1/2) (by norm_num) (by norm_num)).mpr h_mix)