Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(30) — P^0 and the fixed-price probabilities P^j in terms of the dynamic choice probabilities

Proved
SubstitutePricing.Mixed.eq_30

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

dynamic-pricingmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

In the mixed pricing model, let θj=e(aj−rj−u0)/μ\theta_j = e^{(a_j - r^j - u_0)/\mu}θj​=e(aj​−rj−u0​)/μ for a fixed-price variate jjj and Θ=∑j∈S2(x)θj\Theta = \sum_{j \in S_2(x)} \theta_jΘ=∑j∈S2​(x)​θj​. For every inventory xxx and every vector rrr of dynamic prices,

P0=11+Θ(1−∑i∈S1(x)Pi),Pj=θj1+Θ(1−∑i∈S1(x)Pi)(j∈S2(x)),P^0 = \frac{1}{1 + \Theta}\Big(1 - \sum_{i \in S_1(x)} P^i\Big), \qquad P^j = \frac{\theta_j}{1 + \Theta}\Big(1 - \sum_{i \in S_1(x)} P^i\Big) \quad (j \in S_2(x)),P0=1+Θ1​(1−i∈S1​(x)∑​Pi),Pj=1+Θθj​​(1−i∈S1​(x)∑​Pi)(j∈S2​(x)),

where all probabilities are those of (1)–(2) at the full price vector (dynamic prices rrr on n1\mathfrak n_1n1​, fixed prices on n2\mathfrak n_2n2​).

Because the fixed prices do not move, the no-purchase and fixed-price probabilities are determined by the dynamic ones; this is what lets the optimization be carried out over the dynamic choice probabilities alone.

Preamble
import Definitions.Def_SubstitutePricing_Mixed_Model
Formal statement
namespace SubstitutePricing.Mixed
/-- (30): the no-purchase and fixed-price choice probabilities in terms of the dynamic ones. -/
theorem eq_30 (M : Model) (hM : M.Assumptions) (x : Fin M.n → ℕ) (r : Fin M.n → ℝ) :
    M.P0 x (M.mix r) = (1 - ∑ i ∈ M.S1 x, M.P x (M.mix r) i) / (1 + M.Θ x) ∧
    ∀ j ∈ M.S2 x, M.P x (M.mix r) j =
      M.θ j * (1 - ∑ i ∈ M.S1 x, M.P x (M.mix r) i) / (1 + M.Θ x) := by sorry
end SubstitutePricing.Mixed
Source
Dong, Kouvelis, Tian, Dynamic Pricing and Inventory Control of Substitute Products, Manufacturing & Service Operations Management 11(2) (2009), p. 337, App. A, proof of Proposition 2, (30)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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