Let consist of nine distinct positive integer speeds relative to a stationary runner. Write , where denotes distance to the nearest integer.
Theorem. The only primitive tuple with is up to order. Its loneliness is exactly .
Here primitive means that the gcd of the speeds is one. Scaling all speeds by a common positive integer preserves loneliness. The lower bound for ten runners is already known. The classification here rules out every other equality case. Goddyn and Wong list a finite census; their one-entry acceleration theorem and Zhang's one-entry replacement result address specified families of speed sets. Trakulthongchai · Goddyn and Wong · Zhang
Bounding the product of the speeds
Assume . Let be the orthogonal projection of to . Since is primitive, extending it to an integer basis gives . Use a Korkine–Zolotarev basis of this Euclidean lattice. Write for the squared Gram–Schmidt lengths, . Set
The space spanned by and integer lifts of the first basis vectors is rational of dimension and has no identically zero coordinate. Its torus therefore has loneliness at least by coordinate coalescence and the known lower-dimensional lonely runner bounds. Nearest-plane rounding in reverse basis order bounds the distance to the circle of by . Indeed the rounding leaves each Gram–Schmidt coefficient of the projected difference in ; the component parallel to can be absorbed into the circle parameter. The sup distance is at most the Euclidean distance. This gives , including the possible equality at . Allikvere, Lemma 3.3 and Proposition 3.4
The Korkine–Zolotarev ratio bound gives . Each , as can be checked directly with the displayed fractions. Allikvere's product minimization lemma therefore gives . Its hypotheses allow non-strict prefix inequalities. As , the arithmetic-geometric mean inequality gives
Every divides some , since otherwise would witness loneliness at least . Hence divides . Allikvere, Lemmas 3.5–3.6 and 3.10
A shift test for residue classes
Fix and set . If there is at least one speed not divisible by , the condition
implies .
The speeds divisible by comprise at most eight runners. Their known lonely runner bound gives a time with all their distances at least . Take a nearby time at which their distances still exceed and none of the phases of the other speeds at the finitely many times hits either endpoint of the forbidden arc . If the divisible subset is empty, take any time avoiding those endpoints. A divisible speed keeps its phase at every translate. Another speed visits equally spaced phases with multiplicity . On the arc of length , at most different phases can occur because the endpoints were avoided. A union bound over the translates proves the claim. This test uses only the residues modulo and the lower-dimensional bound. Related common-divisor shift arguments
The modular certificate
Use the 28 primes
They are coprime to 2520. For their product the exact inequality shows that one of them divides no speed.
For each listed we establish the following finite implication. If and , then is congruent modulo to a unit multiple of a signed permutation of the consecutive speeds. The checker follows these steps.
- On the -grid fold signs and enumerate every nine-element support without a strict witness up to common scaling. Normalize the pair with least folded quotient to , then visit all increasing completions for which every pair has both folded quotients at least . At each prefix intersect the available witness masks, removing only extensions that admit an actual witness. Every smaller witnessless support extends to a witnessless nine-element set. For each representative test every nonempty subset and enumerate all multiplicities totaling nine on each witnessless subset. Prime-grid enumerator
- For each resulting tuple of residues modulo try all primitive assignments modulo 2 and modulo 3. For modulus , an actual strict witness is a pair , with for every coordinate, where brackets give the absolute folded residue. This is the time . Discard assignments admitting a witness; also discard those excluded by the shift test ( needs at least nonzero entries). Combine surviving mod-2 and mod-3 assignments by . Test the -grid.
- For surviving assignments try every unit multiplier modulo and both units modulo 6 to find a common signed permutation of giving and up to those multipliers. For fixed multiplier modulo the indices and signs, if present, are unique since . The Chinese remainder theorem gives a unit modulo . Normalizing the original speeds by a common scalar modulo only reindexes on each grid. Folding a speed also signs its residue modulo the auxiliary modulus, for which every assignment has been included.
- For every unaligned survivor try the shift test for every divisor of 6. Otherwise enumerate all its lifts modulo 12. If each lift admits a grid witness or is excluded by the shift test on a divisor of 12, then the original tuple is excluded. If a lift survives, perform the corresponding universal test for all lifts of the mod-6 assignment modulo 18. A true tuple would have to admit a surviving lift in both tests. Every unaligned survivor is excluded. Lift and translate checker · Exact integer checks and reproduction driver
From a modular match to equality over the integers
For the prime not dividing , put . There is a signed permutation of with . If the directions were independent, and the integer vector would span a coordinate-free plane. Its torus has loneliness at least by coordinate coalescence and the known bound for eight speeds. Every phase on it has a representation with modulo the integer vector . This differs from by , so its distance to the circle is at most . The loneliness function is 1-Lipschitz, hence
because every listed prime satisfies . This contradiction forces parallelism. Primitivity and positivity give the claimed set. Its value at is ; the circular gap bound among gives the matching upper bound.
The proof uses published lower-dimensional lonely runner inequalities. Its equality classification is an unrefereed computer-assisted result without a Lean formalization. Reproduce all finite checks from the repository root with Python 3.10 or later and a C++20 compiler.
python3 results/tight-nine-speeds/verify.py