Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (11)–(12): triangular law and cap atom

Proved
MinBuying.triangular_law_specification

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

min-buyingoperations-researchpricingprobability

For positive a,va,va,v, the explicitly constructed triangular law is a nonnegative probability law and is regular. Its strict rejection probabilities, right CDF, and cap atom agree with the source formulas; in particular Pr⁡(V<v)=v/(v+a)\Pr(V<v)=v/(v+a)Pr(V<v)=v/(v+a) whereas Pr⁡(V≤v)=1\Pr(V\le v)=1Pr(V≤v)=1, and Pr⁡(V=v)=a/(a+v)\Pr(V=v)=a/(a+v)Pr(V=v)=a/(a+v).

Preamble
import Definitions.Def_MinBuying_Triangular
import Definitions.Def_MinBuying_Regularity

open MeasureTheory Set

Formal statement
namespace MinBuying

/-- Distributional content of equations (11)--(12), including the cap atom.
This is a supporting obligation for the explicit pushforward definition. -/
theorem triangular_law_specification (a v : ℝ) (ha : 0 < a) (hv : 0 < v) :
    ValidMarginal (triangularLaw a v) ∧
    Regular (triangularLaw a v) ∧
    (∀ p : ℝ, rejection (triangularLaw a v) p = triangularReject a v p) ∧
    (∀ p : ℝ, cdf (triangularLaw a v) p = triangularCDF a v p) ∧
    ((triangularLaw a v) {v}).toReal = a / (a + v) ∧
    (∀ᵐ x ∂triangularLaw a v, x ∈ Icc (0 : ℝ) v) := 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, Eqs.(11)–(12).
Read-back

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

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)}. For every pair a,ca,ca,c satisfying a>0a>0a>0 and c>0c>0c>0, the following assertions all hold for F=La,cF=L_{a,c}F=La,c​. First, FFF is a probability measure and its argument is nonnegative FFF-almost surely. Second, with QF(u)=inf⁡{x∈R:0≤x, u≤F((−∞,x])}Q_F(u)=\inf\{x\in\mathbb R:0\le x,\ u\le F((-\infty,x])\}QF​(u)=inf{x∈R:0≤x, u≤F((−∞,x])}, the function q↦qQF(1−q)q\mapsto qQ_F(1-q)q↦qQF​(1−q) is concave on the open interval (0,1)(0,1)(0,1). Third, for every real ppp, the strict-rejection mass is F((−∞,p))=0F((-\infty,p))=0F((−∞,p))=0 when p≤0p\le0p≤0, is p/(p+a)p/(p+a)p/(p+a) when 0<p≤c0<p\le c0<p≤c, and is 111 when p>cp>cp>c. Fourth, for every real ppp, the closed cumulative mass is F((−∞,p])=0F((-\infty,p])=0F((−∞,p])=0 when p<0p<0p<0, is p/(p+a)p/(p+a)p/(p+a) when 0≤p<c0\le p<c0≤p<c, and is 111 when p≥cp\ge cp≥c. Fifth, F({c})=a/(a+c)F(\{c\})=a/(a+c)F({c})=a/(a+c). Sixth, 0≤x≤c0\le x\le c0≤x≤c holds FFF-almost surely. All displayed masses are their finite real values. The formulas distinguish the strict and closed events at the cap p=cp=cp=c; the concavity assertion is restricted to 0<q<10<q<10<q<1, without endpoint conditions.

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