The eight-speed Loneliness Spectrum Conjecture

What Lean checks

All three displayed product families are classified and evaluated within those families, including both exceptional s=1 values. All 17 displayed sporadic values are checked. The norm bound and exhaustive classification outside the families remain open.

For eight distinct positive integer speeds let L(v)=maxtmini∥tvi∥L(v)=\max_t\min_i\|t v_i\|, where ∥x∥\|x\| is the distance from xx to the nearest integer. Call vv primitive when its entries have gcd one.

Theorem. The values strictly below 1/81/8 are exactly

{s8s+1:s∈ℤ>0}.\left\{\frac{s}{8s+1}:s\in\mathbb Z_{>0}\right\}.

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 W∪{8s}W\cup\{8s\} for s≥1s\ge1 and

W∈{{1,2,3,4,5,6,7},{1,2,3,4,5,7,12},{1,4,5,6,7,11,13}}.W\in\big\{\{1,2,3,4,5,6,7\},\{1,2,3,4,5,7,12\},\{1,4,5,6,7,11,13\}\big\}.

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 L(E)=maxx∈Emini∥xi∥L(E)=\max_{x\in E}\min_i\|x_i\| for a rational subspace. Its image in the torus is compact. Consider a rational two-plane EE containing a vector with all coordinates nonzero and of distinct absolute values. We claim that if L(E)<3/23L(E)<3/23, then EE is, up to signs and permutation, a product plane (uW,b)(uW,b) for one of the three WW above.

On any rational line in EE with a repeated absolute coordinate and no zero coordinate, there are at most seven distinct speeds. Six or fewer have loneliness at least 1/71/7. For seven speeds the only spectrum value below 3/233/23 is 1/81/8, and the three primitive sets attaining it are the three WW. Thus each such line has a primitive generator formed from one WW 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 EE in cyclic order in the dual plane. Consecutive rays bound a gap of angle less than π\pi. 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 ww to a positive WW followed by its repeated entry. Enumerate the possible second generators zz with every permutation and with every sign pattern modulo overall sign. Reject dependent pairs, and reject identical coordinate forms up to sign. For every i,ji,j and e=±1e=\pm1 take a=wi−ewja=w_i-ew_j, b=zi−ezjb=z_i-ez_j. The vector az−bwaz-bw 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 WW. Of 1,137,991,680 pairs, 546 satisfy the tests. In each, seven of the coefficient pairs (wj,zj)(w_j,z_j) are proportional and the corresponding entries wjw_j form one WW. 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 (AW,b)(AW,b) with gcd(A,b)=1\gcd(A,b)=1 and A≥1A\ge1. The seven speeds WW all have distance at least 1/81/8 at time 1/81/8. At times (1/8+j)/A(1/8+j)/A the seven phases are fixed and the phase of bb takes AA equally spaced values. For A≥2A\ge2 some value has distance at least 1/2−1/(2A)≥1/41/2-1/(2A)\ge1/4. Hence L<1/8L<1/8 requires A=1A=1. Testing t=1/8t=1/8 then forces 8∣b8\mid b.

Put b=8sb=8s and f(t)=minx∈W∥xt∥f(t)=\min_{x\in W}\|xt\|. The maxima of ff are at t0=1/8,3/8,5/8,7/8t_0=1/8,3/8,5/8,7/8 modulo one, all of height 1/81/8. All other positive local maxima have height at most 2/172/17. To check these finite assertions, any positive maximum here has height below 1/21/2 (the sets contain an odd and an even speed including 1) and has active slopes of opposite signs. Thus (a+b′)t(a+b')t is integral for two distinct speeds in WW. The verifier checks every such point. For s=1s=1 the same exact computation on the eight speeds gives 1/91/9 for consecutive WW, and 2/172/17 for the other two.

Suppose s≥2s\ge2 and put r=s/(8s+1)≥2/17r=s/(8s+1)\ge2/17. Each component of {t:f(t)>r}\{t:f(t)>r\} contains a peak of height 1/81/8. 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 t0t_0 is unique on the component and

f(t)≤1/8−|t−t0|.f(t)\le1/8-|t-t_0|.

If f(t)>rf(t)>r then ∥8st∥≤8s|t−t0|<8s(1/8−r)=r\|8st\|\le8s|t-t_0|<8s(1/8-r)=r. This proves the upper bound.

At t=r=1/8−1/(8(8s+1))t=r=1/8-1/(8(8s+1)), speeds congruent to 2 through 6 modulo 8 have distances at least 1/4−13/136>1/81/4-13/136>1/8. The only speed congruent to 1 is 1, which has distance rr. A speed congruent to 7 starts at phase 7/87/8 and moves left by at most 13/13613/136, so its distance is at least 1/81/8. Finally 8sr≡−r(mod1)8sr\equiv-r\pmod1. This proves the exact value rr for every s≥2s\ge2 and every WW. The consecutive family supplies every value in the theorem.

The finite proof off these planes

Let vv be primitive with L(v)<1/8L(v)<1/8 and on none of the three types of product plane. Every rational plane containing vv has loneliness at least 3/233/23. The projection and rounding argument of the seven-speed proof applies in dimension eight. For clarity, project the integer lattice orthogonally to v⊥v^\perp. It has covolume 1/|v|21/|v|_2. For its sup-norm successive minima λi\lambda_i, Vaaler and Minkowski give ∏λi≤1/|v|2\prod\lambda_i\le1/|v|_2. The space spanned by vv and the first jj integer lifts has loneliness at most L(v)+12∑i≤jλiL(v)+\tfrac12\sum_{i\le j}\lambda_i, by reducing the lift coefficients to absolute values at most 1/21/2. The lower bounds in dimensions two through eight are 3/23,1/7,1/6,1/5,1/4,1/3,1/23/23,1/7,1/6,1/5,1/4,1/3,1/2 from the plane gap and coordinate coalescence. Subtract 1/81/8 and double these bounds. Their successive increments from zero are

(1/92,4/161,1/21,1/15,1/10,1/6,1/3).(1/92,4/161,1/21,1/15,1/10,1/6,1/3).

The partial sums of the minima strictly dominate those of these increments yiy_i. Summing logλi−logyi≥(λi−yi)/λi\log\lambda_i-\log y_i\ge(\lambda_i-y_i)/\lambda_i by parts gives |v|2<1/∏yi=209,960,100|v|_2<1/\prod y_i=209{,}960{,}100. Projection, successive minima and rounding · Coordinate coalescence

For every d=2,…,8d=2,\ldots,8 some speed is divisible by dd, or t=1/dt=1/d is a witness to L≥1/8L\ge1/8. Hence 840∣D=∏vi840\mid D=\prod v_i. The product PP of all 26 primes from 151 through 283 inclusive satisfies 88(840P)2>209960100168^8(840P)^2>209960100^{16}. Since D≤(|v|2/8)8D\le(|v|_2/\sqrt8)^8, one of those primes divides no speed.

If a nonzero integer vector w≡av(modm)w\equiv a v\pmod m satisfies 92∥w∥∞≤m92\|w\|_\infty\le m, it must be parallel to vv. Otherwise z=(w−av)/mz=(w-av)/m spans with vv a plane every phase of which is within ∥w∥∞/(2m)\|w\|_\infty/(2m) of the circle of vv, by reducing the zz coefficient modulo one. The plane would have loneliness strictly below 1/8+1/184=3/231/8+1/184=3/23. 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.

  1. Enumerate eight-element folded supports up to units by normalizing the smallest folded quotient to a pair 1,b1,b. Intersect their witness masks at threshold 1/81/8. Every witnessless support of smaller size extends to such an eight-element support. Test all subsets and all multiplicities to cover eight coordinates.
  2. Lift every surviving class modulo mm to the 282^8 children modulo 2m2m. At even mm, the unit 1+m1+m 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 1/81/8, and one of that time and its translate by 1/21/2 gives the odd speed distance at least 1/41/4.
  3. For odd t≤mt\le m exclude children on which all centered distances are at least (2m)/8(2m)/8 in numerator units, or on which all are at most (2m)/92(2m)/92. 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 2m2m, so the short vector at tt is nonzero. Recurse on unresolved children. The verifier fails if any node remains unresolved at depth twelve.
  4. Remove the proven product families. For every remaining normalized direction check the possible first time of simultaneous distance at least 1/81/8 on [0,1/2][0,1/2]. This is an entering endpoint (8j+1)/(8x)(8j+1)/(8x) for some coordinate xx. Exactly the 17 table rows survive. For each, evaluate all candidate maxima t=k/(a+b)t=k/(a+b) 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 p/qp/q has maxvi≤21q/17\max v_i\le21q/17, with equality at (1,5,6,7,8,11,13,21)(1,5,6,7,8,11,13,21). 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 WW contains an additive triangle, as does every sporadic row by direct test. A triangle-free distance set therefore has L≥1/8L\ge1/8 and admits an eight-coloring by half-open arcs of length 1/81/8 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.