Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2(a) — Monotonicity of the least optimal price

Proved
FBMSP.lemma2a_monotone_price

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

market-segmentationoperations-researchpricing

Under integrable mean-zero MHR error, the least revenue-maximizing price pϵ(x)p_\epsilon(x)pϵ​(x) is nondecreasing for x≥0x\ge0x≥0.

The statement uses the source's least-optimizer convention. It assumes neither uniqueness nor an interior first-order condition; support-boundary optimal prices remain included.

Preamble
import Definitions.Def_FBMSP_Model
Formal statement
namespace FBMSP

/-- Lemma 2(a): under MHR the least optimal posted price is nondecreasing in
the nonnegative predicted mean.  Draft statement; proof remains open. -/
theorem lemma2a_monotone_price (η : MeasureTheory.Measure ℝ)
    (hnoise : ValidNoise η) (hmhr : HasMHR η) :
    MonotoneOn (singlePrice η) (Set.Ici (0 : ℝ)) := 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 . Lemma 2(a), p.17; proof p.42 (ec8).
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). Assume also that η\etaη is absolutely continuous with respect to Lebesgue measure and that D={t:S(t)>0}D=\{t:S(t)>0\}D={t:S(t)>0} is convex and log⁡S\log SlogS is concave on DDD, meaning log⁡S(λs+(1−λ)t)≥λlog⁡S(s)+(1−λ)log⁡S(t)\log S(\lambda s+(1-\lambda)t)\geq\lambda\log S(s)+(1-\lambda)\log S(t)logS(λs+(1−λ)t)≥λlogS(s)+(1−λ)logS(t) for s,t∈Ds,t\in Ds,t∈D and 0≤λ≤10\leq\lambda\leq10≤λ≤1; zero survival values outside DDD are allowed. 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). The assertion is that for every pair of real numbers x,yx,yx,y with 0≤x≤y0\leq x\leq y0≤x≤y, one has p∗(x)≤p∗(y)p_*(x)\leq p_*(y)p∗​(x)≤p∗​(y). Both endpoints may be 000, and equal arguments are permitted. The conclusion is nondecreasingness of this infimum-defined price on [0,∞)[0,\infty)[0,∞); it contains no claim of strict increase and no claim about comparisons involving negative arguments.

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