Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, p. 8 — the tightness instance has CAP value at least αm/2

Proved
CustAssort.Value.thm31_cap_lower

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

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

In the paper's instance with m≥1m\ge1m≥1 products and types, parameter a>0a>0a>0, and parameter b≥1b\ge1b≥1, let α=(∑j=1ma−j)−1\alpha=(\sum_{j=1}^m a^{-j})^{-1}α=(∑j=1m​a−j)−1. Then

zCAP≥αm2.z_{\rm CAP}\ge\frac{\alpha m}{2}.zCAP​≥2αm​.

This is the customized-revenue side of the explicit family showing that the factor mmm in Theorem 3.1 has the right order.

Formalization Note The instance has n=K=mn=K=mn=K=m and uses the paper's ri=air_i=a^iri​=ai, θj=α/aj\theta_j=\alpha/a^jθj​=α/aj, and vij=bm−i+1v_{ij}=b^{m-i+1}vij​=bm−i+1 for i≤ji\le ji≤j (zero otherwise).

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

/-- The personalized-revenue lower bound in the proof of Theorem 3.1, page 8. -/
theorem thm31_cap_lower (m : ℕ) (a b : ℝ)
    (hm : 1 ≤ m) (ha : 0 < a) (hb : 1 ≤ b) :
    alpha a m * (m : ℝ) / 2 ≤ zCAP (thetaI a m) (vI b m) (revI a m) m := 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, display z_CAP ≥ α·m/2
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