Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 4 — optimal prices and discount time with myopic customers and identical declining valuations

Proved
SeasonalPricing.MyopicDet.optimal_prices_and_discount_time

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-pricingmarkdown-pricingp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-managementstrategic-consumers

A seller with unlimited inventory sells a seasonal product over the season [0,1][0, 1][0,1]. Customers arrive as a Poisson process with rate λ>0\lambda > 0λ>0; every customer has base valuation 111 (coefficient of variation c=0c = 0c=0), and a customer's valuation at time ttt is ρt\rho^tρt for a fixed 0<ρ<10 < \rho < 10<ρ<1. The seller posts a premium price p1p_1p1​ until a discount time T∈[0,1]T \in [0, 1]T∈[0,1] and a discount price p2≤p1p_2 \le p_1p2​≤p1​ afterwards. Customers are myopic: one arriving at time t<Tt < Tt<T buys at once iff ρt≥p1\rho^t \ge p_1ρt≥p1​, otherwise waits and buys at TTT iff ρT≥p2\rho^T \ge p_2ρT≥p2​; one arriving after TTT buys iff the current valuation is at least p2p_2p2​. Let Rρ(p1,p2;T)R_\rho(p_1, p_2; T)Rρ​(p1​,p2​;T) be the expected revenue, and

G(p1,p2)=(p1−p2)⋅ln⁡p1ln⁡ρ+p2⋅ln⁡p2ln⁡ρ.G(p_1, p_2) = (p_1 - p_2)\cdot\frac{\ln p_1}{\ln\rho} + p_2\cdot\frac{\ln p_2}{\ln\rho}.G(p1​,p2​)=(p1​−p2​)⋅lnρlnp1​​+p2​⋅lnρlnp2​​.
  1. The problem max⁡ρ≤p2≤p1≤1G(p1,p2)\max_{\rho \le p_2 \le p_1 \le 1} G(p_1, p_2)maxρ≤p2​≤p1​≤1​G(p1​,p2​) has a maximum MMM, and
πC/N∗=λM=max⁡{Rρ(p1,p2;T):0<p2≤p1, 0≤T≤1};\pi^*_{C/N} = \lambda M = \max\big\{R_\rho(p_1, p_2; T) : 0 < p_2 \le p_1,\ 0 \le T \le 1\big\};πC/N∗​=λM=max{Rρ​(p1​,p2​;T):0<p2​≤p1​, 0≤T≤1};

moreover, for every maximizer (p1∗,p2∗)(p_1^*, p_2^*)(p1∗​,p2∗​) of GGG on the region and every TTT with p2∗≤ρT≤p1∗p_2^* \le \rho^T \le p_1^*p2∗​≤ρT≤p1∗​, Rρ(p1∗,p2∗;T)=πC/N∗R_\rho(p_1^*, p_2^*; T) = \pi^*_{C/N}Rρ​(p1∗​,p2∗​;T)=πC/N∗​. 2. If ρ≤e−2+e−1\rho \le e^{-2+e^{-1}}ρ≤e−2+e−1, then the maximizer is unique, p1∗=e−1+e−1p_1^* = e^{-1+e^{-1}}p1∗​=e−1+e−1, p2∗=p1∗/ep_2^* = p_1^*/ep2∗​=p1∗​/e, the optimal revenue is πC/N∗=−λe−1+e−1/ln⁡ρ\pi^*_{C/N} = -\lambda e^{-1+e^{-1}}/\ln\rhoπC/N∗​=−λe−1+e−1/lnρ, and every TTT with

ρT∈[e−2+e−1, e−1+e−1]\rho^T \in \big[e^{-2+e^{-1}},\, e^{-1+e^{-1}}\big]ρT∈[e−2+e−1,e−1+e−1]

gives Rρ(p1∗,p2∗;T)=πC/N∗R_\rho(p_1^*, p_2^*; T) = \pi^*_{C/N}Rρ​(p1∗​,p2∗​;T)=πC/N∗​.

The result says that with identical, declining valuations the seller segments customers by arrival time alone: early arrivals pay the premium price, later ones the discount, and the discount time can be placed anywhere in a whole interval without loss.

Formalization Note The paper's "Q/λ → ∞" is read as unlimited inventory. Prices in the revenue maximization range over all 0<p2≤p10 < p_2 \le p_10<p2​≤p1​ and discount times over [0,1][0, 1][0,1]; the restriction to ρ≤p2≤p1≤1\rho \le p_2 \le p_1 \le 1ρ≤p2​≤p1​≤1 is part of the conclusion, not an assumption. "Setting TTT to any value within the range p2∗≤ρT≤p1∗p_2^* \le \rho^T \le p_1^*p2∗​≤ρT≤p1∗​" is read as: every such TTT is optimal (not: only such TTT). "If one could, it would be optimal to select TTT so that ρT∈[e−2+e−1,e−1+e−1]\rho^T \in [e^{-2+e^{-1}}, e^{-1+e^{-1}}]ρT∈[e−2+e−1,e−1+e−1]" is read the same way, at the explicit prices. Such TTT automatically lie in [0,1][0, 1][0,1]. Uniqueness in part 2 is the reading of "the prices p1∗p_1^*p1∗​ and p2∗p_2^*p2∗​". The decimal approximations 0.1960.1960.196 and 0.5320.5320.532 are not stated.

Preamble
import Mathlib
import Definitions.Def_SeasonalPricing_MyopicDet_myopicRevenue
import Definitions.Def_SeasonalPricing_MyopicDet_reducedObjective
Formal statement
namespace SeasonalPricing.MyopicDet

/-- Proposition 4 (Aviv–Pazgal 2008, p. 351). Myopic customers, identical base valuations
`V = 1` (`c = 0`), `0 < ρ < 1` (`α = −ln ρ`, `H = 1`), unlimited inventory (`Q/λ → ∞`),
and the discount time `T ∈ [0, 1]` chosen by the seller together with the prices.

(a) The problem `max_{ρ ≤ p₂ ≤ p₁ ≤ 1} G(p₁, p₂)`, `G = (p₁ − p₂) ln(p₁)/ln(ρ) + p₂ ln(p₂)/ln(ρ)`,
has a maximum `M`; `λM` is the maximal expected revenue over all prices `0 < p₂ ≤ p₁` and
discount times `T ∈ [0, 1]`; and every maximizer `(p₁*, p₂*)` of `G` together with every `T`
with `p₂* ≤ ρ^T ≤ p₁*` attains it.

(b) If `ρ ≤ e^{−2+e^{−1}}`, the maximizer is unique, `p₁* = e^{−1+e^{−1}}`, `p₂* = p₁*/e`, the
optimal revenue is `π*_{C/N} = −λ e^{−1+e^{−1}}/ln(ρ)`, and every `T` with
`ρ^T ∈ [e^{−2+e^{−1}}, e^{−1+e^{−1}}]` attains it at these prices. -/
theorem optimal_prices_and_discount_time (lam ρ : ℝ) (hlam : 0 < lam) (hρ0 : 0 < ρ)
    (hρ1 : ρ < 1) :
    (∃ M : ℝ,
      IsGreatest {g : ℝ | ∃ p1 p2 : ℝ, ρ ≤ p2 ∧ p2 ≤ p1 ∧ p1 ≤ 1 ∧
          g = reducedObjective ρ p1 p2} M ∧
      IsGreatest {r : ℝ | ∃ p1 p2 T : ℝ, 0 < p2 ∧ p2 ≤ p1 ∧ 0 ≤ T ∧ T ≤ 1 ∧
          r = detRevenue lam ρ p1 p2 T} (lam * M) ∧
      ∀ p1 p2 : ℝ, ρ ≤ p2 → p2 ≤ p1 → p1 ≤ 1 → reducedObjective ρ p1 p2 = M →
        ∀ T : ℝ, p2 ≤ ρ ^ T → ρ ^ T ≤ p1 → detRevenue lam ρ p1 p2 T = lam * M) ∧
    (ρ ≤ Real.exp (-2 + Real.exp (-1)) →
      IsGreatest {g : ℝ | ∃ p1 p2 : ℝ, ρ ≤ p2 ∧ p2 ≤ p1 ∧ p1 ≤ 1 ∧
          g = reducedObjective ρ p1 p2} (-Real.exp (-1 + Real.exp (-1)) / Real.log ρ) ∧
      (∀ p1 p2 : ℝ, ρ ≤ p2 → p2 ≤ p1 → p1 ≤ 1 →
        reducedObjective ρ p1 p2 = -Real.exp (-1 + Real.exp (-1)) / Real.log ρ →
          p1 = Real.exp (-1 + Real.exp (-1)) ∧
            p2 = Real.exp (-1 + Real.exp (-1)) / Real.exp 1) ∧
      IsGreatest {r : ℝ | ∃ p1 p2 T : ℝ, 0 < p2 ∧ p2 ≤ p1 ∧ 0 ≤ T ∧ T ≤ 1 ∧
          r = detRevenue lam ρ p1 p2 T} (-lam * Real.exp (-1 + Real.exp (-1)) / Real.log ρ) ∧
      ∀ T : ℝ, Real.exp (-2 + Real.exp (-1)) ≤ ρ ^ T → ρ ^ T ≤ Real.exp (-1 + Real.exp (-1)) →
        detRevenue lam ρ (Real.exp (-1 + Real.exp (-1)))
            (Real.exp (-1 + Real.exp (-1)) / Real.exp 1) T =
          -lam * Real.exp (-1 + Real.exp (-1)) / Real.log ρ) := by sorry

end SeasonalPricing.MyopicDet
Source
Aviv and Pazgal, Optimal Pricing of Seasonal Products in the Presence of Forward-Looking Consumers, Manufacturing & Service Operations Management 10(3), 2008, p. 351, Proposition 4
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me