Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Proposition 4(ii) — the loss-averse objective (6) is an expected utility with a nondecreasing piecewise-linear utility

Proved
MixFlex.Reliable.lossAverse_eq_expectedUtility

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

expected-utilityflexibilityloss-aversionnewsvendorp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let w0∈Rw_0\in\mathbb Rw0​∈R be the initial wealth and β≥1\beta\ge 1β≥1 the loss-aversion coefficient, and define the piecewise-linear utility with breakpoint w0w_0w0​,

uLA(w)=w0+max⁡{w−w0,0}−βmax⁡{−(w−w0),0}.u_{LA}(w)=w_0+\max\{w-w_0,0\}-\beta\max\{-(w-w_0),0\}.uLA​(w)=w0​+max{w−w0​,0}−βmax{−(w−w0​),0}.

Then

  1. uLAu_{LA}uLA​ is nondecreasing, so it belongs to the class U1U_1U1​;
  2. for every integrable terminal wealth WWW on a probability space, the loss-averse objective (6) equals its expected utility:
w0+E[W~+−βW~−]=E[uLA(W)],W~=W−w0.w_0+E\big[\tilde W^+-\beta\tilde W^-\big]=E\big[u_{LA}(W)\big],\qquad \tilde W=W-w_0 .w0​+E[W~+−βW~−]=E[uLA​(W)],W~=W−w0​.

With the expected-utility comparison this gives part (ii) of Proposition 4 for the loss-averse objective.

Formalization Note Integrability of WWW is assumed so that E[w0+f(W)]=w0+E[f(W)]E[w_0+f(W)]=w_0+E[f(W)]E[w0​+f(W)]=w0​+E[f(W)] holds for the Bochner integral (for non-integrable WWW both sides default to junk values). The SD and SF wealths of the mission are almost surely bounded, so they satisfy it.

Preamble
import Mathlib
import Definitions.Def_MixFlex_Reliable_Model

open MeasureTheory
Formal statement
namespace MixFlex.Reliable
theorem lossAverse_eq_expectedUtility (P : Params) (hP : P.Standing) {Ω : Type*}
    [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] :
    Monotone (uLA P) ∧
      ∀ W : Ω → ℝ, Integrable W μ → lossAverseValue P μ W = expectedUtility μ (uLA P) W := by sorry
end MixFlex.Reliable
Source
Tomlin and Wang, On the value of mix flexibility and dual sourcing in unreliable newsvendor networks, Manufacturing Service Oper. Management 7(1), 2005, p. 53, Appendix A, proof of PROPOSITION 4(ii); p. 40, (6)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me