Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(18)–(19), pp. 311, 314 — boundary conditions of an interior bunch

Proved
MussaRosen.Mono.bunch_conditions

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

bunchingmonopolyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1screening

Under the standing hypotheses, let qqq be an optimal assignment, and suppose it has an interior bunch at a positive quality: there are θ‾<θu<θv<θˉ\underline\theta<\theta^u<\theta^v<\bar\thetaθ​<θu<θv<θˉ and qr>0q^r>0qr>0 with

  1. q(θ)=qrq(\theta)=q^rq(θ)=qr for θu≤θ≤θv\theta^u\le\theta\le\theta^vθu≤θ≤θv,
  2. q˙(θ)>0\dot q(\theta)>0q˙​(θ)>0 throughout some interval immediately to the left of θu\theta^uθu,
  3. q˙(θ)>0\dot q(\theta)>0q˙​(θ)>0 throughout some interval immediately to the right of θv\theta^vθv.

Then

C′(qr)=MR(θu),C′(qr)=MR(θv),∫θuθv[MR(θ)−C′(qr)]f(θ) dθ=0.C'(q^r)=MR(\theta^u),\qquad C'(q^r)=MR(\theta^v),\qquad \int_{\theta^u}^{\theta^v}\bigl[MR(\theta)-C'(q^r)\bigr]f(\theta)\,d\theta=0 .C′(qr)=MR(θu),C′(qr)=MR(θv),∫θuθv​[MR(θ)−C′(qr)]f(θ)dθ=0.

The first two equalities are (18), G(θu)=qr=G(θv)G(\theta^u)=q^r=G(\theta^v)G(θu)=qr=G(θv); the third is (19), μ(θu)−μ(θv)=0\mu(\theta^u)-\mu(\theta^v)=0μ(θu)−μ(θv)=0. Equivalently, the average marginal revenue over the bunch, 1F(θv)−F(θu)∫θuθvMR(θ)f(θ) dθ\frac{1}{F(\theta^v)-F(\theta^u)}\int_{\theta^u}^{\theta^v}MR(\theta)f(\theta)\,d\thetaF(θv)−F(θu)1​∫θuθv​MR(θ)f(θ)dθ, equals the marginal cost C′(qr)C'(q^r)C′(qr).

These conditions determine the bunch when marginal revenue is not monotone.

Formalization Note Hypotheses 2 and 3 state explicitly the paper's condition that the neighboring intervals have q˙>0\dot q>0q˙​>0. (18) is written through C′C'C′ instead of GGG.

Preamble
import Mathlib
import Definitions.Def_MussaRosen_Mono_Setting

open MechanismDesign.Screening Filter Topology
Formal statement
namespace MussaRosen.Mono

theorem bunch_conditions {θlo θhi : ℝ} (D : TypeDistribution θlo θhi)
    (hfd : DifferentiableOn ℝ D.f (Set.Icc θlo θhi))
    (C : ℝ → ℝ) (hC0 : C 0 = 0) (hCd : Differentiable ℝ C) (hCd2 : Differentiable ℝ (deriv C))
    (hC1 : ∀ q : ℝ, 0 ≤ q → 0 < deriv C q) (hC2 : ∀ q : ℝ, 0 ≤ q → 0 < deriv (deriv C) q)
    (q : ℝ → ℝ) (hq : IsOptimal D C q)
    (θu θv qr : ℝ) (hlo : θlo < θu) (huv : θu < θv) (hhi : θv < θhi) (hqr : 0 < qr)
    (hflat : ∀ θ ∈ Set.Icc θu θv, q θ = qr)
    (hleft : ∃ a : ℝ, θlo ≤ a ∧ a < θu ∧
      ∀ θ ∈ Set.Ioo a θu, ∃ d : ℝ, 0 < d ∧ HasDerivAt q d θ)
    (hright : ∃ b : ℝ, θv < b ∧ b ≤ θhi ∧
      ∀ θ ∈ Set.Ioo θv b, ∃ d : ℝ, 0 < d ∧ HasDerivAt q d θ) :
    deriv C qr = virtualValuation D θu ∧ deriv C qr = virtualValuation D θv ∧
      ∫ θ in θu..θv, (virtualValuation D θ - deriv C qr) * D.f θ = 0 := by sorry

end MussaRosen.Mono
Source
Mussa and Rosen, Monopoly and product quality, J. Econ. Theory 18 (1978), p. 311, §4, case (ii); p. 314, §5, equations (18), (19)
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