Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One rounded family with both space guarantees

Proved
ConstrNestedLogit.Space.space_guarantee

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

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

For each nest with positive product preference and space weights, and individually feasible products, one collection Ai\mathcal A_iAi​ of rounded LP assortments and singletons works for every u≥0u\ge0u≥0. It has at most (n+1)2(n+1)^2(n+1)2 feasible members and always includes a two-approximate solution of problem (7). For every ϵ∈[0,1)\epsilon\in[0,1)ϵ∈[0,1) satisfying wij≤ϵciw_{ij}\le\epsilon c_iwij​≤ϵci​ for all products, the same collection also includes a 1/(1−ϵ)1/(1-\epsilon)1/(1−ϵ)-approximate solution at every u≥0u\ge0u≥0:

∀u≥0, ∃S2,Sϵ∈Ai:val⁡u(T)≤2val⁡u(S2),val⁡u(T)≤11−ϵval⁡u(Sϵ)for all T∈Ci.\forall u\ge0,\ \exists S_2,S_\epsilon\in\mathcal A_i:\quad \operatorname{val}_u(T)\le2\operatorname{val}_u(S_2),\quad \operatorname{val}_u(T)\le\frac{1}{1-\epsilon}\operatorname{val}_u(S_\epsilon) \quad\text{for all }T\in C_i.∀u≥0, ∃S2​,Sϵ​∈Ai​:valu​(T)≤2valu​(S2​),valu​(T)≤1−ϵ1​valu​(Sϵ​)for all T∈Ci​.

Here val⁡u(S)=Vi(S)(Ri(S)−u)\operatorname{val}_u(S)=V_i(S)(R_i(S)-u)valu​(S)=Vi​(S)(Ri​(S)−u). The two guarantees imply the factor min⁡{2,1/(1−ϵ)}\min\{2,1/(1-\epsilon)\}min{2,1/(1−ϵ)} claimed in §5.2, while keeping the candidate family fixed before uuu and ϵ\epsilonϵ.

Formalization Note Products form a nonempty finite set, and the within-nest no-purchase weight is zero. Positive preference and space weights are explicit.

Preamble
import Mathlib
import Definitions.Def_ConstrNestedLogit_Space_Model
Formal statement
namespace ConstrNestedLogit.Space

/-- The one quadratic-size family from §5.1 has both guarantees of §5.2. -/
theorem space_guarantee {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ}
    (I : NestedLogitVariants.LP.Instance ι n)
    (w : ι → Fin n → ℝ) (c : ι → ℝ) (i : ι)
    (hn : 0 < n)
    (hvnp : ∀ i, I.vnp i = 0) (hv : ∀ j, 0 < I.v i j)
    (hw : ∀ j, 0 < w i j) (hwc : ∀ j, w i j ≤ c i) :
    ∃ A : Finset (Finset (Fin n)),
      isRoundedCandidateFamily I w c i A ∧
      (∀ S ∈ A, spaceFeasible w c i S) ∧
      A.card ≤ (n + 1) ^ 2 ∧
      (∀ u : ℝ, 0 ≤ u → ∃ S ∈ A, isApproximateAt I w c i u 2 S) ∧
      (∀ ε : ℝ, 0 ≤ ε → ε < 1 → (∀ j, w i j ≤ ε * c i) →
        ∀ u : ℝ, 0 ≤ u → ∃ S ∈ A,
          isApproximateAt I w c i u (1 / (1 - ε)) S) := by sorry

end ConstrNestedLogit.Space
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. 22, concluding paragraph of §5.2
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