VNM.NotTransitive.not_transitive
theoremverifiedformalizationimported Lean
VNM.NotTransitive.not_transitive
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in open VNM in theorem VNM.NotTransitive.not_transitive : ¬ Transitivity pref
- Formalizes
- EconCSLib, `VNM.NotTransitive.not_transitive`
- 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.NotTransitive.not_transitive← VNM.NotTransitive.not_transitive (EconCSLib/Foundation/Utility/VNMAxioms.lean:259): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- VNM.NotContinuous.prefVNM.NotContinuous.pref
- LotteryA lottery over outcomes
O: a probability distribution. JuststdSimplex 𝕜 Owith a game-theoretic name. - VNM.NotTransitive.prefVNM.NotTransitive.pref
- VNM.TransitivityTransitivity: preference chains compose.
- Used by 1
- VNM.NotTransitive.transitivity_independentVNM.NotTransitive.transitivity_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.NotTransitive.not_transitive : ¬ Transitivity pref := by intro h -- Construct three lotteries witnessing intransitivity: -- L₁ = (0.4, 0.1, 0.5), L₂ = (0.3, 0.3, 0.4), L₃ = (0.5, 0.2, 0.3) -- pref L₁ L₂ via component 0: 0.4 ≥ 0.3 -- pref L₂ L₃ via component 1: 0.3 ≥ 0.2 -- ¬pref L₁ L₃: 0.4 < 0.5 and 0.1 < 0.2 let L₁ : Lottery ℚ (Fin 3) := ⟨![2/5, 1/10, 1/2], 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/10, 3/10, 2/5], 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) := ⟨![1/2, 1/5, 3/10], by refine ⟨fun i => by fin_cases i <;> simp (config := { decide := true }) [*] <;> (try norm_num), ?_⟩ simp [Fin.sum_univ_three]; ring⟩ have h12 : pref L₁ L₂ := by left; show (2 : ℚ)/5 ≥ 3/10; norm_num have h23 : pref L₂ L₃ := by right; show (3 : ℚ)/10 ≥ 1/5; norm_num have h13 := h L₁ L₂ L₃ h12 h23 rcases h13 with h0 | h1 · exact absurd h0 (by show ¬((2 : ℚ)/5 ≥ 1/2); norm_num) · exact absurd h1 (by show ¬((1 : ℚ)/10 ≥ 1/5); norm_num)