Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2, p. 11 — p* = E max(V, s), F̄(q*) = (c − s)/(p* − s), r* = s are optimal

Proved
SuReturns.PartialRefunds.proposition2_optimal_policy

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

consumer-returnsnewsvendoroptimal-refundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Standing assumptions (Su pp. 6–7): market demand X∼DX \sim DX∼D with X≥0X \ge 0X≥0; consumer valuations V∼νV \sim \nuV∼ν with finite mean μ=EV\mu = EVμ=EV; unit cost ccc and salvage value sss with 0≤s<c<μ0 \le s < c < \mu0≤s<c<μ. Let FFF be the distribution function of DDD and Fˉ=1−F\bar F = 1 - FFˉ=1−F, and let Π(p,q,r)\Pi(p,q,r)Π(p,q,r) be the seller's expected profit (7)–(8) under the demand rule (6), where consumers buy only if p≤Emax⁡(V,r)p \le E\max(V,r)p≤Emax(V,r). Set

p∗=Emax⁡(V,s),r∗=s,p^* = E\max(V, s), \qquad r^* = s,p∗=Emax(V,s),r∗=s,

and let q∗q^*q∗ be any quantity with

Fˉ(q∗)=c−sp∗−s=c−sEmax⁡(V,s)−s.\bar F(q^*) = \frac{c - s}{p^* - s} = \frac{c - s}{E\max(V, s) - s}.Fˉ(q∗)=p∗−sc−s​=Emax(V,s)−sc−s​.

Then for every price ppp, every refund rrr and every stocking quantity q≥0q \ge 0q≥0,

Π(p,q,r)≤Π(p∗,q∗,r∗).\Pi(p, q, r) \le \Pi(p^*, q^*, r^*).Π(p,q,r)≤Π(p∗,q∗,r∗).

This is Proposition 2: with valuations learned after purchase, the seller optimally charges consumers their full reservation price, sets the refund equal to the salvage value, which implements the efficient ex post allocation of the good, and stocks the newsvendor quantity at margin Emax⁡(V,s)−sE\max(V,s) - sEmax(V,s)−s. It is the basis for the comparison with full refunds (Corollary 1), the welfare result (Corollary 2) and the coordination results of Section 5.

Formalization Note The triple is stated in the page's closed form and its optimality is claimed; uniqueness is not (if ν\nuν puts no mass on [s,r)[s, r)[s,r), the refund rrr is optimal too). The denominator Emax⁡(V,s)−s≥μ−s>0E\max(V,s) - s \ge \mu - s > 0Emax(V,s)−s≥μ−s>0. Existence of q∗q^*q∗ is not claimed; for a continuous demand law it exists by the newsvendor theorem referenced in this mission. Any q∗q^*q∗ solving (10) is automatically ≥0\ge 0≥0, since Fˉ=1\bar F = 1Fˉ=1 on (−∞,0)(-\infty, 0)(−∞,0). Demand is assumed nonnegative (D((−∞,0))=0D((-\infty,0)) = 0D((−∞,0))=0) and stocking quantities range over q≥0q \ge 0q≥0: the page's demand is "a mass of infinitesimal consumers" and qqq a "stocking quantity", and without these readings the profit is unbounded (a negative qqq with a very negative price makes it arbitrarily large). 0≤s0 \le s0≤s is the page's own "0≤s≤c0 \le s \le c0≤s≤c" (p. 26). The valuation law is a general probability measure with integrable identity rather than a density ggg; Gˉ(r)=P(V≥r)\bar G(r) = \mathbb P(V \ge r)Gˉ(r)=P(V≥r) follows the page's tie rule (keep iff V≥rV \ge rV≥r).

Preamble
import Mathlib
import Definitions.Def_SuReturns_PartialRefunds_Model

open MeasureTheory ProbabilityTheory
Formal statement
namespace SuReturns.PartialRefunds

theorem proposition2_optimal_policy (ν D : Measure ℝ) [IsProbabilityMeasure ν]
    [IsProbabilityMeasure D] (hν : Integrable (fun v => v) ν) (hD0 : D (Set.Iio 0) = 0)
    (c s : ℝ) (hs0 : 0 ≤ s) (hsc : s < c) (hcμ : c < meanValuation ν)
    (qstar : ℝ) (hq : 1 - cdf D qstar = (c - s) / (reservationPrice ν s - s)) :
    ∀ p r q, 0 ≤ q → profit ν D c s p q r ≤ profit ν D c s (reservationPrice ν s) qstar s := by sorry

end SuReturns.PartialRefunds
Source
Su, Consumer Returns Policies and Supply Chain Performance, SSRN 1020451 (version of August 2008), p. 11, Proposition 2, (9)–(11); profit (7)–(8), p. 11; demand (6), p. 10
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