(A:F) — is determined by (i), (ii) and either (ii') or (iii')
ProvedTheoryOfGames.Utility.intervalMap_uniquedecision-theoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1utility-theory
Let be a system of utilities satisfying (3:A)–(3:C) and fix . Let be a mapping of all with to real numbers such that , , and either
- for all and all in the interval, or
- for all and all in the interval.
Then coincides with the function of (A:D):
This is the uniqueness counterpart of (A:E); it is the tool by which the local scales on different intervals are later fitted together.
Formalization Note is a function on all of , but its hypotheses and the conclusion only involve its values on , so this is the book's statement about mappings of the interval.
Preamble
import Mathlib import Definitions.Def_TheoryOfGames_Utility_UtilitySystem import Definitions.Def_TheoryOfGames_Utility_intervalMap
Formal statement
namespace TheoryOfGames.Utility
/-- (A:F): for fixed `u₀ < v₀`, a mapping of the `w` with `u₀ ≦ w ≦ v₀` to numbers which
satisfies (i) `f₁(u₀) = 0`, (ii) `f₁(v₀) = 1`, and either (ii') or (iii') of (A:E), coincides
on `u₀ ≦ w ≦ v₀` with the function `f_{u₀,v₀}` of (A:D). -/
theorem intervalMap_unique {U : Type*} (S : UtilitySystem U) {u₀ v₀ : U}
(h : S.lt u₀ v₀) (f₁ : U → ℝ) (h0 : f₁ u₀ = 0) (h1 : f₁ v₀ = 1)
(hf : (∀ (β : OpenUnit) (w : U), S.le u₀ w → S.le w v₀ → w ≠ u₀ →
f₁ (S.cmb β u₀ w) = (β : ℝ) * f₁ w) ∨
(∀ (β : OpenUnit) (w : U), S.le u₀ w → S.le w v₀ → w ≠ v₀ →
f₁ (S.cmb β v₀ w) = 1 - (β : ℝ) + (β : ℝ) * f₁ w)) :
∀ w : U, S.le u₀ w → S.le w v₀ → f₁ w = intervalMap S u₀ v₀ w := by sorry
end TheoryOfGames.Utility
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 620, (A:F)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.