Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 3: an optimal uniform service duration is tst_sts​ or tlt_ltl​

Proved
PriceQualityService.Uniform.theorem_3

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

multinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricingproduct-qualityservice-duration

Consider the joint price, quality and uniform service duration problem (7): the firm chooses prices p∈RN\mathbf p\in\mathbb R^Np∈RN, qualities q∈RN\mathbf q\in\mathbb R^Nq∈RN and one service duration t∈[ts,tl]t\in[t_s,t_l]t∈[ts​,tl​] shared by all products (ti=tt_i=tti​=t for every i∈Ni\in\mathcal Ni∈N), to maximize the total expected profit

max⁡p,q, t∈[ts,tl] Π(p,q,(t,…,t);N)\max_{\mathbf p,\mathbf q,\,t\in[t_s,t_l]}\ \Pi\big(\mathbf p,\mathbf q,(t,\dots,t);\mathcal N\big)p,q,t∈[ts​,tl​]max​ Π(p,q,(t,…,t);N)

under the MNL model (2)–(3). Assume ci>0c_i>0ci​>0 for every product and ts≤tlt_s\le t_lts​≤tl​.

Theorem 3. The optimal uniform service duration is at one of the boundary points: there exist t∗∈{ts,tl}t^*\in\{t_s,t_l\}t∗∈{ts​,tl​} and vectors p∗,q∗\mathbf p^*,\mathbf q^*p∗,q∗ such that

Π(p,q,(t,…,t);N)≤Π(p∗,q∗,(t∗,…,t∗);N)for all t∈[ts,tl], p,q∈RN.\Pi\big(\mathbf p,\mathbf q,(t,\dots,t);\mathcal N\big)\le\Pi\big(\mathbf p^*,\mathbf q^*,(t^*,\dots,t^*);\mathcal N\big) \quad\text{for all }t\in[t_s,t_l],\ \mathbf p,\mathbf q\in\mathbb R^N.Π(p,q,(t,…,t);N)≤Π(p∗,q∗,(t∗,…,t∗);N)for all t∈[ts​,tl​], p,q∈RN.

In particular problem (7) has an optimal solution, and it can be taken with t∗=tst^*=t_st∗=ts​ or t∗=tlt^*=t_lt∗=tl​.

Even when all products must carry the same service duration, the firm should offer either the shortest or the longest one; the paper uses this benchmark to measure the value of service differentiation.

Formalization Note This is the existential reading of "the optimal uniform service duration is tst_sts​ or tlt_ltl​": when the optimal profit does not depend on ttt (every bi=0b_i=0bi​=0 and ai=sia_i=s_iai​=si​) every duration is optimal, so the universal reading needs a non-degeneracy assumption and is a separate item. Existence of an optimum is part of the conclusion. Prices and qualities are unconstrained reals, as in the paper's first-order derivation.

Preamble
import Mathlib
import Definitions.Def_PriceQualityService_Joint_Model
Formal statement
namespace PriceQualityService.Uniform

/-- Theorem 3, Wang, Ke & Cui, accepted manuscript (SSRN 3766191), p. 15: in problem (7), the
joint price, quality and uniform service duration problem `max_{p,q,t} Π(p, q, t; 𝒩)` with
`t_i = t ∈ [t_s, t_l]` for every product, an optimal uniform duration is at a boundary point.
There are `τ ∈ {t_s, t_l}` and price and quality vectors `p*`, `q*` such that the profit at
`(p*, q*, τ)` is at least the profit of every `(p, q, t)` with `t ∈ [t_s, t_l]`. -/
theorem theorem_3 {N : ℕ} (α a b c s : Fin N → ℝ) (hc : ∀ i, 0 < c i) (ts tl : ℝ)
    (hts : ts ≤ tl) :
    ∃ τ : ℝ, (τ = ts ∨ τ = tl) ∧ ∃ pStar qStar : Fin N → ℝ,
      ∀ t ∈ Set.Icc ts tl, ∀ p q : Fin N → ℝ,
        PriceQualityService.Joint.profit α a b c s p q (fun _ => t) ≤ PriceQualityService.Joint.profit α a b c s pStar qStar (fun _ => τ) := by sorry

end PriceQualityService.Uniform
Source
Wang, Ke & Cui, Product Price, Quality and Service Decisions under Consumer Choice Models, accepted manuscript (SSRN 3766191), p. 15, Theorem 3 (problem (7)); proof pp. 29–30
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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