Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.6, p. 53 — the optimal x̂ of (4) over the powers-of-δ candidates is nonnegative

Proved
NestedLogitVariants.PowersDelta.xh_nonneg

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

approximation-algorithmsassortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Throughout, the instance satisfies the standing assumptions of §1, there is at least one product (n≥1n \ge 1n≥1), γˉ=max⁡i∈Mγi\bar\gamma = \max_{i \in M} \gamma_iγˉ​=maxi∈M​γi​ satisfies γˉ>1\bar\gamma > 1γˉ​>1 (the standing assumption of §6, p. 25), and δ>1\delta > 1δ>1. Let (x^,y^)(\hat x, \hat y)(x^,y^​) be an optimal solution of problem (4) when the candidate collection of nest iii is {S^il:l=liL,…,liU}∪{∅}\{\hat S_{il} : l = l^L_i, \dots, l^U_i\} \cup \{\emptyset\}{S^il​:l=liL​,…,liU​}∪{∅}, and the assortments S^il\hat S_{il}S^il​ have the two properties of p. 28: whenever problem (15) at level lll is feasible, S^il\hat S_{il}S^il​ is feasible for it and δ∑j∈S^ilrijvij≥G^il\delta \sum_{j \in \hat S_{il}} r_{ij} v_{ij} \ge \hat G_{il}δ∑j∈S^il​​rij​vij​≥G^il​. Then

x^≥0.\hat x \ge 0.x^≥0.

This is the first step of the proof of Theorem 12: it lets the factor δ2γˉ+1\delta^{2\bar\gamma+1}δ2γˉ​+1 multiply x^\hat xx^ in an inequality without reversing it.

Formalization Note The assortments S^il\hat S_{il}S^il​ enter as an arbitrary family with the two properties of p. 28 (IsPowersFamily): the statement holds for every such family, which includes the one Proposition 15 constructs. A level with no feasible assortment imposes nothing on S^il\hat S_{il}S^il​. Optimality of (x^,y^)(\hat x, \hat y)(x^,y^​) for (4) is feasibility plus minimality of x^\hat xx^ among feasible points. γˉ\bar\gammaγˉ​ is passed as the greatest element of {γi}\{\gamma_i\}{γi​}, so there is at least one nest.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_PowersDelta_Levels
Formal statement
namespace NestedLogitVariants.PowersDelta

/-- A.6, p. 53: "By using the same argument at the beginning of the proof of Theorem 10, it
follows that x̂ ≥ 0." Here `(x̂, ŷ)` is an optimal solution of (4) over the candidate collections
`{Ŝ_il : l = l^L_i, …, l^U_i} ∪ {∅}`. -/
theorem xh_nonneg {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} [NeZero n] (I : Instance ι n)
    (hI : I.Standing) (γbar : ℝ) (hγbar : IsGreatest (Set.range I.γ) γbar) (hγbar1 : 1 < γbar)
    (δ : ℝ) (hδ : 1 < δ)
    (Sh : ι → ℤ → Finset (Fin n)) (hSh : IsPowersFamily I δ Sh)
    (xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I (powersCandidates I δ Sh) xh yh) :
    0 ≤ xh := by sorry

end NestedLogitVariants.PowersDelta
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. 53, Appendix A.6, first sentence of the proof of Theorem 12 (argument of the proof of Theorem 10, p. 45)
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