An ordered active-item list from an optimal triangular pricing policy
ProvedMinBuying.triangular_cap_list_extractionmin-buyingpricingprobability
Let I be a positive-size triangular instance with optimal uniform revenue one. There is a list L of at most n positive triangular parameter pairs with weakly decreasing caps whose continuation from zero is at least the optimal differentiated revenue of I. For every t>0,
This extracts the active items of a suitable cap-or-disabled policy and supplies an ordered algebraic representation for the canonical reduction. It does not assume that all items should remain active.
Preamble
import Definitions.Def_MinBuying_Triangular
Formal statement
namespace MinBuying
/-- An optimal cap-or-disabled policy yields an ordered list of its active
triangular items without increasing any uniform revenue. -/
theorem triangular_cap_list_extraction (n : ℕ) (hn : 0 < n) (I : TriangularInstance n)
(hNorm : UPRevenue (triangularJoint I) = 1) :
∃ L : List (ℝ × ℝ), L.length ≤ n ∧
(∀ x ∈ L, 0 < x.1 ∧ 0 < x.2) ∧
L.Pairwise (fun x y => y.2 ≤ x.2) ∧
DPRevenue (triangularJoint I) ≤ L.foldl (fun C x => continuationStep x.1 x.2 C) 0 ∧
(∀ t : ℝ, 0 < t → t * (1 - (L.map (fun x => triangularReject x.1 x.2 t)).prod) ≤ 1) := 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, proof of Lemma 2, electronic companion ec8–ec11. Auxiliary result proved for this formalization.