Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma EC.3, p. ec7 — tight distributions F̄_L, F̄_M, F̄_H attaining (EC.5)–(EC.7) (corrected: (a) for D > 0; (c) last piece closed at S)

Proved
ValuePersPricing.Deviation.lemma_EC_3

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

lambert-wp2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1personalized-pricingtight-bound

Let S>1S>1S>1, take cost c=0c=0c=0, and let δL,δM,δH\delta_L,\delta_M,\delta_HδL​,δM​,δH​ be the thresholds at M=1M=1M=1. Each statement below asserts the existence of a probability law of a valuation V≥0V\ge 0V≥0 with mean 111, scale SSS and coefficient of deviation DDD whose cCDF Fˉ(x)=P(V≥x)\bar F(x)=\mathbb P(V\ge x)Fˉ(x)=P(V≥x) is, for x≥0x\ge 0x≥0, the stated function, and which attains the corresponding bound with equality.

  1. Low heterogeneity. For D∈(0,δL]D\in(0,\delta_L]D∈(0,δL​], with αL=(W−1((D−1)/e)D−1)−1\alpha_L=\Big(\frac{W_{-1}((D-1)/e)}{D-1}\Big)^{-1}αL​=(D−1W−1​((D−1)/e)​)−1,
FˉL(x)={10≤x<αLαL/xαL≤x≤1Dlog⁡(S) x1<x≤S0x>S,\bar F_L(x)=\begin{cases}1 & 0\le x<\alpha_L\\ \alpha_L/x & \alpha_L\le x\le 1\\ \frac{D}{\log(S)\,x} & 1<x\le S\\ 0 & x>S,\end{cases}FˉL​(x)=⎩⎨⎧​1αL​/xlog(S)xD​0​0≤x<αL​αL​≤x≤11<x≤Sx>S,​

and RPP=W−1((D−1)/e)D−1RSP\mathcal R_{PP}=\frac{W_{-1}((D-1)/e)}{D-1}\mathcal R_{SP}RPP​=D−1W−1​((D−1)/e)​RSP​ (Eq. (EC.5) with equality). 2. Medium heterogeneity. For D∈[δL,δM]D\in[\delta_L,\delta_M]D∈[δL​,δM​], with αM=D/log⁡S\alpha_M=D/\log SαM​=D/logS,

FˉM(x)={1x=0αMeS1/D−10<x<eS1−1/DαM/xeS1−1/D≤x≤S0x>S,\bar F_M(x)=\begin{cases}1 & x=0\\ \frac{\alpha_M}{e}S^{1/D-1} & 0<x<eS^{1-1/D}\\ \alpha_M/x & eS^{1-1/D}\le x\le S\\ 0 & x>S,\end{cases}FˉM​(x)=⎩⎨⎧​1eαM​​S1/D−1αM​/x0​x=00<x<eS1−1/DeS1−1/D≤x≤Sx>S,​

and D RPP=log⁡(S) RSPD\,\mathcal R_{PP}=\log(S)\,\mathcal R_{SP}DRPP​=log(S)RSP​ (Eq. (EC.6) with equality). 3. High heterogeneity. For D∈[δM,δH]D\in[\delta_M,\delta_H]D∈[δM​,δH​], with αH=(−W−1(−1/(eS(1−D))))−1\alpha_H=\big(-W_{-1}(-1/(eS(1-D)))\big)^{-1}αH​=(−W−1​(−1/(eS(1−D))))−1,

FˉH(x)={1x=01−D0<x≤αH1−DαH/xαH1−D<x≤S0x>S,\bar F_H(x)=\begin{cases}1 & x=0\\ 1-D & 0<x\le\frac{\alpha_H}{1-D}\\ \alpha_H/x & \frac{\alpha_H}{1-D}<x\le S\\ 0 & x>S,\end{cases}FˉH​(x)=⎩⎨⎧​11−DαH​/x0​x=00<x≤1−DαH​​1−DαH​​<x≤Sx>S,​

and RPP=−W−1(−1eS(1−D))RSP\mathcal R_{PP}=-W_{-1}\big(\frac{-1}{eS(1-D)}\big)\mathcal R_{SP}RPP​=−W−1​(eS(1−D)−1​)RSP​ (Eq. (EC.7) with equality).

These laws show that the bounds of Theorem 2 are tight in the standardized case; Lemma 1 transports them to a general cost and mean.

Differences from the source:

  • correction: (a) "Suppose D ∈ [0, δL]" → D ∈ (0, δL]; reason: at D = 0, α_L = 1 and F̄_L is the point mass at 1, whose scale is 1, not S > 1 (e.g. S = 2).
  • correction: (c) third piece "α_H/x if x ∈ (α_H/(1−D), S)", "0 otherwise" → α_H/x on (α_H/(1−D), S]; reason: as printed F̄_H(S) = 0 while F̄_H(x) → α_H/S > 0 as x ↑ S, but x ↦ P(V ≥ x) is left-continuous, so no law has the printed cCDF; the mean computation (EC.13) and the optimal prices [α_H/(1−D), S] need the atom at S.
  • encoding: the cCDF on its whole domain → compared on x ≥ 0 only; reason: "0 otherwise" would also cover x < 0, where P(V ≥ x) = 1 for V ≥ 0.
  • encoding: "Eq. (EC.6) with equality" → D·R_PP = log(S)·R_SP; reason: equivalent since D > 0 on [δL, δM].
  • encoding: "a random variable V" → a probability measure ν on ℝ with Market ν 0; S > 1 as a hypothesis; reason: standing assumptions of §2 and of Theorem 2.
Preamble
import Mathlib
import Definitions.Def_ValuePersPricing_Deviation_Model

open MeasureTheory Set Filter Topology
Formal statement
namespace ValuePersPricing.Deviation

/-- Lemma EC.3 (p. ec7): tight distributions for `c = 0`, `µ = 1`, `S > 1` (δ's at `M = 1`).
Each part gives a law with the stated cCDF on `x ≥ 0`, scale `S`, coefficient of deviation `D`
and mean `1` that attains (EC.5), (EC.6), (EC.7) respectively with equality.
Corrected: (a) for `D ∈ (0, δ_L]` (at `D = 0` the printed law is the point mass at 1, of scale 1);
(c) the third piece of `F̄_H` is on `(α_H/(1 − D), S]` (the printed `F̄_H(S) = 0` is not
left-continuous, so no law has it). -/
theorem lemma_EC_3 (S : ℝ) (hS : 1 < S) :
    (∀ D ∈ Ioc 0 (deltaL 1 S),
      ∃ ν : Measure ℝ, Market ν 0 ∧ mean ν = 1 ∧ IsScale ν S ∧ coefDev ν = D ∧
        (∀ x : ℝ, 0 ≤ x → tail ν x =
          if x < (lambertWm1 ((D - 1) / Real.exp 1) / (D - 1))⁻¹ then 1
          else if x ≤ 1 then (lambertWm1 ((D - 1) / Real.exp 1) / (D - 1))⁻¹ / x
          else if x ≤ S then D / (Real.log S * x)
          else 0) ∧
        ppProfit ν 0 =
          lambertWm1 ((D - 1) / Real.exp 1) / (D - 1) * spProfit ν 0) ∧
    (∀ D ∈ Icc (deltaL 1 S) (deltaM 1 S),
      ∃ ν : Measure ℝ, Market ν 0 ∧ mean ν = 1 ∧ IsScale ν S ∧ coefDev ν = D ∧
        (∀ x : ℝ, 0 ≤ x → tail ν x =
          if x = 0 then 1
          else if x < Real.exp 1 * S ^ (1 - 1 / D) then
            D / Real.log S / Real.exp 1 * S ^ (1 / D - 1)
          else if x ≤ S then D / Real.log S / x
          else 0) ∧
        coefDev ν * ppProfit ν 0 = Real.log S * spProfit ν 0) ∧
    (∀ D ∈ Icc (deltaM 1 S) (deltaH 1 S),
      ∃ ν : Measure ℝ, Market ν 0 ∧ mean ν = 1 ∧ IsScale ν S ∧ coefDev ν = D ∧
        (∀ x : ℝ, 0 ≤ x → tail ν x =
          if x = 0 then 1
          else if x ≤ (-lambertWm1 (-1 / (Real.exp 1 * S * (1 - D))))⁻¹ / (1 - D) then 1 - D
          else if x ≤ S then (-lambertWm1 (-1 / (Real.exp 1 * S * (1 - D))))⁻¹ / x
          else 0) ∧
        ppProfit ν 0 =
          -lambertWm1 (-1 / (Real.exp 1 * S * (1 - D))) * spProfit ν 0) := by sorry

end ValuePersPricing.Deviation
Source
Elmachtoub, Gupta & Hamilton, The Value of Personalized Pricing, SSRN 3127719 (review version, PDF sha256 635e22eb…), p. ec7 (PDF 39), Lemma EC.3; proof pp. ec8–ec9 (PDF 40–41)
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