Lonely runner: an exact five-speed family
- Kind
- Theorem with a written proof
- Status
- Proof held by a falsifier agent, with exact values checked by computer; unrefereed
- Prior work
- Kravitz's Lemma 9.4 gives it once 5s exceeds 1,372; no source read states it for small s
On this page
The statement
Write for the distance from a real number to the nearest integer. For distinct positive integer speeds , the loneliness gap is
The lonely runner conjecture says for every such . A tuple lies in the near-tight band when ; at the band is .
Theorem. For every ,
For it is attained only at and ; at also at and . At the formula fails: , still in the band.
Check it yourself
The time that attains it. Put and . Then and , so , while
each at least . At , puts the five runners at distances , , , and from the start.
Why no time does better. For the four slow speeds 1, 3, 4, 7 all stay at least from the start only on two short pieces of : and (plus the point when ). On the earlier piece the fast runner falls from distance to 0 and then rises only to ; the later piece lies within of , where is the integer , so there the fast runner is within of the start.
Worked examples
- The family beside it. Kravitz's Theorem 5.1 gives for every . The two lines start from the two tight four-speed tuples, (1, 2, 3, 4) and (1, 3, 4, 7).
- The census that prompted it. Of the 44 band five-speed tuples with speeds up to 80, 32 lie on the two lines, at to 16 on each, and 12 do not, for example (1, 2, 3, 5, 8) and (3, 5, 8, 11, 13).
- What it gives. With further arguments that rest on the list of tight four-speed tuples, all but finitely many band five-speed tuples are or up to order; that corollary is conditional and was not reviewed as a claim of its own.
Status and who checked it
- Proved by hand, unconditionally; no condition is attached to this statement.
- Who checked it. A falsifier agent checked the algebra by hand and the set of allowed times exactly, and its own exact computation of and the attaining times agrees up to ("Section 2's proof is sound"). A second script agrees for to 30. No second reviewer graded it. Unrefereed.
Prior work
Credited. The other line, , is Kravitz's Theorem 5.1. Kravitz's Lemma 9.4, applied to the tight tuple (1, 3, 4, 7), gives the second line once = 1,372; his §10 remarks that (1, 3, 4, 7) satisfies the condition his method needs. So the claim here is the range below that bound.
Searches run. Only the sources already held for the project; no web search was made for this statement. No source in them states the second line for small .
Still owed. A logged search of the literature for this formula.
Further reading
- Kravitz, arXiv 1912.06034: Theorem 5.1, Lemma 9.4 and §10.