Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, p. 7 — a type contribution is bounded by the MMNL optimum

Proved
CustAssort.Value.thm31_type_bound

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

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

Fix positive product revenues, nonnegative preference weights, nonnegative type arrival weights, and a cardinality budget KKK. For any customer type qqq and any carried set SSS with ∣S∣≤K|S|\le K∣S∣≤K, its personalized expected contribution satisfies

θqfq(S)≤zMMNL.\theta_q f_q(S)\le z_{\rm MMNL}.θq​fq​(S)≤zMMNL​.

The type-optimal subassortment is feasible as a common MMNL offer, whose other type contributions are nonnegative. This is the typewise comparison used for the upper bound in Theorem 3.1.

Formalization Note The source applies this comparison to a CAP-optimal S∗S^*S∗; the statement records the same comparison for every feasible SSS. Normalization of θ\thetaθ is not needed for this intermediate inequality.

Preamble
import Mathlib
import Definitions.Def_CustAssort_Value_Setting
Formal statement
namespace CustAssort.Value

/-- The typewise upper bound in the proof of Theorem 3.1, page 7. -/
theorem thm31_type_bound {n m : ℕ} (K : ℕ) (r : Fin n → ℝ)
    (v : Fin n → Fin m → ℝ) (θ : Fin m → ℝ)
    (hr : ∀ i, 0 < r i) (hv : ∀ i j, 0 ≤ v i j) (hθ : ∀ j, 0 ≤ θ j) :
    ∀ (q : Fin m) (S : Finset (Fin n)), S.card ≤ K →
      θ q * CustAssort.AugGreedy.fj v r q S ≤ zMMNL θ v r K := by sorry

end CustAssort.Value
Source
El Housni & Topaloglu, Joint Assortment Optimization and Customization under a Mixture of Multinomial Logit Models: Value of Personalized Assortments, SSRN 3830082 (version of December 7, 2021), p. 7, proof of Theorem 3.1, displayed type-q comparison
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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