For eight distinct positive integer speeds relative to a stationary runner, write , where the norm denotes distance to the nearest integer.
Theorem. If , then is a dilation of . Conversely every such dilation has .
The nine-runner lonely runner bound was previously proved. Goddyn and Wong found only the consecutive speeds in their finite nine-runner census. Here we establish the equality classification without a speed cutoff. Our argument uses the established lower bounds for smaller numbers of runners. Trakulthongchai · Goddyn and Wong, §1
Product bound
Divide by the gcd and suppose is primitive. The prefix bound for successive minima used in the eight-runner proof gives
Here are the details in this dimension. On the projection of to , let be the successive minima of the central section of the unit sup-norm ball. Its seven-dimensional volume is at least by Vaaler's theorem, and the projected lattice has covolume . Hence by Minkowski's second theorem. The circle of comes within of every point of the torus obtained by lifting the first independent minimum vectors. This follows by rounding the lift coefficients and absorbing the components parallel to into its circle parameter. This torus is coordinate-free. Successive coalescence of coordinates gives it loneliness at least from the known lower-dimensional bounds. Thus the prefix sums of the minima dominate the prefix sums of
Indeed the latter are . For these entries , sum by parts using the nonincreasing weights . This gives . Eight-runner argument · Yi, Gill and Bu, §11 · Prior prefix bounds for speed products, Remark 3.9
Write . By the arithmetic-geometric mean inequality, . Every divides some speed: otherwise gives loneliness at least . Thus divides . This is the strict-witness version of Rosenfeld's forced-divisor observation. Lemma 3.10 and references
A mixed-modulus assertion
For each of the following 26 primes , a primitive tuple with either has a strict witness on the -grid or is a signed permuted unit multiple of modulo :
To verify the assertion, fold nonzero residues modulo to . Enumerate every eight-element set with no strict witness on the -grid up to multiplication by a nonzero scalar. For completeness, normalize a pair with least folded quotient over both orders to ; all remaining members exceed . Enumerate completions in increasing order with every folded pair quotient at least , intersecting the witness masks of the chosen speeds. Remove a possible last speed whenever a multiplier witnesses the whole set. Modular enumerator
A smaller witnessless support extends to a witnessless eight-element set, since adding a speed can only remove witnessing times. Check every nonempty subset of each enumerated set; if it has no witness, try all positive multiplicities giving a total of eight entries. This includes every folded multiset, up to the same symmetries. For each resulting tuple :
- For , enumerate the vectors modulo with . Exclude if some pair , satisfies for all . This gives a strict witness at time . Coordinate signs act on both residues, and a common unit modulo merely reindexes .
- Combine each surviving pair , into and run the same test with . The two smaller grids are contained in this larger one.
- For every survivor explicitly find a signed permutation of and units such that and for every . To do so, try all , determine the possible index and sign for each folded entry, require that all eight different indices are used, and try both units modulo six. Each sign and index is uniquely determined for fixed when it exists, since . The Chinese remainder theorem provides a common unit modulo . Undoing the initial normalization modulo just changes this unit.
The program verifies the assertion for every listed prime. The integer comparison ensures at least one of them does not divide . Lift checker · Prime and product verifier
Lifting the direction
For this prime our tuple has no strict witness, so there is a signed permutation of the consecutive speeds with for an integer . Set . If are independent, is an integer vector and generate a rational plane. Its torus has loneliness at least by coordinate coalescence and the known bound in at most seven speeds. Every phase on this plane can be represented by with , since is integral. The phase differs from it by , of sup norm at most . The loneliness function is 1-Lipschitz. Consequently
where the last inequality follows from . This contradiction forces parallelism. Primitivity and positivity yield the consecutive speeds. At these speeds attain , and among two are always at circular distance at most . This proves both directions.
The classification is an unrefereed computer-assisted result without a Lean formalization. Run the verifier with Python 3.10 or later and a C++20 compiler from the repository root.
python3 results/tight-eight-speeds/verify.py