Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1: reduction to triangular-revenue distributions

Proved
MinBuying.lemma1_triangular_reduction

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

min-buyingoperations-researchpricingprobability

Every positive-size independent continuous regular instance admits a family of at most the original number of independent positive-parameter triangular laws whose optimal differentiated revenue is weakly larger and whose optimal uniform revenue is weakly smaller. No interior acceptance-probability restriction is added.

Preamble
import Definitions.Def_MinBuying_Triangular
import Definitions.Def_MinBuying_Regularity

open MeasureTheory

Formal statement
namespace MinBuying

/-- Lemma 1, PDF p.18: reduce a continuous regular independent instance to
at most the original number of triangular-revenue items. The original
source's finite attained optima are included in `RegularInstance`. -/
theorem lemma1_triangular_reduction (n : ℕ) (F : Fin n → Measure ℝ)
    (hF : RegularInstance F) :
    ∃ m : ℕ, 0 < m ∧ m ≤ n ∧ ∃ I : TriangularInstance m,
      WellPosed (triangularJoint I) ∧
      DPRevenue (productLaw F) ≤ DPRevenue (triangularJoint I) ∧
      UPRevenue (triangularJoint I) ≤ UPRevenue (productLaw F) := 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.18, Lemma 1; PDF pp.34–35/ec7–ec8.
Read-back

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

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. Write W(λ)W(\lambda)W(λ) for the conjunction that both sets defining DλD_\lambdaDλ​ and UλU_\lambdaUλ​ are bounded above, there is a vector ppp with every pi≥0p_i\ge0pi​≥0 and Rλ(p)=DλR_\lambda(p)=D_\lambdaRλ​(p)=Dλ​, there is an r≥0r\ge0r≥0 with Rλ(r1)=UλR_\lambda(r\mathbf1)=U_\lambdaRλ​(r1)=Uλ​, and Uλ>0U_\lambda>0Uλ​>0. For every natural number nnn and family (Fi)i<n(F_i)_{i<n}(Fi​)i<n​ of measures on R\mathbb RR, assume n>0n>0n>0, each FiF_iFi​ is a probability measure concentrated on [0,∞)[0,\infty)[0,∞) and absolutely continuous with respect to Lebesgue measure, each FiF_iFi​ satisfies the following concavity condition, and W(μ)W(\mu)W(μ) holds for μ=⨂i<nFi\mu=\bigotimes_{i<n}F_iμ=⨂i<n​Fi​. For each marginal GGG, the concavity condition means that the function q↦qQG(1−q)q\mapsto qQ_G(1-q)q↦qQG​(1−q) is concave on the open interval (0,1)(0,1)(0,1), where QG(u)=inf⁡{x∈R:0≤x, u≤G((−∞,x])}Q_G(u)=\inf\{x\in\mathbb R:0\le x,\ u\le G((-\infty,x])\}QG​(u)=inf{x∈R:0≤x, u≤G((−∞,x])} is the real infimum; the marginal masses in this formula are finite real numbers. 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)}. Then there exists an integer mmm with 0<m≤n0<m\le n0<m≤n, and there exist arrays (aj,cj)j<m(a_j,c_j)_{j<m}(aj​,cj​)j<m​ with every aj>0a_j>0aj​>0 and cj>0c_j>0cj​>0, such that, for ν=⨂j<mLaj,cj\nu=\bigotimes_{j<m}L_{a_j,c_j}ν=⨂j<m​Laj​,cj​​, one has W(ν)W(\nu)W(ν), Dμ≤DνD_\mu\le D_\nuDμ​≤Dν​, and Uν≤UμU_\nu\le U_\muUν​≤Uμ​. No order condition on the output caps is included. The existence of mmm precedes the existence of its parameter arrays, both may depend on the input family, and the assumptions cannot hold at n=0n=0n=0 because their first requirement is n>0n>0n>0.

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