Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 14, p. 43 — R_i(N_i,j−1) ≥ R_i(N_ij) for j = 2, …, n

Proved
NestedLogitVariants.Synergistic.R_nbr_antitone

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

assortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

For an instance with fully-captured nests (vi0=0v_{i0} = 0vi0​=0), revenues ordered ri1≥ri2≥⋯≥rinr_{i1} \ge r_{i2} \ge \dots \ge r_{in}ri1​≥ri2​≥⋯≥rin​ in each nest, and positive preference weights, the expected revenue of the nested-by-revenue assortments decreases along the nest: for every nest iii and every j∈{2,…,n}j \in \{2, \dots, n\}j∈{2,…,n},

Ri(Nij)≤Ri(Ni,j−1).R_i(N_{ij}) \le R_i(N_{i,j-1}).Ri​(Nij​)≤Ri​(Ni,j−1​).

Indeed Ri(Nij)=∑k=1jrikvik/∑k=1jvikR_i(N_{ij}) = \sum_{k=1}^j r_{ik} v_{ik} / \sum_{k=1}^j v_{ik}Ri​(Nij​)=∑k=1j​rik​vik​/∑k=1j​vik​ is a weighted average of the jjj largest revenues of nest iii. The fact gives αik1≥1\alpha^1_{ik} \ge 1αik1​≥1 in the proof of Theorem 7 (p. 43) and the first half of Lemma 14.

Formalization Note The standing assumptions are those of the model (see the Model definition) and of §4: every nest is fully captured, vi0=0v_{i0} = 0vi0​=0, and γi>1\gamma_i > 1γi​>1 for some nest iii (p. 16). Revenues need only be nonnegative here. The range j≥2j \ge 2j≥2 excludes Ri(Ni0)=Ri(∅)=0R_i(N_{i0}) = R_i(\emptyset) = 0Ri​(Ni0​)=Ri​(∅)=0.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_Synergistic_Model
Formal statement
namespace NestedLogitVariants.Synergistic

/-- Proof of Lemma 14, p. 43: since `r_{i1} ≥ ⋯ ≥ r_{in}`, `R_i(N_{ij})` is a weighted average of the
first `j` revenues of nest `i` and `R_i(N_{i,j−1}) ≥ R_i(N_{ij})` for `j = 2, …, n`. -/
theorem R_nbr_antitone {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
    (hI : I.Standing) (hfc : ∀ i, I.vnp i = 0) (hsyn : ∃ i, 1 < I.γ i)
    (i : ι) (j : ℕ) (hj2 : 2 ≤ j) (hjn : j ≤ n) :
    R I i (nbr n j) ≤ R I i (nbr n (j - 1)) := by sorry

end NestedLogitVariants.Synergistic
Source
Davis, Gallego, Topaloglu, Assortment optimization under variants of the nested logit model, revised manuscript of June 18, 2013 (published Oper. Res. 62(2), 2014, DOI 10.1287/opre.2014.1256), p. 43, proof of Lemma 14 (first two sentences), cited in Appendix A.1, p. 43
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