Proof of Theorem 5: is increasing and is decreasing
ProvedAssortSearch.SearchQC.f_mono_g_antiassortment-planningconsumer-searchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let for all variants, , , , an assortment and . Let the cost be concave on and differentiable on . Then on the function
is nondecreasing, and the function
is nonincreasing, where .
The paper asserts this "by a similar argument as in Theorem 4" without further detail. It is the monotonicity used in both cases of the proof of Theorem 5.
Formalization Note "Increasing"/"decreasing" are stated in the weak sense (MonotoneOn, AntitoneOn), because may be constant (linear cost). The domain is , where all arguments of lie in .
Preamble
import Mathlib import Definitions.Def_AssortSearch_SearchQC_Model import Definitions.Def_AssortSearch_SearchQC_ProofTerms
Formal statement
namespace AssortSearch.SearchQC
/-- p. 15: for a cost `c` concave on `[0, 1]` and differentiable on `(0, 1)`, `f(v_j)` is
nondecreasing and `g(v_j)` is nonincreasing in `v_j > 0`. -/
theorem f_mono_g_anti {n : ℕ} (v : Fin n → ℝ) (v0 lam m : ℝ) (c : ℝ → ℝ)
(S : Finset (Fin n))
(hv : ∀ i, 0 < v i) (hv0 : 0 < v0) (hlam : 0 < lam)
(hconc : ConcaveOn ℝ (Set.Icc 0 1) c) (hdiff : DifferentiableOn ℝ c (Set.Ioo 0 1)) :
MonotoneOn (fFn m c lam (VS v v0 S)) (Set.Ioi 0) ∧
AntitoneOn (gFn m c lam v S (VS v v0 S)) (Set.Ioi 0) := by sorry
end AssortSearch.SearchQC
Source
Cachon, Terwiesch & Xu, Retail Assortment Planning in the Presence of Consumer Search, working paper (Dec. 20, 2002), p. 15 (PDF 17), proof of Theorem 5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.