Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 9, p. 23 — for x ≥ 0, max_S V_i(S)^γ_i (R_i(S) − x) equals max_{ϵ≥0} (v_i0+ϵ)^γ_i [K_i(ϵ)/(v_i0+ϵ) − x]

Proved
NestedLogitVariants.PartialCompetitive.nest_max_eq_knapsack_max

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

assortment-optimizationknapsacknested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a nested logit instance in which every dissimilarity parameter satisfies γi≤1\gamma_i \le 1γi​≤1, fix a nest iii and a number x≥0x \ge 0x≥0, and let Ki(ϵ)K_i(\epsilon)Ki​(ϵ) be the knapsack value of display (9). Then

max⁡Si⊆NVi(Si)γi(Ri(Si)−x)=max⁡ϵi≥0{(vi0+ϵi)γi[Ki(ϵi)vi0+ϵi−x]}.\max_{S_i \subseteq N} V_i(S_i)^{\gamma_i}\big(R_i(S_i) - x\big) = \max_{\epsilon_i \ge 0} \Big\{ (v_{i0} + \epsilon_i)^{\gamma_i} \Big[ \frac{K_i(\epsilon_i)}{v_{i0} + \epsilon_i} - x \Big] \Big\}.Si​⊆Nmax​Vi​(Si​)γi​(Ri​(Si​)−x)=ϵi​≥0max​{(vi0​+ϵi​)γi​[vi0​+ϵi​Ki​(ϵi​)​−x]}.

Equivalently, a number yyy satisfies y≥Vi(Si)γi(Ri(Si)−x)y \ge V_i(S_i)^{\gamma_i}(R_i(S_i) - x)y≥Vi​(Si​)γi​(Ri​(Si​)−x) for every assortment Si⊆NS_i \subseteq NSi​⊆N if and only if y≥(vi0+ϵ)γi[Ki(ϵ)/(vi0+ϵ)−x]y \ge (v_{i0} + \epsilon)^{\gamma_i}[K_i(\epsilon)/(v_{i0}+\epsilon) - x]y≥(vi0​+ϵ)γi​[Ki​(ϵ)/(vi0​+ϵ)−x] for every ϵ≥0\epsilon \ge 0ϵ≥0.

This identity turns the per-nest constraint of the linear program (3), one inequality per assortment, into a constraint indexed by a single capacity parameter, and is the core of Lemma 9.

Formalization Note Both maxima are attained (the left one over a finite family; the right one at a capacity equal to the weight of a knapsack-optimal assortment), so the equality of the two maxima is stated as: yyy bounds one family if and only if it bounds the other, without forming a real supremum. The hypothesis x≥0x \ge 0x≥0 is the page's; for x<0x < 0x<0 the right-hand family is unbounded.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_PartialCompetitive_Model
import Definitions.Def_NestedLogitVariants_PartialCompetitive_Knapsack
Formal statement
namespace NestedLogitVariants.PartialCompetitive

/-- Proof of Lemma 9, p. 23. For `x ≥ 0` and dissimilarity parameters at most one, the two maxima
`max_{S ⊂ N} V_i(S)^{γ_i} (R_i(S) − x)` and `max_{ε ≥ 0} (v_{i0} + ε)^{γ_i} [K_i(ε)/(v_{i0} + ε) − x]`
coincide; stated as: a number `y` bounds the first family iff it bounds the second. -/
theorem nest_max_eq_knapsack_max {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
    (hI : I.Standing)
    (hγ : ∀ i, I.γ i ≤ 1) (i : ι) (x : ℝ) (hx : 0 ≤ x) (y : ℝ) :
    (∀ S : Finset (Fin n), nestWeight I i S * (R I i S - x) ≤ y) ↔
      (∀ ε : ℝ, 0 ≤ ε → (I.vnp i + ε) ^ I.γ i * (Kval I i ε / (I.vnp i + ε) - x) ≤ y) := by sorry

end NestedLogitVariants.PartialCompetitive
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. 23, proof of Lemma 9, first display
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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