Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, p. 8 — the diagonal term decays from the smallest product

Proved
CustAssort.Value.thm31_second_term

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

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

On the paper's instance with a>0a>0a>0 and b≥1b\ge1b≥1, let SSS be a nonempty assortment, let ℓS\ell_SℓS​ be its smallest product index, and take j∈Sj\in Sj∈S. The diagonal-product term in equation (3.1) satisfies

αbm−j+11+∑i∈S, i≤jbm−i+1≤αbj−ℓS.\alpha\frac{b^{m-j+1}}{1+\sum_{i\in S,\ i\le j}b^{m-i+1}}\le\frac{\alpha}{b^{j-\ell_S}}.α1+∑i∈S, i≤j​bm−i+1bm−j+1​≤bj−ℓS​α​.

This is the second contribution to the MMNL upper bound. For j∉Sj\notin Sj∈/S the diagonal term is zero.

Formalization Note Both jjj and ℓS\ell_SℓS​ are 0-based in Lean, so their difference remains j−ℓSj-\ell_Sj−ℓS​. Membership j∈Sj\in Sj∈S ensures this exponent is nonnegative.

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

/-- The second-term bound following equation (3.1), page 8. -/
theorem thm31_second_term (m : ℕ) (a b : ℝ) (hb : 1 ≤ b) (ha : 0 < a)
    (S : Finset (Fin m)) (hS : S.Nonempty) (j : Fin m) (hj : j ∈ S) :
    secondTerm a b S j ≤ alpha a m / b ^ (j.val - (S.min' hS).val) := 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. 8, proof of Theorem 3.1, second-term display after (3.1)
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