Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (1)–(2): independent min-buying revenues

Proved
MinBuying.independent_revenue_formula

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

min-buyingoperations-researchpricingprobability

For independent nonnegative valuation laws and a feasible price vector sorted in ascending order, expected min-buying revenue equals ∑ipi(1−Fi<(pi))∏j<iFj<(pj)\sum_i p_i(1-F_i^<(p_i))\prod_{j<i}F_j^<(p_j)∑i​pi​(1−Fi<​(pi​))∏j<i​Fj<​(pj​), where Fi<(t)=Pr⁡(Vi<t)F_i^<(t)=\Pr(V_i<t)Fi<​(t)=Pr(Vi​<t). Every nonnegative common price qqq earns q(1−∏iFi<(q))q(1-\prod_iF_i^<(q))q(1−∏i​Fi<​(q)). Strict rejection makes these identities valid at atoms.

Preamble
import Definitions.Def_MinBuying_Model

open MeasureTheory
open scoped BigOperators

Formal statement
namespace MinBuying

/-- Equations (1)--(2), written with strict rejection so they also cover
cap atoms. The formula for differentiated prices uses ascending price order. -/
theorem independent_revenue_formula (n : ℕ) (hn : 0 < n)
    (F : Fin n → Measure ℝ) (hF : ∀ i, ValidMarginal (F i))
    (p : Prices n) (hp : FeasiblePrices p) (hsorted : Monotone p) :
    Revenue (productLaw F) p = independentRevenueFormula F p ∧
    (∀ q : ℝ, 0 ≤ q →
      uniformRevenue (productLaw F) q = q * (1 - ∏ i : Fin n, rejection (F i) q)) := 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 . pp.8–9, Eqs.(1)–(2).
Read-back

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

For every natural number nnn satisfying n>0n>0n>0, every family (Fi)i∈In(F_i)_{i\in I_n}(Fi​)i∈In​​ of measures on R\mathbb RR with In={0,…,n−1}I_n=\{0,\ldots,n-1\}In​={0,…,n−1} such that each FiF_iFi​ has total mass one and is concentrated almost everywhere on [0,∞)[0,\infty)[0,∞), and every real price vector (pi)i∈In(p_i)_{i\in I_n}(pi​)i∈In​​ satisfying pi≥0p_i\ge0pi​≥0 for every iii and pi≤pjp_i\le p_jpi​≤pj​ whenever i≤ji\le ji≤j, let μ=⨂i∈InFi\mu=\bigotimes_{i\in I_n}F_iμ=⨂i∈In​​Fi​ be the finite product measure. For any real vector bbb, define mb(v)=min⁡{bi:i∈In, bi≤vi}m_b(v)=\min\{b_i:i\in I_n,\ b_i\le v_i\}mb​(v)=min{bi​:i∈In​, bi​≤vi​} when the set of affordable indices is nonempty and define mb(v)=0m_b(v)=0mb​(v)=0 otherwise, and define Rμ(b)=∫mb(v) dμ(v)R_\mu(b)=\int m_b(v)\,d\mu(v)Rμ​(b)=∫mb​(v)dμ(v), the real-valued Bochner integral, whose general definition assigns zero to a nonintegrable integrand. Let ri(t)=toReal⁡(Fi((−∞,t)))r_i(t)=\operatorname{toReal}(F_i(({-\infty},t)))ri​(t)=toReal(Fi​((−∞,t))), where conversion to a real preserves a finite nonnegative value and sends +∞+\infty+∞ to zero; the present probability assumptions ensure the finite case. The assertion is the conjunction

Rμ(p)=∑i∈Inpi(1−ri(pi))∏j∈In, j<irj(pj),∀q∈R,q≥0 ⟹ Rμ((q)i∈In)=q(1−∏i∈Inri(q)).R_\mu(p)=\sum_{i\in I_n}p_i\bigl(1-r_i(p_i)\bigr)\prod_{j\in I_n,\,j<i}r_j(p_j),\qquad \forall q\in\mathbb R,\quad q\ge0\ \Longrightarrow\ R_\mu((q)_{i\in I_n})=q\left(1-\prod_{i\in I_n}r_i(q)\right).Rμ​(p)=i∈In​∑​pi​(1−ri​(pi​))j∈In​,j<i∏​rj​(pj​),∀q∈R,q≥0 ⟹ Rμ​((q)i∈In​​)=q(1−i∈In​∏​ri​(q)).

The product over the indices preceding i=0i=0i=0 is the empty product and equals one. The outer assumptions on ppp apply to this whole conjunction, including its universally quantified uniform-price clause. Nondecreasing prices may have ties and may be zero; equality vi=piv_i=p_ivi​=pi​ is an affordable event, while rejection is the strict event vi<piv_i<p_ivi​<pi​. No continuity, absolute continuity, regularity, equality of marginals, boundedness of attainable optimal revenues, or attainment of optima is hypothesized. The case n=0n=0n=0 is excluded by the explicit hypothesis.

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