Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C-2, p. App-5 — r is an optimal price of the worst-case law F_α(·|r,(w,q)) for r ∈ [r̲_α, w) ∪ [w, r̄_α]

Proved
SinglePointPricing.Det.lemma_C_2

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

generalized-paretooptimal-pricep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let α∈[0,1]\alpha\in[0,1]α∈[0,1], w>0w>0w>0, q∈(0,1)q\in(0,1)q∈(0,1) and r∈[r‾α(w,q),w)∪[w,r‾α(w,q)]r\in[\underline r_\alpha(w,q),w)\cup[w,\overline r_\alpha(w,q)]r∈[r​α​(w,q),w)∪[w,rα​(w,q)]. Then r≥0r\ge0r≥0 is an optimal price of Fα(⋅∣r,(w,q))F_\alpha(\cdot\mid r,(w,q))Fα​(⋅∣r,(w,q)):

r F‾α(r∣r,(w,q))=max⁡v≥0v F‾α(v∣r,(w,q)).r\,\overline F_\alpha(r\mid r,(w,q)) = \max_{v\ge0} v\,\overline F_\alpha(v\mid r,(w,q)).rFα​(r∣r,(w,q))=v≥0max​vFα​(v∣r,(w,q)).

Consequently opt(Fα(⋅∣r,(w,q)))\mathrm{opt}(F_\alpha(\cdot\mid r,(w,q)))opt(Fα​(⋅∣r,(w,q))) is the revenue at rrr, which equals rrr when r<wr<wr<w; this is step (a) of (4.1).

Differences from the source:

  • reading: 'the optimal price associated with F_α(·|r, (w, q)) is given by r' → r maximizes v ↦ v F̄_α(v|r, (w, q)) over v ≥ 0; reason: the uniqueness reading is false: for α = 0 and r = r̲_0(w, q) the revenue v F̄_0(v|r, (w, q)) equals r on all of [r, w]
  • encoding: r ≤ r̄_α(w, q) = w/(αΓ_α^{−1}(q)), with r̄_0 = +∞ → α Γ_α^{−1}(q) r ≤ w; reason: Γ_α^{−1}(q) > 0 for q ∈ (0, 1), so the condition is the same, and at α = 0 it is r < +∞
  • encoding: r ≥ 0 implicit → conclusion r ∈ [0, ∞) stated; reason: the optimal price is a price; r̲_α(w, q) > 0
Preamble
import Mathlib
import Definitions.Def_SinglePointPricing_Det_Setting
import Definitions.Def_SinglePointPricing_Det_WorstCase
Formal statement
namespace SinglePointPricing.Det

/-- Lemma C-2, p. App-5: for `α ∈ [0, 1]`, `w > 0`, `q ∈ (0, 1)` and
`r ∈ [r̲_α(w, q), w) ∪ [w, r̄_α(w, q)]`, the price `r` is an optimal price of `F_α(·|r, (w, q))`:
it maximizes the revenue `v ↦ v F̄_α(v|r, (w, q))` over `v ≥ 0`. -/
theorem lemma_C_2 (α w q r : ℝ) (hα : α ∈ Set.Icc (0 : ℝ) 1) (hw : 0 < w)
    (hq : q ∈ Set.Ioo (0 : ℝ) 1) (hr : r ∈ rSet α w q) :
    r ∈ Set.Ici (0 : ℝ) ∧ IsMaxOn (fun v => v * Fbar α w q r v) (Set.Ici 0) r := by sorry

end SinglePointPricing.Det
Source
Allouah, Bahamou & Besbes, Optimal Pricing with a Single Point, arXiv:2103.05611v2, Lemma C-2, p. App-5
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