Proof of Theorem 5: and are positive and increasing, and is increasing
ProvedAssortSearch.SearchQC.D_K_pos_increasingassortment-planningconsumer-searchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and , and for put
Then:
- and for every ;
- and are strictly increasing on ;
- the ratio is strictly increasing on .
The paper asserts these facts without proof. They are used in Case (1) of the proof of Theorem 5, where is written as a positive term times an increasing one.
Formalization Note The paper says "increasing"; the strict form is stated, which holds for all , .
Preamble
import Mathlib import Definitions.Def_AssortSearch_SearchQC_ProofTerms
Formal statement
namespace AssortSearch.SearchQC
/-- pp. 15–16: for `λ > 0` and `V_S > 0`, `D` and `K` are positive and increasing on
`v_j ∈ [0, ∞)`, and so is `K/D`. -/
theorem D_K_pos_increasing (lam VS : ℝ) (hlam : 0 < lam) (hVS : 0 < VS) :
(∀ x ∈ Set.Ici (0 : ℝ), 0 < Dfn lam VS x ∧ 0 < Kfn lam VS x) ∧
StrictMonoOn (Dfn lam VS) (Set.Ici 0) ∧
StrictMonoOn (Kfn lam VS) (Set.Ici 0) ∧
StrictMonoOn (fun x => Kfn lam VS x / Dfn lam VS x) (Set.Ici 0) := by sorry
end AssortSearch.SearchQC
Source
Cachon, Terwiesch & Xu, Retail Assortment Planning in the Presence of Consumer Search, working paper (Dec. 20, 2002), pp. 15-16 (PDF 17-18), proof of Theorem 5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.