Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lonely runner conjecture

Open
LonelyRunnerConjecture.lonely_runner_conjecture

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

combinatoricsdiophantine-approximationnumber-theoryopen-problem

The lonely runner conjecture. Runners start together at 000 on a circular track of length 111, each with a distinct positive integer speed. For every k∈Nk\in\mathbb Nk∈N and every set of kkk distinct positive integer speeds v1,…,vkv_1,\dots,v_kv1​,…,vk​ there is a time ttt at which every runner is at distance at least 1k+1\frac{1}{k+1}k+11​ from the start:

∀k, ∀{v1,…,vk}⊂Z>0 distinct, ∃t∈R, ∀i, ∥tvi∥≥1k+1.\forall k,\ \forall\{v_1,\dots,v_k\}\subset\mathbb Z_{>0}\text{ distinct},\ \exists t\in\mathbb R,\ \forall i,\ \|tv_i\|\ge\tfrac{1}{k+1}.∀k, ∀{v1​,…,vk​}⊂Z>0​ distinct, ∃t∈R, ∀i, ∥tvi​∥≥k+11​.

Equivalently, every runner is sometimes lonely. The threshold 1k+1\frac{1}{k+1}k+11​ is best possible (Dirichlet approximation). A counterexample — a set of k≥2k\ge2k≥2 distinct positive integers such that at every time some runner is within <1k+1<\frac{1}{k+1}<k+11​ of 000 — would disprove the conjecture; this is the task posed by Epoch AI. The cases k=0,1k=0,1k=0,1 are trivial.

Formalization Note Speeds are a Finset ℕ of positive integers (distinctness automatic); ∥x∥\|x\|∥x∥ is distToNearestInt. The statement is ∀ k, LRC k.

Preamble
import Mathlib
import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture

theorem lonely_runner_conjecture : ∀ k : ℕ, LRC k := by sorry

end LonelyRunnerConjecture
Source
Epoch AI, FrontierMath: Open Problems — The Lonely Runner Conjecture, https://epoch.ai/frontiermath/open-problems/lonely-runner (Prompt and About sections).
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