AFTD Auto-Formalizing Theoretical Domains

VNM.NotContinuous.not_continuous

theoremverifiedformalizationimported Lean

VNM.NotContinuous.not_continuous

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
open VNM in
theorem VNM.NotContinuous.not_continuous : ¬ Continuity pref
Formalizes
EconCSLib, `VNM.NotContinuous.not_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 13
  • 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…
  • stdSimplex.purePoint-mass simplex element at i₀.
  • VNM.ContinuityContinuity (Archimedean / MSZ Axiom 2.12): for L₁ ≿ L₂ ≿ L₃, there exists θ ∈ [0,1] such that L₂ ∼ [θ L₁, (1-θ) L₃].
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • indiffIndifference derived from a weak preference relation.
  • Lottery.pureA pure (degenerate) lottery: outcome o₀ with probability 1. Alias of stdSimplex.pure.
  • 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…
  • stdSimplex.pure_applystdSimplex.pure_apply
  • 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.NotContinuous.not_continuous : ¬ Continuity pref := by  intro h  -- Use pure outcomes: A₀ ≿ A₁ ≿ A₂ in lex order  have h12 : pref (Lottery.pure (𝕜 := ℚ) (0 : Fin 3)) (Lottery.pure (𝕜 := ℚ) (1 : Fin 3)) := by    simp only [pref, Lottery.pure]; left; decide  have h23 : pref (Lottery.pure (𝕜 := ℚ) (1 : Fin 3)) (Lottery.pure (𝕜 := ℚ) (2 : Fin 3)) := by    simp only [pref, Lottery.pure]; right; constructor <;> decide  obtain ⟨θ, hθ₀, hθ₁, hfwd, hbwd⟩ := h _ _ _ h12 h23  -- mix θ (pure 0) (pure 2) has val 0 = θ, val 1 = 0  -- pure 1 has val 0 = 0, val 1 = 1  -- hbwd : pref (mix θ _ _ (pure 0) (pure 2)) (pure 1)  --       = (θ > 0 ∨ (θ = 0 ∧ 0 ≥ 1))  -- mix θ (pure 0) (pure 2) has val 0 = θ, val 1 = 0  -- pure 1 has val 0 = 0, val 1 = 1  have mix0 : (Lottery.mix θ hθ₀ hθ₁ (Lottery.pure (𝕜 := ℚ) (0 : Fin 3))    (Lottery.pure (2 : Fin 3))).val (0 : Fin 3) = θ := by    simp [Lottery.mix, stdSimplex.mix, Lottery.pure]  have mix1 : (Lottery.mix θ hθ₀ hθ₁ (Lottery.pure (𝕜 := ℚ) (0 : Fin 3))    (Lottery.pure (2 : Fin 3))).val (1 : Fin 3) = 0 := by    simp [Lottery.mix, stdSimplex.mix, Lottery.pure]  have p1_0 : (Lottery.pure (𝕜 := ℚ) (1 : Fin 3)).val (0 : Fin 3) = 0 := by    simp [Lottery.pure]  have p1_1 : (Lottery.pure (𝕜 := ℚ) (1 : Fin 3)).val (1 : Fin 3) = 1 := by    simp [Lottery.pure]  simp only [pref, mix0, mix1, p1_0, p1_1] at hfwd hbwd  -- hbwd : θ > 0 ∨ (θ = 0 ∧ 0 ≥ 1)  -- hfwd : 0 > θ ∨ (0 = θ ∧ 1 ≥ 0)  rcases hbwd with h | ⟨h₁, h₂⟩  · rcases hfwd with h' | ⟨h', _⟩ <;> linarith  · linarith
See it in the graphDiscuss this resultChallenge it