Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2, oracle step — Charged precomputation and reconstruction

Proved
FBMSP.oracle_operation_bound

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

market-segmentationoperations-researchpricing

Suppose each nonempty index interval [a,b)[a,b)[a,b) with b≤nb\le nb≤n has a declared oracle charge at most mmm. For n,k≥1n,k\ge1n,k≥1, summing these charges once over all nonempty intervals costs at most mn(n+1)/2m n(n+1)/2mn(n+1)/2. Adding the declared Bellman candidate evaluations for k−1k-1k−1 additional layers and kkk backtracking steps gives

T(n,k,m)≤5n2(k+m).T(n,k,m)\le5n^2(k+m).T(n,k,m)≤5n2(k+m).

The primitive oracle's charge includes both the optimal price and attained block revenue.

Preamble
import Definitions.Def_FBMSP_DynamicProgram
Formal statement
namespace FBMSP

theorem oracle_operation_bound (n k m : ℕ) (hn : 1 ≤ n) (hk : 1 ≤ k)
    (charge : ℕ → ℕ → ℕ)
    (hCost : ∀ a b, a < b → b ≤ n → charge a b ≤ m) :
    oracleCharges charge n ≤ m * blockOracleCalls n ∧
      segmentationWork charge k n ≤ 5 * (n * n) * (k + m) := 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).
Read-back

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

For all natural n,k,mn,k,mn,k,m with n≥1n\geq1n≥1 and k≥1k\geq1k≥1, and every function c:N2→Nc:\mathbb N^2\to\mathbb Nc:N2→N such that c(a,b)≤mc(a,b)\leq mc(a,b)≤m whenever a<b≤na<b\leq na<b≤n, define Oc(n)=∑b=1n∑a=0b−1c(a,b)O_c(n)=\sum_{b=1}^{n}\sum_{a=0}^{b-1}c(a,b)Oc​(n)=∑b=1n​∑a=0b−1​c(a,b) and Q(n)=∑b=1nbQ(n)=\sum_{b=1}^{n}bQ(n)=∑b=1n​b. The assertion is the conjunction Oc(n)≤mQ(n)O_c(n)\leq mQ(n)Oc​(n)≤mQ(n) and Oc(n)+(k−1)Q(n+1)+k≤5n2(k+m)O_c(n)+(k-1)Q(n+1)+k\leq5n^2(k+m)Oc​(n)+(k−1)Q(n+1)+k≤5n2(k+m). Here k−1k-1k−1 has its ordinary value because k≥1k\geq1k≥1, and the second left side is precisely the defined segmentation-work quantity: the sum of supplied nonempty-interval charges, (k−1)(k-1)(k−1) times the triangular count through n+1n+1n+1, and kkk. The theorem imposes no bound on diagonal or out-of-range charges, which never enter the sum, and it does not quantify an oracle implementation or relate ccc to execution time. The value m=0m=0m=0 is permitted and forces all the charged in-range entries to be zero; n=0n=0n=0 and k=0k=0k=0 are 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