Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. 967 — w(x + h, y + h) = k(h)w(x, y) with k(h) > 0

Proved
BellRegret.Representation.lemma1_shift_factor

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

decision-theoryfunctional-equationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1regret

Let u(x,y)u(x,y)u(x,y) be strictly increasing in xxx and strictly decreasing in yyy, take the value function v(x)=xv(x)=xv(x)=x, and suppose Assumption 1 holds: shifting every outcome of two alternatives by the same amount hhh never changes which one is preferred. Write

w(x,y)=u(x,y)−u(y,x)w(x,y)=u(x,y)-u(y,x)w(x,y)=u(x,y)−u(y,x)

for the part of uuu that simple comparisons can identify. Then there is a function k:R→(0,∞)k:\mathbb R\to(0,\infty)k:R→(0,∞) such that for all x,y,hx,y,hx,y,h

w(x+h, y+h)=k(h) w(x,y).w(x+h,\,y+h)=k(h)\,w(x,y).w(x+h,y+h)=k(h)w(x,y).

This is the first step of the proof of Lemma 1: shifting all outcomes rescales the difference function by a positive factor that depends only on the shift. It leads to the multiplicative equation k(x+h)=k(x)k(h)k(x+h)=k(x)k(h)k(x+h)=k(x)k(h) and to the exponential factor of Lemma 1.

Formalization Note The page writes this step for v(x)=xv(x)=xv(x)=x; the hypothesis is Assumption 1 with v=idv=\mathrm{id}v=id. "Increasing/decreasing" (p. 965) is read strictly. The function kkk is chosen before xxx, yyy, hhh.

Preamble
import Mathlib
import Definitions.Def_BellRegret_Representation_Model
Formal statement
namespace BellRegret.Representation

/-- Bell (1982), proof of Lemma 1, p. 967: for `v(x) = x`, Assumption 1 implies
`w(x + h, y + h) = k(h) w(x, y)` with `k(h) > 0`, where `w(x, y) = u(x, y) - u(y, x)`.
The function `k` does not depend on `x`, `y`. -/
theorem lemma1_shift_factor (u : ℝ → ℝ → ℝ)
    (hux : ∀ y, StrictMono (fun x => u x y)) (huy : ∀ x, StrictAnti (fun y => u x y))
    (hA1 : Assumption1 u id) :
    ∃ k : ℝ → ℝ, (∀ h, 0 < k h) ∧
      ∀ x y h : ℝ, u (x + h) (y + h) - u (y + h) (x + h) = k h * (u x y - u y x) := by sorry

end BellRegret.Representation
Source
Bell, Regret in Decision Making under Uncertainty, Operations Research 30(5) (1982) 961–981, p. 967 (PDF 8), proof of Lemma 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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