AFTD Auto-Formalizing Theoretical Domains

IsPositiveAffineOf.symm

theoremverifiedformalizationimported Lean

Positive affine transformation is symmetric (invertible). [MSZ Ex 2.19] If v(x) = a·u(x) + b with a > 0, then u(x) = (1/a)·v(x) + (-b/a).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {X 𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
theorem IsPositiveAffineOf.symm {u v : X → 𝕜}
    (h : IsPositiveAffineOf u v) : IsPositiveAffineOf v u
Formalizes
EconCSLib, `IsPositiveAffineOf.symm`
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 3
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • 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…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {X 𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in/-- Positive affine transformation is symmetric (invertible). [MSZ Ex 2.19] If `v(x) = a·u(x) + b` with `a > 0`, then `u(x) = (1/a)·v(x) + (-b/a)`. -/theorem IsPositiveAffineOf.symm {u v : X → 𝕜}    (h : IsPositiveAffineOf u v) : IsPositiveAffineOf v u := by  obtain ⟨a, b, ha, hv⟩ := h  exact ⟨1/a, -b/a, div_pos one_pos ha, fun x => by    have ha' : a ≠ 0 := ne_of_gt ha    field_simp [ha']; linarith [hv x]⟩
See it in the graphDiscuss this resultChallenge it