Lean lower bounds for at most three speeds

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.

LonelinessSmallRunner.lean proves the lonely-runner lower bounds for one, two, and three speeds, and transfers them to rational subspaces.

The theorem value_ge_one_div_length_add_one states that every nonempty list DD of positive integer speeds with |D|≤3|D|\le3 satisfies

value(D)≥1|D|+1.\mathop{\mathrm{value}}(D)\ge\frac1{|D|+1}.

Repeated entries are allowed. For a bound in terms of the number of distinct speeds, apply the theorem to the list of distinct speeds, whose value is the same.

Proof dependencies

Loneliness.Packing.one_div_length_add_one_le_density proves the lower bound for the maximal density of a set avoiding the differences in DD. Its proof uses a finite greedy construction, repeats a finite block with a separating gap, and passes to arbitrarily large blocks.

Haralambis.density_eq_value proves that this maximal density equals the actual circle loneliness value for every positive triple. Its proof allows repeated differences.

The new module proves that both density and loneliness value depend only on the list's support. A one-speed or two-speed list can therefore be padded with repeated entries when applying Haralambis's equality. The greedy lower bound is applied to the original list, so the constants remain 1/21/2, 1/31/3, and 1/41/4, respectively.

lonelyRunnerBound m hm discharges the predicate Loneliness.CoordinateSubspace.LonelyRunnerBound m whenever m≤3m\le3. This predicate says that every nonempty list of at most mm distinct positive integer speeds has value at least 1/(m+1)1/(m+1).

Subspace consequences

Let Eℚ⊆ℚnE_{\mathbb Q}\subseteq\mathbb Q^n have real span EE, and assume that no coordinate vanishes identically on EE. The coordinate-coalescence construction produces an integer-speed line in EE with at most n−dimE+1n-\dim E+1 distinct absolute speeds. Therefore, when that number is at most three,

M(E)≥1n−dimE+2.M(E)\ge\frac1{n-\dim E+2}.

subspace_value_lower proves this inequality with no remaining lonely-runner hypothesis. In five coordinates the following three theorems provide exactly the larger-subspace bounds used in the norm reduction:

Theorem Dimension Lower bound
five_coordinate_dimension_three 3 1/41/4
five_coordinate_dimension_four 4 1/31/3
five_coordinate_dimension_five 5 1/21/2

These are bounds for the existing Loneliness.SubspaceDensity.spaceValue, defined as a supremum of the actual nearest-integer clearance.

Verification

The module compiles with the pinned toolchain and passed independent leanchecker replay. Seven headline declarations were audited transitively; their only axioms are propext, Classical.choice, and Quot.sound.

The four-speed gap and the lattice product estimate are not consequences of these three-speed lower bounds. They remain separate inputs to the full five-speed classification.