Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2 — the products with v^j=rj\hat v_j=r_jv^j​=rj​ form an optimal assortment

Proved
MarkovChainChoice.Assortment.dual_tight_set_optimal

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

assortment-optimizationchoice-modelslp-dualityp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (λ,ρ)(\lambda,\rho)(λ,ρ) be a Markov chain choice model on N={1,…,n}N=\{1,\dots,n\}N={1,…,n} (with λj>0\lambda_j>0λj​>0, ρj,i≥0\rho_{j,i}\ge0ρj,i​≥0, ∑iρj,i<1\sum_i\rho_{j,i}<1∑i​ρj,i​<1) and r∈Rnr\in\mathbb R^nr∈Rn revenues. Let v^\hat vv^ be an optimal solution of

min⁡v∈Rn{∑j∈Nλjvj: vj≥rj  ∀j∈N,  vj≥∑i∈Nρj,ivi  ∀j∈N}(Dual)\min_{v\in\mathbb R^n}\Big\{\sum_{j\in N}\lambda_jv_j:\ v_j\ge r_j\ \ \forall j\in N,\ \ v_j\ge\sum_{i\in N}\rho_{j,i}v_i\ \ \forall j\in N\Big\}\qquad\text{(Dual)}v∈Rnmin​{j∈N∑​λj​vj​: vj​≥rj​  ∀j∈N,  vj​≥i∈N∑​ρj,i​vi​  ∀j∈N}(Dual)

and define S^={j∈N:v^j=rj}\hat S=\{j\in N:\hat v_j=r_j\}S^={j∈N:v^j​=rj​}. Then S^\hat SS^ is an optimal solution of the assortment problem:

∑j∈NPj,S rj ≤ ∑j∈NPj,S^ rjfor every S⊆N,\sum_{j\in N}P_{j,S}\,r_j\ \le\ \sum_{j\in N}P_{j,\hat S}\,r_j\qquad\text{for every } S\subseteq N,j∈N∑​Pj,S​rj​ ≤ j∈N∑​Pj,S^​rj​for every S⊆N,

where (PS,RS)(P_S,R_S)(PS​,RS​) is the solution of the (Balance) equations for the offer set SSS.

The assortment problem over 2n2^n2n offer sets is thereby solved by one linear program with nnn variables, which makes it tractable.

Formalization Note. The theorem is stated for every optimal solution v^\hat vv^ of (Dual) (the paper's "the optimal solution"; the proof uses only optimality). S^\hat SS^ is defined by equality v^j=rj\hat v_j=r_jv^j​=rj​, and revenues carry no sign assumption.

Preamble
import Mathlib
import Definitions.Def_MarkovChainChoice_Assortment_Model
import Definitions.Def_MarkovChainChoice_Assortment_LinearPrograms
Formal statement
namespace MarkovChainChoice.Assortment

theorem dual_tight_set_optimal {n : ℕ} (M : Model n) (r v : Fin n → ℝ)
    (hv : IsDualOptimal M r v) :
    IsOptimalAssortment M r (Finset.univ.filter (fun j => v j = r j)) := by sorry

end MarkovChainChoice.Assortment
Source
Feldman, Topaloglu, Revenue Management Under the Markov Chain Choice Model, Oper. Res. 65(5), 2017, p. 1326, Theorem 2
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me