Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

The difference parameter in progression discrepancy

../


In Problem 177, a single coloring f:N→{−1,1}f:\mathbb N\to\{-1,1\} must have bounded discrepancy on all finite arithmetic progressions of each fixed positive difference. Suppose a finite function h(d)h(d) bounds that discrepancy, and put

H(D)=max⁡1≤d≤Dh(d).H(D)=\max_{1\le d\le D}h(d).

The retained lower-bound arguments give unboundedness of hh and a square-root lower bound for this monotone envelope. They do not, by those arguments alone, give a lower bound for h(d)h(d) at every sufficiently large individual dd. The following implications are author-recorded by Plasma AI; no independent review is recorded.

Van der Waerden's theorem gives monochromatic progressions of every finite length. A progression of length LL has discrepancy LL, so its difference dd must satisfy h(d)≥Lh(d)\ge L. Hence sup⁡dh(d)=∞\sup_d h(d)=\infty. Since each individual h(d)h(d) is finite, such differences escape every finite set. This proves lim sup⁡d→∞h(d)=∞\limsup_{d\to\infty}h(d)=\infty, and H(D)→∞H(D)\to\infty. It does not prove lim inf⁡d→∞h(d)=∞\liminf_{d\to\infty}h(d)=\infty without an additional argument or a monotonicity assumption on hh.

The stronger quantitative consequence uses Roth's retained corollary (4). Its statement on printed p. 257 of the held transcription was inspected; its proof is not checked here. Applied to a set of density η\eta in [1,N][1,N], it gives a residue-class progression P⊆[1,N]P\subseteq[1,N] of difference at most N\sqrt N with

∣∣P∩S∣−η∣P∣∣≥cη(1−η) N1/4\bigl||P\cap S|-\eta|P|\bigr| \ge c\sqrt{\eta(1-\eta)}\,N^{1/4}

for an absolute c>0c>0. Take N=D2N=D^2 and S={j≤N:f(j)=1}S=\{j\le N:f(j)=1\}. Since the initial interval has difference 11, its sum has absolute value at most h(1)h(1); thus η=1/2+O(h(1)/N)\eta=1/2+O(h(1)/N) and η(1−η)\eta(1-\eta) stays bounded away from zero for large DD. Moreover

∑j∈Pf(j)=2(∣P∩S∣−η∣P∣)+(2η−1)∣P∣,∣(2η−1)∣P∣∣≤h(1).\sum_{j\in P}f(j) =2\bigl(|P\cap S|-\eta|P|\bigr)+(2\eta-1)|P|, \qquad |(2\eta-1)|P||\le h(1).

The progression supplied by the corollary consequently has discrepancy at least c′D−h(1)c'\sqrt D-h(1) and difference d≤Dd\le D. Therefore H(D)≫DH(D)\gg\sqrt D for all sufficiently large DD. In particular, no admissible coloring can have a bound h(d)=O(dp)h(d)=O(d^p) for fixed p<1/2p<1/2. The threshold in this application may depend on h(1)h(1).

The existential d≤Dd\le D is essential. The accepted source theorem and its uniform-power obstruction are retained; no pointwise lower bound at every dd is claimed here. The sharper upper bounds in the problem account concern one coloring working simultaneously for all differences. Closing the gap between the possible uniform growth exponents remains unresolved.