Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 — Bounds on an optimal segment price

Proved
FBMSP.corollary1_segment_price_bounds

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

market-segmentationoperations-researchpricing

Consider a nonempty finite segment with nonnegative distinct predicted values and positive weights normalized to sum to one, under integrable mean-zero MHR error. If every individual least optimal price lies between LLL and UUU, some nonnegative price that maximizes total segment revenue also lies in [L,U][L,U][L,U].

Taking the smallest and largest individual optimal prices as L,UL,UL,U recovers the finite-support form of the source's bound. The existence formulation handles ties without claiming that every segment optimizer must lie in the interval.

Preamble
import Definitions.Def_FBMSP_Model
Formal statement
namespace FBMSP

/-- Corollary 1 for a finite segment.  Bounds enclosing all individual least
optimal prices also enclose an attaining optimal price for the segment.
Draft statement; proof remains open. -/
theorem corollary1_segment_price_bounds {n : ℕ}
    (η : MeasureTheory.Measure ℝ) (hnoise : ValidNoise η) (hmhr : HasMHR η)
    (μ w : Fin n → ℝ) (hmarket : ValidFiniteMarket μ w)
    (L U : ℝ)
    (hbounds : ∀ i, L ≤ singlePrice η (μ i) ∧ singlePrice η (μ i) ≤ U) :
    ∃ p : ℝ, 0 ≤ p ∧ L ≤ p ∧ p ≤ U ∧
      ∀ q : ℝ, 0 ≤ q →
        blockRevenue η μ w 0 n q ≤ blockRevenue η μ w 0 n 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 . Corollary 1, p.17; proof p.43 (ec9).
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). 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 real L,UL,UL,U such that L≤p∗(μi)≤UL\leq p_*(\mu_i)\leq UL≤p∗​(μi​)≤U for every i<ni<ni<n, there exists a real ppp with p≥0p\geq0p≥0 and L≤p≤UL\leq p\leq UL≤p≤U such that, for every nonnegative real qqq, ∑i=0n−1wiqS(q−μi)≤∑i=0n−1wipS(p−μi)\sum_{i=0}^{n-1}w_i qS(q-\mu_i)\leq\sum_{i=0}^{n-1}w_i pS(p-\mu_i)∑i=0n−1​wi​qS(q−μi​)≤∑i=0n−1​wi​pS(p−μi​). Thus at least one maximizing common price for the full finite index interval [0,n)[0,n)[0,n) lies in the supplied bounds; the statement does not require it to be the least maximizing common price or assert that every maximizing price lies there. The bounds themselves need not be nonnegative, and L≤UL\leq UL≤U follows from the bounds hypothesis and n>0n>0n>0 rather than being a separate hypothesis. No nonnegative-realized-sum condition 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