Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 12 — J(S,T) is the sum of J over the connected components of G[S,T]

Proved
ConsiderChoose.StateSpace.lemma_1

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

assortment-optimizationconnected-componentsdynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a consider-then-choose instance with a unique ranking: products [N][N][N] numbered in preference order, prices PiP_iPi​, customer types [K][K][K] with consideration sets CjC_jCj​ and weights λj\lambda_jλj​. For S⊆[N]S\subseteq[N]S⊆[N] and T⊆[K]T\subseteq[K]T⊆[K] let J(S,T)=max⁡A⊆S∑j∈TλjRev(j,A)J(S,T)=\max_{A\subseteq S}\sum_{j\in T}\lambda_j\mathrm{Rev}(j,A)J(S,T)=maxA⊆S​∑j∈T​λj​Rev(j,A), and let (Su,Tu)u∈[r](S_u,T_u)_{u\in[r]}(Su​,Tu​)u∈[r]​ be the connected components of the bipartite graph G[S,T]G[S,T]G[S,T] (an edge joins product iii and type jjj when i∈Cji\in C_ji∈Cj​). Then

J(S,T)=∑u=1rJ(Su,Tu).J(S,T)=\sum_{u=1}^{r}J(S_u,T_u).J(S,T)=u=1∑r​J(Su​,Tu​).

The lemma says that the subproblem splits into independent subproblems, one per connected component. It is the base case of the dynamic program and is applied again after every stocking decision.

Formalization Note. The sum runs over all components of G[S,T]G[S,T]G[S,T], including isolated products ({k},∅)(\{k\},\emptyset)({k},∅) and isolated types (∅,{j})(\emptyset,\{j\})(∅,{j}), as in the paper's partition; each of these contributes 000. No sign or normalisation condition on λ\lambdaλ or PPP is assumed: the identity holds for every instance, so the standing assumption that λ\lambdaλ is a probability vector is not needed and not carried.

Preamble
import Mathlib
import Definitions.Def_ConsiderChoose_StateSpace_Model
Formal statement
namespace ConsiderChoose.StateSpace

theorem lemma_1 {N K : ℕ} (I : Instance N K) (S : Finset (Fin N)) (T : Finset (Fin K)) :
    J I S T = ∑ p ∈ comps I.C S T, J I p.1 p.2 := by sorry

end ConsiderChoose.StateSpace
Source
Aouad, Farias & Levi (2021), Management Science 67(6), accepted manuscript (LBS eprint 1426), p. 12, Lemma 1
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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