Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma EC.1, p. ec3 — for c = 0, µ = 1 and D > δM: R_PP/R_SP ≤ −W₋₁(−1/(eS(1 − D)))

Proved
ValuePersPricing.Deviation.lemma_EC_1

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

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

Let V∼FV\sim FV∼F satisfy V≥0V\ge 0V≥0 almost surely, with mean μ=1\mu=1μ=1 and scale SSS, take cost c=0c=0c=0, and let D=E∣V−1∣/2D=\mathbb E|V-1|/2D=E∣V−1∣/2. If D>δM=log⁡S/(1+log⁡S)D>\delta_M=\log S/(1+\log S)D>δM​=logS/(1+logS) (the threshold at M=1M=1M=1), then

RPP≤−W−1(−1eS(1−D)) RSP.(EC.7)\mathcal R_{PP}\le -W_{-1}\Big(\frac{-1}{eS(1-D)}\Big)\,\mathcal R_{SP}.\qquad\text{(EC.7)}RPP​≤−W−1​(eS(1−D)−1​)RSP​.(EC.7)

This is the High Heterogeneity bound of Theorem 2 in the standardized case c=0c=0c=0, μ=1\mu=1μ=1.

Formalization Note Under the hypotheses S>1S>1S>1 and S(1−D)≥1S(1-D)\ge 1S(1−D)≥1 (Lemma 2), so the argument of W−1W_{-1}W−1​ lies in [−1/e,0)[-1/e,0)[−1/e,0).

Differences from the source:

  • encoding: R_PP/R_SP ≤ B → R_PP ≤ B·R_SP; reason: R_SP > 0 under the hypotheses; avoids division junk.
Preamble
import Mathlib
import Definitions.Def_ValuePersPricing_Deviation_Model

open MeasureTheory Set Filter Topology
Formal statement
namespace ValuePersPricing.Deviation

/-- Lemma EC.1 (p. ec3), Eq. (EC.7): for `c = 0`, `µ = 1`, a law of scale `S` and `D > δ_M`,
`R_PP/R_SP ≤ −W₋₁(−1/(e S (1 − D)))`, stated multiplicatively. -/
theorem lemma_EC_1 (ν : Measure ℝ) (S : ℝ) (hm : Market ν 0) (hμ : mean ν = 1)
    (hS : IsScale ν S) (hD : deltaM 1 S < coefDev ν) :
    ppProfit ν 0 ≤
      -lambertWm1 (-1 / (Real.exp 1 * S * (1 - coefDev ν))) * spProfit ν 0 := 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.1, Eq. (EC.7); proof pp. ec5–ec6 (PDF 37–38)
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