For distinct positive integer speeds , put , where is the distance to the nearest integer. Divide the speeds by their gcd and sort them. This preserves since time ranges over the entire circle.
Theorem. The primitive septuples with are precisely for and the 27 rows of the exact table. Consequently the complete set of values below is
In particular the seven-speed case of the Amended Loneliness Spectrum Conjecture holds. For a reduced fraction the only possible values of are 1 and 2. Fan and Sun reported and . Cordella's exhaustive table through maximum speed 50 agrees with the theorem on that range. The five sporadic rows beyond that range have largest speeds 52, 54, 65, 71 and 112. For example has maximum , attained at . Fan and Sun · Cordella, §6.3
Reducing to a finite set of primes
For a rational subspace , write . The associated torus is compact. We use the established plane gap in this repository. Every rational two-plane contained in no coordinate hyperplane has , except possibly signed permutations of . The classification uses the six-speed spectrum and a finite enumeration of planes on two independent lines with repeated speeds. The near-tight primitive tuples on these product planes are exactly our stated infinite family, with for every . Henceforth let be near-tight and on none of the product planes. Plane gap and its dependencies · Product-plane calculation
Project orthogonally onto . Primitivity gives the projected lattice covolume , by extending to an integral basis and taking base times height. Let be its successive minima in the sup norm. Vaaler's lower bound on the central section volume and Minkowski's second theorem give . Lift independent projected vectors attaining these minima to integer vectors . On , reduce each coefficient of modulo one to absolute value at most . Absorb the components parallel to into its coefficient. Every phase on this torus is within in sup norm of the speed circle. Loneliness is 1-Lipschitz in this norm. Vaaler · Yi, Gill and Bu, §11
The lower bounds for in increasing dimension are . The first follows from the plane gap. The others follow by coalescing coordinates on a rational line and applying the known lonely runner bounds for at most five distinct speeds, as in the seven-coordinate norm argument. Since , the partial sums of the minima strictly exceed the corresponding partial sums of
Indeed these latter sums equal twice the respective lower bounds minus . Concavity gives . Summation by parts with nonincreasing weights gives a strictly positive sum. Therefore .
Set . For each , a speed is divisible by , since otherwise would give loneliness at least . Thus , while AM–GM gives . Take the primes
They are coprime to 420 and their product satisfies . The verifier checks this with integers. At least one of the primes therefore divides no coordinate of .
A short modular vector determines the integer direction
Suppose , , and . The multiplier need not be a unit. If is independent of , put . Every phase on their plane can be represented with . Its distance from on the speed circle is at most . Thus the plane has loneliness strictly below . This contradicts the plane gap because it contains . Hence is parallel to . Sorting the absolute coordinates of and dividing out their gcd recovers the primitive tuple. A zero coordinate or a repeated absolute coordinate rules the direction out.
Exhausting the modular possibilities
Fix a listed prime dividing no speed. Write . A witness at modulus is a multiplier with for every . Such a multiplier excludes the tuple.
At enumerate folded supports of size seven up to common unit, individual signs and permutation. For a pair consider the smaller of . Choose the minimum over all distinct pairs and rescale so the selected pair becomes . All other members are larger than , since each is itself a quotient against 1. Enumerate them in order with all pairwise minima at least . Intersect the witness-time masks as coordinates are added. Any smaller witnessless support extends to a witnessless seven-element support, since extra constraints only remove witness times. Test all subsets of each returned support and add all multiplicities giving length seven. Canonicalize a multiset by dividing by each of its distinct members, folding and sorting, and choosing the least result. Prime enumerator · Multiset enumeration
Above a surviving representative , starting at , consider all lifts modulo . A parent unit lifts to a child unit, so representatives preserve coverage. For even the unit toggles the bits at precisely the odd coordinates. We may therefore fix the bit at the first odd entry to zero. At any even modulus the all-even class violates primitivity. A class with just one odd speed is impossible as well. The six even speeds admit a time with all distances at least by the six-speed lonely runner theorem. At that time and half a turn later their phases agree, while one of the two odd-speed distances is at least .
For each odd , the two possible distances in numerator units in coordinate are and . Exclude all children where each chosen distance is at least . If a choice in every coordinate gives distance at most , the choice is unique since the two options sum to . The centered residues form a short modular vector. On an actual primitive tuple the vector is nonzero, because the residue vector of a primitive integer tuple has order and . The short-vector lemma either excludes the child or supplies its only possible integer direction, which we retain for exact testing. Signs, permutation and multiplication by a common unit in the modular representation only permute or sign the recovered coordinates or change the multiplier of the lemma.
Repeat on each unresolved child. The executable fails on any unresolved node at depth ten. All nineteen trees terminate before that bound and yield 10,179 distinct candidate integer directions in total. Trying only odd multipliers can leave extra work, but every deletion has one of the justifications above. Binary lifts
Exact values and consequences
For each surviving direction, test the known family and the threshold . On a nonempty simultaneous closed superlevel set has a first point. At this point some speed enters its admissible interval, so the first point has the form . The verifier tests all such endpoints after trying inexpensive rational witnesses. For each remaining direction its positive maximum is below . Locally each active distance function there has slope or , without a cusp. At a maximum both signs must occur, so is integral for two distinct speeds. Exhausting all such rational times computes the maximum exactly. The resulting tuples and fractions agree entry by entry with the 27-row table. The table and the product-plane formula give the stated spectrum. Exact arithmetic verifier
Sharp speed bound. If in lowest terms and is primitive, then . On the infinite family the largest speed is . On the table the largest ratio is , attained by .
Zhu's triangle conjecture for six and seven distances. Let be a set of positive integer distances. If its distance graph on the integers has chromatic number , then it contains a triangle. Indeed every seven-speed near-tight tuple contains , allowing . This holds by inspection of the family and an exhaustive test of the table. For six speeds, the two product families contain respectively and in absolute values. The third family includes the signed coordinates , whose nonzero distinct magnitudes give an additive relation. The proof outside these families gives a signed additive relation on three distinct speeds. Scaling preserves the existence of a triangle. Thus triangle-free has . Choose a maximizing time and color by . Two phases in the same half-open arc of length have circular distance strictly below , so every edge joins different colors. This gives a proper -coloring. Six-speed classification · Barajas and Serra on Zhu's conjecture
The proof uses exact integer and rational arithmetic. Its prior plane and six-speed results have their own verifiers in this repository. The new classification awaits independent mathematical review and Lean formalization.