Expected dual value:
ProvedPersonalizedAssortment.IB.expected_dual_valueLet be any function with . Let be any selection rule and let be the inventory process it generates. Define with . Then
The identity expresses the expected objective of the dual certificate through the final inventory alone. It is the computation that precedes the weak-duality bound in the proof of Theorem 1.
Formalization Note is written as . The paper uses Lemma 2 to know that a product with zero inventory is never offered. Here the dynamics are used instead, together with : a stocked-out product contributes to both sides whether or not it is offered. So the identity holds for every selection rule, and neither Assumption 1 nor Lemma 2 is needed.
import Mathlib import Definitions.Def_PersonalizedAssortment_IB_ChoiceModel import Definitions.Def_PersonalizedAssortment_IB_InventoryBalancing
namespace PersonalizedAssortment.IB
/-- The expected-dual display of §A.3 (pp. 1548–1549):
`𝔼[∑_{t=1}^T λ^t] = 𝔼[∑_{i=1}^n r_i ∑_{k=I_i^T+1}^{c_i} Ψ(k/c_i)]`, where `λ^t` is evaluated at the
inventories `I^{t-1}` at the start of the period and the right side at the final inventories
`I^T`. -/
theorem expected_dual_value {n : ℕ} {Z : Type*} (r : Fin n → ℝ) (c : Fin n → ℕ)
(φ : Z → ChoiceModel n) (Ψ : ℝ → ℝ) (hΨ0 : Ψ 0 = 0) {T : ℕ} (z : Fin T → Z)
(sel : Fin T → (Fin n → ℕ) → Finset (Fin n)) :
∑ t : Fin T, expectInv φ z sel c t.val t.isLt.le (lamIB Ψ r c φ z sel t) =
expectInv φ z sel c T le_rfl
(fun I => ∑ i : Fin n, r i * ∑ k ∈ Finset.Ioc (I i) (c i), Ψ ((k : ℝ) / (c 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 .
- are arbitrary reals and are arbitrary naturals (possibly ).
- assigns to each a choice model (nonnegative , zero for , with ).
- .
- is an arbitrary selection mapping each and each to a subset , not required to satisfy any optimality or feasibility property.
- is arbitrary except that .
Expectation operator. Define for by the recursion
where and lowers coordinate by one, floored at . This is the expectation of for the chain that:
- starts at ;
- in step , from state , lowers coordinate with probability for each ;
- otherwise stays.
Conclusion. Write . The statement asserts
where the inner sum runs over the integers in and is empty when .
Degenerate cases.
- If , both sides are , since the right side is evaluated at .
- If , every ratio for product uses , giving , and the inner range is empty.
- If , both sides are .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.