Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2.2 — Attainment of the least monopoly price

Proved
FBMSP.singlePrice_attains

by mikeh · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

market-segmentationoperations-researchpricing

For any integrable mean-zero error law and nonnegative predicted value xxx, the infimum defining pϵ(x)p_\epsilon(x)pϵ​(x) is an actual least revenue-maximizing nonnegative price, and

pϵ(x)S(pϵ(x)−x)=Rϵ(x).p_\epsilon(x)S(p_\epsilon(x)-x)=R_\epsilon(x).pϵ​(x)S(pϵ​(x)−x)=Rϵ​(x).

This supplies the optimizer-existence obligation implicit in the source's notation. It does not assume that optimal prices are unique.

Preamble
import Definitions.Def_FBMSP_Model
Formal statement
namespace FBMSP

/-- Supporting attainment obligation for the source's least-optimizer
definition of p_epsilon.  Draft statement; proof remains open. -/
theorem singlePrice_attains (η : MeasureTheory.Measure ℝ)
    (hnoise : ValidNoise η) (x : ℝ) (hx : 0 ≤ x) :
    IsLeastOptimalPrice η x (singlePrice η x) ∧
      postedRevenue η x (singlePrice η x) = singleRevenue η x := by sorry

end FBMSP
Source
Titing Cui and Michael L. Hamilton, Optimal Feature-Based Market Segmentation and Pricing, October 22, 2025 manuscript (60 PDF pages); Operations Research 74(3), 1354–1370 (2026). https://doi.org/10.1287/opre.2022.0490 ; https://ssrn.com/abstract=4151103 . Section 2.2, p.11, definitions of price, margin, and revenue.
Read-back

What the Lean code literally says, in plain math · gpt-6-astra

Let η\etaη be a probability measure on R\mathbb RR such that the identity is integrable and ∫e dη(e)=0\int e\,d\eta(e)=0∫edη(e)=0. Put S(t)=η([t,∞))S(t)=\eta([t,\infty))S(t)=η([t,∞)) and r(x,p)=pS(p−x)r(x,p)=pS(p-x)r(x,p)=pS(p−x). For real xxx, let Ox={p∈R:p≥0 and r(x,q)≤r(x,p) for every real q≥0}O_x=\{p\in\mathbb R:p\geq0\ \text{and}\ r(x,q)\leq r(x,p)\ \text{for every real }q\geq0\}Ox​={p∈R:p≥0 and r(x,q)≤r(x,p) for every real q≥0}, let p∗(x)=inf⁡Oxp_*(x)=\inf O_xp∗​(x)=infOx​ with the real-infimum convention inf⁡∅=0\inf\varnothing=0inf∅=0, and let R(x)=sup⁡p≥0r(x,p)R(x)=\sup_{p\geq0}r(x,p)R(x)=supp≥0​r(x,p). For every real x≥0x\geq0x≥0, the assertion is that p∗(x)∈Oxp_*(x)\in O_xp∗​(x)∈Ox​, that p∗(x)≤qp_*(x)\leq qp∗​(x)≤q for every q∈Oxq\in O_xq∈Ox​, and that r(x,p∗(x))=R(x)r(x,p_*(x))=R(x)r(x,p∗​(x))=R(x). In expanded form the infimum is nonnegative, its revenue is at least the revenue at every nonnegative real price, it is no greater than any other nonnegative price having that maximizing property, and its revenue equals the supremum over all nonnegative real prices. Thus the conclusion includes nonemptiness of OxO_xOx​ and attainment at its least element, including when x=0x=0x=0. No density, survival log-concavity, bounded-support, or nonnegative-sum condition is assumed.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikeh · Oct 30, 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