Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3: canonical cap-pricing upper bound

Proved
MinBuying.lemma3_canonical_bound

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

min-buyingoperations-researchpricingprobability

Every canonical triangular instance whose optimal uniform revenue is at most one earns at most 1/x⋆1/x^\star1/x⋆ when each item is priced at its cap. This statement concerns designated cap-pricing revenue and does not assume cap-pricing is optimal.

Preamble
import Definitions.Def_MinBuying_Triangular

Formal statement
namespace MinBuying

/-- Lemma 3, PDF p.22: the actual canonical cap-pricing revenue is bounded
by the reciprocal of the exact ODE-defined constant. -/
theorem lemma3_canonical_bound (I : CanonicalInstance)
    (hUP : UPRevenue (canonicalLaw I) ≤ 1) :
    Revenue (canonicalLaw I) (canonicalPrices I) ≤ 1 / criticalRatio := 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.22, Lemma 3; PDF pp.38–42/ec11–ec15.
Read-back

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

For every nonnegative integer mmm, terminal cap T>1T>1T>1, and arrays aj>0a_j>0aj​>0 and 1<cj<T1<c_j<T1<cj​<T for j<mj<mj<m with cj<cic_j<c_icj​<ci​ whenever i<ji<ji<j, 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)}. Put μ=L1,T⊗⨂j<mLaj,cj\mu=L_{1,T}\otimes\bigotimes_{j<m}L_{a_j,c_j}μ=L1,T​⊗⨂j<m​Laj​,cj​​ and p∗=(T,c0,…,cm−1)p^*=(T,c_0,\ldots,c_{m-1})p∗=(T,c0​,…,cm−1​). 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. Define, for 0≤t<10\le t<10≤t<1, β(0)=1\beta(0)=1β(0)=1 and β(t)=2/(1−t2)+log⁡(1−t2)/t2\beta(t)=2/(1-t^2)+\log(1-t^2)/t^2β(t)=2/(1−t2)+log(1−t2)/t2 when t>0t>0t>0; define E(x)=∫0xtβ(t) dtE(x)=\int_0^x t\beta(t)\,dtE(x)=∫0x​tβ(t)dt and B(x)=e−E(x)(1+∫0xβ(t)eE(t) dt)B(x)=e^{-E(x)}\bigl(1+\int_0^x\beta(t)e^{E(t)}\,dt\bigr)B(x)=e−E(x)(1+∫0x​β(t)eE(t)dt) for 0≤x<10\le x<10≤x<1, with the integrals taken with respect to Lebesgue measure. The constant in the conclusion is κ=inf⁡{x∈(0,1):xB(x)=1}\kappa=\inf\{x\in(0,1):xB(x)=1\}κ=inf{x∈(0,1):xB(x)=1}, using the real infimum operation. The definition does not assume that this set is nonempty or that its infimum is attained; an empty set has real infimum 000, and the real division convention gives 1/0=01/0=01/0=0. If Uμ≤1U_\mu\le1Uμ​≤1, then Rμ(p∗)≤1/κR_\mu(p^*)\le1/\kappaRμ​(p∗)≤1/κ. The conclusion concerns the revenue of this specified cap-price vector. The count mmm may be zero, in which case μ=L1,T\mu=L_{1,T}μ=L1,T​ and p∗=(T)p^*=(T)p∗=(T); the hypothesis is an upper bound on the uniform supremum and does not require it to equal 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