Reduction from real to integer speeds
OpenLonelyRunnerConjecture.real_speeds_reductioncombinatoricsdiophantine-approximationnumber-theory
If the conjecture holds for positive integer speeds (), then it holds for any distinct positive real speeds: there is a time with for all . 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 LonelyRunnerConjectureSource
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.