Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2(b) — Finite-menu interval domination

Proved
FBMSP.lemma2b_finite_menu_intervals

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

market-segmentationoperations-researchpricing

For a finite sorted prediction support with positive probability weights, a nonempty sorted nonnegative price menu, and independent integrable mean-zero MHR error, there exists a monotone maximizing assignment with interval fibers. It weakly improves revenue relative to every other assignment using that menu.

Repeated prices, unused menu indices, zero purchase probabilities, and ties are allowed. This is the finite computational specialization used by Theorem 2.

Preamble
import Definitions.Def_FBMSP_Model
Formal statement
namespace FBMSP

/-- Tie-safe finite-menu form of Lemma 2(b): there exists a monotone row
maximizer, whose fibers are intervals and whose expected revenue dominates
every assignment using that same menu.  Draft statement; proof remains open. -/
theorem lemma2b_finite_menu_intervals {n k : ℕ}
    (η : MeasureTheory.Measure ℝ) (hnoise : ValidNoise η) (hmhr : HasMHR η)
    (μ w : Fin n → ℝ) (hmarket : ValidFiniteMarket μ w)
    (hk : 0 < k) (p : Fin k → ℝ)
    (hp : Monotone p) (hp_nonneg : ∀ j, 0 ≤ p j) :
    ∃ a : Fin n → Fin k,
      Monotone a ∧
      (∀ i j, postedRevenue η (μ i) (p j) ≤
        postedRevenue η (μ i) (p (a i))) ∧
      (∀ i₁ i₂ i₃, i₁ ≤ i₂ → i₂ ≤ i₃ →
        a i₁ = a i₃ → a i₂ = a i₁) ∧
      ∀ b : Fin n → Fin k,
        finitePolicyRevenue η μ w b p ≤ finitePolicyRevenue η μ w a p := 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); finite regime of Theorem 2.
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 a natural nnn, let real arrays (μi,wi)0≤i<n(\mu_i,w_i)_{0\leq i<n}(μi​,wi​)0≤i<n​ satisfy n>0n>0n>0, μi<μj\mu_i<\mu_jμi​<μj​ whenever i<ji<ji<j, all μi≥0\mu_i\geq0μi​≥0, all wi>0w_i>0wi​>0, and ∑iwi=1\sum_iw_i=1∑i​wi​=1. For any natural k>0k>0k>0 and nondecreasing real price vector 0≤p0≤⋯≤pk−10\leq p_0\leq\cdots\leq p_{k-1}0≤p0​≤⋯≤pk−1​, there exists an assignment a:{0,…,n−1}→{0,…,k−1}a:\{0,\ldots,n-1\}\to\{0,\ldots,k-1\}a:{0,…,n−1}→{0,…,k−1} that is nondecreasing and satisfies all three conclusions: for every i<ni<ni<n and j<kj<kj<k, r(μi,pj)≤r(μi,pa(i))r(\mu_i,p_j)\leq r(\mu_i,p_{a(i)})r(μi​,pj​)≤r(μi​,pa(i)​); for indices i1≤i2≤i3i_1\leq i_2\leq i_3i1​≤i2​≤i3​, equality a(i1)=a(i3)a(i_1)=a(i_3)a(i1​)=a(i3​) implies a(i2)=a(i1)a(i_2)=a(i_1)a(i2​)=a(i1​); and for every assignment bbb into the same kkk slots, ∑iwir(μi,pb(i))≤∑iwir(μi,pa(i))\sum_iw_i r(\mu_i,p_{b(i)})\leq\sum_iw_i r(\mu_i,p_{a(i)})∑i​wi​r(μi​,pb(i)​)≤∑i​wi​r(μi​,pa(i)​). Thus every chosen index is a pointwise maximizer for its mean, the indices assigned to any fixed slot form an interval or the empty set, and the chosen assignment dominates all other assignments for this fixed price vector. Duplicate prices and ties are allowed and the assignment need not be unique; some slots may be unused, including when k>nk>nk>n. Both n=0n=0n=0 and k=0k=0k=0 are excluded, and no condition μi+e≥0\mu_i+e\geq0μi​+e≥0 is imposed.

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