These files prove the linear-algebra construction behind Lemma 11.2 of Yi, Gill and Bu, Four runners that are barely lonely. They construct a line with few distinct absolute speeds inside a subspace. For rational subspaces, the line has an integer direction. No lattice-volume estimate or finite exhaustion is used in this construction.
Main statement
Let have dimension , where . Assume that no coordinate vanishes identically on : for every coordinate , some has . Then there is with
The integer vector is viewed in in the membership assertion. The theorem is Loneliness.CoordinateSubspace.exists_integer_direction in LonelinessIntegerDirection.lean.
The construction also proves a stronger intermediate statement. There is a one-dimensional subspace , with no identically zero coordinate, such that its coordinate functions have at most equivalence classes under equality up to sign. Every vector in therefore has at most that many distinct absolute coordinate values.
One step of the construction
LonelinessCoalescence.lean works with a finite family of nonzero linear forms on a vector space over an infinite ordered field. Their span must have dimension at least two. It finds indices and such that
has codimension one, the forms are not proportional, and no original vanishes identically on .
The proof uses two separating linear functionals. It first finds a functional that is nonzero on every member of the finite family of forms, viewed as vectors in the dual space. Normalize those vectors by . A second functional separates every unequal pair of normalized vectors. There are two adjacent distinct values in the resulting finite ordered set.
Orient the associated vectors so that their -values are positive. Their sum has -ratio strictly between the adjacent values. Thus the sum is proportional to none of the original vectors. Its kernel has codimension one. If any original form vanished on that kernel, it would be proportional to the sum, a contradiction.
The headline theorem is
Loneliness.Coalescence.coalescing_hyperplane
This argument works over both and . It uses finite ordering and linear algebra; it does not need an angle or a cyclic-order formalization.
LonelinessCoordinateSubspace.lean applies the theorem to the coordinate forms on . It proves that these forms span the full dual of , then obtains
The property that no coordinate vanishes identically is called CoordinateFree. The concrete theorem is coordinate_coalescence.
Iteration and the number of speeds
LonelinessCoordinateClasses.lean defines SameCoordinate E i j to mean that the two coordinate functions on agree everywhere, or are negatives everywhere. It proves that this is an equivalence relation and defines classCount E as its number of classes.
Restriction to a smaller subspace gives a surjection on classes. The one-step construction merges two previously different classes because its two forms were not proportional. The class count therefore falls strictly at each step.
Strong induction on gives exists_coordinate_free_line, with the more precise bound
There are at most original classes. The theorem exists_coordinate_free_line_card concludes . absolute_values_card_le_classCount transfers this class bound to each vector in .
A finite family of nonzero coordinate forms has a point where none vanishes. Choose such a point in . Over , the theorem clear_rational_denominators gives a positive integer common multiplier. Multiplication keeps the vector in , preserves nonzero coordinates, and gives the required integer direction. Distinct integer absolute values embed into the rational absolute values, so the same counting bound applies.
Real spans and actual loneliness values
LonelinessRationalSubspace.lean defines realSpan E by casting the rational vectors of into and taking their real linear span. finrank_realSpan proves
It maps a rational basis into the real coordinate space, proves that this family remains linearly independent after extending scalars, and proves that it spans the real space. The property CoordinateFree is equivalent for the rational subspace and its real span.
The real-span operation preserves sums of subspaces. For every family of integer vectors, the real span of their rational span is their real span. These identities keep the rational model available when the density argument adjoins integer vectors to an existing subspace.
exists_integer_direction_real gives an integer vector in realSpan E, with no zero coordinate and at most distinct absolute speeds.
LonelinessCoalescenceValue.lean defines integerSpeeds w by listing the distinct natural absolute values of the integer coordinates. It proves that the value of the real line generated by equals the actual real-time loneliness value of that list:
Here spaceValue and value are the existing supremum definitions used by the density argument and the exact five-speed examples. Sign changes and duplicate speeds disappear because they leave distance to the nearest integer unchanged.
spaceValue_lower_of_runner_bound proves the general transfer: if every nonempty list of at most distinct positive integer speeds has value at least , and , then . LonelyRunnerBound m specializes the supplied lower bound to . The resulting theorem coalescence_value_lower gives
under the explicit hypothesis LonelyRunnerBound (n-d+1). The coalescence modules do not assert that this lonely-runner hypothesis holds for every .
Verification
All six Lean files compile with the repository's pinned Lean and Mathlib versions. Each compiled module also passed a separate leanchecker replay. The fourteen headline declarations were checked with #print axioms; their transitive axiom sets contain only propext, Classical.choice, and Quot.sound. No placeholder proof, new mathematical axiom, or native-decision axiom is used.
Relation to the remaining reduction
An integer direction defines an integer-speed circle modulo . The construction provides the circle with at most distinct absolute speeds required by the coalescence step. The corresponding loneliness lower bound still uses the lonely-runner theorem for that number of speeds.
The projected-lattice covolume identity, the successive-minima product bound, the four-speed gap, and the exhaustive plane classification are separate inputs to the five-speed norm reduction. The coordinate construction proves none of these inputs and does not establish full five-speed exhaustion.