Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1(i), p. 9 — under full refunds, p* = argmax (p − s)Ḡ(p) and F̄(q*) = (c − s)/((p* − s)Ḡ(p*)) are optimal

Proved
SuReturns.PartialRefunds.proposition1_full_refund

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

consumer-returnsfull-refundnewsvendorp2o-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 Gˉ(p)=P(V≥p)\bar G(p) = \mathbb P(V \ge p)Gˉ(p)=P(V≥p), FFF the distribution function of DDD and Fˉ=1−F\bar F = 1 - FFˉ=1−F, and let Πfull(p,q)\Pi_{\text{full}}(p,q)Πfull​(p,q) be the full-refund profit (1). Suppose p∗p^*p∗ maximizes (p−s)Gˉ(p)(p - s)\bar G(p)(p−s)Gˉ(p) over all real ppp, (4), and q∗q^*q∗ satisfies

Fˉ(q∗)=c−s(p∗−s)Gˉ(p∗).(5)\bar F(q^*) = \frac{c - s}{(p^* - s)\bar G(p^*)}. \qquad (5)Fˉ(q∗)=(p∗−s)Gˉ(p∗)c−s​.(5)

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

Πfull(p,q)≤Πfull(p∗,q∗).\Pi_{\text{full}}(p, q) \le \Pi_{\text{full}}(p^*, q^*).Πfull​(p,q)≤Πfull​(p∗,q∗).

This is Proposition 1(i): under a full refund policy the seller's price and quantity decisions separate, the price maximizing the per-unit margin (p−s)Gˉ(p)(p - s)\bar G(p)(p−s)Gˉ(p) and the quantity solving a newsvendor problem with that margin.

Formalization Note The denominator of (5) is positive at a maximizer: since μ>s\mu > sμ>s, some p>sp > sp>s has Gˉ(p)>0\bar G(p) > 0Gˉ(p)>0. Only the sufficiency direction of "characterized by" is stated, and existence of p∗p^*p∗, q∗q^*q∗ is not claimed; if (p∗−s)Gˉ(p∗)<c−s(p^* - s)\bar G(p^*) < c - s(p∗−s)Gˉ(p∗)<c−s, (5) has no solution and the statement is vacuous for that law, a gap of the page itself. 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 proposition1_full_refund (ν 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 ν)
    (pF qF : ℝ) (hp : IsMaxOn (fun p => (p - s) * keepProb ν p) Set.univ pF)
    (hq : 1 - cdf D qF = (c - s) / ((pF - s) * keepProb ν pF)) :
    ∀ p q, 0 ≤ q → fullRefundProfit ν D c s p q ≤ fullRefundProfit ν D c s pF qF := by sorry

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