Lemma 2: inventory balancing never offers a stocked-out product
ProvedPersonalizedAssortment.IB.lemma2_never_offers_stocked_outLet and , and let be a family of feasible assortments with that is closed under removing a product: and imply . Suppose the choice models satisfy Assumption 1 (substitutability). Let be a penalty function ( increasing, , ) and let be an inventory-balancing selection rule. That rule maximizes the index and, among the maximizers, has the fewest products. Then for every period and every inventory vector ,
In words, the algorithm never offers an assortment that contains a product with zero remaining inventory.
Lemma 2 shows that inventory balancing respects the capacity constraints: it never tries to sell a unit it does not have.
Formalization Note The paper proves Lemma 2 in its online appendix and states it under Assumption 1 only. Closure of under removing a product is added, because without it the lemma is false. For example, take with product stocked out and product in stock with positive index: the rule must offer . Every example family in the paper (cardinality, budget and shelf-space constraints) is closed under removal. The claim is made for every inventory vector between and , which covers every state the process can reach.
import Mathlib import Definitions.Def_PersonalizedAssortment_IB_ChoiceModel import Definitions.Def_PersonalizedAssortment_IB_PenaltyFunction import Definitions.Def_PersonalizedAssortment_IB_InventoryBalancing
namespace PersonalizedAssortment.IB
/-- Lemma 2 (p. 1538): under Assumption 1, the inventory-balancing algorithm never offers an
assortment containing a product with zero remaining inventory. Stated for every inventory vector
`I ≤ c` and every period. Added hypothesis `hdel`: the feasible family is closed under removing a
product (without it the lemma is false). -/
theorem lemma2_never_offers_stocked_out {n : ℕ} {Z : Type*} (r : Fin n → ℝ)
(hr : ∀ i, 0 < r i) (c : Fin n → ℕ) (hc : ∀ i, 0 < c i) (𝒮 : Finset (Finset (Fin n)))
(h𝒮 : ∅ ∈ 𝒮) (hdel : ∀ S ∈ 𝒮, ∀ j ∈ S, S.erase j ∈ 𝒮) (φ : Z → ChoiceModel n)
(hsub : Substitutable 𝒮 φ) (Ψ : ℝ → ℝ) (hΨ : IsPenaltyFunction Ψ) {T : ℕ} (z : Fin T → Z)
(sel : Fin T → (Fin n → ℕ) → Finset (Fin n)) (hsel : IsIBRule Ψ r c 𝒮 φ z sel)
(t : Fin T) (I : Fin n → ℕ) (hI : ∀ i, I i ≤ c i) :
∀ i ∈ sel t I, 0 < I i := by sorry
end PersonalizedAssortment.IB
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Data.
- Products are and periods are .
- and naturals for all .
- is a finite family of subsets of such that , and for every and every also .
- assigns to each a choice model (nonnegative , zero for , with ).
Substitutability hypothesis. For every , every and all ,
Penalty hypothesis. maps into , is nondecreasing on , and has and .
Selection hypothesis. For every period and every :
- ;
- maximizes over ;
- no maximizer in has fewer elements than .
Conclusion. For any period and any vector with for all , every product has . The vector is not required to be reachable by any process.
Degenerate cases. If , there is no period, and the statement is vacuous. If , is empty and the conclusion holds trivially.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.