Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Corollary 1, p. 26 — E max(V, s) − s ≥ (p − s)Ḡ(p) for every price p

Proved
SuReturns.PartialRefunds.corollary1_full_refund_margin

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

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

Let VVV have law ν\nuν with finite mean, Gˉ(p)=P(V≥p)\bar G(p) = \mathbb P(V \ge p)Gˉ(p)=P(V≥p), and let sss be real. For every real ppp,

(p−s)Gˉ(p)  ≤  Emax⁡(V,s)−s.(p - s)\bar G(p) \;\le\; E\max(V, s) - s.(p−s)Gˉ(p)≤Emax(V,s)−s.

The proof of Corollary 1 applies this at the optimal full-refund price pF∗p^*_FpF∗​: the per-unit margin under full refunds never exceeds the per-unit margin Emax⁡(V,s)−sE\max(V,s) - sEmax(V,s)−s of the optimal partial refund, which is why the optimal quantity under partial refunds is larger.

Formalization Note The page states the inequality at pF∗p^*_FpF∗​ and notes pF∗≥sp^*_F \ge spF∗​≥s; it holds for every real ppp (for p≤sp \le sp≤s the left side is ≤0≤Emax⁡(V,s)−s\le 0 \le E\max(V,s) - s≤0≤Emax(V,s)−s), and is stated in that form.

Preamble
import Mathlib
import Definitions.Def_SuReturns_PartialRefunds_Model

open MeasureTheory ProbabilityTheory
Formal statement
namespace SuReturns.PartialRefunds

theorem corollary1_full_refund_margin (ν : Measure ℝ) [IsProbabilityMeasure ν]
    (hν : Integrable (fun v => v) ν) (s : ℝ) :
    ∀ p, (p - s) * keepProb ν p ≤ reservationPrice ν s - s := by sorry

end SuReturns.PartialRefunds
Source
Su, Consumer Returns Policies and Supply Chain Performance, SSRN 1020451 (version of August 2008), p. 26, proof of Corollary 1
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