Dirichlet sharpness of the threshold
ProvedLonelyRunnerConjecture.dirichlet_sharpnesscombinatoricsdiophantine-approximationnumber-theory
For every integer and every real time , some speed satisfies . This is Dirichlet's approximation theorem; it shows the conjectured threshold cannot be increased, since the speed set never has all runners strictly farther than from the start.
Formalization Note The set is Finset.Icc 1 k; the hypothesis excludes the empty range.
Preamble
import Mathlib import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture
theorem dirichlet_sharpness (k : ℕ) (hk : 1 ≤ k) (t : ℝ) :
∃ v ∈ Finset.Icc 1 k, distToNearestInt (t * (v : ℝ)) ≤ (1 : ℝ) / (k + 1 : ℝ) := by sorry
end LonelyRunnerConjectureSource
R. D. Malikiosis, F. Santos, M. Schymura, Linearly-exponential checking is enough for the LRC, https://arxiv.org/abs/2411.06903, §1.1 (Dirichlet's approximation theorem); Tao §1, eq. (1.1).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.