AFTD Auto-Formalizing Theoretical Domains

VNM.axioms_independent

theoremverifiedformalizationimported Lean

Exercise 2.5 [MSZ]: The four vNM axioms are independent. For each axiom, there exists a preference relation on lotteries that violates that axiom while satisfying the other three.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
open VNM in
theorem VNM.axioms_independent :
    -- ¬Complete
    (∃ pref : Lottery ℚ (Fin 3) → Lottery ℚ (Fin 3) → Prop,
      ¬ Completeness pref ∧ Transitivity pref ∧ Independence pref ∧ Continuity pref) ∧
    -- ¬Transitive
    (∃ pref : Lottery ℚ (Fin 3) → Lottery ℚ (Fin 3) → Prop,
      ¬ Transitivity pref ∧ Completeness pref ∧ Independence pref ∧ Continuity pref) ∧
    -- ¬Independent
    (∃ pref : Lottery ℚ (Fin 3) → Lottery ℚ (Fin 3) → Prop,
      ¬ Independence pref ∧ Completeness pref ∧ Transitivity pref ∧ Continuity pref) ∧
    -- ¬Continuous
    (∃ pref : Lottery ℚ (Fin 3) → Lottery ℚ (Fin 3) → Prop,
      ¬ Continuity pref ∧ Completeness pref ∧ Transitivity pref ∧ Independence pref)
Formalizes
EconCSLib, `VNM.axioms_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 10

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
open VNM in
/-- **Exercise 2.5 [MSZ]**: The four vNM axioms are independent. For each axiom, there exists a preference relation on lotteries that violates that axiom while satisfying the other three. -/
theorem VNM.axioms_independent :
    -- ¬Complete
    (∃ pref : Lottery ℚ (Fin 3) → Lottery ℚ (Fin 3) → Prop,
      ¬ Completeness pref ∧ Transitivity pref ∧ Independence pref ∧ Continuity pref) ∧
    -- ¬Transitive
    (∃ pref : Lottery ℚ (Fin 3) → Lottery ℚ (Fin 3) → Prop,
      ¬ Transitivity pref ∧ Completeness pref ∧ Independence pref ∧ Continuity pref) ∧
    -- ¬Independent
    (∃ pref : Lottery ℚ (Fin 3) → Lottery ℚ (Fin 3) → Prop,
      ¬ Independence pref ∧ Completeness pref ∧ Transitivity pref ∧ Continuity pref) ∧
    -- ¬Continuous
    (∃ pref : Lottery ℚ (Fin 3) → Lottery ℚ (Fin 3) → Prop,
      ¬ Continuity pref ∧ Completeness pref ∧ Transitivity pref ∧ Independence pref) :=
  ⟨NotComplete.completeness_independent,
   NotTransitive.transitivity_independent,
   NotIndependent.independence_independent,
   NotContinuous.continuity_independent⟩
See it in the graphDiscuss this resultChallenge it