Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (2) has a unique root

Proved
ConstrNestedLogit.Stitch.equation_2_unique

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

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

Fix a finite collection of candidate assortments in each nest, with at least one candidate per nest. Let Vi(Si)V_i(S_i)Vi​(Si​) be the total preference weight of the products in SiS_iSi​, Ri(Si)R_i(S_i)Ri​(Si​) their conditional expected revenue, γi∈(0,1]\gamma_i\in(0,1]γi​∈(0,1] the nest dissimilarity, and v0>0v_0>0v0​>0 the weight of no purchase. Then there is exactly one real number zzz satisfying equation (2):

v0z=∑i∈Mmax⁡Si∈Ai{Vi(Si)γi(Ri(Si)−z)}.v_0z=\sum_{i\in M}\max_{S_i\in A_i}\left\{V_i(S_i)^{\gamma_i}\bigl(R_i(S_i)-z\bigr)\right\}.v0​z=i∈M∑​Si​∈Ai​max​{Vi​(Si​)γi​(Ri​(Si​)−z)}.

This identifies the scalar value used to combine the candidate assortments. The paper states existence and uniqueness in the paragraph following Lemma 1 without a separate proof.

Formalization Note Nests form a finite type, and each AiA_iAi​ is a nonempty finite set of assortments. Products are indexed from zero. The main model uses vi0=0v_{i0}=0vi0​=0; strictly positive product weights and v0>0v_0>0v0​>0 make the probability model well defined. Revenues have no ordering or sign restriction.

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

/-- Section 2, p. 12: equation (2) has a unique solution for nonempty finite candidate
collections. -/
theorem equation_2_unique {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ}
    (I : NestedLogitVariants.LP.Instance ι n)
    (A : ι → Finset (Finset (Fin n)))
    (hA : ∀ i, (A i).Nonempty)
    (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) :
    ∃! z : ℝ, I.v0 * z = ∑ i, (A i).sup' (hA i) (fun S =>
      NestedLogitVariants.LP.nestWeight I i S * (NestedLogitVariants.LP.R I i S - z)) := 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, paragraph after Lemma 1, equation (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