Lonely runner conjecture (nonzero speeds)
OpenLonelyRunner.conjectureThe lonely runner conjecture (Wills, Cusick): runners run on a circular track of length , starting together, with pairwise distinct, nonzero constant speeds. Then there is a time at which every runner is at distance at least from the start — i.e. for every ,
where denotes the fractional part. The constant is best possible ( runners and the stationary start point make points on the circle, one pair within by pigeonhole at every time, and equality is attained by evenly spaced configurations).
The conjecture is open for ; it is known for (and for speed sets of special structure). This is the correctly stated form of the conjecture: the existing entries named lonely_runner_conjecture on this platform were disproved only because their statements allow a zero speed (a stationary runner is always at distance ), which is excluded here by the hypothesis .
Formalization Note Distance is Int.fract (speeds i * t), the fractional part as on the existing entries.
import Mathlib
namespace LonelyRunner
open Classical in
theorem conjecture (n : ℕ) (hn : 1 ≤ n)
(speeds : Fin n → ℝ)
(hnz : ∀ i, speeds i ≠ 0)
(hdist : ∀ i j : Fin n, i ≠ j → speeds i ≠ speeds j) :
∃ t : ℝ, 0 < t ∧
∀ i : Fin n,
let pos := Int.fract (speeds i * t)
(1 : ℝ) / (n + 1) ≤ pos ∧ pos ≤ 1 - 1 / (n + 1) := by
sorry
end LonelyRunner