Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (13)–(14): canonical formulas equal market revenues

Proved
MinBuying.canonical_revenue_bridge

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

min-buyingoperations-researchpricingprobability

For every canonical parameter system, its actual joint product law is a valid min-buying market with well-posed pricing optima. The designated cap vector is feasible, its expected revenue equals the scalar continuation recursion, and each common-price expected revenue equals the explicit product formula. This identifies the algebraic benchmark with genuine pricing revenues.

Preamble
import Definitions.Def_MinBuying_Triangular

Formal statement
namespace MinBuying

/-- The scalar canonical formulas are the actual min-buying revenues of the
concrete independent product law, with finite attained positive optima. -/
theorem canonical_revenue_bridge (I : CanonicalInstance) :
    ValidLaw (canonicalLaw I) ∧
    WellPosed (canonicalLaw I) ∧
    Revenue (canonicalLaw I) (canonicalPrices I) = canonicalCapRevenue I ∧
    (∀ p : ℝ, 0 ≤ p →
      uniformRevenue (canonicalLaw I) p = canonicalUniformRevenueAt I p) := 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.19–22, Eqs.(13)–(14).
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 satisfying 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​​, with the terminal marginal first, and put 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. 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. Define C0=T/(T+1)C_0=T/(T+1)C0​=T/(T+1) 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 j<mj<mj<m. Also define ρa,c(r)=0\rho_{a,c}(r)=0ρa,c​(r)=0 if r≤0r\le0r≤0, ρa,c(r)=r/(r+a)\rho_{a,c}(r)=r/(r+a)ρa,c​(r)=r/(r+a) if 0<r≤c0<r\le c0<r≤c, and ρa,c(r)=1\rho_{a,c}(r)=1ρa,c​(r)=1 if r>0r>0r>0 and r>cr>cr>c. Then the conjunction of the following statements holds: μ\muμ is a probability measure concentrated on vectors whose coordinates are all nonnegative; W(μ)W(\mu)W(μ) holds; Rμ(p∗)=CmR_\mu(p^*)=C_mRμ​(p∗)=Cm​; and, for every real r≥0r\ge0r≥0, Rμ(r1)=r(1−ρ1,T(r)∏j<mρaj,cj(r))R_\mu(r\mathbf1)=r\bigl(1-\rho_{1,T}(r)\prod_{j<m}\rho_{a_j,c_j}(r)\bigr)Rμ​(r1)=r(1−ρ1,T​(r)∏j<m​ρaj​,cj​​(r)). At m=0m=0m=0 the law has only the terminal coordinate, Cm=T/(T+1)C_m=T/(T+1)Cm​=T/(T+1), and the product over jjj is 111. The last identity includes r=0r=0r=0 and cap prices themselves; it is asserted only for nonnegative rrr.

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