Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma EC.2, p. ec3 — strongest bound by regime: sign patterns and unique roots at δL and δM

Proved
ValuePersPricing.Deviation.lemma_EC_2

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

lambert-wp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1personalized-pricing

Let S>1S>1S>1 and let δL,δM,δH\delta_L,\delta_M,\delta_HδL​,δM​,δH​ be the thresholds at M=1M=1M=1:

δL=log⁡S−W−1(−1/(eS)),δM=log⁡S1+log⁡S,δH=S−1S.\delta_L=\frac{\log S}{-W_{-1}(-1/(eS))},\qquad \delta_M=\frac{\log S}{1+\log S},\qquad \delta_H=\frac{S-1}{S}.δL​=−W−1​(−1/(eS))logS​,δM​=1+logSlogS​,δH​=SS−1​.
  1. The function
f(D)=−W−1(−1−De)1−D−log⁡SDf(D)=\frac{-W_{-1}\big(-\frac{1-D}{e}\big)}{1-D}-\frac{\log S}{D}f(D)=1−D−W−1​(−e1−D​)​−DlogS​

is negative for D∈(0,δL)D\in(0,\delta_L)D∈(0,δL​), positive for D∈(δL,δH]D\in(\delta_L,\delta_H]D∈(δL​,δH​], and δL\delta_LδL​ is its unique root in (0,δH](0,\delta_H](0,δH​]. 2. The function

g(D)=log⁡SD+W−1(−1eS(1−D))g(D)=\frac{\log S}{D}+W_{-1}\Big(\frac{-1}{eS(1-D)}\Big)g(D)=DlogS​+W−1​(eS(1−D)−1​)

vanishes at D=δMD=\delta_MD=δM​, is non-negative for all D∈(0,δH]D\in(0,\delta_H]D∈(0,δH​], and δM\delta_MδM​ is its unique root in (0,δH](0,\delta_H](0,δH​].

Consequently, in the standardized case, the low bound (EC.5) is the strongest on [0,δL][0,\delta_L][0,δL​], the medium bound (EC.6) on (δL,δM](\delta_L,\delta_M](δL​,δM​], and the high bound (EC.7) on (δM,δH](\delta_M,\delta_H](δM​,δH​].

Differences from the source:

  • encoding: (b) "non-negative for all D ∈ [0, δH]" → for D ∈ (0, δH]; reason: log(S)/D is undefined at D = 0.
  • encoding: no hypothesis on S → 1 < S; reason: the lemma sits inside the proof of Theorem 2, whose standing hypothesis is S > 1; for S = 1 all thresholds are 0 and log S = 0.
Preamble
import Mathlib
import Definitions.Def_ValuePersPricing_Deviation_Model

open MeasureTheory Set Filter Topology
Formal statement
namespace ValuePersPricing.Deviation

/-- Lemma EC.2 (p. ec3), for `S > 1` with `δ_L, δ_M, δ_H` at `M = 1`:
(a) `f(D) = −W₋₁(−(1 − D)/e)/(1 − D) − log(S)/D` is negative on `(0, δ_L)`, positive on
`(δ_L, δ_H]`, and `δ_L` is its unique root in `(0, δ_H]`;
(b) `g(D) = log(S)/D + W₋₁(−1/(e S (1 − D)))` vanishes at `δ_M`, is non-negative on `(0, δ_H]`,
and `δ_M` is its unique root there. -/
theorem lemma_EC_2 (S : ℝ) (hS : 1 < S) :
    ((∀ D ∈ Ioo 0 (deltaL 1 S),
        -lambertWm1 (-(1 - D) / Real.exp 1) / (1 - D) - Real.log S / D < 0) ∧
      (∀ D ∈ Ioc (deltaL 1 S) (deltaH 1 S),
        0 < -lambertWm1 (-(1 - D) / Real.exp 1) / (1 - D) - Real.log S / D) ∧
      -lambertWm1 (-(1 - deltaL 1 S) / Real.exp 1) / (1 - deltaL 1 S)
          - Real.log S / deltaL 1 S = 0 ∧
      (∀ D ∈ Ioc 0 (deltaH 1 S),
        -lambertWm1 (-(1 - D) / Real.exp 1) / (1 - D) - Real.log S / D = 0 →
          D = deltaL 1 S)) ∧
    (Real.log S / deltaM 1 S
          + lambertWm1 (-1 / (Real.exp 1 * S * (1 - deltaM 1 S))) = 0 ∧
      (∀ D ∈ Ioc 0 (deltaH 1 S),
        0 ≤ Real.log S / D + lambertWm1 (-1 / (Real.exp 1 * S * (1 - D)))) ∧
      (∀ D ∈ Ioc 0 (deltaH 1 S),
        Real.log S / D + lambertWm1 (-1 / (Real.exp 1 * S * (1 - D))) = 0 →
          D = deltaM 1 S)) := by sorry

end ValuePersPricing.Deviation
Source
Elmachtoub, Gupta & Hamilton, The Value of Personalized Pricing, SSRN 3127719 (review version, PDF sha256 635e22eb…), p. ec3 (PDF 35), Lemma EC.2; proof pp. ec6–ec7 (PDF 38–39)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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