Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix, Theorem 1: the full-credit equation is impossible

Proved
PerishableReturns.Suboptimal.appendix_theorem_1_full_credit

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1returns-policysupply-chain-coordination

Suppose c3<c<c1<pc_3<c<c_1<pc3​<c<c1​<p, and g,g1≥0g,g_1\ge0g,g1​≥0. With unlimited returns R=1R=1R=1 and full credit c2=c1c_2=c_1c2​=c1​, the coordination equation (10) would require

0=(c1−p−g)+(p+g2−c)(p+g−c1)p+g2−c3.0=(c_1-p-g)+\frac{(p+g_2-c)(p+g-c_1)}{p+g_2-c_3}.0=(c1​−p−g)+p+g2​−c3​(p+g2​−c)(p+g−c1​)​.

This equality cannot hold. It is the algebraic obstruction behind Theorem 1: an integrated-company optimal order cannot also be retailer-optimal under unlimited full-credit returns.

Formalization Note p+g−c1>0p+g-c_1>0p+g−c1​>0 and p+g2−c3>0p+g_2-c_3>0p+g2​−c3​>0 follow from the stated cost inequalities, so the cancellation in the paper's appendix is legitimate. The statement uses the exact R=1R=1R=1, c2=c1c_2=c_1c2​=c1​ policy, without a demand-dependent choice.

Preamble
import Mathlib
import Definitions.Def_PerishableReturns_Suboptimal_Model
Formal statement
namespace PerishableReturns.Suboptimal

/-- Appendix, proof of Theorem 1, p. 175: (10) cannot hold at full credit. -/
theorem appendix_theorem_1_full_credit (K : Costs) (c1 : ℝ)
    (hc : K.c < c1) (hp : c1 < K.p) :
    (c1 - K.p - K.g) +
      (K.p + K.g2 - K.c) * (K.p + K.g - c1) / (K.p + K.g2 - K.c3) ≠ 0 := by sorry

end PerishableReturns.Suboptimal
Source
Pasternack, Optimal Pricing and Return Policies for Perishable Commodities, Marketing Science 4(2) (1985), Appendix, proof of Theorem 1, p. 175
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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