Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(29), A.3 Case 2, p. 46 — if ẑ_i(ϵ) has no fractional component, 2ŷ_i ≥ (v_i0+ϵ)^γ_i [K_i(ϵ)/(v_i0+ϵ) − 2x̂]

Proved
NestedLogitVariants.PartialCompetitive.ineq_29

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 with γi≤1\gamma_i \le 1γi​≤1 for every nest and at least one product per nest, and let (x^,y^)(\hat x, \hat y)(x^,y^​) be an optimal solution of the linear program (4) over the candidate collections {S^i(ϵi):ϵi∈[0,∞]}∪{{j}:j∈N}\{\hat S_i(\epsilon_i) : \epsilon_i \in [0,\infty]\} \cup \{\{j\} : j \in N\}{S^i​(ϵi​):ϵi​∈[0,∞]}∪{{j}:j∈N}. Fix a nest iii and a capacity ϵ≥0\epsilon \ge 0ϵ≥0, and suppose that no component of the greedy solution z^i(ϵ)\hat z_i(\epsilon)z^i​(ϵ) of (11) lies strictly between 000 and 111. Then

2y^i≥(vi0+ϵ)γi[Ki(ϵ)vi0+ϵ−2x^].2\hat y_i \ge (v_{i0} + \epsilon)^{\gamma_i}\Big[\frac{K_i(\epsilon)}{v_{i0} + \epsilon} - 2\hat x\Big].2y^​i​≥(vi0​+ϵ)γi​[vi0​+ϵKi​(ϵ)​−2x^].

This is Case 2 of the proof of Theorem 10: here the constraint of (4) for S^i(ϵ)\hat S_i(\epsilon)S^i​(ϵ) alone dominates the knapsack value.

Formalization Note As for (28), the page states (29) at a maximizer ϵ^i\hat\epsilon_iϵ^i​; the statement here holds for every capacity ϵ≥0\epsilon \ge 0ϵ≥0, and the page's form Ki(ϵ)/(vi0+ϵ)1−γi−(vi0+ϵ)γi 2x^K_i(\epsilon)/(v_{i0}+\epsilon)^{1-\gamma_i} - (v_{i0}+\epsilon)^{\gamma_i}\,2\hat xKi​(ϵ)/(vi0​+ϵ)1−γi​−(vi0​+ϵ)γi​2x^ equals the bracket form for vi0+ϵ>0v_{i0} + \epsilon > 0vi0​+ϵ>0. The hypothesis n≥1n \ge 1n≥1 is the paper's nonempty NNN.

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

/-- Inequality (29), A.3 Case 2, p. 46: if `ẑ_i(ε)` has no fractional component, then
`2 ŷ_i ≥ (v_{i0} + ε)^{γ_i} [K_i(ε)/(v_{i0} + ε) − 2 x̂]`. Stated for every `ε ≥ 0`. -/
theorem ineq_29 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
    (hI : I.Standing)
    (hγ : ∀ i, I.γ i ≤ 1) (hn : 0 < n)
    (xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I (candidates I) xh yh)
    (i : ι) (ε : ℝ) (hε : 0 ≤ ε) (hnf : ∀ k, zhat I i ε k ∉ Set.Ioo (0 : ℝ) 1) :
    (I.vnp i + ε) ^ I.γ i * (Kval I i ε / (I.vnp i + ε) - 2 * xh) ≤ 2 * yh i := 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. 46, Appendix A.3, Case 2, display (29)
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