Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2, (28)→(29), p. 26 — E max(V, r) = rG(r) + ∫_r^∞ v dG(v)

Proved
SuReturns.PartialRefunds.eq28_29_reservation_price

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

consumer-returnsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pricing

Let VVV be a real random variable with law ν\nuν and finite mean, and let G(r)=P(V<r)G(r) = \mathbb P(V < r)G(r)=P(V<r). For every real rrr,

Emax⁡(V,r)=r G(r)+∫[r,∞)v dν(v).E\max(V, r) = r\,G(r) + \int_{[r,\infty)} v\,d\nu(v).Emax(V,r)=rG(r)+∫[r,∞)​vdν(v).

This is the identity behind the step from (28) to (29) in the proof of Proposition 2: the consumer's reservation price under refund rrr splits into the refund collected by consumers who return (V<rV < rV<r) and the valuation enjoyed by those who keep (V≥rV \ge rV≥r).

Formalization Note The page writes ∫r∞vg(v) dv\int_r^\infty v g(v)\,dv∫r∞​vg(v)dv for a density ggg; here ν\nuν is a general law and the integral is over the closed half-line [r,∞)[r,\infty)[r,∞), matching the tie rule keep iff V≥rV \ge rV≥r. Integrability of VVV is the page's finite μ=EV\mu = EVμ=EV.

Preamble
import Mathlib
import Definitions.Def_SuReturns_PartialRefunds_Model

open MeasureTheory ProbabilityTheory
Formal statement
namespace SuReturns.PartialRefunds

theorem eq28_29_reservation_price (ν : Measure ℝ) [IsProbabilityMeasure ν]
    (hν : Integrable (fun v => v) ν) (r : ℝ) :
    reservationPrice ν r = r * returnProb ν r + ∫ v in Set.Ici r, v ∂ν := by sorry

end SuReturns.PartialRefunds
Source
Su, Consumer Returns Policies and Supply Chain Performance, SSRN 1020451 (version of August 2008), p. 26, proof of Proposition 2, (28)–(29)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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