IsPositiveAffineOf.trans
theoremverifiedformalizationimported Lean
Positive affine transformation is transitive.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {X π : Type*} [Field π] [LinearOrder π] [IsStrictOrderedRing π] in theorem IsPositiveAffineOf.trans {u v w : X β π} (hβ : IsPositiveAffineOf u v) (hβ : IsPositiveAffineOf v w) : IsPositiveAffineOf u w
- Formalizes
- EconCSLib, `IsPositiveAffineOf.trans`
- 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.trans← IsPositiveAffineOf.trans (EconCSLib/Foundation/Utility/AffineTransform.lean:47): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.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
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/-- Positive affine transformation is transitive. -/theorem IsPositiveAffineOf.trans {u v w : X β π} (hβ : IsPositiveAffineOf u v) (hβ : IsPositiveAffineOf v w) : IsPositiveAffineOf u w := by obtain β¨aβ, bβ, haβ, hvβ© := hβ obtain β¨aβ, bβ, haβ, hwβ© := hβ exact β¨aβ * aβ, aβ * bβ + bβ, mul_pos haβ haβ, fun x => by rw [hw, hv]; ringβ©