For eight distinct positive integer speeds let , where is the distance from to the nearest integer. Call primitive when its entries have gcd one.
Theorem. The values strictly below are exactly
This proves Kravitz’s original Loneliness Spectrum Conjecture for eight speeds. Up to scaling and permutation, every tuple giving one of these values is either in the 17-row table or has the form for and
The classification agrees with Cordella’s 29 primitive tuples through maximum speed 40. The three sporadic tuples beyond that cutoff have largest speeds 56, 62 and 80. Kravitz · Cordella, §6.3
The three product planes
Write for a rational subspace. Its image in the torus is compact. Consider a rational two-plane containing a vector with all coordinates nonzero and of distinct absolute values. We claim that if , then is, up to signs and permutation, a product plane for one of the three above.
On any rational line in with a repeated absolute coordinate and no zero coordinate, there are at most seven distinct speeds. Six or fewer have loneliness at least . For seven speeds the only spectrum value below is , and the three primitive sets attaining it are the three . Thus each such line has a primitive generator formed from one by repeating one entry and applying signs and a coordinate permutation. Seven-speed spectrum and classification
There are at least two independent such lines. Arrange the distinct rays of the signed coordinate forms on in cyclic order in the dual plane. Consecutive rays bound a gap of angle less than . A sum of boundary forms lies inside that gap, hence its kernel equates two coordinates up to sign without vanishing identically on any coordinate. Two gaps neither equal nor antipodal give distinct lines. This is the adjacent-ray argument used in the seven-coordinate classification. Yi, Gill and Bu, Lemma 11.2
Normalize the first generator to a positive followed by its repeated entry. Enumerate the possible second generators with every permutation and with every sign pattern modulo overall sign. Reject dependent pairs, and reject identical coordinate forms up to sign. For every and take , . The vector lies on the corresponding repeat line. Whenever all coordinates are nonzero, its set of absolute values divided by its minimum must be one of the three . Of 1,137,991,680 pairs, 546 satisfy the tests. In each, seven of the coefficient pairs are proportional and the corresponding entries form one . Since the plane has rank two, this is precisely a product plane. Exhaustive plane verifier
Spectrum on the product planes
A primitive positive tuple on such a plane has the form with and . The seven speeds all have distance at least at time . At times the seven phases are fixed and the phase of takes equally spaced values. For some value has distance at least . Hence requires . Testing then forces .
Put and . The maxima of are at modulo one, all of height . All other positive local maxima have height at most . To check these finite assertions, any positive maximum here has height below (the sets contain an odd and an even speed including 1) and has active slopes of opposite signs. Thus is integral for two distinct speeds in . The verifier checks every such point. For the same exact computation on the eight speeds gives for consecutive , and for the other two.
Suppose and put . Each component of contains a peak of height . Between consecutive zeros of the speed waves their minimum is concave, because each wave is a concave tent on this interval. Its slopes on its linear pieces are nonzero integers. Hence the peak is unique on the component and
If then . This proves the upper bound.
At , speeds congruent to 2 through 6 modulo 8 have distances at least . The only speed congruent to 1 is 1, which has distance . A speed congruent to 7 starts at phase and moves left by at most , so its distance is at least . Finally . This proves the exact value for every and every . The consecutive family supplies every value in the theorem.
The finite proof off these planes
Let be primitive with and on none of the three types of product plane. Every rational plane containing has loneliness at least . The projection and rounding argument of the seven-speed proof applies in dimension eight. For clarity, project the integer lattice orthogonally to . It has covolume . For its sup-norm successive minima , Vaaler and Minkowski give . The space spanned by and the first integer lifts has loneliness at most , by reducing the lift coefficients to absolute values at most . The lower bounds in dimensions two through eight are from the plane gap and coordinate coalescence. Subtract and double these bounds. Their successive increments from zero are
The partial sums of the minima strictly dominate those of these increments . Summing by parts gives . Projection, successive minima and rounding · Coordinate coalescence
For every some speed is divisible by , or is a witness to . Hence . The product of all 26 primes from 151 through 283 inclusive satisfies . Since , one of those primes divides no speed.
If a nonzero integer vector satisfies , it must be parallel to . Otherwise spans with a plane every phase of which is within of the circle of , by reducing the coefficient modulo one. The plane would have loneliness strictly below . Thus the absolute coordinates of a short modular vector determine the primitive speeds, or exclude the class if one is zero or two are equal.
For each of the 26 primes the verifier performs the following exhaustive tests. Details of the signed unit normalization and binary lifts are given in the seven-speed proof.
- Enumerate eight-element folded supports up to units by normalizing the smallest folded quotient to a pair . Intersect their witness masks at threshold . Every witnessless support of smaller size extends to such an eight-element support. Test all subsets and all multiplicities to cover eight coordinates.
- Lift every surviving class modulo to the children modulo . At even , the unit lets us fix the lift of the first odd entry. All-even classes violate primitivity. With exactly one odd speed, the seven even speeds admit a time of loneliness at least , and one of that time and its translate by gives the odd speed distance at least .
- For odd exclude children on which all centered distances are at least in numerator units, or on which all are at most . In the latter case keep the normalized short direction whenever its absolute coordinates are nonzero and distinct. On a primitive tuple the residue vector has full order , so the short vector at is nonzero. Recurse on unresolved children. The verifier fails if any node remains unresolved at depth twelve.
- Remove the proven product families. For every remaining normalized direction check the possible first time of simultaneous distance at least on . This is an entering endpoint for some coordinate . Exactly the 17 table rows survive. For each, evaluate all candidate maxima as above. Every reduced value has denominator one more than eight times its numerator. Modular and exact verifier
Consequences. Each primitive near-tight tuple of reduced loneliness has , with equality at . On the product families the ratio is below one, and direct comparison gives the sharp ratio on the table. Zhu’s triangle conjecture also holds for eight integer distances. Each contains an additive triangle, as does every sporadic row by direct test. A triangle-free distance set therefore has and admits an eight-coloring by half-open arcs of length at a maximizing time. Coloring argument and statement of Zhu’s conjecture
The written proof and computational certificates await independent mathematical review and Lean formalization.