IsPositiveAffineOf.preserves_le
theoremverifiedformalizationimported Lean
A positive affine transform preserves the order: u x ≤ u y ↔ v x ≤ v y.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {X 𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in theorem IsPositiveAffineOf.preserves_le {u v : X → 𝕜} (h : IsPositiveAffineOf u v) (x y : X) : u x ≤ u y ↔ v x ≤ v y
- Formalizes
- EconCSLib, `IsPositiveAffineOf.preserves_le`
- 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.IsPositiveAffineOf.preserves_le← IsPositiveAffineOf.preserves_le (EconCSLib/Foundation/Utility/AffineTransform.lean:55): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - IsPositiveAffineOf
vis a positive affine transformation ofu:v(x) = a · u(x) + bwitha > 0. Two utility functions related by a positive affine… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
- TotalPreorderA total preorder: a preorder where
- Used by 1
- IsPositiveAffineOf.preserves_representationIf
urepresents a preference, so does any positive affine transform. [MSZ 2.22]
- IsPositiveAffineOf.preserves_representationIf
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {X 𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in/-- A positive affine transform preserves the order: `u x ≤ u y ↔ v x ≤ v y`. -/theorem IsPositiveAffineOf.preserves_le {u v : X → 𝕜} (h : IsPositiveAffineOf u v) (x y : X) : u x ≤ u y ↔ v x ≤ v y := by obtain ⟨a, b, ha, hv⟩ := h simp only [hv] constructor · intro hle have := mul_le_mul_of_nonneg_left hle (le_of_lt ha) linarith · intro hle have : a * u x + b ≤ a * u y + b := hle have : a * u x ≤ a * u y := by linarith exact le_of_mul_le_mul_left this ha