Trivial union bound
ProvedLonelyRunnerConjecture.trivial_boundcombinatoricsdiophantine-approximationnumber-theory
For every and any distinct positive integer speeds, there is a time at which every runner is at distance at least from the start. This is the trivial union-bound lower bound on the gap of loneliness, a factor of two short of the conjecture.
Formalization Note Stated for a Finset ℕ of cardinality with positive speeds; the bound is (1:ℝ)/(2*k).
Preamble
import Mathlib import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture
theorem trivial_bound (k : ℕ) (hk : 1 ≤ k) (S : Finset ℕ) (hS : S.card = k)
(hpos : ∀ v ∈ S, 0 < v) :
∃ t : ℝ, ∀ v ∈ S, (1 : ℝ) / (2 * k : ℝ) ≤ distToNearestInt (t * (v : ℝ)) := by sorry
end LonelyRunnerConjectureSource
T. Tao, Some remarks on the lonely runner conjecture, https://arxiv.org/abs/1701.02048 (v4), Proposition 1.1.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.