Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pricing Inequality, §3.1, p. 9 — F̄(x) ≤ R_SP(F,0)/x for every x > 0

Proved
ValuePersPricing.Deviation.pricing_inequality

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

monopoly-pricingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1personalized-pricing

Let V∼FV\sim FV∼F be a valuation with V≥0V\ge 0V≥0 almost surely and finite mean, and let the cost be c=0c=0c=0. For every price x>0x>0x>0,

Fˉ(x)≤RSP(F,0)x,\bar F(x)\le\frac{\mathcal R_{SP}(F,0)}{x},Fˉ(x)≤xRSP​(F,0)​,

where Fˉ(x)=P(V≥x)\bar F(x)=\mathbb P(V\ge x)Fˉ(x)=P(V≥x) and RSP(F,0)=sup⁡pp Fˉ(p)\mathcal R_{SP}(F,0)=\sup_p p\,\bar F(p)RSP​(F,0)=supp​pFˉ(p).

The optimal single-price revenue thus controls the tail of the valuation distribution; this pointwise bound drives all the upper bounds of the paper.

Differences from the source:

  • encoding: V ∼ F nonnegative with cost 0 → a probability measure ν on ℝ with Market ν 0 (V ≥ 0 a.s., E|V| < ∞); reason: standing assumptions of §2.
Preamble
import Mathlib
import Definitions.Def_ValuePersPricing_Deviation_Model

open MeasureTheory Set Filter Topology
Formal statement
namespace ValuePersPricing.Deviation

/-- The Pricing Inequality (§3.1, p. 9): with zero cost, `F̄(x) ≤ R_SP(F, 0)/x` for every `x > 0`. -/
theorem pricing_inequality (ν : Measure ℝ) (hm : Market ν 0) :
    ∀ x : ℝ, 0 < x → tail ν x ≤ spProfit ν 0 / x := by sorry

end ValuePersPricing.Deviation
Source
Elmachtoub, Gupta & Hamilton, The Value of Personalized Pricing, SSRN 3127719 (review version, PDF sha256 635e22eb…), p. 9 (PDF 9), §3.1, Pricing Inequality
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