Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1: optimal durations are extreme, qualities are (αi+ti∗bi)/(2ci)(\alpha_i+t_i^*b_i)/(2c_i)(αi​+ti∗​bi​)/(2ci​), markups equal 1+r∗1+r^*1+r∗, and r∗r^*r∗ is the optimal profit

Proved
PriceQualityService.Joint.theorem_1

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

multinomial-logitoperations-researchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricing

Consider the joint optimization problem (4): choose prices p∈RN\mathbf p\in\mathbb R^Np∈RN, quality levels q∈RN\mathbf q\in\mathbb R^Nq∈RN and service durations t∈[ts,tl]N\mathbf t\in[t_s,t_l]^Nt∈[ts​,tl​]N to maximize the MNL profit

Π(p,q,t;N)=∑i∈N[pi−ciqi2−ti(ai−biqi)]⋅exp⁡(αiqi−pi+tisi)1+∑j∈Nexp⁡(αjqj−pj+tjsj).\Pi(\mathbf p,\mathbf q,\mathbf t;\mathcal N)=\sum_{i\in\mathcal N}\bigl[p_i-c_iq_i^2-t_i(a_i-b_iq_i)\bigr]\cdot\frac{\exp(\alpha_iq_i-p_i+t_is_i)}{1+\sum_{j\in\mathcal N}\exp(\alpha_jq_j-p_j+t_js_j)}.Π(p,q,t;N)=i∈N∑​[pi​−ci​qi2​−ti​(ai​−bi​qi​)]⋅1+∑j∈N​exp(αj​qj​−pj​+tj​sj​)exp(αi​qi​−pi​+ti​si​)​.

Assume ci>0c_i>0ci​>0 for every iii and ts≤tlt_s\le t_lts​≤tl​. Then:

  1. Existence and structure. There are durations t∗\mathbf t^*t∗ with ti∗∈{ts,tl}t_i^*\in\{t_s,t_l\}ti∗​∈{ts​,tl​} for every iii (part (a)) and a real number r∗r^*r∗ that is the unique solution of
r=∑i∈Nexp⁡(bi2ti∗24ci+(si−ai+αibi2ci)ti∗+αi24ci−r−1),r=\sum_{i\in\mathcal N}\exp\Bigl(\frac{b_i^2t_i^{*2}}{4c_i}+\Bigl(s_i-a_i+\frac{\alpha_ib_i}{2c_i}\Bigr)t_i^*+\frac{\alpha_i^2}{4c_i}-r-1\Bigr),r=i∈N∑​exp(4ci​bi2​ti∗2​​+(si​−ai​+2ci​αi​bi​​)ti∗​+4ci​αi2​​−r−1),

such that with

qi∗=αi+ti∗bi2ci,pi∗=1+r∗+ciqi∗2+ti∗(ai−biqi∗)q_i^*=\frac{\alpha_i+t_i^*b_i}{2c_i},\qquad p_i^*=1+r^*+c_iq_i^{*2}+t_i^*(a_i-b_iq_i^*)qi∗​=2ci​αi​+ti∗​bi​​,pi∗​=1+r∗+ci​qi∗2​+ti∗​(ai​−bi​qi∗​)

(parts (b) and (c)) the triple (p∗,q∗,t∗)(\mathbf p^*,\mathbf q^*,\mathbf t^*)(p∗,q∗,t∗) is optimal for (4) and its profit equals r∗r^*r∗. 2. Every optimum has this structure. If (p,q,t)(\mathbf p,\mathbf q,\mathbf t)(p,q,t) is optimal for (4) with optimal profit r∗=Π(p,q,t;N)r^*=\Pi(\mathbf p,\mathbf q,\mathbf t;\mathcal N)r∗=Π(p,q,t;N), then for every iii: qi=(αi+tibi)/(2ci)q_i=(\alpha_i+t_ib_i)/(2c_i)qi​=(αi​+ti​bi​)/(2ci​), pi=1+r∗+ciqi2+ti(ai−biqi)p_i=1+r^*+c_iq_i^2+t_i(a_i-b_iq_i)pi​=1+r∗+ci​qi2​+ti​(ai​−bi​qi​), r∗r^*r∗ solves the equation above with t\mathbf tt in place of t∗\mathbf t^*t∗, and, when ts<tlt_s<t_lts​<tl​, ti∈{ts,tl}t_i\in\{t_s,t_l\}ti​∈{ts​,tl​} for every product with bi≠0b_i\ne0bi​=0 or ai≠sia_i\ne s_iai​=si​.

Thus the optimal service durations are extreme, each quality is set from the product's own parameters, all products carry the same markup 1+r∗1+r^*1+r∗, and r∗r^*r∗ is the optimal profit.

Formalization Note ci>0c_i>0ci​>0 is the paper's increasing convex production cost (p. 8). Qualities range over all of R\mathbb RR, as in the paper's proof; the model's range [0,ai/bi)[0,a_i/b_i)[0,ai​/bi​) (p. 8) is not imposed. The paper's "always at a boundary point" is stated for optimal solutions in the precise form: when bi=0b_i=0bi​=0 and ai=sia_i=s_iai​=si​ the profit does not depend on tit_iti​ once qiq_iqi​ and pip_ipi​ are optimal, so every duration of product iii is optimal; for all other products every optimal duration is tst_sts​ or tlt_ltl​ (this needs ts<tlt_s<t_lts​<tl​; when ts=tlt_s=t_lts​=tl​ the claim is trivial). Products are Fin N (0-based) and N=0N=0N=0 is allowed (then r∗=0r^*=0r∗=0).

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

/-- Theorem 1, Wang, Ke & Cui, pp. 9–10, for problem (4): maximize the profit (3) over prices
`p ∈ ℝ^N`, qualities `q ∈ ℝ^N` and service durations `t ∈ [t_s, t_l]^N`.

First conjunct (existence, (a)–(c)): there are durations `t*` with every `t*_i ∈ {t_s, t_l}` and a
real `r*` that is the unique root of
`r = ∑_i exp(b_i² t*_i²/(4c_i) + (s_i − a_i + α_i b_i/(2c_i)) t*_i + α_i²/(4c_i) − r − 1)`, such that
with `q*_i = (α_i + t*_i b_i)/(2c_i)` and `p*_i = 1 + r* + c_i q*_i² + t*_i(a_i − b_i q*_i)` the triple
`(p*, q*, t*)` is optimal and its profit is `r*`.

Second conjunct (every optimum has this structure): if `(p, q, t)` is optimal with value
`r* = Π(p, q, t)`, then `q_i = (α_i + t_i b_i)/(2c_i)`, `p_i = 1 + r* + c_i q_i² + t_i(a_i − b_i q_i)`,
`r*` solves the equation above at `t`, and, when `t_s < t_l`, `t_i ∈ {t_s, t_l}` for every `i` with
`b_i ≠ 0` or `a_i ≠ s_i` (when `b_i = 0` and `a_i = s_i` every duration of product `i` is optimal). -/
theorem theorem_1 {N : ℕ} (α a b c s : Fin N → ℝ) (hc : ∀ i, 0 < c i) (ts tl : ℝ)
    (hst : ts ≤ tl) :
    (∃ (tstar : Fin N → ℝ) (rstar : ℝ),
      (∀ i, tstar i = ts ∨ tstar i = tl) ∧
      rstar = ∑ i, Real.exp (durationExponent α a b c s i (tstar i) - rstar - 1) ∧
      (∀ r : ℝ, r = ∑ i, Real.exp (durationExponent α a b c s i (tstar i) - r - 1) → r = rstar) ∧
      (let qstar : Fin N → ℝ := fun i => (α i + tstar i * b i) / (2 * c i)
       let pstar : Fin N → ℝ := fun i =>
         1 + rstar + c i * qstar i ^ 2 + tstar i * (a i - b i * qstar i)
       (∀ p q t : Fin N → ℝ, (∀ i, t i ∈ Set.Icc ts tl) →
          profit α a b c s p q t ≤ profit α a b c s pstar qstar tstar) ∧
        profit α a b c s pstar qstar tstar = rstar)) ∧
    (∀ p q t : Fin N → ℝ, (∀ i, t i ∈ Set.Icc ts tl) →
      (∀ p' q' t' : Fin N → ℝ, (∀ i, t' i ∈ Set.Icc ts tl) →
          profit α a b c s p' q' t' ≤ profit α a b c s p q t) →
      (∀ i, q i = (α i + t i * b i) / (2 * c i)) ∧
      (∀ i, p i = 1 + profit α a b c s p q t + c i * q i ^ 2 + t i * (a i - b i * q i)) ∧
      profit α a b c s p q t =
        ∑ i, Real.exp (durationExponent α a b c s i (t i) - profit α a b c s p q t - 1) ∧
      (ts < tl → ∀ i, (b i ≠ 0 ∨ a i ≠ s i) → t i = ts ∨ t i = tl)) := by sorry

end PriceQualityService.Joint
Source
Wang, Ke & Cui, Product Price, Quality and Service Decisions under Consumer Choice Models, accepted manuscript (SSRN 3766191), pp. 9–10, Theorem 1; proof pp. 25–27, Appendix B
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