Proof of Lemma 3, p. 14 — with K₂ = M³(M + 1), H₂ = M(M + 1) as in Lemma 2, every plan with q₂ ≠ M costs more than the threshold
ProvedJRPHard.RangeDiv.item2_pinnedeoqjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1range-divisor
Let be integers with , and consider the periodic instance with , , , , . For all positive integers with ,
So no plan with reaches the threshold : item 2's heavy EOQ term pins , exactly as in the proof of Lemma 2.
Formalization Note The paper says only that are "sufficiently large … as in the proof … in Lemma 2". The statement uses Lemma 2's values, so the claim is about one explicit instance.
Preamble
import Mathlib import Definitions.Def_JRPHard_RangeDiv_Setting
Formal statement
namespace JRPHard.RangeDiv
theorem item2_pinned (M L U : ℕ) (hI : IsRangeDivisorInstance M L U) (q₁ q₂ : ℕ)
(hq₁ : 0 < q₁) (hq₂ : 0 < q₂) (hne : q₂ ≠ M) :
(threshold M L U : ℝ) < rangeCost M L U q₁ q₂ := by sorry
end JRPHard.RangeDiv
Source
Schulz and Telha, Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard, arXiv:2007.09045v1, p. 14, §3.1, proof of Lemma 3, first paragraph (with p. 11, proof of Lemma 2, "Optimal replenishment cycle for item 2")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.