Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2: reduction to a canonical instance

Proved
MinBuying.lemma2_canonical_reduction

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

min-buyingoperations-researchpricingprobability

For an independent triangular instance of n≥1n\ge1n≥1 products normalized to optimal uniform revenue one, and every ε>0\varepsilon>0ε>0, there exists a canonical instance with N≤nN\le nN≤n additional items plus one terminal item. Its designated cap-pricing revenue is at least the original optimal differentiated revenue minus ε\varepsilonε, and its optimal uniform revenue is at most one.

Preamble
import Definitions.Def_MinBuying_Triangular

Formal statement
namespace MinBuying

/-- Lemma 2, PDF p.20: normalized triangular instances admit canonical
cap-pricing approximations, with at most `n` nonterminal items. -/
theorem lemma2_canonical_reduction (n : ℕ) (hn : 0 < n)
    (I : TriangularInstance n) (hNorm : UPRevenue (triangularJoint I) = 1)
    (ε : ℝ) (hε : 0 < ε) :
    ∃ J : CanonicalInstance, J.count ≤ n ∧
      DPRevenue (triangularJoint I) - ε ≤
        Revenue (canonicalLaw J) (canonicalPrices J) ∧
      UPRevenue (canonicalLaw J) ≤ 1 := by
  sorry

end MinBuying
Source
Titing Cui, Michael L. Hamilton, Jourdain Lamperski, and Kasra Ganjizadeh Tari, Unit-Demand Pricing for Min-Buying Customers, September 27, 2026 manuscript, 47 PDF pages (main pp.1–27; companion ec1–ec20). https://doi.org/10.2139/ssrn.5178133 . p.20, Lemma 2; PDF pp.35–38/ec8–ec11.
Read-back

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

For real a,ca,ca,c, let La,cL_{a,c}La,c​ be the image of Lebesgue measure restricted to (0,1)(0,1)(0,1) under u↦min⁡{c,au/(1−u)}u\mapsto\min\{c,au/(1-u)\}u↦min{c,au/(1−u)}. For a measure λ\lambdaλ on a finite real coordinate space and a price vector ppp, let Mp(x)M_p(x)Mp​(x) be the minimum of the numbers pip_ipi​ over those indices satisfying pi≤xip_i\le x_ipi​≤xi​, with Mp(x)=0M_p(x)=0Mp​(x)=0 when there is no such index, and put Rλ(p)=∫Mp(x) dλ(x)R_\lambda(p)=\int M_p(x)\,d\lambda(x)Rλ​(p)=∫Mp​(x)dλ(x). Write Dλ=sup⁡{Rλ(p):pi≥0 for every i}D_\lambda=\sup\{R_\lambda(p):p_i\ge0\text{ for every }i\}Dλ​=sup{Rλ​(p):pi​≥0 for every i} and Uλ=sup⁡{Rλ(r1):r≥0}U_\lambda=\sup\{R_\lambda(r\mathbf1):r\ge0\}Uλ​=sup{Rλ​(r1):r≥0}, where the suprema are taken in R\mathbb RR and r1r\mathbf1r1 is the constant price vector. For every integer n>0n>0n>0 and positive real arrays (ai,ci)i<n(a_i,c_i)_{i<n}(ai​,ci​)i<n​, let μ=⨂i<nLai,ci\mu=\bigotimes_{i<n}L_{a_i,c_i}μ=⨂i<n​Lai​,ci​​ and assume Uμ=1U_\mu=1Uμ​=1. Then, for every real ε>0\varepsilon>0ε>0, there exist a count m∈Nm\in\mathbb Nm∈N with m≤nm\le nm≤n, a terminal cap T>1T>1T>1, and arrays bj>0b_j>0bj​>0 and 1<dj<T1<d_j<T1<dj​<T for j<mj<mj<m, strictly decreasing in their caps in the sense that dj<did_j<d_idj​<di​ whenever i<ji<ji<j, such that, with ν=L1,T⊗⨂j<mLbj,dj\nu=L_{1,T}\otimes\bigotimes_{j<m}L_{b_j,d_j}ν=L1,T​⊗⨂j<m​Lbj​,dj​​ and p∗=(T,d0,…,dm−1)p^*=(T,d_0,\ldots,d_{m-1})p∗=(T,d0​,…,dm−1​), one has Dμ−ε≤Rν(p∗)D_\mu-\varepsilon\le R_\nu(p^*)Dμ​−ε≤Rν​(p∗) and Uν≤1U_\nu\le1Uν​≤1. The output count mmm counts the nonterminal coordinates, so the output law has m+1≤n+1m+1\le n+1m+1≤n+1 coordinates, and m=0m=0m=0 is permitted. There is no ordering hypothesis on the input caps. The output parameters may depend on ε\varepsilonε, the approximation inequality is weak, and the output uniform supremum is required only to be at most 111.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikeh · Oct 31, 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