Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positive scaling of triangular min-buying revenues

Proved
MinBuying.triangular_revenue_homogeneity

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

min-buyingpricingprobability

Let III be a finite independent triangular-valuation instance with parameters ai>0a_i>0ai​>0 and caps vi>0v_i>0vi​>0. Assume its differentiated and uniform revenue optima are finite and attained, with positive uniform optimum. For every scale s>0s>0s>0, there is an instance JJJ with the same number of items and parameters sais a_isai​ and svis v_isvi​ such that the same optimization conditions hold and

RDP(J)=sRDP(I),RUP(J)=sRUP(I).R_{\mathrm{DP}}(J)=sR_{\mathrm{DP}}(I),\qquad R_{\mathrm{UP}}(J)=sR_{\mathrm{UP}}(I).RDP​(J)=sRDP​(I),RUP​(J)=sRUP​(I).

This formalizes the positive rescaling used to normalize uniform revenue to one in the proof of Theorem 4. It preserves the pricing ratio and does not add moment assumptions.

Preamble
import Definitions.Def_MinBuying_Triangular

Formal statement
namespace MinBuying

/-- Positive scaling of triangular valuation parameters scales both pricing
optima by the same factor. This is the normalization used on pp.22--23. -/
theorem triangular_revenue_homogeneity (n : ℕ) (I : TriangularInstance n)
    (hI : WellPosed (triangularJoint I)) (s : ℝ) (hs : 0 < s) :
    ∃ J : TriangularInstance n,
      (∀ i, J.a i = s * I.a i) ∧
      (∀ i, J.cap i = s * I.cap i) ∧
      WellPosed (triangularJoint J) ∧
      DPRevenue (triangularJoint J) = s * DPRevenue (triangularJoint I) ∧
      UPRevenue (triangularJoint J) = s * UPRevenue (triangularJoint I) := 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, p.23, proof of Theorem 4 (rescaling step); Eq.(11) for the triangular laws. Supporting normalization lemma.

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