Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 (Central Lemma), p. 15 — Φ is injective on the state space, so |𝒮| = |Φ⟨𝒮⟩|

Proved
ConsiderChoose.StateSpace.lemma_2

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

assortment-optimizationdynamic-programminginjectivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1state-space

Let C1,…,CK⊆[N]C_1,\dots,C_K\subseteq[N]C1​,…,CK​⊆[N] be consideration sets over products numbered in the common preference order, let S\mathcal SS be the state space of the dynamic program of §3 (the distinct nontrivial connected subproblems (S,T)(S,T)(S,T) generated from the components of G[[N],[K]]G[[N],[K]]G[[N],[K]] by stocking or skipping min⁡(S)\min(S)min(S)), and let

Φ(S,T)=[min⁡(S)]∩⋃u∈TCu⊆[N].\Phi(S,T)=[\min(S)]\cap\bigcup_{u\in T}C_u\subseteq[N].Φ(S,T)=[min(S)]∩u∈T⋃​Cu​⊆[N].

Then Φ\PhiΦ is injective on S\mathcal SS, and consequently

∣S∣=∣Φ⟨S⟩∣.|\mathcal S|=|\Phi\langle\mathcal S\rangle|.∣S∣=∣Φ⟨S⟩∣.

The lemma turns counting the states of the dynamic program into counting subsets of products, which is how Theorem 1 and the paper's later running-time bounds for structured consideration sets are obtained.

Formalization Note. S\mathcal SS is the inductively generated stateSpace C; trivial components (no product or no type) are not states. The second conjunct is the cardinality identity ∣Φ⟨S⟩∣=∣S∣|\Phi\langle\mathcal S\rangle|=|\mathcal S|∣Φ⟨S⟩∣=∣S∣ with Set.ncard on finite sets.

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

theorem lemma_2 {N K : ℕ} (C : Fin K → Finset (Fin N)) :
    Set.InjOn (fun p : Finset (Fin N) × Finset (Fin K) => Phi C p.1 p.2) (stateSpace C) ∧
      ((fun p : Finset (Fin N) × Finset (Fin K) => Phi C p.1 p.2) '' stateSpace C).ncard =
        (stateSpace C).ncard := by sorry

end ConsiderChoose.StateSpace
Source
Aouad, Farias & Levi (2021), Management Science 67(6), accepted manuscript (LBS eprint 1426), p. 15, Lemma 2 (Central Lemma)
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