Work

The rank of short integer relations in the lonely runner problem

Year: 2026
Type: preprint
Abstract: For n positive speeds, suppose that at every time at least one runner is within distance 1/(n+1) of the origin on the unit circle. We prove that the speeds satisfy at least n/2 - O(n/log n) linearly independent integer relations, each of Euclidean length O(sqrt(n) (log n)^2). This includes both equality configurations and potential counterexamples. The proof weights times by a product of trigonometric polynomials. A two-coordinate deletion lemma controls each remaining runner under this same weight. The argument applies to real speeds as well as integer speeds. As an application, assuming the lonely runner conjecture in all smaller dimensions, every primitive integer counterexample in dimension n satisfies log ||v||_2 <= (3/4) n log n + O(n log log n). The rank estimate itself requires no lower-dimensional hypothesis. Version 2 adds a Lean 4 formalization (Lean 4.24.0, Mathlib commit f897ebcf72cd16f89ab4577d0c826cd14afaafc7; axioms propext, Classical.choice, Quot.sound only; no sorry). It proves Theorem 1 for all positive real speeds and n >= 4 with H = 5 ceil(sqrt n) ceil(log2(2n))^2, both in the form n/2 - 100 n/log n <= k_H(v) and in the sharper finite form of the manuscript. For Theorem 2 it formalizes the hole step, the determinant descent and the final (3/4) n log n estimate, taking the determinant split, the short-determinant bound, the covering constant and the lattice descent as explicit hypotheses; the rational-subspace separation lemma, the dual-lattice covolume identities and the reverse Minkowski / Poisson summation step are not formalized. The paper PDF and LaTeX source are unchanged from version 1. The mathematical development, formalization, checking programs and English exposition were prepared with substantial assistance from AI systems.
Language: English
Open Access status: green
OpenAlex ID: W7236815902
Cites:
Cited by:
Related to: 10