Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2(b) — Interval assignment for arbitrary prediction values

Proved
FBMSP.lemma2b_general_menu_intervals

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

market-segmentationoperations-researchpricing

Fix a nonempty, nondecreasing list of nonnegative prices and an integrable mean-zero MHR error law. There exists a nondecreasing assignment of every real prediction value to a menu index that maximizes the pointwise expected revenue. Each nonempty assignment fiber is an interval: if two ordered endpoints receive the same index, all prediction values between them receive that index too.

This fixed-menu statement retains arbitrary prediction values and therefore supports both atomic and continuous prediction laws. It asserts existence of a suitable interval assignment; ties need not make every optimal assignment interval.

Preamble
import Definitions.Def_FBMSP_Model
Formal statement
namespace FBMSP

theorem lemma2b_general_menu_intervals {k : ℕ}
    (hk : 0 < k) (η : MeasureTheory.Measure ℝ)
    (hη : ValidNoise η) (hMHR : HasMHR η)
    (p : Fin k → ℝ) (hp : Monotone p) (hpNonneg : ∀ j, 0 ≤ p j) :
    ∃ a : ℝ → Fin k, Monotone a ∧
      (∀ (x : ℝ) (j : Fin k), postedRevenue η x (p j) ≤
        postedRevenue η x (p (a x))) ∧
      (∀ x₁ x₂ x₃ : ℝ, x₁ ≤ x₂ → x₂ ≤ x₃ →
        a x₁ = a x₃ → a x₂ = a 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 . Lemma 2(b), p.17; proof pp.42–43 (ec8–ec9).
Read-back

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

For every natural k>0k>0k>0, let η\etaη be a probability measure on R\mathbb RR with integrable identity function and ∫e dη(e)=0\int e\,d\eta(e)=0∫edη(e)=0, and write 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 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. For any nondecreasing nonnegative real price vector 0≤p0≤⋯≤pk−10\leq p_0\leq\cdots\leq p_{k-1}0≤p0​≤⋯≤pk−1​, there exists a function a:R→{0,…,k−1}a:\mathbb R\to\{0,\ldots,k-1\}a:R→{0,…,k−1} such that a(x)≤a(y)a(x)\leq a(y)a(x)≤a(y) whenever x≤yx\leq yx≤y, r(x,pj)≤r(x,pa(x))r(x,p_j)\leq r(x,p_{a(x)})r(x,pj​)≤r(x,pa(x)​) for every real xxx and every j<kj<kj<k, and for all real x1≤x2≤x3x_1\leq x_2\leq x_3x1​≤x2​≤x3​, equality a(x1)=a(x3)a(x_1)=a(x_3)a(x1​)=a(x3​) implies a(x2)=a(x1)a(x_2)=a(x_1)a(x2​)=a(x1​). Thus the selected slot maximizes posted revenue within the supplied vector at every real argument, and the set assigned to any fixed slot is an interval in the order-convex sense, possibly empty. The arguments range over all of R\mathbb RR, including negative values; there is no prediction measure or almost-everywhere restriction. Duplicate prices, zero prices, ties, and zero sale probabilities are permitted, and the theorem does not require uniqueness of the selection or prescribe the inclusion of interval endpoints. The case k=0k=0k=0 is excluded.

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