Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.1, PDF p. 28 — the markup equation θ = Σₖ exp(α̂ₖ − βₖθ) has a unique solution

Proved
MultiStoreAssort.Pricing.theta_exists_unique

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

joint-pricingmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let α1,…,αn>0\alpha_1,\dots,\alpha_n>0α1​,…,αn​>0 and β1,…,βn>0\beta_1,\dots,\beta_n>0β1​,…,βn​>0, and put α^k=αk−log⁡βk−1\hat\alpha_k=\alpha_k-\log\beta_k-1α^k​=αk​−logβk​−1. Then the equation

θ=∑k∈Neα^k−βkθ\theta=\sum_{k\in\mathcal N}e^{\hat\alpha_k-\beta_k\theta}θ=k∈N∑​eα^k​−βk​θ

has exactly one real solution θ∗\theta^*θ∗.

The paper applies this store by store, with αk=αik\alpha_k=\alpha_{ik}αk​=αik​, βk=βik\beta_k=\beta_{ik}βk​=βik​, to define θi∗\theta^*_iθi∗​. The solution is the optimal revenue of the single-store joint assortment and pricing problem (14), and θi∗+1/βik\theta^*_i+1/\beta_{ik}θi∗​+1/βik​ are the optimal prices of Theorem 6. Existence and uniqueness make the hypothesis "θi\theta_iθi​ solves the markup equation" of the main theorem satisfiable and unambiguous.

Formalization Note The positivity of αk\alpha_kαk​ is the page's αk∈R+\alpha_k\in\mathbb R^+αk​∈R+ and is not needed for the conclusion; βk>0\beta_k>0βk​>0 is needed for log⁡βk\log\beta_klogβk​.

Preamble
import Mathlib
import Definitions.Def_MultiStoreAssort_Pricing_Model
Formal statement
namespace MultiStoreAssort.Pricing
open Finset

theorem theta_exists_unique {n : ℕ} (a b : Fin n → ℝ) (ha : ∀ k, 0 < a k) (hb : ∀ k, 0 < b k) :
    ∃! θ : ℝ, IsTheta a b θ := by sorry

end MultiStoreAssort.Pricing
Source
Liu, Chen, Liu & Wan, Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing, authors' manuscript with Online and Additional Supplements (2024-09-17; MSOM DOI 10.1287/msom.2024.0761), PDF p. 28, §8.1, sentence defining θ*ᵢ before Theorem 6
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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