AFTD Auto-Formalizing Theoretical Domains

IsPositiveAffineOf

defimported Lean

v is a positive affine transformation of u: v(x) = a · u(x) + b with a > 0. Two utility functions related by a positive affine transform represent the same preference. [MSZ 2.22]

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {X 𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
def IsPositiveAffineOf (u v : X → 𝕜) : Prop
Defined in
EconCSLib, `IsPositiveAffineOf`
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
none listed
Built on 2
  • 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.
Used by 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {X 𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
/-- `v` is a positive affine transformation of `u`: `v(x) = a · u(x) + b` with `a > 0`. Two utility functions related by a positive affine transform represent the same preference. [MSZ 2.22] -/
def IsPositiveAffineOf (u v : X → 𝕜) : Prop :=
  ∃ (a b : 𝕜), 0 < a ∧ ∀ x, v x = a * u x + b
See it in the graphDiscuss this resultChallenge it