AFTD Auto-Formalizing Theoretical Domains

IsPositiveAffineOf.preserves_representation

theoremverifiedformalizationimported Lean

If u represents a preference, so does any positive affine transform. [MSZ 2.22]

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {X π•œ : Type*} [Field π•œ] [LinearOrder π•œ] [IsStrictOrderedRing π•œ] in
theorem IsPositiveAffineOf.preserves_representation [Preorder X] {u v : X β†’ π•œ}
    (h : IsPositiveAffineOf u v) (hrep : RepresentsPreference u) :
    RepresentsPreference v
Formalizes
EconCSLib, `IsPositiveAffineOf.preserves_representation`
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 5
  • RepresentsPreferenceA utility function u : A β†’ V represents the preference ≀ on A if a ≀ b ↔ u a ≀ u b. [MSZ 2.7]
  • IsPositiveAffineOfv is a positive affine transformation of u: v(x) = a Β· u(x) + b with a > 0. Two utility functions related by a positive affine…
  • TotalPreorderA total preorder: a preorder where ≀ is total (complete). This is weaker than LinearOrder β€” it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
  • IsPositiveAffineOf.preserves_leA positive affine transform preserves the order: u x ≀ u y ↔ v x ≀ v y.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {X π•œ : Type*} [Field π•œ] [LinearOrder π•œ] [IsStrictOrderedRing π•œ] in/-- If `u` represents a preference, so does any positive affine transform. [MSZ 2.22] -/theorem IsPositiveAffineOf.preserves_representation [Preorder X] {u v : X β†’ π•œ}    (h : IsPositiveAffineOf u v) (hrep : RepresentsPreference u) :    RepresentsPreference v where  le_iff a b := by    rw [← h.preserves_le]    exact hrep.le_iff a b
See it in the graphDiscuss this resultChallenge it