Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lacunary speeds: vi+1≥2viv_{i+1}\ge 2v_ivi+1​≥2vi​

Open
LonelyRunnerConjecture.lacunary_speeds

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

combinatoricsdiophantine-approximationnumber-theory

For k≥2k\ge2k≥2 and kkk positive integer speeds in which each speed is at least twice the previous one (when sorted), there is a time ttt with ∥tv∥≥1k+1\|tv\|\ge\frac{1}{k+1}∥tv∥≥k+11​ for every speed. The conjecture thus holds for geometrically growing (lacunary) speeds with ratio at least 222.

Formalization Note The hypothesis is written for all pairs a < b → 2*a ≤ b, which for a sorted set is equivalent to consecutive doubling vi+1≥2viv_{i+1}\ge2v_ivi+1​≥2vi​.

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 LonelyRunnerConjecture
Source
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
  • 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