Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, pp. 9–10 — the interval [(M − 1)/2 − (p − 1)/2, (M − 1)/2 + (p − 1)/2] contains a multiple q of p with JRP^red(q) < 4(M − 1)

Proved
JRPHard.Aperiodic.exists_good_multiple

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

integer-factorizationjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pigeonhole

Let MMM be an odd composite number and let ppp be a divisor of MMM with 3≤p<M3 \le p < M3≤p<M (so ppp is odd). Then there is a positive integer qqq that is a multiple of ppp, lies in the integer interval

[M−12−p−12, M−12+p−12]∩Z+,\left[\frac{M-1}{2} - \frac{p-1}{2},\ \frac{M-1}{2} + \frac{p-1}{2}\right] \cap \mathbb Z^+,[2M−1​−2p−1​, 2M−1​+2p−1​]∩Z+,

and satisfies

JRPred(q) < 4(M−1).\mathrm{JRP}^{\mathrm{red}}(q) \ <\ 4(M-1).JRPred(q) < 4(M−1).

Combined with the coprime lower bound, this shows that every minimizer q1∗q_1^*q1∗​ of problem (2) satisfies gcd⁡(q1∗,M)>1\gcd(q_1^*, M) > 1gcd(q1∗​,M)>1.

Formalization Note Because MMM and ppp are odd, both endpoints are integers; they are written with natural-number division and subtraction, (M - 1) / 2 - (p - 1) / 2 and (M - 1) / 2 + (p - 1) / 2, which are exact here (and the lower endpoint (M−p)/2(M-p)/2(M−p)/2 is positive since p<Mp < Mp<M).

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

theorem exists_good_multiple (M : ℕ) (hodd : Odd M) (h1 : 1 < M) (hcomp : ¬ M.Prime)
    (p : ℕ) (hpM : p ∣ M) (hp3 : 3 ≤ p) (hplt : p < M) :
    ∃ q : ℕ, 0 < q ∧ p ∣ q ∧
      (M - 1) / 2 - (p - 1) / 2 ≤ q ∧ q ≤ (M - 1) / 2 + (p - 1) / 2 ∧
      jrpRed M q < 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, pp. 9–10, proof of Lemma 1, "This upper bound, as a continuous function of q, is strictly convex …"
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