Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tao's logarithmic improvement of the union bound

Open
LonelyRunnerConjecture.tao_log_improvement

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

combinatoricsdiophantine-approximationnumber-theory

There is an absolute constant c>0c>0c>0 and a threshold NNN such that for all k≥Nk\ge Nk≥N and any kkk distinct positive integer speeds, some time ttt satisfies ∥tv∥≥12k+clog⁡kk2(log⁡log⁡k)2\|tv\|\ge \frac{1}{2k}+\frac{c\log k}{k^2(\log\log k)^2}∥tv∥≥2k1​+k2(loglogk)2clogk​ for every speed. This is the best known asymptotic lower bound on the gap of loneliness.

Formalization Note "Sufficiently large" is ∃ N, ∀ k ≥ N; logarithms are Real.log.

Preamble
import Mathlib
import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture

theorem tao_log_improvement :
    ∃ c : ℝ, 0 < c ∧ ∃ N : ℕ, ∀ k : ℕ, N ≤ k →
      ∀ S : Finset ℕ, S.card = k → (∀ v ∈ S, 0 < v) →
        ∃ t : ℝ, ∀ v ∈ S,
          (1 : ℝ) / (2 * k : ℝ)
            + c * Real.log (k : ℝ) / ((k : ℝ) ^ 2 * (Real.log (Real.log (k : ℝ))) ^ 2)
          ≤ distToNearestInt (t * (v : ℝ)) := by sorry

end LonelyRunnerConjecture
Source
T. Tao, Some remarks on the lonely runner conjecture, https://arxiv.org/abs/1701.02048 (v4), Theorem 1.2.
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