Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (4.1), p. 21 — R(P_d, F_α(w,q)) as a sup over p ∈ [0,w] of the minimum of three worst-case ratios

Proved
SinglePointPricing.Det.eq_4_1

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

deterministic-pricingmaximin-ratiop2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let α∈[0,1]\alpha\in[0,1]α∈[0,1], w>0w>0w>0 and q∈(0,1)q\in(0,1)q∈(0,1). The maximin ratio of the deterministic prices is

R(Pd,Fα(w,q))=sup⁡p∈[0,w]min⁡{inf⁡r∈[r‾α(w,q),p)p F‾α(p∣r,(w,q))r, pw, inf⁡r∈[w,r‾α(w,q)]p F‾α(p∣r,(w,q))opt(Fα(⋅∣r,(w,q)))},\mathcal R(\mathcal P_d,\mathcal F_\alpha(w,q)) = \sup_{p\in[0,w]}\min\Big\{\inf_{r\in[\underline r_\alpha(w,q),p)}\frac{p\,\overline F_\alpha(p\mid r,(w,q))}{r},\ \frac pw,\ \inf_{r\in[w,\overline r_\alpha(w,q)]}\frac{p\,\overline F_\alpha(p\mid r,(w,q))}{\mathrm{opt}(F_\alpha(\cdot\mid r,(w,q)))}\Big\},R(Pd​,Fα​(w,q))=p∈[0,w]sup​min{r∈[r​α​(w,q),p)inf​rpFα​(p∣r,(w,q))​, wp​, r∈[w,rα​(w,q)]inf​opt(Fα​(⋅∣r,(w,q)))pFα​(p∣r,(w,q))​},

the three terms being the worst cases with oracle price below ppp, between ppp and www, and at or above www.

This is the paper's first reduction of the deterministic problem, from which Proposition D-1 and the closed forms of Theorem 2 follow.

Differences from the source:

  • reading: w, the historical price, with no sign stated in the theorem → hypothesis 0 < w; reason: w is a posted price and Lemma C-2 states w > 0; at w = 0 no law has F̄(0) = q < 1
  • reading: F̄ = 1 − F for a right-continuous cdf F (p. 9) → F̄(p) = μ([p, ∞)), the closed tail P(v ≥ p); reason: the page defines the data as the fraction of values greater than or equal to w (p. 2), the revenue as ∫ p 1{v ≥ p} dF(v) = p F̄(p) (p. 9), and its worst cases (3.1) as ccdfs equal to the atom's size at the top of the support; only the closed tail makes these agree, and the two tails differ only at atoms
  • reading: α-strong regularity: a positive density on the support [a, b] except possibly at its maximum, with (1 − α)v − F̄(v)/f(v) monotone (p. 11, App-1) → Γ_α^{−1} ∘ F̄ is convex on {v ≥ 0 : F̄(v) > 0}, with no absolute-continuity requirement; reason: with h = Γ_α^{−1} ∘ F̄ the α-virtual value is (1 − α)v − (1 + (1 − α)h)/h′, which is non-decreasing exactly when h is convex; convexity on {F̄ > 0} allows exactly an atom at the top of the support (as p. 11 does) and excludes interior atoms and singular parts. The printed 'non-increasing' (p. 11) is a slip for non-decreasing (App. A; proof of Lemma C-1)
  • encoding: sup and inf in R(Ψ, F), opt(F) and R(P′, 𝓕) → sSup and sInf on ℝ; reason: every set involved is nonempty and bounded (ratios lie in [0, 1], revenues are bounded by the mean), so the real sSup and sInf are the paper's sup and inf; no junk value arises
  • encoding: min{min_{r∈[r̲_α,p)} …, p/w, min_{r∈[w,r̄_α]} …} → sInf of the union of the three value sets; reason: the minima over half-open sets are infima (p. 21, (b): min_{r∈[p,w)} p/r = p/w is not attained), an empty group (p ≤ r̲_α, or r̄_α < w) imposes no constraint, and the infimum of a union is the minimum of the infima; the union always contains p/w
  • encoding: opt(F_α(·|r, (w, q))) → sup_{v ≥ 0} v F̄_α(v|r, (w, q)), computed from the ccdf (3.2); reason: (2.1) applied to the law whose ccdf on [0, ∞) is F̄_α(·|r, (w, q))
  • 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 < +∞
Preamble
import Mathlib
import Definitions.Def_SinglePointPricing_Det_Setting
import Definitions.Def_SinglePointPricing_Det_WorstCase
Formal statement
namespace SinglePointPricing.Det

/-- Display (4.1), line (b), p. 21: the deterministic maximin ratio as a supremum over prices
`p ∈ [0, w]` of the smallest of three worst-case ratios,
`inf_{r ∈ [r̲_α(w,q), p)} p F̄_α(p|r,(w,q))/r`, `p/w`, and
`inf_{r ∈ [w, r̄_α(w,q)]} p F̄_α(p|r,(w,q))/opt(F_α(·|r,(w,q)))`; the minimum of the three is the
infimum of the union of the three value sets (an empty group contributes nothing). -/
theorem eq_4_1 (α w q : ℝ) (hα : α ∈ Set.Icc (0 : ℝ) 1) (hw : 0 < w)
    (hq : q ∈ Set.Ioo (0 : ℝ) 1) :
    maximin Pd (FClass α w q) =
      sSup ((fun p : ℝ =>
        sInf (((fun r => p * Fbar α w q r p / r) '' Set.Ico (rLow α w q) p) ∪ {p / w} ∪
          ((fun r => p * Fbar α w q r p / optFun (Fbar α w q r)) ''
            {r | w ≤ r ∧ α * GammaAInv α q * r ≤ w}))) '' Set.Icc 0 w) := by sorry

end SinglePointPricing.Det
Source
Allouah, Bahamou & Besbes, Optimal Pricing with a Single Point, arXiv:2103.05611v2, §4.1, p. 21, display (4.1), line (b)
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