Proof of Theorem 3.1, p. 8 — the diagonal term decays from the smallest product
ProvedCustAssort.Value.thm31_second_termassortment-optimizationcustomizationmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
On the paper's instance with and , let be a nonempty assortment, let be its smallest product index, and take . The diagonal-product term in equation (3.1) satisfies
This is the second contribution to the MMNL upper bound. For the diagonal term is zero.
Formalization Note Both and are 0-based in Lean, so their difference remains . Membership 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.