Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 6, p. 24 — the MNL purchase probability Q(S) is increasing in S

Proved
ChoiceRM.MNL.mnl_purchaseProb_mono

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

discrete-choicemultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

Let w1,…,wn>0w_1, \dots, w_n > 0w1​,…,wn​>0 and let Pj(S)=wj/(∑i∈Swi+1)P_j(S) = w_j / (\sum_{i\in S} w_i + 1)Pj​(S)=wj​/(∑i∈S​wi​+1) for j∈Sj \in Sj∈S be the MNL choice probabilities (14). Then the total purchase probability

Q(S)=∑j∈SPj(S)=∑i∈Swi∑i∈Swi+1Q(S) = \sum_{j \in S} P_j(S) = \frac{\sum_{i \in S} w_i}{\sum_{i\in S} w_i + 1}Q(S)=j∈S∑​Pj​(S)=∑i∈S​wi​+1∑i∈S​wi​​

is increasing in SSS: Q(S)≤Q(T)Q(S) \le Q(T)Q(S)≤Q(T) whenever S⊆T⊆NS \subseteq T \subseteq NS⊆T⊆N.

This is condition (i) of the nesting-by-fare-order property (Definition 4) for the MNL model.

Preamble
import Mathlib
import Definitions.Def_RevenueManagement_singleResource
import Definitions.Def_ChoiceRM_MNL_FareOrder
import Definitions.Def_ChoiceRM_MNL_Models
Formal statement
namespace ChoiceRM.MNL

open RevenueManagement

/-- Proof of Proposition 6, p. 24: under the MNL model (14) with positive weights, the purchase
probability `Q(S) = Σ_{j∈S} P_j(S)` is increasing in `S`. -/
theorem mnl_purchaseProb_mono {n : ℕ} (w : Fin n → ℝ) (hw : ∀ j, 0 < w j)
    (S T : Finset (Fin n)) (hST : S ⊆ T) :
    purchaseProb (mnl w) S ≤ purchaseProb (mnl w) T := by sorry

end ChoiceRM.MNL
Source
Talluri, van Ryzin, Revenue management under a general discrete choice model of consumer behavior, working paper of October 21, 2001 (UPF Economics Working Paper 533; published Management Science 50(1), 2004, DOI 10.1287/mnsc.1030.0147), p. 24, proof of Proposition 6, first paragraph
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