RepresentsPreference.indifferent_iff
theoremverifiedformalizationimported Lean
A utility representation preserves indifference.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem RepresentsPreference.indifferent_iff [Preorder A] [Preorder V'] {u : A → V'} (h : RepresentsPreference u) (a b : A) : Indifferent a b ↔ Indifferent (u a) (u b)
- Formalizes
- EconCSLib, `RepresentsPreference.indifferent_iff`
- 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.RepresentsPreference.indifferent_iff← RepresentsPreference.indifferent_iff (EconCSLib/Foundation/Preference.lean:197): adapted
What was changed in
RepresentsPreference.indifferent_iff--- EconCSLib/Foundation/Preference.lean:197 (RepresentsPreference.indifferent_iff) +++ as compiled here @@ -1,3 +1,4 @@ -/-- A utility representation preserves indifference. -/ -theorem RepresentsPreference.indifferent_iff [Preorder A] [Preorder V] {u : A → V} +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +theorem RepresentsPreference.indifferent_iff [Preorder A] [Preorder V'] {u : A → V'} (h : RepresentsPreference u) (a b : A) : - Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- RepresentsPreferenceA utility function
u : A → Vrepresents the preference≤onAifa ≤ b ↔ u a ≤ u b. [MSZ 2.7] - IndifferentTwo outcomes are indifferent under a preorder:
a ≤ b ∧ b ≤ a. In aPartialOrderthis impliesa = b; in a generalPreorderit does…
- RepresentsPreferenceA utility function
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A utility representation preserves indifference. -/ theorem RepresentsPreference.indifferent_iff [Preorder A] [Preorder V'] {u : A → V'} (h : RepresentsPreference u) (a b : A) : Indifferent a b ↔ Indifferent (u a) (u b) := ⟨fun ⟨h1, h2⟩ => ⟨(h.le_iff a b).mp h1, (h.le_iff b a).mp h2⟩, fun ⟨h1, h2⟩ => ⟨(h.le_iff a b).mpr h1, (h.le_iff b a).mpr h2⟩⟩