Proof of Lemma 1, p. 9 — for q₂ ≠ M, JRP(q₁, q₂) ≥ EOQ_{K₂,H₂}(M) + K₀ + 4 > JRP(1, M)
ProvedJRPHard.Aperiodic.item2_pinnedeoqinteger-factorizationjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be an odd composite number and let be the aperiodic objective of the instance of Lemma 1 (, , , ). For all positive integers with ,
and
Moreover this lower bound already exceeds the value of the plan :
Together these show that every plan with is strictly worse than , so every optimal plan has .
Preamble
import Mathlib import Definitions.Def_JRPHard_Aperiodic_Setting
Formal statement
namespace JRPHard.Aperiodic
theorem item2_pinned (M : ℕ) (hodd : Odd M) (h1 : 1 < M) (hcomp : ¬ M.Prime) :
(∀ q₁ q₂ : ℕ, 0 < q₁ → 0 < q₂ → q₂ ≠ M →
4 * (q₁ : ℝ) + min (eoq2 M (M - 1)) (eoq2 M (M + 1)) ≤ lemma1Cost M q₁ q₂ ∧
eoq2 M M + (coefK0 M : ℝ) + 4 ≤ lemma1Cost M q₁ q₂) ∧
lemma1Cost M 1 M < eoq2 M M + (coefK0 M : ℝ) + 4 := by sorry
end JRPHard.Aperiodic
Source
Schulz and Telha, Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard, arXiv:2007.09045v1, p. 9, proof of Lemma 1, "Optimal replenishment cycle for item 2"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.