Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 1, p. 15 — if Φ(S₁,T₁) = Φ(S₂,T₂) and u′ ∈ T₂ \ T₁, then C_{u′} ∩ S₁ = ∅

Proved
ConsiderChoose.StateSpace.claim_1

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

assortment-optimizationdynamic-programmingp2o-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, and let S\mathcal SS be the state space of the dynamic program of §3: the subproblems (S,T)(S,T)(S,T) generated from the nontrivial connected components of G[[N],[K]]G[[N],[K]]G[[N],[K]] by repeatedly stocking or skipping the most preferred remaining product min⁡(S)\min(S)min(S) and splitting the residual graph into its nontrivial components. Let Φ(S,T)=[min⁡(S)]∩⋃u∈TCu\Phi(S,T)=[\min(S)]\cap\bigcup_{u\in T}C_uΦ(S,T)=[min(S)]∩⋃u∈T​Cu​.

Suppose (S1,T1),(S2,T2)∈S(S_1,T_1),(S_2,T_2)\in\mathcal S(S1​,T1​),(S2​,T2​)∈S satisfy Φ(S1,T1)=Φ(S2,T2)\Phi(S_1,T_1)=\Phi(S_2,T_2)Φ(S1​,T1​)=Φ(S2​,T2​), and let u′∈T2∖T1u'\in T_2\setminus T_1u′∈T2​∖T1​. Then

Cu′∩S1=∅.C_{u'}\cap S_1=\emptyset.Cu′​∩S1​=∅.

In the paper this claim is the key step of the proof of Lemma 2 (injectivity of Φ\PhiΦ on S\mathcal SS), which argues by contradiction from T2∖T1≠∅T_2\setminus T_1\neq\emptysetT2​∖T1​=∅.

Formalization Note. The hypotheses are exactly those under which the paper states and proves the claim (Appendix EC.1.1). Because the claim sits inside a proof by contradiction, Lemma 2 shows that they can never all hold, so this statement is equivalent, given the rest of the paper's argument, to the key step of Lemma 2; it is not a statement about an inhabited situation.

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

theorem claim_1 {N K : ℕ} (C : Fin K → Finset (Fin N))
    {S₁ S₂ : Finset (Fin N)} {T₁ T₂ : Finset (Fin K)}
    (h₁ : Reachable C S₁ T₁) (h₂ : Reachable C S₂ T₂) (hΦ : Phi C S₁ T₁ = Phi C S₂ T₂)
    {u' : Fin K} (hu : u' ∈ T₂ \ T₁) : C u' ∩ S₁ = ∅ := by sorry

end ConsiderChoose.StateSpace
Source
Aouad, Farias & Levi (2021), Management Science 67(6), accepted manuscript (LBS eprint 1426), p. 15, Claim 1 (proof of Lemma 2; proved in Appendix EC.1.1, p. ec1)
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