Five-speed Loneliness Spectrum Conjecture

What Lean checks

All twelve example values and both critical-family reductions are checked. The unconditional four-speed gap theorem is proved: below 2/9, precisely the two scaled critical directions occur, both with value 1/5. This also proves the four-speed runner bound. The unconditional five-speed lower bound L(v) ≥ 1/6 is also proved by Renault’s argument. All 122,880 indexed plane cases and the five-speed coordinate cutoff are checked, and their gap input is now available. The bounded five-speed classification remains open.

Collection · Catalogue · Verification · Lean status

Result

The values below 1/5 are exactly s/(5s+1) for positive integers s. Cordella’s twelve sporadic primitive quintuples exhaust the exceptions to the two known families.

Proof and sources

Read the proof for the original problem, assumptions, argument, and cited sources. These notes are unrefereed.

Verification

Run from the repository root:

python3 results/five-speed-spectrum/verify.py

See the verification guide for dependencies and the distinction between computational checks and formal proofs.

Formalization

Partial formalization. Lean proves both critical-family reductions, all twelve listed example values, and the realization of every s/(5s+1). It also proves the unconditional four-speed coordinate cutoff 5,832 and the complete finite plane certificate with 122,880 indexed cases.

Lean also proves the complete threshold classification at 1/6: every positive primitive five-speed tuple at or below that value is a permutation of [1,2,3,4,5] or [1,3,4,5,9], and both have value exactly 1/6. Gcd normalization extends this to all positive five-element lists. The proof includes an independent unconditional five-speed lower bound and preserves the existing Renault proof. Its full 250-module closure, 7,070 finite frames, and 7,586 required theorem endpoints passed fresh sources, the complete axiom audit, and exact stock kernel replay. See the tight-five checkpoint. The full spectrum classification below 1/5 remains partial.

The four-speed gap input is now proved. Every positive distinct four-speed tuple below 2/9 is a positive scaling and permutation of (1,2,3,4) or (1,3,4,7), and its value is exactly 1/5. The four-speed runner bound follows. The proof's complete 84-module closure has source, axiom, and independent kernel component coverage.

The geometric plane classification and five-speed cutoff can use that proved input. Every positive primitive tuple below 1/5 is then bounded by 279,841 or contains a dilated critical quadruple. The bounded five-speed enumeration remains open. See the four-speed proof, plane classification, pigeonhole cutoffs, and status report.

Supporting files