Finite-grid approximation of the benchmark continuation
ProvedMinBuying.grid_continuation_approximationmin-buyingpricingprobability
Fix and the paper's functions . For every there is a positive integer such that, on the grid , the budget increments and recursion
satisfy . 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.