Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (3.1), p. 8 — split weighted MNL revenue by the diagonal product

Proved
CustAssort.Value.eq_3_1

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≥0b\ge0b≥0, let SSS be any assortment and jjj any customer type. Separate the numerator of θjRev⁡j(S)\theta_j\operatorname{Rev}_j(S)θj​Revj​(S) into products i<ji<ji<j and the possible product jjj. Equation (3.1) is

θjRev⁡j(S)=θj∑i∈S, i<jaibm−i+11+∑i∈S, i≤jbm−i+1+α1{j∈S}bm−j+11+∑i∈S, i≤jbm−i+1.\theta_j\operatorname{Rev}_j(S)=\theta_j\frac{\sum_{i\in S,\ i<j}a^i b^{m-i+1}}{1+\sum_{i\in S,\ i\le j}b^{m-i+1}}+\alpha\frac{\mathbf1_{\{j\in S\}}b^{m-j+1}}{1+\sum_{i\in S,\ i\le j}b^{m-i+1}}.θj​Revj​(S)=θj​1+∑i∈S, i≤j​bm−i+1∑i∈S, i<j​aibm−i+1​+α1+∑i∈S, i≤j​bm−i+11{j∈S}​bm−j+1​.

This decomposition isolates the two contributions bounded separately in the proof of Theorem 3.1.

Formalization Note firstTerm and secondTerm are the two displayed fractions. The paper's indices start at one; Lean's start at zero, so i≤j−1i\le j-1i≤j−1 is i < j.

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

/-- Equation (3.1), page 8: the weighted type revenue splits before and at `j`. -/
theorem eq_3_1 (m : ℕ) (a b : ℝ) (ha : 0 < a) (hb : 0 ≤ b)
    (S : Finset (Fin m)) (j : Fin m) :
    thetaI a m j * CustAssort.AugGreedy.rev (vI b m) (revI a m) j S =
      firstTerm a b S j + secondTerm a b S j := 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, (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