Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 (concave case), p. 9 — if P_A is concave then every optimal price P** is at least the linear price P* = (P_m + c)/2

Proved
LinearPriceRule.Concave.theorem_1_concave

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

concave-demandmonopolyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricing

Consider a market with maximum price PmP_mPm​, marginal cost 0≤c<Pm0 \le c < P_m0≤c<Pm​, saturation quantity Qmax⁡>0Q_{\max} > 0Qmax​>0 and inverse demand PAP_APA​ with PA(0)=PmP_A(0) = P_mPA​(0)=Pm​, non-increasing and continuous on [0,Qmax⁡][0, Q_{\max}][0,Qmax​]. If PAP_APA​ is concave on [0,Qmax⁡][0, Q_{\max}][0,Qmax​], then for every quantity Q∗∗Q^{**}Q∗∗ maximizing the profit (PA(Q)−c) Q(P_A(Q) - c)\,Q(PA​(Q)−c)Q over [0,Qmax⁡][0, Q_{\max}][0,Qmax​],

P∗∗=PA(Q∗∗)  ≥  P∗=Pm+c2.P^{**} = P_A(Q^{**}) \;\ge\; P^* = \frac{P_m + c}{2}.P∗∗=PA​(Q∗∗)≥P∗=2Pm​+c​.

The linear pricing rule therefore under-prices whenever the true inverse demand is concave. This is the first step of the proof of Proposition 5.

Formalization Note Concavity is of the inverse demand PAP_APA​ in QQQ, on [0,Qmax⁡][0, Q_{\max}][0,Qmax​]. No differentiability is assumed (the paper's proof uses a Taylor expansion; the statement does not need it). The conclusion holds for every maximizer, not a chosen one.

Preamble
import Mathlib
import Definitions.Def_LinearPriceRule_Concave_Model
Formal statement
namespace LinearPriceRule.Concave
theorem theorem_1_concave (M : Market) (hM : M.Standing)
    (hconc : ConcaveOn ℝ (Set.Icc 0 M.Qmax) M.PA) (Q : ℝ) (hQ : IsOptQty M Q) :
    linPrice M ≤ M.PA Q := by sorry
end LinearPriceRule.Concave
Source
Cohen, Perakis & Pindyck, SSRN 2673810, p. 9, Theorem 1 (concave case; proof p. 23)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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