Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 6, p. 24, (15) — the index k* and the weight λ for an incomplete set

Proved
ChoiceRM.MNL.exists_kstar_theta

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, write W(S)=∑i∈SwiW(S) = \sum_{i \in S} w_iW(S)=∑i∈S​wi​, and let T⊆NT \subseteq NT⊆N be incomplete (not of the form Ak={1,…,k}A_k = \{1, \dots, k\}Ak​={1,…,k}, 0≤k≤n0 \le k \le n0≤k≤n). Then there is an index k∗k^*k∗ with 0≤k∗<n0 \le k^* < n0≤k∗<n such that

  1. W(Ak∗)≤W(T)<W(Ak∗+1)W(A_{k^*}) \le W(T) < W(A_{k^*+1})W(Ak∗​)≤W(T)<W(Ak∗+1​);
  2. TTT contains a product with index larger than k∗k^*k∗, i.e. max⁡{j:j∈T}>k∗\max\{j : j \in T\} > k^*max{j:j∈T}>k∗;
  3. there is θ∈[0,1]\theta \in [0, 1]θ∈[0,1] with
θW(Ak∗)W(Ak∗)+1+(1−θ)W(Ak∗+1)W(Ak∗+1)+1=W(T)W(T)+1.(15)\theta \frac{W(A_{k^*})}{W(A_{k^*}) + 1} + (1 - \theta) \frac{W(A_{k^*+1})}{W(A_{k^*+1}) + 1} = \frac{W(T)}{W(T) + 1}. \qquad (15)θW(Ak∗​)+1W(Ak∗​)​+(1−θ)W(Ak∗+1​)+1W(Ak∗+1​)​=W(T)+1W(T)​.(15)

The two complete sets Ak∗A_{k^*}Ak∗​ and Ak∗+1A_{k^*+1}Ak∗+1​, mixed with weights θ\thetaθ and 1−θ1-\theta1−θ, are the convex combination that the proof of Proposition 6 compares with TTT.

Formalization Note The paper's λ\lambdaλ is written θ\thetaθ (λ is reserved in Lean). Products are Fin n, so "max⁡{j:j∈T}>k∗\max\{j : j\in T\} > k^*max{j:j∈T}>k∗" in the paper's 1-based indexing is "some j∈Tj \in Tj∈T with k ≤ j.val" in 0-based indexing, and AkA_kAk​ is complete n k. The page says "define λ\lambdaλ by (15)"; that a solution exists and lies in [0,1][0,1][0,1], so that the weights are convex, is implicit there and is what this item asserts.

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, (15): for an incomplete set `T` there is an index `k*` with
`W(A_{k*}) ≤ W(T) < W(A_{k*+1})` (where `W(S) = Σ_{i∈S} w_i`), `T` contains a fare beyond
`A_{k*}`, and a weight `θ ∈ [0, 1]` (the paper's `λ`) solving (15). -/
theorem exists_kstar_theta {n : ℕ} (w : Fin n → ℝ) (hw : ∀ j, 0 < w j)
    (T : Finset (Fin n)) (hT : ¬ IsComplete T) :
    ∃ k < n,
      ∑ i ∈ complete n k, w i ≤ ∑ i ∈ T, w i ∧
      ∑ i ∈ T, w i < ∑ i ∈ complete n (k + 1), w i ∧
      (∃ j ∈ T, k ≤ j.val) ∧
      ∃ θ : ℝ, 0 ≤ θ ∧ θ ≤ 1 ∧
        θ * ((∑ 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) := 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, definition of k* and eq. (15)
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