These files prove normalization, coefficient-rounding transfer, and the arithmetic of the original lattice norm reduction. The original sharp lattice bound is not asserted by these files.
A later, independently checked pigeonhole argument supplies an alternative finite/infinite reduction. It gives the unconditional four-speed cutoff 5832 and, under the explicit four-speed gap, the five-speed nonfamily cutoff 279841. The finite critical-plane classification is fully checked in that route. See Elementary finite/infinite reduction. The two finite tuple classifications remain separate; the alternative does not require the lattice-volume theorems listed below.
Gcd normalization
LonelinessNormalization.lean defines the greatest common divisor of a list by an iterated Nat.gcd, and defines normalize ds by dividing every speed by that divisor.
value_scale proves, for every positive integer ,
The upper bound reduces arbitrary real times modulo one. The lower bound uses the time for every .
For a nonempty positive list, normalization preserves its actual value, length, positivity, and distinctness, and makes its greatest common divisor one. primitive_representative collects these conclusions in a single existence theorem.
Normalization also preserves containment of either critical quadruple. This removes the primitivity hypothesis from the previously proved classification:
Loneliness.Normalization.critical_family_below_threshold
For every positive speed list of length five containing a positive dilation of [1,2,3,4] or [1,3,4,7], a value below therefore equals for some positive integer .
Density transfer by rounding coefficients
LonelinessSubspaceDensity.lean works directly with a real linear subspace . It defines
The definitions are pointClearance and spaceValue. The theorem spaceValue_speed_line identifies with the existing actual real-time loneliness value of the natural speed list .
Let , and choose arbitrary approximating vectors . Suppose
extension_density proves that every point
has a vector and an integer vector with
The construction is explicit. Express , and put
Then
Each scalar coefficient has absolute value at most . The triangle inequality gives the asserted coordinate bound. This construction does not require the added vectors to be linearly independent.
point_transfer proves the required Lipschitz inequality modulo integer vectors. extension_value_bound and extension_value_bound_norm conclude
Taking to be the orthogonal projection of onto gives the coefficient-rounding transfer used by the lattice method. The existence of short projected lattice vectors is a separate mathematical step.
Exact arithmetic of the norm thresholds
LonelinessNormArithmetic.lean proves the numerical part with all lattice and subspace hypotheses explicit. It does not assert that those hypotheses have already been established for every speed tuple.
For ordered nonnegative numbers , the inequalities
imply
Given , first_minimum_bound proves . five_speed_threshold combines this with the density inequalities and to prove that the containing two-dimensional space has value strictly below .
The analogous three-minimum calculation gives . squared_covolume_integer_bound proves that an integral squared covolume then satisfies .
Dependencies of the original lattice route
The source for the external reduction is Yi, Gill and Bu, Four runners that are barely lonely, arXiv:2610.40694v1, especially Sections 3, 11, and 12. A readable PDF mirror contains the same paper.
Corollary 11.6(ii) uses the projected-lattice covolume identity, Vaaler's cube-section theorem, Minkowski's second theorem, coordinate coalescence, and Theorem 11.5. The latter uses the four-speed gap and an additional enumeration. The four-speed proof enumerates 800,816,099 quadruples. The five-coordinate g5enum2 enumeration visits 65,989,492,206 vectors, retains 30,485,136,454 normalized vectors, and has sixteen survivors. These searches are separate from this repository's final 317 five-speed candidates.
The pinned Mathlib contains lattice bases and covolumes in Mathlib.Algebra.Module.ZLattice.Basic and Mathlib.Algebra.Module.ZLattice.Covolume. It also contains Blichfeldt's theorem and Minkowski's first convex-body theorem in Mathlib.MeasureTheory.Group.GeometryOfNumbers. Searches of this pinned source did not find Vaaler's theorem, Minkowski's second theorem, successive minima, or a lonely-runner classification.
These particular files prove normalization, density transfer, and numerical threshold calculations. They leave the original lattice hypotheses explicit. The later pigeonhole route replaces those hypotheses with elementary finite approximation and the checked critical-plane certificate. Completion of the four-speed finite classification and the final five-speed finite classification is still needed for the full exhaustion theorem.