Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: the LP-stitched assortment is best among candidate combinations

Proved
ConstrNestedLogit.Stitch.theorem_2

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

assortment-optimizationlinear-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For each nest iii, let AiA_iAi​ be a finite collection of candidate assortments. Suppose (z^,y^)(\widehat z,\widehat y)(z,y​) is an optimal solution of linear program (4), which minimizes zzz subject to v0z≥∑iyiv_0z\ge\sum_i y_iv0​z≥∑i​yi​ and yi≥Vi(Si)γi(Ri(Si)−z)y_i\ge V_i(S_i)^{\gamma_i}(R_i(S_i)-z)yi​≥Vi​(Si​)γi​(Ri​(Si​)−z) for every Si∈AiS_i\in A_iSi​∈Ai​. In each nest, choose a candidate S^i\widehat S_iSi​ that maximizes Vi(Si)γi(Ri(Si)−z^)V_i(S_i)^{\gamma_i}(R_i(S_i)-\widehat z)Vi​(Si​)γi​(Ri​(Si​)−z). Then

Π(S1,…,Sm)≤Π(S^1,…,S^m)for every combination Si∈Ai.\Pi(S_1,\ldots,S_m)\le\Pi(\widehat S_1,\ldots,\widehat S_m) \qquad\text{for every combination }S_i\in A_i.Π(S1​,…,Sm​)≤Π(S1​,…,Sm​)for every combination Si​∈Ai​.

Thus one LP optimum and independent nestwise maximizations select a highest-revenue combination from the supplied candidate collections.

Formalization Note Optimality in (4) means feasibility and minimum zzz over every feasible LP pair; feasibility alone does not suffice. The paper's candidates lie in CiC_iCi​, but no property of those sets is used in this comparison. Products are zero-indexed, vi0=0v_{i0}=0vi0​=0, v0>0v_0>0v0​>0, all product weights are positive, and γi∈(0,1]\gamma_i\in(0,1]γi​∈(0,1]. Revenues need not be ordered or nonnegative.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_LP_Model
Formal statement
namespace ConstrNestedLogit.Stitch

/-- Theorem 2, p. 12: the candidate combination selected at an optimum of (4)
maximizes expected revenue among all candidate combinations. -/
theorem theorem_2 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ}
    (I : NestedLogitVariants.LP.Instance ι n)
    (A : ι → Finset (Finset (Fin n)))
    (z : ℝ) (y : ι → ℝ) (S_hat : ι → Finset (Fin n))
    (hvnp : ∀ i, I.vnp i = 0)
    (hv0 : 0 < I.v0)
    (hv : ∀ i j, 0 < I.v i j)
    (hγ : ∀ i, 0 < I.γ i ∧ I.γ i ≤ 1)
    (hlp : NestedLogitVariants.LP.LP4Optimal I (fun i => (A i : Set (Finset (Fin n)))) z y)
    (hmem : ∀ i, S_hat i ∈ A i)
    (hmax : ∀ i S, S ∈ A i →
      NestedLogitVariants.LP.nestWeight I i S * (NestedLogitVariants.LP.R I i S - z) ≤
      NestedLogitVariants.LP.nestWeight I i (S_hat i) *
        (NestedLogitVariants.LP.R I i (S_hat i) - z)) :
    ∀ S : ι → Finset (Fin n), (∀ i, S i ∈ A i) →
      NestedLogitVariants.LP.revenue I S ≤ NestedLogitVariants.LP.revenue I S_hat := by sorry

end ConstrNestedLogit.Stitch
Source
Gallego & Topaloglu, Constrained Assortment Optimization for the Nested Logit Model, Management Science (2014), DOI 10.1287/mnsc.2014.1931; authors' manuscript of Sept. 11, 2013, p. 12, Theorem 2, equations (3)–(4)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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