Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 6, p. 24 — for j ≤ k*, P̄_j(α) = w_j/(Σ_{i∈T} w_i + 1) ≥ P_j(T)

Proved
ChoiceRM.MNL.mix_ge_below_kstar

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, W(S)=∑i∈SwiW(S) = \sum_{i\in S} w_iW(S)=∑i∈S​wi​, and let Pj(S)P_j(S)Pj​(S) be the MNL probabilities (14). Let T⊆NT \subseteq NT⊆N, let 0≤k∗<n0 \le k^* < n0≤k∗<n satisfy W(Ak∗)≤W(T)<W(Ak∗+1)W(A_{k^*}) \le W(T) < W(A_{k^*+1})W(Ak∗​)≤W(T)<W(Ak∗+1​), and let θ∈[0,1]\theta \in [0,1]θ∈[0,1] satisfy (15). With the convex weights αk∗=θ\alpha_{k^*} = \thetaαk∗​=θ, αk∗+1=1−θ\alpha_{k^*+1} = 1 - \thetaαk∗+1​=1−θ and αk=0\alpha_k = 0αk​=0 otherwise, and Pˉj(α)=∑kαkPj(Ak)\bar P_j(\alpha) = \sum_{k} \alpha_k P_j(A_k)Pˉj​(α)=∑k​αk​Pj​(Ak​), every product j≤k∗j \le k^*j≤k∗ satisfies

Pˉj(α)=θwjW(Ak∗)+1+(1−θ)wjW(Ak∗+1)+1=wjW(T)+1 ≥ Pj(T).\bar P_j(\alpha) = \theta \frac{w_j}{W(A_{k^*}) + 1} + (1-\theta)\frac{w_j}{W(A_{k^*+1}) + 1} = \frac{w_j}{W(T) + 1} \ \ge\ P_j(T).Pˉj​(α)=θW(Ak∗​)+1wj​​+(1−θ)W(Ak∗+1​)+1wj​​=W(T)+1wj​​ ≥ Pj​(T).

Summed over j≤ij \le ij≤i, this gives the majorization inequalities of Theorem 2 (ii) for the prefixes AiA_iAi​ with i≤k∗i \le k^*i≤k∗.

Formalization Note The paper's λ\lambdaλ is written θ\thetaθ (λ is reserved in Lean). Products are Fin n; the paper's j≤k∗j \le k^*j≤k∗ (1-based) is j.val < k (0-based). The weights are twoPoint k θ on the index set {0,…,n}\{0, \dots, n\}{0,…,n}.

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

/-- Proof of Proposition 6, p. 24: with `k*`, `θ` (the paper's `λ`) as in (15) and the
two-point weights `α_{k*} = θ`, `α_{k*+1} = 1 − θ`, every fare `j ≤ k*` (0-based `j < k`) has
`P̄_j(α) = w_j / (W(T) + 1) ≥ P_j(T)`. -/
theorem mix_ge_below_kstar {n : ℕ} (w : Fin n → ℝ) (hw : ∀ j, 0 < w j)
    (T : Finset (Fin n)) (k : ℕ) (hk : k < n)
    (hlo : ∑ i ∈ complete n k, w i ≤ ∑ i ∈ T, w i)
    (hhi : ∑ i ∈ T, w i < ∑ i ∈ complete n (k + 1), w i)
    (θ : ℝ) (hθ0 : 0 ≤ θ) (hθ1 : θ ≤ 1)
    (h15 : θ * ((∑ i ∈ complete n k, w i) / (∑ i ∈ complete n k, w i + 1)) +
        (1 - θ) * ((∑ i ∈ complete n (k + 1), w i) /
          (∑ i ∈ complete n (k + 1), w i + 1)) =
      (∑ i ∈ T, w i) / (∑ i ∈ T, w i + 1)) :
    ∀ j : Fin n, j.val < k →
      mixProb (mnl w) (twoPoint k θ) j = w j / (∑ i ∈ T, w i + 1) ∧
        mnl w T j ≤ w j / (∑ i ∈ T, w i + 1) := 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, eq. (16) and the display for j ≤ k*
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