Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. 9 — for q₂ ≠ M, JRP(q₁, q₂) ≥ EOQ_{K₂,H₂}(M) + K₀ + 4 > JRP(1, M)

Proved
JRPHard.Aperiodic.item2_pinned

by mikedeng1 · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

eoqinteger-factorizationjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let MMM be an odd composite number and let JRP\mathrm{JRP}JRP be the aperiodic objective of the instance of Lemma 1 (K1=K0=M(M−1)K_1 = K_0 = M(M-1)K1​=K0​=M(M−1), H1=4H_1 = 4H1​=4, K2=M3(M2−1)K_2 = M^3(M^2-1)K2​=M3(M2−1), H2=M(M2−1)H_2 = M(M^2-1)H2​=M(M2−1)). For all positive integers q1,q2q_1, q_2q1​,q2​ with q2≠Mq_2 \ne Mq2​=M,

JRP(q1,q2) ≥ 4q1+min⁡{EOQK2,H2(M−1), EOQK2,H2(M+1)}\mathrm{JRP}(q_1,q_2) \ \ge\ 4q_1 + \min\{\mathrm{EOQ}_{K_2,H_2}(M-1),\ \mathrm{EOQ}_{K_2,H_2}(M+1)\}JRP(q1​,q2​) ≥ 4q1​+min{EOQK2​,H2​​(M−1), EOQK2​,H2​​(M+1)}

and

JRP(q1,q2) ≥ EOQK2,H2(M)+K0+4.\mathrm{JRP}(q_1,q_2) \ \ge\ \mathrm{EOQ}_{K_2,H_2}(M) + K_0 + 4 .JRP(q1​,q2​) ≥ EOQK2​,H2​​(M)+K0​+4.

Moreover this lower bound already exceeds the value of the plan (1,M)(1, M)(1,M):

JRP(1,M) < EOQK2,H2(M)+K0+4.\mathrm{JRP}(1, M) \ <\ \mathrm{EOQ}_{K_2,H_2}(M) + K_0 + 4 .JRP(1,M) < EOQK2​,H2​​(M)+K0​+4.

Together these show that every plan with q2≠Mq_2 \ne Mq2​=M is strictly worse than (1,M)(1,M)(1,M), so every optimal plan has q2=Mq_2 = Mq2​=M.

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
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me