Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 — Step 4(a) revenue; equation (30)

Disproved
CloseGaps.DPA.lemma_5

by Shuze Chen · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

dpap2o-gran-per-chapterp2o-plan-paperp2o-v1

Lemma 5. E[p̃ min(Ŷ^u, (nx − ∑{i,j} Y{ij}^u)^+) I(B_{N^u+1})] ≥ n(1 − t_{N^u}^u)p^D λ(p^D) · P(B_{N^u+1}) − Cnτ_1^u log n. (30)

Differences from the source:

  • encoding: Continuous-time controlled Poisson sales with an off action. → A measurable price rule on sale histories, exponential interarrivals and Option-valued actions.; reason: The off action has zero intensity and revenue; the history rule cannot access the unknown demand.
  • reading: The size parameter n is written without an integrality restriction. → n is real.; reason: This retains the displayed domain, including every integer size.
  • encoding: The DPA objects are constructed by the displayed algorithm. → Partial stage construction and successful construction in the conclusion.; reason: Definedness is asserted in the conclusion at the source sizes: every printed real grid count must be an exact positive integer, each stage duration positive, and each stopping minimum attained; no rounding or restriction to executable sizes is introduced.
  • reading: Stage counts appear as fixed summation limits and deterministic factors outside expectations in section 5, although the interval widths are random. → A common pair of deterministic counts satisfies the actual stopping tests almost surely on the constructed virtual traces.; reason: This is the literal fixed-count reading of the printed formulas; nominal-width equalities are not assumed, and successful construction is asserted in the conclusion.
  • encoding: Grid prices have indices j=1,...,κ_i. → Grid indices are j=0,...,k-1, with price lo+j(hi-lo)/k.; reason: The same left endpoints are enumerated; only the index origin changes.
  • reading: The empirical argmax and argmin do not specify a tie rule. → Choose the least grid index attaining each finite optimum.; reason: This fixes an observable deterministic selection from the source argmax or argmin, without demand information.
  • reading: The base-instance estimator is count/Δ and its inventory target is x/T. → For the size-n normalized instance, estimate base demand by count/(nΔ) and compare with x.; reason: Instantiating the pseudocode with inventory nx and dividing its rate estimate and target by n gives this rule; normalized time has horizon one.
Preamble
import Definitions.Def_CloseGaps_DPA_RevenueEvents

open MeasureTheory Set

open scoped Classical
Formal statement
namespace CloseGaps.DPA

theorem lemma_5 (c : Coefficients) (hc : c.Positive) (x : ℝ) (hx : 0 < x) :
    ∃ C : ℝ, 0 < C ∧
    ∀ a : Market, a.Valid → a.hi - a.lo = 1 →
    ∃ π : ℝ → PriceRule, ∀ n : ℝ, 3 ≤ n →
    ∀ lam : ℝ → ℝ, InClass c a x 1 lam →
    ∃ N : StageCounts, Experiment a lam n x (π n) N ∧
      n * (1 - timeU n N.Nu) * dOpt a x 1 lam * lam (dOpt a x 1 lam) *
        probability (B a lam n x N (N.Nu + 1)) - C * n * tauU n 1 * Real.log n ≤
          ∫ E, revenue5 a lam n x N E ∂clockLaw := by sorry

end CloseGaps.DPA
Source
Wang, Deng, and Ye (2014), Operations Research 62(2), 318–331, DOI 10.1287/opre.2013.1245, Lemma 5, p. 325 (PDF 8)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Statement. For all coefficients ccc with M,K,mL,mU>0M,K,m_L,m_U>0M,K,mL​,mU​>0, and every x>0x>0x>0, there is a constant C>0C>0C>0 such that:

for every market aaa with alo<ahia_{\mathrm{lo}}<a_{\mathrm{hi}}alo​<ahi​ and ahi−alo=1a_{\mathrm{hi}}-a_{\mathrm{lo}}=1ahi​−alo​=1, there is a family of price rules (πn)(\pi_n)(πn​), chosen before nnn and λ\lambdaλ, such that for every real n≥3n\ge3n≥3 and every λ\lambdaλ with InClass(c,a,x,1,λ)(c,a,x,1,\lambda)(c,a,x,1,λ), there exist N=(Nu,Nc)N=(N_u,N_c)N=(Nu​,Nc​) with Experiment(a,λ,n,x,πn,N)(a,\lambda,n,x,\pi_n,N)(a,λ,n,x,πn​,N) and

n (1−TNuU(n)) d λ(d)  P(BNu+1)  −  C n τ1U(n)ln⁡n  ≤  ∫R5 dP.n\,\big(1-T^U_{N_u}(n)\big)\,d\,\lambda(d)\;\mathbb{P}(B_{N_u+1})\;-\;C\,n\,\tau^U_1(n)\ln n\;\le\;\int R_5\,d\mathbb{P}.n(1−TNu​U​(n))dλ(d)P(BNu​+1​)−Cnτ1U​(n)lnn≤∫R5​dP.

Terms.

  • d=d∗=max⁡(u∗,c∗)d=d^*=\max(u^*,c^*)d=d∗=max(u∗,c∗), where:
    • u∗u^*u∗ is the supremum of the maximizers of pλ(p)p\lambda(p)pλ(p) on I=[alo,ahi]I=[a_{\mathrm{lo}},a_{\mathrm{hi}}]I=[alo​,ahi​];
    • c∗c^*c∗ is the supremum of the minimizers of ∣λ(p)−x∣|\lambda(p)-x|∣λ(p)−x∣;
    • each is 000 if empty.
  • TNuU(n)=∑i=1NuτiU(n)T^U_{N_u}(n)=\sum_{i=1}^{N_u}\tau^U_i(n)TNu​U​(n)=∑i=1Nu​​τiU​(n), where:
    • τ1U(n)=n−1/2(ln⁡n)7/2\tau^U_1(n)=n^{-1/2}(\ln n)^{7/2}τ1U​(n)=n−1/2(lnn)7/2;
    • τiU(n)=n−12(3/5)i−1(ln⁡n)5\tau^U_i(n)=n^{-\frac12(3/5)^{i-1}}(\ln n)^5τiU​(n)=n−21​(3/5)i−1(lnn)5 for i≥2i\ge2i≥2.
  • BNu+1={ℓ=Nu+1}B_{N_u+1}=\{\ell=N_u+1\}BNu​+1​={ℓ=Nu​+1} is the event that no u-stage 1..Nu1..N_u1..Nu​ switches. A u-stage switches when its c-selected grid point exceeds its u-selected point by more than 2ln⁡n2\sqrt{\ln n}2lnn​ gaps.

R5R_5R5​.

R5=p~⋅min⁡ ⁣(FU, max⁡(nx−ΣU,0))⋅1BNu+1,R_5=\tilde p\cdot\min\!\big(F^U,\ \max(nx-\Sigma^U,0)\big)\cdot\mathbf 1_{B_{N_u+1}},R5​=p~​⋅min(FU, max(nx−ΣU,0))⋅1BNu​+1​​,

where:

  • p~=m+2ln⁡n g\tilde p=m+2\sqrt{\ln n}\,gp~​=m+2lnn​g for u-stage NuN_uNu​, with mmm the larger of its two selected grid points and ggg its gap;
  • FU=NE(v+nλ(p~)(1−TNuU))−˙NE(v)F^U=N_E\big(v+n\lambda(\tilde p)(1-T^U_{N_u})\big)\dot-N_E(v)FU=NE​(v+nλ(p~​)(1−TNu​U​))−˙​NE​(v) is the truncated increment of the imported counting process NEN_ENE​, starting at that stage's end clock vvv;
  • ΣU\Sigma^UΣU is the total of all counts of u-stages 1..Nu1..N_u1..Nu​.

Missing stages contribute zeros.

Stages. A stage exists only if all hold:

  • its size is exactly a positive integer;
  • its duration is positive;
  • its interval is ordered;
  • λ≥0\lambda\ge0λ≥0 on its grid.

Counts are truncated increments of NEN_ENE​ along clock times advancing by nλ(pj)τ/kn\lambda(p_j)\tau/knλ(pj​)τ/k. The u-stages and c-branches shrink around the selected points.

Experiment requires all of:

  1. At horizon 111, both of:
    • almost surely, the complete trace holds;
    • almost surely, while πn\pi_nπn​'s sales process has fewer than ⌊nx⌋+\lfloor nx\rfloor_+⌊nx⌋+​ sales strictly before t∈[0,1)t\in[0,1)t∈[0,1), its posted price is a real price given by the stage schedule (experimental grid point or final posting). The sales process uses thresholds EjE_jEj​ against the rate integrated since the last sale, capped at ⌊nx⌋+\lfloor nx\rfloor_+⌊nx⌋+​.
  2. Almost surely, all of:
    • Nu≥1N_u\ge1Nu​≥1 and Nc≥1N_c\ge1Nc​≥1 are exactly the first u- and c-stopping indices, with all intermediate stages existing on every branch;
    • 1−TNuU≥01-T^U_{N_u}\ge01−TNu​U​≥0;
    • 1−TlU−TNcC≥01-T^U_l-T^C_{N_c}\ge01−TlU​−TNc​C​≥0 for l∈[1,Nu]l\in[1,N_u]l∈[1,Nu​];
    • λ(p~)≥0\lambda(\tilde p)\ge0λ(p~​)≥0 on BNu+1B_{N_u+1}BNu​+1​.
  3. A0A_0A0​, A1A_1A1​, A2A_2A2​ and the BiB_iBi​ are measurable.
  4. R4R_4R4​, R5R_5R5​, R6R_6R6​ and R7,lR_{7,l}R7,l​ are integrable.

InClass is as in the model:

  • λ\lambdaλ strictly decreasing on III, with 0≤λ≤M0\le\lambda\le M0≤λ≤M;
  • λ\lambdaλ and pλ(p)p\lambda(p)pλ(p) are KKK-Lipschitz;
  • an inverse-on-III function γ\gammaγ, KKK-Lipschitz on λ(I)\lambda(I)λ(I), with zγ(z)z\gamma(z)zγ(z) having second derivative in [−mL,−mU][-m_L,-m_U][−mL​,−mU​] on λ(I)\lambda(I)λ(I);
  • d∈(alo,ahi)d\in(a_{\mathrm{lo}},a_{\mathrm{hi}})d∈(alo​,ahi​).

Degenerate cases.

  • If mL<mUm_L<m_UmL​<mU​, the inner statement is vacuous.
  • Experiment, for every n≥3n\ge3n≥3, requires the needed stage sizes n110(3/5)i−1ln⁡nn^{\frac1{10}(3/5)^{i-1}}\ln nn101​(3/5)i−1lnn and n16(2/3)i−1ln⁡nn^{\frac16(2/3)^{i-1}}\ln nn61​(2/3)i−1lnn to be exact positive integers. For example, at n=3n=3n=3, 31/10ln⁡3≈1.2263^{1/10}\ln3\approx1.22631/10ln3≈1.226 must be an integer.
  • If P(BNu+1)=0\mathbb{P}(B_{N_u+1})=0P(BNu​+1​)=0, the left side is −Cnτ1Uln⁡n-Cn\tau^U_1\ln n−Cnτ1U​lnn.
Human review
  • Endorsed by Community (Bot) · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 29, 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