Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(A:E) — properties of fu0,v0f_{u_0,v_0}fu0​,v0​​: monotone, and linear toward either endpoint

Proved
TheoryOfGames.Utility.intervalMap_properties

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), fix u0<v0u_0 < v_0u0​<v0​, and let f=fu0,v0f = f_{u_0,v_0}f=fu0​,v0​​ be the function of (A:D) on the interval u0≦w≦v0u_0 \leqq w \leqq v_0u0​≦w≦v0​. Then, for utilities in that interval:

  1. (i') fff is monotone: w<w′w < w'w<w′ implies f(w)<f(w′)f(w) < f(w')f(w)<f(w′);
  2. (ii') for 0<β<10 < \beta < 10<β<1 and w≠u0w \neq u_0w=u0​,
f((1−β)u0+βw)=βf(w);f\big((1-\beta)u_0 + \beta w\big) = \beta f(w);f((1−β)u0​+βw)=βf(w);
  1. (iii') for 0<β<10 < \beta < 10<β<1 and w≠v0w \neq v_0w=v0​,
f((1−β)v0+βw)=1−β+βf(w).f\big((1-\beta)v_0 + \beta w\big) = 1 - \beta + \beta f(w).f((1−β)v0​+βw)=1−β+βf(w).

These properties say that fff is the correct numerical scale on the interval: combinations with either endpoint are carried into the corresponding numerical combinations.

Preamble
import Mathlib
import Definitions.Def_TheoryOfGames_Utility_UtilitySystem
import Definitions.Def_TheoryOfGames_Utility_intervalMap
Formal statement
namespace TheoryOfGames.Utility

/-- (A:E): for fixed `u₀ < v₀` the function `f = f_{u₀,v₀}` of (A:D), on the interval
`u₀ ≦ w ≦ v₀`, is (i') monotone, and satisfies
(ii') `f((1 − β)u₀ + βw) = βf(w)` for `0 < β < 1` and `w ≠ u₀`,
(iii') `f((1 − β)v₀ + βw) = 1 − β + βf(w)` for `0 < β < 1` and `w ≠ v₀`. -/
theorem intervalMap_properties {U : Type*} (S : UtilitySystem U) {u₀ v₀ : U}
    (h : S.lt u₀ v₀) :
    (∀ w w' : U, S.le u₀ w → S.le w v₀ → S.le u₀ w' → S.le w' v₀ → S.lt w w' →
        intervalMap S u₀ v₀ w < intervalMap S u₀ v₀ w') ∧
      (∀ (β : OpenUnit) (w : U), S.le u₀ w → S.le w v₀ → w ≠ u₀ →
        intervalMap S u₀ v₀ (S.cmb β u₀ w) = (β : ℝ) * intervalMap S u₀ v₀ w) ∧
      ∀ (β : OpenUnit) (w : U), S.le u₀ w → S.le w v₀ → w ≠ v₀ →
        intervalMap S u₀ v₀ (S.cmb β v₀ w) = 1 - (β : ℝ) + (β : ℝ) * 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:E)
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