Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pruning and equal-cap aggregation of triangular continuation lists

Proved
MinBuying.triangular_list_pruning

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

min-buyingpricingprobability

Consider a finite list of positive triangular parameters with weakly decreasing caps. Suppose its continuation from zero exceeds one. There is a list with no more entries, strictly decreasing caps greater than one, and continuation at least as large. At each positive common price t, its rejection product is also at least as large:

∏(a,v)∈LPr⁡Tri⁡(a,v)(V<t)≤∏(a,v)∈MPr⁡Tri⁡(a,v)(V<t).\prod_{(a,v)\in L}\Pr_{\operatorname{Tri}(a,v)}(V<t)\le\prod_{(a,v)\in M}\Pr_{\operatorname{Tri}(a,v)}(V<t).(a,v)∈L∏​Tri(a,v)Pr​(V<t)≤(a,v)∈M∏​Tri(a,v)Pr​(V<t).

This algebraic preprocessing supplies the strict cap ordering and cap lower bound required for a canonical instance, while preserving the differentiated-revenue lower bound and every uniform-revenue upper bound.

Preamble
import Definitions.Def_MinBuying_Triangular

Formal statement
namespace MinBuying

/-- Remove the caps at most one and merge adjacent equal-cap triangular
items without increasing uniform revenue or decreasing a cap continuation above one. -/
theorem triangular_list_pruning (L : List (ℝ × ℝ))
    (hpar : ∀ x ∈ L, 0 < x.1 ∧ 0 < x.2)
    (hdec : L.Pairwise (fun x y => y.2 ≤ x.2))
    (hfinal : 1 < L.foldl (fun S x => continuationStep x.1 x.2 S) 0) :
    ∃ M : List (ℝ × ℝ), M.length ≤ L.length ∧
      (∀ x ∈ M, 0 < x.1 ∧ 1 < x.2) ∧
      M.Pairwise (fun x y => y.2 < x.2) ∧
      L.foldl (fun S x => continuationStep x.1 x.2 S) 0 ≤
        M.foldl (fun S x => continuationStep x.1 x.2 S) 0 ∧
      (∀ t : ℝ, 0 < t →
        (L.map (fun x => triangularReject x.1 x.2 t)).prod ≤
          (M.map (fun x => triangularReject x.1 x.2 t)).prod) := 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. Supporting ordered-list preprocessing.

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