For five distinct positive integer speeds , write , where denotes distance to the nearest integer. Dividing all speeds by their gcd preserves . Call a set primitive if its gcd is one.
Theorem. The values of strictly below are exactly
This proves the five-speed case of Kravitz's Loneliness Spectrum Conjecture. The result concerns the entire five-speed spectrum below the threshold. The original conjecture has counterexamples at other numbers of speeds. Kravitz, 2021 · Fan and Sun, 2026
Classification outside the two known families. Call a set critical-family if it contains a dilation of or . Exactly twelve primitive sets outside these families have .
| Value | Primitive sets outside the two families |
|---|---|
| , , | |
| , , | |
| , , | |
| , |
Cordella found all twelve examples and their values by enumerating speeds through 130. His Theorem 6.4 left finitely many possible exceptions to the spectrum prediction. The new claim is the exhaustiveness of his list over all speeds. This is a computer-assisted, unrefereed proof. Cordella, §6.2
The finite problem
Cordella's Lemma 4.1 and Theorem 4.2 give the claimed form on both critical families. In particular realizes for every positive integer . Yi, Gill and Bu's Corollary 11.6(ii) proves that every primitive five-speed set with outside those families has Euclidean norm strictly below . We use these two papers as mathematical inputs. Write for the ordered positive speed vector under consideration. Cordella, §4 · Yi, Gill and Bu, §11.1
For an odd prime write . A residue vector has a witness if some multiplier makes for every coordinate. The rational time then gives . Existence of a witness is invariant under nonzero modular scaling, coordinate sign changes and permutations. Thus a vector with lacks a witness at every prime.
We use the following elementary observation twice. Suppose that for every prime in a finite set, at least one member of a fixed list of nonzero integers is divisible by that prime. Then the product of these distinct primes divides the absolute product of the integers. An upper bound strictly smaller than the prime product gives a contradiction.
First reduction to three parameters
Call an equation an additive relation, allowing . The first finite check certifies a set of primes with product greater than . At each such prime every set of five distinct nonzero folded residues without a witness has at least two additive relations up to signs, or contains a folded dilation of . In counting relations, a doubled speed and its target count once, and each unordered triple of distinct entries counts once. For distinct nonzero folded residues and , there is at most one sign choice up to overall sign on each such triple.
Here is how the check covers every set. Among ordered pairs of distinct entries choose the smallest folded quotient , and scale its denominator to one. The normalized set is , since any smaller remaining entry would be a smaller quotient by one. The ratios in both directions of every pair must fold to at least . For each admissible , start with every compatible . For each multiplier witnessing the first four entries, remove each witnessed by the same multiplier. Inspect every surviving set for the asserted additive relations. The program may discard a prime as soon as one counterexample to this modular assertion appears. Only fully checked primes count toward the product.
To lift this assertion, suppose the integer tuple has at most one relation and contains no dilation of . Form the following list, omitting identically zero values at this tuple.
- The five speeds and the twenty forms for .
- The forty forms for and the forty forms for .
- If the sole relation is in distinct speeds, the six forms .
The last six are nonzero under the supposition. A prime dividing none of the entries preserves distinct nonzero folded speeds and can create no extra additive relation. If a folded dilation of occurs, its three distinct coordinates give an additive relation. This must be the existing relation . After dividing by , the ratio must be one of modulo . Indeed the signed triple permutes a multiple of , up to overall sign, since . One of the six forms must then vanish modulo . Thus every certified prime divides the product of our list. Each of the at most 111 factors has absolute value at most by Cauchy–Schwarz. The certified prime product rules this out.
Consequently there are two additive relations, or there is a dilation of . Two different additive relations have independent coefficient rows. In the dilation case, after permuting coordinates use and . There are 50 possible additive rows in five positive coordinates, hence 1,225 unordered pairs, plus this last case.
The verifier identifies their kernels with nine three-dimensional spaces up to signed coordinate permutation, discarding kernels that force a zero or a repeated absolute speed. The certificate gives each space as the column span of a matrix . For reproducibility, two independent rows define their span by the ten minors up to a common factor. The complementary signed three-row minors of define its annihilator by the same coordinates. The checker compares these integer vectors after dividing by their gcd and fixing their sign. For discarded cases it checks membership of a coordinate row or a signed pair row in the span of by all three-row minors. Each listed contains the three signed unit rows. A signed permutation of in its column span therefore has form with and .
Second reduction to two parameters
For each matrix , the certificate supplies a list of integer rows of length three. The lists were found by fitting lines through modular points. Their validity follows from the following independent exhaustive test.
For a given prime, visit all projective points over . At each point either a coordinate of vanishes, the vector has a witness, or for some . Count the prime only if all points pass. Let be the resulting product, computed separately for each . The check establishes, in exact integers,
For an integer parameter with no witnesses, every counted prime must divide some in this list. This also holds when reduces to zero. If all were nonzero, Cauchy–Schwarz and the divisibility observation would contradict the displayed inequality. The speed coordinates are nonzero, so over the integers for some listed .
Choose an index with . With the other two entries of as free parameters, a speed row becomes the pair of coefficients for , after multiplying all speeds by . Only the ratio of the two free parameters matters. Take coprime representatives , allowing a common sign change, with and , and also check . The bound holds because both original parameters were entries of . Drop maps with a forced zero speed, repeated absolute speeds, or a forced critical quadruple. Removing identical maps leaves 164 maps.
Exhausting the rational directions
At each of the primes 50021 and 50023, for each remaining map, the verifier tests every slope on for a witness. For each surviving slope modulo 50021 it tries each . If , the only lifts in can be and . Test the second prime using , and retain coprime parameters. Both primes exceed , so is invertible. Convert every surviving direction to sorted primitive absolute speeds and apply the original distinctness, norm and critical-family restrictions. Exactly 317 different quintuples remain.
For each candidate an exact rational witness suffices to discard it. For the others the maximum can be computed at times with . For a maximum strictly between zero and , the minimum of the five triangular waves must have active slopes of opposite signs. Their distances agree, so their phases are negatives modulo one. A maximum of occurs only when every phase is and is also covered by a pair sum. Reflection reduces the numerators to . Comparing fractions gives exactly the twelve rows grouped in the table. This proves the classification and the theorem.
Five-distance consequence of Zhu's conjecture
If a set of five integer distances gives a triangle-free distance graph on , it has no additive relation. Every entry in the table and both critical families have such a relation. Hence some time satisfies for every distance. Color the integer by . Two phases in the same half-open interval have circular distance strictly less than , so this is a proper five-coloring. This proves the five-distance instance of Zhu's triangle conjecture. Barajas and Serra, 2008
Reproduction
Run from the repository root with Python 3.10 or later and a C++20 compiler.
python3 results/five-speed-spectrum/verify.pyThe verifier reads the nine maps and their proposed line covers, rebuilds the C++ arithmetic search, and recomputes all finite assertions, including the twelve exact values. All prime-product comparisons use unbounded integers. There is no Lean formalization of this result. Verifier · Finite-field enumeration · Line certificates