Wiki
Wiki

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

Updated


Source. Laczkovich (1984), printed pp. 112 and 114 (PDF pp. 4–6). The proof expands the source's finite-witness characterization and the use of that characterization in Theorem 2.

Statement

Fix an integer N≥2N\ge2 and H⊆RH\subseteq\mathbb R. A set UU is NN-closed if

(x+h,x+2h,…,x+Nh∈U, h>0) ⟹ x∈U(1)\bigl(x+h,x+2h,\ldots,x+Nh\in U,\ h>0\bigr) \ \Longrightarrow\ x\in U \tag{1}

for all real x,hx,h. Let H(N)H^{(N)} be the intersection of all NN-closed sets containing HH.

Then x∈H(N)x\in H^{(N)} if and only if there is a finite list x0,…,xt=xx_0,\ldots,x_t=x such that each xjx_j is either in HH, or has xj+ihx_j+ih among earlier entries for all 1≤i≤N1\le i\le N, for some h>0h>0.

If HH lies in an additive subgroup GG, then H(N)⊆GH^{(N)}\subseteq G, and every step hh in such a witness also lies in GG. Consequently, if f:G→Rf:G\to\mathbb R satisfies (K) and f≤Mf\le M on HH, then f≤Mf\le M on H(N)H^{(N)}.

There is also a useful finite-seed observation. If HH contains NN consecutive points

z,z+1,…,z+N−1,z,z+1,\ldots,z+N-1,

then H(N)H^{(N)} contains every z−jz-j for integers j≥0j\ge0.

Dependencies. The group and inequality conventions are in Definitions. Only finite induction is needed.

Bears on. Problem 1125, through Lemma 2 and Theorem 2.

Proof

Put H0=HH_0=H, and let Hj+1H_{j+1} be HjH_j together with every point whose NN later equally spaced points all lie in HjH_j. The union V=⋃j≥0HjV=\bigcup_{j\ge0}H_j is NN-closed. Indeed, the finitely many later points in (1) belong to finitely many stages; their largest stage contains all of them, so the next stage contains xx.

Every NN-closed set containing HH contains every HjH_j, by induction. Thus V=H(N)V=H^{(N)}. A point in HjH_j has a finite witness list: for a new point, concatenate finite witness lists for its NN parents and append the point. Repetition of entries is harmless. Conversely, any such list lies in every NN-closed superset of HH, by induction along the list. This proves the characterization, including H=∅H=\varnothing, whose closure is empty.

An additive subgroup is NN-closed because the first two later points give

h=(x+2h)−(x+h)∈G,x=2(x+h)−(x+2h)∈G.h=(x+2h)-(x+h)\in G,\qquad x=2(x+h)-(x+2h)\in G.

Hence H(N)⊆GH^{(N)}\subseteq G. The same two identities show that the steps in a finite witness list lie in GG. Starting with f≤Mf\le M on HH, induction along the list now gives

f(xj)≤f(xj+h)+f(xj+2h)2≤Mf(x_j)\le\frac{f(x_j+h)+f(x_j+2h)}2\le M

at every new point. This uses only the first two parents, even when N>2N>2.

Finally, the NN displayed consecutive seed points yield z−1z-1 by taking h=1h=1. The last NN known consecutive points then yield z−2z-2, and induction yields every point claimed. The restriction N≥2N\ge2 is essential for the subgroup assertion: one later point alone does not determine a step in GG.