EconCSLib.Foundation.Utility.AffineTransform #
Positive affine transformations of utility functions and their properties.
Main definitions #
IsPositiveAffineOf—vis a positive affine transform ofu
Main results #
IsPositiveAffineOf.preserves_le— positive affine transform preserves ≤IsPositiveAffineOf.preserves_representation— ifurepresents ≤, so doesa·u + bIsPositiveAffineOf.symm— positive affine transform is invertible [MSZ Ex 2.19]
References #
- [MSZ] Chapter 2, Theorem 2.22
theorem
IsPositiveAffineOf.refl
{X : Type u_1}
{𝕜 : Type u_2}
[Field 𝕜]
[LinearOrder 𝕜]
[IsStrictOrderedRing 𝕜]
(u : X → 𝕜)
:
Positive affine transformation is reflexive (identity: a=1, b=0).
theorem
IsPositiveAffineOf.trans
{X : Type u_1}
{𝕜 : Type u_2}
[Field 𝕜]
[LinearOrder 𝕜]
[IsStrictOrderedRing 𝕜]
{u v w : X → 𝕜}
(h₁ : IsPositiveAffineOf u v)
(h₂ : IsPositiveAffineOf v w)
:
Positive affine transformation is transitive.
theorem
IsPositiveAffineOf.preserves_le
{X : Type u_1}
{𝕜 : Type u_2}
[Field 𝕜]
[LinearOrder 𝕜]
[IsStrictOrderedRing 𝕜]
{u v : X → 𝕜}
(h : IsPositiveAffineOf u v)
(x y : X)
:
A positive affine transform preserves the order: u x ≤ u y ↔ v x ≤ v y.
theorem
IsPositiveAffineOf.preserves_representation
{X : Type u_1}
{𝕜 : Type u_2}
[Field 𝕜]
[LinearOrder 𝕜]
[IsStrictOrderedRing 𝕜]
[Preorder X]
{u v : X → 𝕜}
(h : IsPositiveAffineOf u v)
(hrep : RepresentsPreference u)
:
If u represents a preference, so does any positive affine transform. [MSZ 2.22]
theorem
IsPositiveAffineOf.symm
{X : Type u_1}
{𝕜 : Type u_2}
[Field 𝕜]
[LinearOrder 𝕜]
[IsStrictOrderedRing 𝕜]
{u v : X → 𝕜}
(h : IsPositiveAffineOf u v)
:
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).