Lonely runner: distance to the nearest integer and
DefinitionLonelyRunnerConjecture_Defscombinatoricsdiophantine-approximationnumber-theory
Write for the distance from a real number to the nearest integer, where is the fractional part; this is the circular distance from position to the start on a unit-length track. For , asserts that for every set of distinct positive integer speeds there is a time with for every . These two declarations are the shared vocabulary of the mission; distToNearestInt equals |x - round x|.
Definition code
import Mathlib
namespace LonelyRunnerConjecture
/-- The distance from a real number `x` to the nearest integer,
`min (fract x, 1 - fract x)`, where `fract x = Int.fract x` is the fractional part.
Equivalently, the circular distance from position `x` to the starting point `0`
on a track of unit length. -/
noncomputable def distToNearestInt (x : ℝ) : ℝ :=
min (Int.fract x) (1 - Int.fract x)
/-- The lonely runner conjecture for `k` moving runners: for every set `S` of `k`
distinct positive integer speeds, there is a time `t` at which every runner is at
distance at least `1 / (k + 1)` from the starting point `0`. -/
noncomputable def LRC (k : ℕ) : Prop :=
∀ S : Finset ℕ, S.card = k → (∀ v ∈ S, 0 < v) →
∃ t : ℝ, ∀ v ∈ S, (1 : ℝ) / (k + 1 : ℝ) ≤ distToNearestInt (t * (v : ℝ))
end LonelyRunnerConjectureSource
Epoch AI, FrontierMath: Open Problems — The Lonely Runner Conjecture, https://epoch.ai/frontiermath/open-problems/lonely-runner (distance formula and conjecture).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.