§4, pp. 311–312 — θ^v < θ̄: no bunch at the top
ProvedMussaRosen.Mono.not_bunched_at_topbunchingmonopolyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1screening
Under the standing hypotheses, let be an optimal assignment and assume . Then is not constant on any interval with : for every and every constant , there is with .
The monopolist always differentiates among the customers with the largest valuations of quality.
Formalization Note The hypothesis says that the top type buys under competition. The paper presupposes that the monopolist serves an interval with (p. 306); without it the assignment would be a bunch at the top.
Preamble
import Mathlib import Definitions.Def_MussaRosen_Mono_Setting open MechanismDesign.Screening Filter Topology
Formal statement
namespace MussaRosen.Mono
theorem not_bunched_at_top {θ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) :
deriv C 0 < θhi → ∀ θu < θhi, ∀ c : ℝ, ¬ ∀ θ ∈ Set.Ioo θu θhi, q θ = c := by sorry
end MussaRosen.Mono
Source
Mussa and Rosen, Monopoly and product quality, J. Econ. Theory 18 (1978), pp. 311–312, §4, last paragraph of case (ii)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.