Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classical small cases: up to seven runners (k≤6k\le 6k≤6)

Open
LonelyRunnerConjecture.classical_small_cases

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

combinatoricsdiophantine-approximationnumber-theory

The conjecture holds for every k≤6k\le6k≤6 (up to seven runners). This combines the classical cases: k=1k=1k=1 trivial, k=2k=2k=2 Wills, k=3k=3k=3 Betke–Wills, k=4k=4k=4 Cusick–Pomerance, k=5k=5k=5 Bohman–Holzman–Kleitman, k=6k=6k=6 Barajas–Serra.

Formalization Note Stated as ∀ k ≤ 6, LRC k.

Preamble
import Mathlib
import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture

theorem classical_small_cases : ∀ k : ℕ, k ≤ 6 → LRC k := by sorry

end LonelyRunnerConjecture
Source
G. Perarnau, O. Serra, The Lonely Runner Conjecture turns 60, https://arxiv.org/abs/2409.20160, §6 (Small number of runners); Barajas–Serra 2008, https://arxiv.org/abs/0710.4495.
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