Loneliness on a fixed relation hyperplane

What Lean checks

Original ordered positive distinct sample; deterministic maximum and velocity bound; uniform O(1/N) error over all shifts; fixed and independent Haar-shift laws; exact finite-subspace and positive-N quasipolynomial counts with degree bound; full-support endpoint formula including k=2; sharp (1,2,3) example. The complete 72-module closure passed strict sources, all-owned/private audit and exact stock replay.

Beck and Everett ask how the maximum loneliness of random runners changes when their speeds satisfy a fixed linear relation. We condition their uniform box model on that relation. Original question, §4

For example, consider positive distinct speeds a,b,a+ba,b,a+b. Their maximum loneliness converges in probability to 1/31/3, and the limiting probability of attaining 1/31/3 exactly is 1/41/4.

For any admissible primitive relation m⋅v=0m\cdot v=0 and starting positions ss, the general limit is

12−∥m⋅((1/2,…,1/2)−s)∥ℝ/ℤ∥m∥1.\frac12-\frac{\|m\cdot((1/2,\ldots,1/2)-s)\|_{\mathbb R/\mathbb Z}}{\|m\|_1}.

For each fixed tolerance, the exceptional fraction is O(1/N)O(1/N) for speeds up to NN, uniformly over starting positions. The proof also gives the limiting law for random starting positions and counts exact attainment in the unshifted full-support case. This is an unrefereed answer to the statistical question under the stated sampling model. Proof · Exact checks

Lean formalization

All statements of the note are formally verified: the deterministic bound, uniform probability estimate, fixed and independent-shift laws, exact quasipolynomial counts and degree bound, endpoint formula, and rate sharpness. The original sampling model and mathematical hypotheses are preserved.

The exact 72-module closure passed fresh strict source checks, an audit of all 1,403 owned declarations including private declarations, and 72 stock kernel replays. All 106 required endpoints have theorem kind. See the checked statements and immutable evidence.