Tao's logarithmic improvement of the union bound
OpenLonelyRunnerConjecture.tao_log_improvementcombinatoricsdiophantine-approximationnumber-theory
There is an absolute constant and a threshold such that for all and any distinct positive integer speeds, some time satisfies 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 LonelyRunnerConjectureSource
T. Tao, Some remarks on the lonely runner conjecture, https://arxiv.org/abs/1701.02048 (v4), Theorem 1.2.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.