Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. 9 — EOQ_{K₂,H₂}(M ± 1) = EOQ_{K₂,H₂}(M) + H₂/(M ± 1) ≥ EOQ_{K₂,H₂}(M) + K₀

Proved
JRPHard.Aperiodic.eoq_shift

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

eoqjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let M≥2M \ge 2M≥2 be an integer and consider item 2 of the instance of Lemma 1, with K2=M3(M2−1)K_2 = M^3(M^2-1)K2​=M3(M2−1) and H2=M(M2−1)H_2 = M(M^2-1)H2​=M(M2−1), and the discount K0=M(M−1)K_0 = M(M-1)K0​=M(M−1). Moving item 2's cycle one step away from MMM in either direction costs exactly H2/(M±1)H_2/(M\pm1)H2​/(M±1), and this is at least the discount K0K_0K0​:

EOQK2,H2(M±1)=EOQK2,H2(M)+H2M±1 ≥ EOQK2,H2(M)+K0.\mathrm{EOQ}_{K_2,H_2}(M \pm 1) = \mathrm{EOQ}_{K_2,H_2}(M) + \frac{H_2}{M \pm 1} \ \ge\ \mathrm{EOQ}_{K_2,H_2}(M) + K_0 .EOQK2​,H2​​(M±1)=EOQK2​,H2​​(M)+M±1H2​​ ≥ EOQK2​,H2​​(M)+K0​.

Both signs are asserted: the identity for M+1M+1M+1 and for M−1M-1M−1, and each added term is at least K0K_0K0​.

This is the computation that makes item 2's period rigid: no saving on the discount can pay for moving q2q_2q2​ away from MMM.

Formalization Note The cycle M−1M-1M−1 is the natural-number M−1M-1M−1, which equals the real M−1M-1M−1 because M≥2M \ge 2M≥2; the divisor M−1M-1M−1 on the right is real subtraction.

Preamble
import Mathlib
import Definitions.Def_JRPHard_Aperiodic_Setting
Formal statement
namespace JRPHard.Aperiodic

theorem eoq_shift (M : ℕ) (hM : 2 ≤ M) :
    (eoq2 M (M + 1) = eoq2 M M + (coefH2 M : ℝ) / ((M : ℝ) + 1) ∧
      (coefK0 M : ℝ) ≤ (coefH2 M : ℝ) / ((M : ℝ) + 1)) ∧
    (eoq2 M (M - 1) = eoq2 M M + (coefH2 M : ℝ) / ((M : ℝ) - 1) ∧
      (coefK0 M : ℝ) ≤ (coefH2 M : ℝ) / ((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. 9, proof of Lemma 1, "Optimal replenishment cycle for item 2", second display
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