Source. S. Korsky, A resolution of the de Bruijn--Erdős
consecutive-gap problem, arXiv:2609.07196v2, Proposition 6.4 (pp. 12--13)
of the retained PDF, read in the canonical conversion and checked against
the text layer; held by its library card,
Korsky 2026, resolution.
The inputs are
Lemma 6.2 and
Lemma 6.3.
Standing. Author-recorded reconstruction; not an independent review;
changes no status and assigns no tier. The source is an unrefereed
preprint; the implied constants are absolute and kept implicit as in the
source, except where the reconstruction names one.
Definitions
Notation as on the Lemma 6.2 page: Δt(x,D), Zt(D), identity
(6.4), hypothesis (6.1) with A≥1. Put zt(D)=Zt(D)/D for D>0.
Statement (Proposition 6.4, p. 12)
There are absolute constants C2,C3>0 with the following property.
Suppose that (6.1) holds with A≥1 and r≥C2A, and put
Λ=log(r/A),S=Λ2Ar.
Then, for all sufficiently large integers n,
0≤D≤Ssup∫TNn((x,x+D/n])−Ddx≤C3A.(6.7)
The time threshold may depend on r, A and the sequence, but not on
D.
Proof
Put θ=A/r and K=Ar, and take C2 large enough
that θ and θΛ are small (both tend to 0 as
r/A→∞).
The scale chain. Take K=D0<D1<⋯<Dh=r with Di+1=2Di
except that the last step is shortened to end at r; adjacent scales
satisfy K≤D≤E≤2D, and h≤log2(r/K)+1=O(Λ). For an
adjacent pair D<E apply Lemma 6.2 with k=⌈D/K⌉, so
D/K≤k≤2D/K and
Iteration. Lemma 6.3 gives zt(r)=Zt(r)/r≤A/r=θ2 at every
late time. Starting at scale K and time t, apply (6.8) along the
chain, the time being multiplied by 1+qi≤1+2θ at the i-th
step. With h=O(Λ) steps and θΛ small,
(1+Cθ)h≤exp(Cθh)=O(1), so
by (6.9) at the time (1+θ)t. Since θ≤θΛ, this
is at most 8A+C′′DθΛ+4r/t with C′′ absolute, and the
definition of S gives
DθΛ≤SθΛ=Kθ/Λ=A/Λ≤A. So
Zt(D)≤(8+C′′)A+4r/t.
Integer times. At an integer time n large enough that 4r/n≤A,
identity (6.4) gives
∫TΔn(x,D)dx=2Zn(D)≤2(9+C′′)A,
which is (6.7) with C3=2(9+C′′). The case D=0 is trivial. The
threshold on n comes from (6.9) at the time (1+θ)n, from
4r/n≤A, from the finitely many chain comparisons behind (6.9), and
from the descent comparison, whose transport error 8A+4r/t is free of
D and whose only D-dependent largeness requirement (Lemma 6.2 page,
end of proof) is that the arc of length D/n be shorter than 1;
identity (6.4) needs the same. Since D≤S, any n>S meets both at
once, so one late time serves every 0≤D≤S.
Role in the argument
Localizing the points of a moving short interval, with insertion time as
a second coordinate, turns (6.7) into a planar L1 discrepancy bound
that contradicts Halász's theorem for large S; this is
Lemma 7.2, and the
assembly is on the
Theorem 1.1 page.