Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (EC.6) — Bellman optimality for consecutive blocks

Proved
FBMSP.dp_correctness

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

market-segmentationoperations-researchpricing

Let W(a,b)W(a,b)W(a,b) be any real score assigned to the index interval [a,b)[a,b)[a,b). The declared Bellman recurrence for k+1k+1k+1 consecutive block slots on [a,a+n)[a,a+n)[a,a+n) is attained by a witnessed partition and is at least the score of every such partition.

Empty blocks are allowed. When their scores are zero, they represent unused slots. This is a generic combinatorial lemma; applying it to pricing requires the block-oracle and interval-reduction links. A complete proof of this generic lemma has been checked locally, but this uploaded draft target remains an open statement until publication and proof submission.

Preamble
import Definitions.Def_FBMSP_DynamicProgram
Formal statement
namespace FBMSP

theorem dp_correctness (W : ℕ → ℕ → ℝ) (k a n : ℕ) :
    IntervalValue W k a n (intervalDP W k a n) ∧
      ∀ v, IntervalValue W k a n v → v ≤ intervalDP W k a n := 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 . Proof of Theorem 2, pp.43–44 (ec9–ec10), Eq. (EC.6).
Read-back

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

For every function W:N2→RW:\mathbb N^2\to\mathbb RW:N2→R and all natural numbers k,a,nk,a,nk,a,n, let D0(a,n)=W(a,a+n)D_0(a,n)=W(a,a+n)D0​(a,n)=W(a,a+n) and Dℓ+1(a,n)=max⁡0≤i≤n(Dℓ(a,i)+W(a+i,a+n))D_{\ell+1}(a,n)=\max_{0\leq i\leq n}\bigl(D_\ell(a,i)+W(a+i,a+n)\bigr)Dℓ+1​(a,n)=max0≤i≤n​(Dℓ​(a,i)+W(a+i,a+n)). Then Dk(a,n)D_k(a,n)Dk​(a,n) is itself a sum ∑j=0kW(cj,cj+1)\sum_{j=0}^{k}W(c_j,c_{j+1})∑j=0k​W(cj​,cj+1​) for some nondecreasing natural cuts c0=ac_0=ac0​=a and ck+1=a+nc_{k+1}=a+nck+1​=a+n, and every such sum is at most Dk(a,n)D_k(a,n)Dk​(a,n). Here the admissible sums are equivalently the values generated by beginning with the one-block value W(a,a+n)W(a,a+n)W(a,a+n) at level 000 and repeatedly appending a last block from a+ia+ia+i to a+na+na+n with i≤ni\leq ni≤n. There are k+1k+1k+1 blocks, repeated cuts and empty blocks are allowed, and no sign, monotonicity, or zero-diagonal condition on WWW is assumed. All zero cases are included: for k=0k=0k=0 the value is the single weight W(a,a+n)W(a,a+n)W(a,a+n), and for n=0n=0n=0 every block is empty and the value is (k+1)W(a,a)(k+1)W(a,a)(k+1)W(a,a).

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