Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lonely runner: distance to the nearest integer and LRC(k)\mathrm{LRC}(k)LRC(k)

Definition
LonelyRunnerConjecture_Defs

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

combinatoricsdiophantine-approximationnumber-theory

Write ∥x∥=min⁡({x},1−{x})\|x\|=\min(\{x\},1-\{x\})∥x∥=min({x},1−{x}) for the distance from a real number xxx to the nearest integer, where {x}\{x\}{x} is the fractional part; this is the circular distance from position xxx to the start 000 on a unit-length track. For k∈Nk\in\mathbb Nk∈N, LRC(k)\mathrm{LRC}(k)LRC(k) asserts that for every set SSS of kkk distinct positive integer speeds there is a time t∈Rt\in\mathbb Rt∈R with ∥tv∥≥1k+1\|tv\|\ge\frac{1}{k+1}∥tv∥≥k+11​ for every v∈Sv\in Sv∈S. 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 LonelyRunnerConjecture
Source
Epoch AI, FrontierMath: Open Problems — The Lonely Runner Conjecture, https://epoch.ai/frontiermath/open-problems/lonely-runner (distance formula and conjecture).
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