AFTD Auto-Formalizing Theoretical Domains

VNM.NotTransitive.continuous

theoremverifiedformalizationimported Lean

VNM.NotTransitive.continuous

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
open VNM in
theorem VNM.NotTransitive.continuous : Continuity pref
Formalizes
EconCSLib, `VNM.NotTransitive.continuous`
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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 10
  • VNM.NotContinuous.prefVNM.NotContinuous.pref
  • LotteryA lottery over outcomes O: a probability distribution. Just stdSimplex 𝕜 O with a game-theoretic name.
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • VNM.NotTransitive.prefVNM.NotTransitive.pref
  • VNM.ContinuityContinuity (Archimedean / MSZ Axiom 2.12): for L₁ ≿ L₂ ≿ L₃, there exists θ ∈ [0,1] such that L₂ ∼ [θ L₁, (1-θ) L₃].
  • indiffIndifference derived from a weak preference relation.
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
  • 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…
  • 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
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inopen VNM intheorem VNM.NotTransitive.continuous : Continuity pref := by  intro L₁ L₂ L₃ h₁₂ h₂₃  -- Try θ=0 (mix = L₃): works if pref L₃ L₂  by_cases h₃₂ : pref L₃ L₂  · refine ⟨0, le_refl 0, by norm_num, ?_⟩    exact ⟨by simp only [pref, Lottery.mix, stdSimplex.mix] at h₂₃ ⊢; rcases h₂₃ with h | h <;> [left; right] <;> nlinarith,           by simp only [pref, Lottery.mix, stdSimplex.mix] at h₃₂ ⊢; rcases h₃₂ with h | h <;> [left; right] <;> nlinarith⟩  -- Try θ=1 (mix = L₁): works if pref L₂ L₁  · by_cases h₂₁ : pref L₂ L₁    · refine ⟨1, by norm_num, le_refl 1, ?_⟩      exact ⟨by simp only [pref, Lottery.mix, stdSimplex.mix] at h₂₁ ⊢; rcases h₂₁ with h | h <;> [left; right] <;> nlinarith,             by simp only [pref, Lottery.mix, stdSimplex.mix] at h₁₂ ⊢; rcases h₁₂ with h | h <;> [left; right] <;> nlinarith⟩    · -- Neither endpoint works ⟹ L₁ strictly dominates L₂ strictly dominates L₃ on both coords      simp only [pref] at h₃₂ h₂₁      push_neg at h₃₂ h₂₁      obtain ⟨h₃₂_0, h₃₂_1⟩ := h₃₂      obtain ⟨h₂₁_0, h₂₁_1⟩ := h₂₁      -- Match component 0: θ = (L₂(0) - L₃(0)) / (L₁(0) - L₃(0))      have hden_pos : L₁.val 0 - L₃.val 0 > 0 := by linarith      have hnum_pos : L₂.val 0 - L₃.val 0 > 0 := by linarith      have hnum_lt : L₂.val 0 - L₃.val 0 < L₁.val 0 - L₃.val 0 := by linarith      set θ := (L₂.val 0 - L₃.val 0) / (L₁.val 0 - L₃.val 0)      refine ⟨θ, le_of_lt (div_pos hnum_pos hden_pos),              le_of_lt (by rwa [div_lt_one hden_pos]), ?_⟩      -- At this θ, mix.val 0 = L₂.val 0 (by construction)      have hmix0 : θ * L₁.val 0 + (1 - θ) * L₃.val 0 = L₂.val 0 := by        have hne : L₁.val 0 - L₃.val 0 ≠ 0 := ne_of_gt hden_pos        simp only [θ]; field_simp; ring      simp only [indiff, pref, Lottery.mix, stdSimplex.mix]      exact ⟨Or.inl (by linarith), Or.inl (by linarith)⟩
See it in the graphDiscuss this resultChallenge it