Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(A:F) — fu0,v0f_{u_0,v_0}fu0​,v0​​ is determined by (i), (ii) and either (ii') or (iii')

Proved
TheoryOfGames.Utility.intervalMap_unique

by mikedeng1 · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

decision-theoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1utility-theory

Let UUU be a system of utilities satisfying (3:A)–(3:C) and fix u0<v0u_0 < v_0u0​<v0​. Let f1f_1f1​ be a mapping of all www with u0≦w≦v0u_0 \leqq w \leqq v_0u0​≦w≦v0​ to real numbers such that f1(u0)=0f_1(u_0) = 0f1​(u0​)=0, f1(v0)=1f_1(v_0) = 1f1​(v0​)=1, and either

  1. f1((1−β)u0+βw)=βf1(w)f_1\big((1-\beta)u_0 + \beta w\big) = \beta f_1(w)f1​((1−β)u0​+βw)=βf1​(w) for all 0<β<10 < \beta < 10<β<1 and all w≠u0w \neq u_0w=u0​ in the interval, or
  2. f1((1−β)v0+βw)=1−β+βf1(w)f_1\big((1-\beta)v_0 + \beta w\big) = 1 - \beta + \beta f_1(w)f1​((1−β)v0​+βw)=1−β+βf1​(w) for all 0<β<10 < \beta < 10<β<1 and all w≠v0w \neq v_0w=v0​ in the interval.

Then f1f_1f1​ coincides with the function fu0,v0f_{u_0,v_0}fu0​,v0​​ of (A:D):

f1(w)=fu0,v0(w)(u0≦w≦v0).f_1(w) = f_{u_0,v_0}(w) \qquad (u_0 \leqq w \leqq v_0).f1​(w)=fu0​,v0​​(w)(u0​≦w≦v0​).

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 f1f_1f1​ is a function on all of UUU, but its hypotheses and the conclusion only involve its values on u0≦w≦v0u_0 \leqq w \leqq v_0u0​≦w≦v0​, 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
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me