Lemma 4, p. 36 — v + k + δJ(0) ≥ δJ(X): with outside option 0 the consumer always redeems
ProvedBuyXFree.Threshold.lemma_4dynamic-programmingloyalty-programp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reward-program
Throughout, the standing assumptions of §3 hold: , , , , , and the program has a threshold . denotes any solution of the optimality equations (1)–(2) of the consumer facing price and threshold . For every price ,
That is, a consumer holding points always redeems when the outside option is .
Preamble
import Mathlib import Definitions.Def_BuyXFree_Threshold_Model
Formal statement
namespace BuyXFree.Threshold
/-- Lemma 4, p. 36: `v + k + δJ(0) ≥ δJ(X)`; with outside option `0` the consumer always
redeems. -/
theorem lemma_4 (P : Params) (hP : P.Standing) (p : ℝ) (X : ℕ) (hX : 1 ≤ X)
(J : ℕ → ℝ) (hJ : IsValueFn P p X J) :
P.v + P.k + P.δ * J 0 ≥ P.δ * J X := by sorry
end BuyXFree.Threshold
Source
Liu, Sun & Zhang, An Analysis of "Buy X, Get One Free" Reward Programs, accepted manuscript (Operations Research 69(6), 2021; version of March 26, 2021), p. 36, Lemma 4 (stated in the proof of Proposition 2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.