Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5), App. B, PDF p. 34 — the responsive retail price is (a − q̂)/b below a/2 and a/(2b) above

Proved
YieldPostpone.Preference.eq_5

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1responsive-pricingrevenue-maximizationsupply-chain

Let a,b>0a,b>0a,b>0 and let x>0x>0x>0 units be available for sale. Over admissible retail prices 0<p<a/b0<p<a/b0<p<a/b, the revenue pmin⁡{a−bp, x}p\min\{a-bp,\,x\}pmin{a−bp,x} has a unique maximizer, namely

p∗(x)={a−xb,0<x<a2,a2b,x≥a2.p^*(x)=\begin{cases}\dfrac{a-x}{b}, & 0<x<\dfrac a2,\\[2mm] \dfrac{a}{2b}, & x\ge\dfrac a2.\end{cases}p∗(x)=⎩⎨⎧​ba−x​,2ba​,​0<x<2a​,x≥2a​.​

This is the retailer's ex post pricing rule under responsive pricing (scenarios OR and DR): with little stock the retailer prices to clear it, with ample stock it charges the monopoly price and leaves units unsold.

Formalization Note The page writes the rule with indicators of 0<q^<a/20<\hat q<a/20<q^​<a/2 and q^>a/2\hat q>a/2q^​>a/2; at x=a/2x=a/2x=a/2 the two expressions coincide, so the boundary is assigned to the second case here. The statement asserts that the set of maximizers is exactly {p∗(x)}\{p^*(x)\}{p∗(x)}.

Preamble
import Mathlib
import Definitions.Def_YieldPostpone_Preference_Setting
Formal statement
namespace YieldPostpone.Preference

/-- (5), App. B, PDF p. 34: with `x > 0` units available, the revenue `p min{a − bp, x}` over
admissible prices `0 < p < a/b` has the unique maximizer `p*(x) = (a − x)/b` if `x < a/2`
and `p*(x) = a/(2b)` if `x ≥ a/2`. -/
theorem eq_5 (P : Params) (hP : P.Valid) (x : ℝ) (hx : 0 < x) :
    {p : ℝ | pAdm P p ∧ ∀ p' : ℝ, pAdm P p' → salesRev P p' x ≤ salesRev P p x} =
      {if x < P.a / 2 then (P.a - x) / P.b else P.a / (2 * P.b)} := by sorry

end YieldPostpone.Preference
Source
Geng, Guo, Xiao, Yang, …, SSRN 3546872 (author version), App. B, PDF p. 34 (appendix p. 2), (5)
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

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