VNM.NotComplete.independent
theoremverifiedformalizationimported Lean
VNM.NotComplete.independent
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in open VNM in theorem VNM.NotComplete.independent : Independence pref
- Formalizes
- EconCSLib, `VNM.NotComplete.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.NotComplete.independent← VNM.NotComplete.independent (EconCSLib/Foundation/Utility/VNMAxioms.lean:124): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- VNM.IndependenceIndependence: mixing both sides with a common lottery preserves preference.
L₁ ≿ L₂ ↔ [α L₁, (1-α) N] ≿ [α L₂, (1-α) N]forα > 0. - 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. - 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… - VNM.NotComplete.prefVNM.NotComplete.pref
- 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
- VNM.IndependenceIndependence: mixing both sides with a common lottery preserves preference.
- Used by 1
- VNM.NotComplete.completeness_independentVNM.NotComplete.completeness_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.NotComplete.independent : Independence pref := by intro L₁ L₂ N α hα₀ hα₁ constructor · intro h; simp only [pref] at h; subst h; rfl · intro h simp only [pref] at h have hval : L₁.val = L₂.val := funext fun i => by have := congr_arg (fun L => L.val i) h simp only [Lottery.mix, stdSimplex.mix] at this -- this : α * L₁.val i + (1 - α) * N.val i = α * L₂.val i + (1 - α) * N.val i -- or a disjunction if simp simplified differently nlinarith exact Subtype.ext hval