For distinct positive integer speeds , put , where is distance to the nearest integer. Call near-tight when . Divide the speeds by their gcd to obtain a primitive tuple.
Theorem. The six-speed values strictly below are exactly
Consequently every near-tight value in lowest terms has odd and . This proves Cordella's Conjecture 6.2 and the six-speed case of Fan and Sun's amended Loneliness Spectrum Conjecture. Every primitive near-tight sextuple also satisfies , answering Cordella's Question 6.6 for six speeds. Cordella, §§6.1 and 6.4 · Fan and Sun
Cordella proved the restrictions on three critical families, showed that only finitely many tuples fall outside them, and found nine such tuples in a search through speed 110. We prove that his nine exhaust the sporadic primitive tuples. Each row below is sorted.
| Primitive sextuples outside the critical families | |
|---|---|
| , , | |
| , , | |
We work up to permutations and individual sign changes. A tuple lies on a critical family if it belongs to the real column space of one of the following parameterizations, after these symmetries,
For tuples on these families the necessary spectrum restriction and the speed bound follow from Cordella's Theorems 4.2 and 5.3, including Lemma 4.1 for the product families. The nine rows satisfy both conclusions directly. The six-speed lonely runner bound gives . Every with occurs on . The tuple attains , giving . Every with occurs by Jain and Kravitz's Theorem 1.5, expressed there in terms of . These are the two residue classes in the theorem. It remains to prove the table exhaustive. Cordella, §§3–5 · Jain and Kravitz, Theorem 1.5
A gap for planes and bounds for integer directions
For a rational subspace of , let its loneliness be the maximum of over its image in the torus. A plane is coordinate-free when no coordinate form vanishes identically.
Lemma 1. Every coordinate-free plane in six coordinates with loneliness strictly below is one of the three critical planes, up to signed permutations.
By the five-speed spectrum theorem, among five distinct speeds a value below must be . The tight five-speed sets are the dilations of and . Four or fewer distinct speeds give at least . Therefore every primitive integer direction on the plane with no zero coordinate and with a repeated absolute speed has one of these two quintuples with one coordinate repeated. Two coordinate forms cannot agree identically up to sign, since then infinitely many primitive directions on the plane, away from the coordinate zeros, would belong to a finite list. Five-speed spectrum · Cordella, §2.5
There are two independent directions of this kind. In the dual plane cyclically order the distinct rays of the signed coordinate forms. Their span has rank two, so there are at least four rays and every consecutive gap has angle less than . The sum of a signed form on either boundary of a gap lies inside it, parallel to no coordinate form. The kernel of the sum gives a rational repeat line avoiding coordinate zeros. Choose two gaps that are distinct even after identifying antipodal gaps.
Normalize one primitive repeat vector by signs and permutation, leaving ten choices. For each, try all signed permutations of a second repeat vector with positive first entry. On a candidate plane with generators , the line where coordinates agree up to sign has generator . Test every such line with no zero coordinate against the same two tight quintuples. Of 1,152,000 pairs, 190 survive independence and these necessary tests, and all 190 span one of the three listed planes up to signed permutation. The verifier checks equality of rational column spaces. Cordella already evaluated all three critical planes at . This proves the gap. Repeat-line enumeration · Cordella's critical-plane calculation
Lemma 2. Let be a primitive near-tight sextuple outside the three critical families, in a rational space of dimension . Write for the covolume of in . Then
Project orthogonally inside onto . The resulting lattice has covolume , by extending the primitive vector to a basis and taking base times height. Let be its successive minima for . Vaaler's central-section theorem gives this body volume at least . Minkowski's second theorem gives . This is the projection argument of Yi, Gill and Bu applied inside . Vaaler · Earlier prefix bounds for speed products, Remark 3.9 · Yi, Gill and Bu, Lemma 11.3
Lift independent successive-minimum vectors to . Every point of the torus spanned by is within sup distance of the circle of . Round the coefficients of the to nearest integers, and absorb their remaining components parallel to into the circle parameter. The loneliness function is 1-Lipschitz. The two-dimensional torus containing has loneliness at least by Lemma 1. In dimensions the respective lower bounds are , from coalescing coordinates and the known lower-dimensional lonely runner inequalities. All these tori contain a vector whose coordinates are nonzero. Yi, Gill and Bu, Lemma 11.2
Using gives strictly larger prefix sums for the than for the first entries of
Indeed the prefix bounds are . Concavity gives . Summation by parts gives a positive sum on the right since is nonincreasing. Thus , with both products truncated at . Taking reciprocals proves the lemma.
In particular . If an integer matrix spans , then for a full column basis, since the column lattice has integer index in . These bounds apply after every signed coordinate permutation.
Finite-field certificates
Write . A multiplier is a witness when for each coordinate. Time then excludes near-tightness. Every prime used is at least 53. Scaling by a nonzero residue, folding signs and permuting entries preserve the existence of a witness.
For each prime the first program enumerates every witnessless six-element folded set up to scaling. Among ordered pairs choose a pair with smallest folded quotient , scale it to , and enumerate the four remaining members in increasing order with every pair quotient folded to at least . After fixing five members, remove every eligible sixth member witnessed by any multiplier common to the five. Read every survivor. This includes a representative of each orbit. For repeated residues, any witnessless set of support at most five extends to a witnessless six-element set. Check its five-element deletions and repeat every possible member. The checker also tests four-element deletions, rejecting the prime if any have no witness. This covers all nonzero multisets of size six at the accepted primes. Enumerator · Cover checker
We use distinct primes to lift modular alternatives to exact integer identities. If every counted prime divides the product of some integer evaluations, and their prime product exceeds the upper bound for that absolute integer product, one evaluation must vanish. For a row and parameter vector use . The verifier counts a prime separately for each assertion it passes. All the comparisons below use integers. Driver · Prime certificate
From six to four parameters
At the primes counted for the first test every nonzero witnessless sextuple admits at least two signed additive relations, each on three distinct folded values and on a different triple of indices. If no such relation holds over the integers, take the product of the 80 nonzero forms with , and multiply by . Every counted prime divides that integer to order at least two. Primes dividing a speed are covered by the squared product of the speeds. Every other counted prime divides two different factors among the 80. With , the verifier checks . This is a contradiction. Thus some true additive triangle exists.
Sign and order that triangle as , write , and use the five parameters . They occur among signed speeds, so their Euclidean norm is at most . Their speed matrix has Gram determinant three. Lemma 2 bounds their squared norm by . If the three folded anchor values are distinct, the second modular test requires another relation of one of two types. Either an anchored difference equals a signed extra speed, or a signed sum of two extras equals an anchor. Here denotes one of . There are 54 linear forms up to overall sign. The list is invariant under permuting the signed anchors, reversing their common sign, and signing or permuting the extras. This is why the test can use one ordering of each modular triangle. A collision of folded anchors either makes a speed zero or makes some zero modulo , since . The six speed forms and the three anchor differences account for all such primes. All nine are nonzero over the integers for the tuples under consideration. For the 63 rows together the checker establishes . Some one of the 54 additional relations therefore holds over the integers.
The two resulting signed shapes are, up to order,
For each shape the certificate gives a list of further linear forms. The program tries every embedding into every witnessless folded multiset, allowing both relative signs of after fixing the sign of . Every embedding must make some listed form zero modulo for the prime to count. The six speed rows cover zero residues. The four parameters are individual signed speeds, so their squared norm is less than . In each shape the verifier checks . Since no speed vanishes over the integers, a listed form does. Line covers
From three parameters to the finite list
Eliminate one parameter in each new equation . If , multiply all speed rows by and use the coefficients on the remaining parameters. Drop maps with forced zeros or repeated absolute speeds. Identify signed-permutation equivalents over the rationals. For the latter test, choose ordered independent speed rows as a basis and express every row in that basis by Cramer's rule. Clear a common denominator, normalize row signs and order, and minimize over choices of basis and signs of the basis parameters. The key retains the denominator. Equal keys give equal rational spaces up to signed permutation. The resulting fifteen maps all have denominator one, so parameters can be taken to be individual signed speeds.
For each map of rank three and its proposed rows , visit every point of the projective parameter plane at each tested prime. Every point must give a zero speed, a witness, or some modulo . These tests attain for every map. A parameter that reduces to zero is covered by the speed rows. Hence another equation vanishes over the integers. Eliminate and canonicalize again, discarding the three known critical planes. There are 78 noncritical two-parameter maps. Projective-plane checker · Elimination and exact product checks
Let now be one such map. Its entire torus has loneliness at least by Lemma 1. For a primitive parameter direction , the lifts of its circle in are parallel lines spaced apart because is primitive. Under , a move of Euclidean length changes each phase by at most . Thus if the circle has loneliness below ,
The checker exhausts the closed disk given by this bound, taking and both signs of . A common denominator in the parameterization only scales the speeds and has no effect on loneliness. Sort and divide the resulting speeds by their gcd. Remove tuples with zero or repeated speeds or on a critical plane. Membership in the third critical family is tested by trying every signed ordered pair of distinct speeds as its first two parameters.
A rational witness discards a tuple. The exact threshold test checks the left endpoints of the intervals on which for . If the six closed unions intersect, their first common point is such an endpoint. For the true survivors the exact maximum occurs when two active triangular waves have opposite slopes, so is an integer for some . A strict maximum below is positive, and lies away from any cusp of an active wave. Enumerating those pair-sum times gives the nine entries and exact values in the table. This proves the theorem. Disk and exact-value checker
Reproduction and status
Run from the repository root with Python 3.10 or later and a C++20 compiler.
python3 results/six-speed-spectrum/verify.pyThe proof uses the repository's five-speed theorem and the cited literature. The verifier recompiles the searches and recomputes the prime products and all final cases. The result is an unrefereed computer-assisted proof without a Lean formalization.