Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9, p. 23 — with γ_i ≤ 1, problems (3) and (10) have the same optimal solutions

Proved
NestedLogitVariants.PartialCompetitive.lemma_9

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

assortment-optimizationknapsacklinear-programmingnested-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 (the no-purchase weights vi0≥0v_{i0} \ge 0vi0​≥0 are arbitrary), with at least one product per nest. Let (3) be the linear program

min⁡ xs.t.v0x≥∑i∈Myi,yi≥Vi(Si)γi(Ri(Si)−x)  ∀Si⊆N, i∈M,\min\ x \quad \text{s.t.}\quad v_0 x \ge \sum_{i \in M} y_i,\quad y_i \ge V_i(S_i)^{\gamma_i}(R_i(S_i) - x)\ \ \forall S_i \subseteq N,\ i \in M,min xs.t.v0​x≥i∈M∑​yi​,yi​≥Vi​(Si​)γi​(Ri​(Si​)−x)  ∀Si​⊆N, i∈M,

and (10) the program in which the second family of constraints is replaced by yi≥max⁡ϵi≥0{(vi0+ϵi)γi[Ki(ϵi)/(vi0+ϵi)−x]}y_i \ge \max_{\epsilon_i \ge 0}\{(v_{i0}+\epsilon_i)^{\gamma_i}[K_i(\epsilon_i)/(v_{i0}+\epsilon_i) - x]\}yi​≥maxϵi​≥0​{(vi0​+ϵi​)γi​[Ki​(ϵi​)/(vi0​+ϵi​)−x]}. Then for every xxx and y=(y1,…,ym)y = (y_1, \dots, y_m)y=(y1​,…,ym​),

(x,y) is optimal for (3)  ⟺  (x,y) is optimal for (10).(x, y) \text{ is optimal for (3)} \iff (x, y) \text{ is optimal for (10)}.(x,y) is optimal for (3)⟺(x,y) is optimal for (10).

Lemma 9 is what lets §5 work with knapsack problems in place of the assortment problem.

Formalization Note An optimal solution is a feasible pair whose xxx is no larger than that of any feasible pair. The hypothesis n≥1n \ge 1n≥1 (the paper's N={1,…,n}N = \{1, \dots, n\}N={1,…,n} is nonempty) is added: with no products, all vi0=0v_{i0} = 0vi0​=0 and v0=0v_0 = 0v0​=0, problem (3) has no optimal solution while (0,0)(0, 0)(0,0) is optimal for (10).

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

/-- Lemma 9, p. 23: with dissimilarity parameters at most one, problems (3) and (10) have the same
optimal solutions. -/
theorem lemma_9 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
    (hI : I.Standing)
    (hγ : ∀ i, I.γ i ≤ 1) (hn : 0 < n) (x : ℝ) (y : ι → ℝ) :
    LP3Optimal I x y ↔ LP10Optimal 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, Lemma 9
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