Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 proof: continuous evolution dominates one discrete step

Proved
MinBuying.continuous_dominates_step

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

min-buyingoperations-researchpricingprobability

For 0≤y≤x<10\le y\le x<10≤y≤x<1 and initial continuation z≥1z\ge1z≥1, let a=exp⁡(A(x)−A(y))−1a=\exp(A(x)-A(y))-1a=exp(A(x)−A(y))−1. Then (a+z)/(1+xa)(a+z)/(1+xa)(a+z)/(1+xa) is at most the value at xxx of the continuous benchmark flow initialized at zzz at yyy.

Preamble
import Definitions.Def_MinBuying_Analytic

open Set

Formal statement
namespace MinBuying

theorem continuous_dominates_step (y z x : ℝ)
    (hy : 0 ≤ y) (hyx : y ≤ x) (hx : x < 1) (hz : 1 ≤ z) :
    let a := Real.exp (canonicalBudget x - canonicalBudget y) - 1
    (a + z) / (1 + x * a) ≤ benchmarkFlow y z x := 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 . PDF pp.40–41/ec13–ec14, proof of Lemma 3.
Read-back

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

Define total real functions BBB and SSS by B(0)=0B(0)=0B(0)=0, B(t)=−log⁡(1−t2)/tB(t)=-\log(1-t^2)/tB(t)=−log(1−t2)/t for t≠0t\ne0t=0, S(0)=1S(0)=1S(0)=1, and S(t)=2/(1−t2)+log⁡(1−t2)/t2S(t)=2/(1-t^2)+\log(1-t^2)/t^2S(t)=2/(1−t2)+log(1−t2)/t2 for t≠0t\ne0t=0, and put E(t)=∫0tuS(u) duE(t)=\int_0^t uS(u)\,duE(t)=∫0t​uS(u)du. Here the integrals are oriented Lebesgue interval integrals, defined to be zero when their real-valued integrands are not integrable; division by zero is zero, and the total real logarithm has log⁡0=0\log0=0log0=0 and log⁡t=log⁡∣t∣\log t=\log|t|logt=log∣t∣ at negative ttt. For every ordered triple of real numbers (y,z,x)(y,z,x)(y,z,x) satisfying 0≤y0\le y0≤y, y≤xy\le xy≤x, x<1x<1x<1, and z≥1z\ge1z≥1, set a=eB(x)−B(y)−1a=e^{B(x)-B(y)}-1a=eB(x)−B(y)−1. The assertion is the inequality

a+z1+xa ≤ e−(E(x)−E(y))(z+∫yxS(t)eE(t)−E(y) dt).\frac{a+z}{1+xa}\ \le\ e^{-(E(x)-E(y))}\left(z+\int_y^x S(t)e^{E(t)-E(y)}\,dt\right).1+xaa+z​ ≤ e−(E(x)−E(y))(z+∫yx​S(t)eE(t)−E(y)dt).

The quantifiers include y=0y=0y=0, z=1z=1z=1, and the coincident-endpoint case y=xy=xy=x; in that last case a=0a=0a=0 and both displayed sides equal zzz. There is no upper restriction on zzz, and the endpoint x=1x=1x=1 is excluded.

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