Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reduction from real to integer speeds

Open
LonelyRunnerConjecture.real_speeds_reduction

by LG · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsdiophantine-approximationnumber-theory

If the conjecture holds for kkk positive integer speeds (LRC(k)\mathrm{LRC}(k)LRC(k)), then it holds for any kkk distinct positive real speeds: there is a time ttt with ∥tvi∥≥1k+1\|t v_i\|\ge\frac{1}{k+1}∥tvi​∥≥k+11​ for all iii. This is the classical reduction justifying the restriction to integer speeds.

Formalization Note Real speeds are a function Fin k → ℝ, positive and injective; the integer case is the hypothesis LRC k.

Preamble
import Mathlib
import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture

theorem real_speeds_reduction (k : ℕ) (h : LRC k) (v : Fin k → ℝ)
    (hpos : ∀ i, 0 < v i) (hinj : Function.Injective v) :
    ∃ t : ℝ, ∀ i, (1 : ℝ) / (k + 1 : ℝ) ≤ distToNearestInt (t * v i) := by sorry

end LonelyRunnerConjecture
Source
R. D. Malikiosis, F. Santos, M. Schymura, Linearly-exponential checking is enough for the LRC, https://arxiv.org/abs/2411.06903, §1.1 (reduction to integer velocities; Wills Lemma 5, Betke–Wills Lemma 1; Bohman–Holzman–Kleitman 2001; Henze–Malikiosis 2017).
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 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