Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma EC.1: rejection probability bound

Proved
MinBuying.lemmaEC1_rejection_bound

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

min-buyingoperations-researchpricingprobability

For a finite independent triangular family with positive parameters and weakly decreasing caps, and a common price t>0t>0t>0 no larger than any cap, let CCC be the continuation revenue from pricing at the caps. Then ∏it/(t+ai)≤t/(t+C)\prod_i t/(t+a_i)\le t/(t+C)∏i​t/(t+ai​)≤t/(t+C). The empty family is included with product one and continuation zero.

Preamble
import Definitions.Def_MinBuying_Triangular

Formal statement
namespace MinBuying

/-- Lemma EC.1, PDF p.45: strict-rejection bound for decreasing-cap
triangular items. Includes the empty-product/zero-continuation base case. -/
theorem lemmaEC1_rejection_bound (n : ℕ) (I : TriangularInstance n)
    (hOrder : Antitone I.cap) (t : ℝ) (ht : 0 < t)
    (hCaps : ∀ i, t ≤ I.cap i) :
    triangularRejectionProduct I t ≤ t / (t + triangularContinuation I n) := 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 . PDF p.45/ec18, Lemma EC.1.
Read-back

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

For every natural number nnn, including n=0n=0n=0, let (ai,ci)i<n(a_i,c_i)_{i<n}(ai​,ci​)i<n​ be arrays of positive real numbers, and assume the cap array is nonincreasing: if i≤ji\le ji≤j then cj≤cic_j\le c_icj​≤ci​. For every real t>0t>0t>0 such that t≤cit\le c_it≤ci​ for every index, define C0=0C_0=0C0​=0 and Cj+1=(aj+Cj)/(1+aj/cj)C_{j+1}=(a_j+C_j)/(1+a_j/c_j)Cj+1​=(aj​+Cj​)/(1+aj​/cj​) for 0≤j<n0\le j<n0≤j<n, in increasing index order. Then ∏i<nt/(t+ai)≤t/(t+Cn)\prod_{i<n}t/(t+a_i)\le t/(t+C_n)∏i<n​t/(t+ai​)≤t/(t+Cn​). This product is the explicitly given rational product over all coordinates, and CnC_nCn​ is the result of processing all nnn coordinates in the stated recurrence. Equal caps and equality t=cit=c_it=ci​ are permitted. At n=0n=0n=0 the positivity and ordering requirements on arrays are vacuous, the product is 111, Cn=0C_n=0Cn​=0, and the conclusion is the equality 1≤11\le11≤1.

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