Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4, p. 19 — nested logit joint optimum: qxi†=(αxi+txbxi)/(2cxi)q^\dagger_{xi}=(\alpha_{xi}+t_xb_{xi})/(2c_{xi})qxi†​=(αxi​+tx​bxi​)/(2cxi​), common markup μ1+r†\mu_1+r^\daggerμ1​+r†, optimal profit r†r^\daggerr†

Proved
PriceQualityService.NestedLogit.theorem_4

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

nested-logitoperations-researchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricingquality

Consider a firm selling products in two nests x∈{s,l}x\in\{s,l\}x∈{s,l} with fixed service durations ts,tlt_s,t_lts​,tl​, under the two-stage nested logit model with upper-level scale μ1≥1\mu_1\ge1μ1​≥1 (nest coefficient 1/μ11/\mu_11/μ1​) and production-cost coefficients cxi>0c_{xi}>0cxi​>0. The firm chooses prices p\mathbf pp and qualities q\mathbf qq to maximize the total expected profit ΠM(p,q)\Pi_M(\mathbf p,\mathbf q)ΠM​(p,q) of (9). Define

qxi†=αxi+txbxi2cxi.q^\dagger_{xi}=\frac{\alpha_{xi}+t_xb_{xi}}{2c_{xi}} .qxi†​=2cxi​αxi​+tx​bxi​​.

Then:

  1. the equation in rrr
r=∑x∈{s,l}μ1(∑i=1mxexp⁡(αxiqxi†−cxiqxi†2−tx(axi−bxiqxi†)+txsxi−r−μ1))1/μ1r=\sum_{x\in\{s,l\}}\mu_1\Bigl(\sum_{i=1}^{m_x}\exp\bigl(\alpha_{xi}q^\dagger_{xi}-c_{xi}q^{\dagger2}_{xi}-t_x(a_{xi}-b_{xi}q^\dagger_{xi})+t_xs_{xi}-r-\mu_1\bigr)\Bigr)^{1/\mu_1}r=x∈{s,l}∑​μ1​(i=1∑mx​​exp(αxi​qxi†​−cxi​qxi†2​−tx​(axi​−bxi​qxi†​)+tx​sxi​−r−μ1​))1/μ1​

has a unique real solution r†r^\daggerr†; 2. with pxi†=μ1+r†+cxiqxi†2+tx(axi−bxiqxi†)p^\dagger_{xi}=\mu_1+r^\dagger+c_{xi}q^{\dagger2}_{xi}+t_x(a_{xi}-b_{xi}q^\dagger_{xi})pxi†​=μ1​+r†+cxi​qxi†2​+tx​(axi​−bxi​qxi†​), the decisions (p†,q†)(\mathbf p^\dagger,\mathbf q^\dagger)(p†,q†) maximize ΠM\Pi_MΠM​ over all real price and quality vectors; 3. the optimal profit is ΠM(p†,q†)=r†\Pi_M(\mathbf p^\dagger,\mathbf q^\dagger)=r^\daggerΠM​(p†,q†)=r†; 4. (p†,q†)(\mathbf p^\dagger,\mathbf q^\dagger)(p†,q†) is the only maximizer.

The result says that, as under the multinomial logit model, each product's optimal quality depends only on its own parameters and its nest's duration, and that at the optimum every product, in either nest, carries the same markup μ1+r†\mu_1+r^\daggerμ1​+r†.

Formalization Note. Optimality is global: (2) quantifies over all (p,q)∈Rms+ml×Rms+ml(\mathbf p,\mathbf q)\in\mathbb R^{m_s+m_l}\times\mathbb R^{m_s+m_l}(p,q)∈Rms​+ml​×Rms​+ml​; the paper's proof uses first-order conditions. Clause (4) is the reading of "the optimal quality level ... is given by" and "the optimal price ... can be expressed as" as statements about every optimum. Empty nests are allowed; an empty nest contributes nothing to the sum.

Preamble
import Mathlib
import Definitions.Def_PriceQualityService_NestedLogit_Optimum
Formal statement
namespace PriceQualityService.NestedLogit

/-- Theorem 4, p. 19 (Wang, Ke & Cui), joint price and quality optimization under the two-stage
nested logit model with fixed nests and nest durations, `μ₁ ≥ 1` and `c_xi > 0`. There is a real
number `r†` such that
1. `r†` solves `r = ∑_{x∈{s,l}} μ₁ (∑_i exp(α_xi q†_xi − c_xi q†_xi² − t_x (a_xi − b_xi q†_xi) + t_x s_xi − r − μ₁))^{1/μ₁}`,
   and it is the only real solution;
2. with `q†_xi = (α_xi + t_x b_xi)/(2c_xi)` and `p†_xi = μ₁ + r† + c_xi q†_xi² + t_x (a_xi − b_xi q†_xi)`,
   `(p†, q†)` maximizes the profit `Π_M` of (9) over all price and quality vectors;
3. the optimal profit `Π_M(p†, q†)` equals `r†`;
4. every maximizer `(p, q)` of `Π_M` is `(p†, q†)`. -/
theorem theorem_4 (M : Model) (hμ : 1 ≤ M.μ₁) (hc : ∀ x i, 0 < M.c x i) :
    ∃ rDag : ℝ,
      rDag = fixedPointRHS M (qDagger M) rDag ∧
      (∀ r : ℝ, r = fixedPointRHS M (qDagger M) r → r = rDag) ∧
      (∀ p q : Vec M, profit M p q ≤ profit M (pDagger M rDag) (qDagger M)) ∧
      profit M (pDagger M rDag) (qDagger M) = rDag ∧
      (∀ p q : Vec M, (∀ p' q' : Vec M, profit M p' q' ≤ profit M p q) →
        q = qDagger M ∧ p = pDagger M rDag) := by sorry

end PriceQualityService.NestedLogit
Source
Wang, Ke & Cui, Product Price, Quality and Service Decisions under Consumer Choice Models, accepted manuscript (SSRN 3766191), p. 19, Theorem 4; proof in Online Supplement pp. 5–6 (PDF pp. 38–39)
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