Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. 9 — for q₁ coprime with M, JRP^red(q₁) = (M − 1)²/q₁ + 4q₁ ≥ 4(M − 1)

Proved
JRPHard.Aperiodic.coprime_lower_bound

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

am-gminteger-factorizationjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let MMM be an odd composite number and let qqq be a positive integer coprime with MMM. Then lcm(q,M)=qM\mathrm{lcm}(q, M) = qMlcm(q,M)=qM, the reduced objective of problem (2) is

JRPred(q)=(M−1)2q+4q,\mathrm{JRP}^{\mathrm{red}}(q) = \frac{(M-1)^2}{q} + 4q ,JRPred(q)=q(M−1)2​+4q,

and consequently

JRPred(q) ≥ min⁡x∈R, x>0{(M−1)2x+4x}=4(M−1).\mathrm{JRP}^{\mathrm{red}}(q) \ \ge\ \min_{x \in \mathbb R,\, x>0}\left\{\frac{(M-1)^2}{x} + 4x\right\} = 4(M-1).JRPred(q) ≥ x∈R,x>0min​{x(M−1)2​+4x}=4(M−1).

Both the identity and the inequality are asserted.

So no period sharing no factor with MMM can do better than 4(M−1)4(M-1)4(M−1); an optimal q1q_1q1​ must share a non-trivial factor with MMM as soon as some other period beats 4(M−1)4(M-1)4(M−1).

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

theorem coprime_lower_bound (M : ℕ) (hodd : Odd M) (h1 : 1 < M) (hcomp : ¬ M.Prime)
    (q : ℕ) (hq : 0 < q) (hcop : Nat.Coprime q M) :
    jrpRed M q = ((M : ℝ) - 1) ^ 2 / (q : ℝ) + 4 * (q : ℝ) ∧
      4 * ((M : ℝ) - 1) ≤ jrpRed M q := 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, "First, let us show that gcd(q₁*, M) > 1"
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