Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1.4, eq. (1), p. 4 — under linear inverse demand P_m − bQ the optimal quantity is (P_m − c)/2b and the price is (P_m + c)/2

Proved
LinearPriceRule.Concave.linear_price

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

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

Let Pm>cP_m > cPm​>c and b>0b > 0b>0, and suppose the inverse demand is linear, P(Q)=Pm−bQP(Q) = P_m - bQP(Q)=Pm​−bQ, so that selling Q≥0Q \ge 0Q≥0 units earns (Pm−bQ−c) Q(P_m - bQ - c)\,Q(Pm​−bQ−c)Q. Then the profit is maximized over Q≥0Q \ge 0Q≥0 uniquely at

QL∗=Pm−c2b,with pricePm−b QL∗=Pm+c2.Q^*_L = \frac{P_m - c}{2b}, \qquad\text{with price}\qquad P_m - b\,Q^*_L = \frac{P_m + c}{2}.QL∗​=2bPm​−c​,with pricePm​−bQL∗​=2Pm​+c​.

This is the source of the pricing rule: the profit-maximizing price under a linear demand does not depend on the slope bbb, so a firm that knows only PmP_mPm​ and ccc can charge P∗=(Pm+c)/2P^* = (P_m + c)/2P∗=(Pm​+c)/2 (the "linear price") without knowing bbb.

Formalization Note The statement asserts that QL∗Q^*_LQL∗​ is a maximizer on [0,∞)[0, \infty)[0,∞), that it is the only one, and the identity for the price. No sign condition on ccc is needed here.

Preamble
import Mathlib
import Definitions.Def_LinearPriceRule_Concave_Model
Formal statement
namespace LinearPriceRule.Concave
theorem linear_price (Pm b c : ℝ) (hb : 0 < b) (hc : c < Pm) :
    IsMaxOn (linProfitAt Pm b c) (Set.Ici 0) ((Pm - c) / (2 * b)) ∧
    (∀ Q ∈ Set.Ici (0 : ℝ), IsMaxOn (linProfitAt Pm b c) (Set.Ici 0) Q →
      Q = (Pm - c) / (2 * b)) ∧
    Pm - b * ((Pm - c) / (2 * b)) = (Pm + c) / 2 := by sorry
end LinearPriceRule.Concave
Source
Cohen, Perakis & Pindyck, SSRN 2673810, p. 4, §1.4, eq. (1)
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