Source. S. Korsky, A resolution of the de Bruijn--Erdős
consecutive-gap problem, arXiv:2609.07196v2, Section 2 and Lemma 2.1
(pp. 4--5) of the retained PDF, read in the canonical conversion beside
the PDF and checked against the text layer at the displayed constants;
held by its library card,
Korsky 2026, resolution.
Standing. Author-recorded reconstruction; not an independent review;
changes no status and assigns no tier. The source is an unrefereed,
AI-assisted preprint registered as a proof claim for Problem 1221.
Definitions
Let (xn)n≥1 be distinct points of T=R/Z
and fix r∈N. For real t≥1 put
Pt={x1,…,x⌊t⌋},Nt(I)=#(Pt∩I).
The sets are nested: Ps⊆Pt for s≤t. The r-spans of
Pt are the clockwise distances from each point of Pt to the point
r places after it in cyclic order, written Si(t); they are the
r-spans at time ⌊t⌋. Intervals are oriented half-open
arcs (x,x+ℓ] of length ℓ<1; lifts to R are used to
translate endpoints and to measure displacements. For D>0,
so that Ut(D) and Vt(D) compare the largest and smallest counts in
intervals of length D/t with D, the count a perfectly spread set
would give. Write (z)+=max(z,0).
Hypothesis (2.1). A number A≥1 is fixed, and for every
sufficiently large t there are at,bt≥0 with at+bt≤A such
that every r-span of Pt satisfies
tr−at≤Si(t)≤tr+bt.
Cyclic moves. For a time s with kr<∣Ps∣, let Fs be the map
sending each point of Ps to the point kr places after it in the
cyclic order of Ps, and Bs=Fs−1 the move by kr places
backward. Both are bijections of Ps. The clockwise displacement of
Fs at a point is the sum of k consecutive r-spans of Ps (the
kr gaps after the point, grouped in k runs of r), so under (2.1) it
lies in
[skr−kas,skr+kbs].
The counterclockwise displacement of Bs at a point p′ is the
clockwise displacement of Fs at Bs(p′), so it lies in the same
range. All times below are large enough that (2.1) holds, that
kr<∣Ps∣, and that every interval used has length less than 1.
Statement (Lemma 2.1, p. 4)
Fix D,E>0 and an integer k≥1, and put q=E/(kr). If q<1, then
for all sufficiently large t,
For fixed E and k the time threshold can be chosen uniformly for D
in any bounded range.
Proof of (2.2)
Put t+=(1+q)t and ℓ=E/t+. For 0≤u≤ℓ let s=s(u) be
the solution of
tkr−skr=u,that is,s=1−ut/(kr)t.
As u runs from 0 to ℓ, ut/(kr) runs from 0 to
Et/(t+kr)=q/(1+q), so s runs from t to t/(1−q/(1+q))=t+; thus
t≤s≤t+.
The injection. Consider
Tu:PtFtPt↪PsBsPs↪Pt+.
Each arrow is injective, so Tu is an injection of Pt into
Pt+. Its clockwise displacement at p is the displacement of Ft
at p, in [k(r−at)/t,k(r+bt)/t], minus the counterclockwise
displacement of Bs at Ft(p), in [k(r−as)/s,k(r+bs)/s]. Using
kr/t−kr/s=u, the displacement minus u lies in
[−tkat−skbs,tkbt+skas]⊆tk[−at−A,bt+A],
because s≥t and as,bs≤A.
Enlarging the interval. Let I=(x,x+D/t]. Extend I to the left by
k(at+A)/t and to the right by k(bt+A)/t, obtaining
If p∈Pt∩I, then Tu(p)−u lies within k(at+A)/t to the left
and k(bt+A)/t to the right of p (the left bound strict in the sense
that Tu(p)−u≥p−k(at+A)/t>x−k(at+A)/t), so Tu(p)∈J+u. As
Tu is injective into Pt+,
Nt(I)≤Nt+(J+u)(0≤u≤ℓ).
Averaging. Integrate over u∈[0,ℓ]. For each point p of
Pt+, the set of u∈[0,ℓ] with p∈J+u has the same measure
as the set of v∈J with p∈(v,v+ℓ] (both are the set of
v=p−u in J∩[p−ℓ,p), up to endpoints), so
the last step because ℓ=E/t+, so each
Nt+((v,v+ℓ])≤EUt+(E) by the definition of U. Dividing by
Dℓ=DE/t+,
DNt(I)≤D∣J∣t+Ut+(E)≤(1+D3kA)(1+q)Ut+(E),
and the supremum over x gives (2.2). The half-open endpoint conventions
affect none of the integrals.
Proof of (2.3)
Put t−=(1−q)t and ℓ=E/t−. For 0≤u≤ℓ let s=s(u) solve
skr−tkr=u,that is,s=1+ut/(kr)t;
as u runs from 0 to ℓ, ut/(kr) runs from 0 to
Et/(t−kr)=q/(1−q) and s from t down to t(1−q)=t−, so
t−≤s≤t.
The injection. This time use
Tu′:Pt−↪PsBsPs↪PtFtPt,
an injection of Pt− into Pt. Its clockwise displacement is the
displacement of Ft, in [k(r−at)/t,k(r+bt)/t], minus the
counterclockwise displacement of Bs, in [k(r−as)/s,k(r+bs)/s].
Using kr/s−kr/t=u, the displacement minus (−u) lies in
Shrinking the interval. Let I=(x,x+D/t]. Move its left endpoint to
the right by kat/t+kA/t− and its right endpoint to the left by
kbt/t+kA/t−; call the result J, empty if its length is not
positive. Then
since ℓ=E/t− makes each Nt−((v,v+ℓ])≥EVt−(E).
Dividing by Dℓ=DE/t−, the coefficient of Vt−(E) is
∣J∣t−/D, which is at least
(tt−−DkA(tt−+2))+=(1−q−DkA(3−q))+,
using t−/t=1−q. The infimum over x gives (2.3).
Uniformity
Both constructions use only inclusions from an earlier point set into a
later one and the moves Ft, Bs, Ft; the comparison times s(u)
range over [t,t+] or [t−,t] and depend on E, k and t but not
on D. The threshold on t must make (2.1) hold at all these times,
make kr<∣Pt−∣, and make the intervals J, J+u shorter than 1;
for D in a bounded range one threshold does all of this.
Role in the argument
Iterated along a chain of doubling scales from r±A down to
Ar and then applied once more, the lemma gives the
short-interval counting bound of
Proposition 3.1.
Its averaged form, with pointwise span control replaced by L1 control,
is
Lemma 6.2.