Lacunary speeds:
OpenLonelyRunnerConjecture.lacunary_speedscombinatoricsdiophantine-approximationnumber-theory
For and positive integer speeds in which each speed is at least twice the previous one (when sorted), there is a time with for every speed. The conjecture thus holds for geometrically growing (lacunary) speeds with ratio at least .
Formalization Note The hypothesis is written for all pairs a < b → 2*a ≤ b, which for a sorted set is equivalent to consecutive doubling .
Preamble
import Mathlib import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture
theorem lacunary_speeds (k : ℕ) (hk : 2 ≤ k) (S : Finset ℕ) (hS : S.card = k)
(hpos : ∀ v ∈ S, 0 < v)
(hdoub : ∀ a ∈ S, ∀ b ∈ S, a < b → 2 * a ≤ b) :
∃ t : ℝ, ∀ v ∈ S, (1 : ℝ) / (k + 1 : ℝ) ≤ distToNearestInt (t * (v : ℝ)) := by sorry
end LonelyRunnerConjectureSource
G. Perarnau, O. Serra, The Lonely Runner Conjecture turns 60, https://arxiv.org/abs/2409.20160, Theorem 18 (Barajas–Serra, On the chromatic number of circulant graphs, 2009).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.