Proof of Lemma 1, p. 10 — multiples q₁ of M have JRP^red(q₁) = 4q₁ ≥ 4M, while JRP^red((M − 1)/2) ≤ 4(M − 1)
ProvedJRPHard.Aperiodic.multiple_of_Minteger-factorizationjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be an odd composite number.
- If is a positive multiple of , then every replenishment of item 1 is a joint one, and
- At the period ,
Since , no multiple of minimizes problem (2); hence every minimizer satisfies .
Formalization Note is natural-number division, exact because is odd.
Preamble
import Mathlib import Definitions.Def_JRPHard_Aperiodic_Setting
Formal statement
namespace JRPHard.Aperiodic
theorem multiple_of_M (M : ℕ) (hodd : Odd M) (h1 : 1 < M) (hcomp : ¬ M.Prime) :
(∀ q : ℕ, 0 < q → M ∣ q → jrpRed M q = 4 * (q : ℝ) ∧ 4 * (M : ℝ) ≤ jrpRed M q) ∧
jrpRed M ((M - 1) / 2) ≤ 4 * ((M : ℝ) - 1) := 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. 10, proof of Lemma 1, "Next, let us show that gcd(q₁*, M) < M"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.