Proof of Lemma 1, p. 967 — w(x + h, y + h) = k(h)w(x, y) with k(h) > 0
ProvedBellRegret.Representation.lemma1_shift_factorLet be strictly increasing in and strictly decreasing in , take the value function , and suppose Assumption 1 holds: shifting every outcome of two alternatives by the same amount never changes which one is preferred. Write
for the part of that simple comparisons can identify. Then there is a function such that for all
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 and to the exponential factor of Lemma 1.
Formalization Note The page writes this step for ; the hypothesis is Assumption 1 with . "Increasing/decreasing" (p. 965) is read strictly. The function is chosen before , , .
import Mathlib import Definitions.Def_BellRegret_Representation_Model
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.