Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-grid approximation of the benchmark continuation

Proved
MinBuying.grid_continuation_approximation

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

min-buyingpricingprobability

Fix 0≤u<v<10\le u<v<10≤u<v<1 and the paper's functions A,cA,cA,c. For every ε>0\varepsilon>0ε>0 there is a positive integer mmm such that, on the grid xk=u+(v−u)k/mx_k=u+(v-u)k/mxk​=u+(v−u)k/m, the budget increments ak=A(xk+1)−A(xk)a_k=A(x_{k+1})-A(x_k)ak​=A(xk+1​)−A(xk​) and recursion

C0=c(u),Ck+1=ak+Ck1+xk+1akC_0=c(u),\qquad C_{k+1}=\frac{a_k+C_k}{1+x_{k+1}a_k}C0​=c(u),Ck+1​=1+xk+1​ak​ak​+Ck​​

satisfy c(v)−ε<Cmc(v)-\varepsilon<C_mc(v)−ε<Cm​. This gives a finite approximation used to construct near-tight canonical instances. It is a direct-grid variant of the convergence step in the proof of Lemma 4.

Preamble
import Definitions.Def_MinBuying_Analytic

Formal statement
namespace MinBuying

theorem grid_continuation_approximation (u v : ℝ) (hu : 0 ≤ u) (huv : u < v) (hv : v < 1)
    (ε : ℝ) (hε : 0 < ε) :
    ∃ m : ℕ, 0 < m ∧
      let X : ℕ → ℝ := fun k => u + (v - u) * (k : ℝ) / (m : ℝ)
      let a : ℕ → ℝ := fun k => canonicalBudget (X (k + 1)) - canonicalBudget (X k)
      continuousBenchmark v - ε <
        (List.range m).foldl (fun C k => (a k + C) / (1 + X (k + 1) * a k))
          (continuousBenchmark u) := by
  sorry

end MinBuying
Source
Cui, Hamilton, Lamperski, and Ganjizadeh Tari, Unit-Demand Pricing for Min-Buying Customers, September 27, 2026 manuscript, https://doi.org/10.2139/ssrn.5178133, electronic companion ec15–ec17, proof of Lemma 4, equations (EC.21)–(EC.24); p.17, equation (10). Supporting finite-grid convergence variant.

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