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), Theorem 2, statement on printed p. 110 and proof on pp. 114–115 (PDF pp. 2 and 6–7).

Statement

Let α\alpha be irrational with bounded regular continued-fraction partial quotients. Suppose f:Gα→Rf:G_\alpha\to\mathbb R satisfies

2f(x)≤f(x+h)+f(x+2h)(x,h∈Gα, h>0).2f(x)\le f(x+h)+f(x+2h) \qquad(x,h\in G_\alpha,\ h>0).

Then ff is nondecreasing on GαG_\alpha.

Dependencies. Lemma 2, backward propagation, positive increments, and Lemma 1. The continued-fraction facts imported by Lemma 2 remain explicit. No regularity assumption on ff is used.

Bears on. Problem 1125, through Theorem 1.

Proof

Fix a<ba<b in GαG_\alpha. Apply Lemma 2 with closure parameter 22 and endpoint bb, obtaining a finite seed HH. It is nonempty because its closure contains bb whereas the empty seed has empty closure. Let

M=max⁡x∈Hf(x).M=\max_{x\in H}f(x).

Backward propagation shows f(x)≤Mf(x)\le M for all x∈Gαx\in G_\alpha with x≤bx\le b, in particular f(b)≤Mf(b)\le M.

Set g(x)=max⁡{f(x),f(b)}g(x)=\max\{f(x),f(b)\}. This truncation also satisfies the inequality. If g(x)=f(x)g(x)=f(x), bound the two later ff values by the corresponding gg values; if g(x)=f(b)g(x)=f(b), both later gg values are at least f(b)f(b). On [a,b]∩Gα[a,b]\cap G_\alpha we therefore have

f(b)≤g(x)≤M,∣g(x)∣≤K:=max⁡{∣f(b)∣,∣M∣}.(1)f(b)\le g(x)\le M,\qquad |g(x)|\le K:=\max\{|f(b)|,|M|\}. \tag{1}

This single KK is fixed before choosing any progression length.

Let N≥1N\ge1 be an arbitrary integer. The positive-increment decomposition supplies c,d∈Gαc,d\in G_\alpha, c,d>0c,d>0, with

Nc+(N+1)d=b−a.Nc+(N+1)d=b-a.

All the points from aa to a+Nca+Nc in steps of cc, followed by the points from a+Nca+Nc to bb in steps of dd, lie in the interval where (1) holds. Restricting gg to either finite progression gives a sequence satisfying the hypotheses of Lemma 1: every valid integer step corresponds to a positive integer multiple of cc or dd in GαG_\alpha.

Two applications of that lemma yield

g(a)≤g(a+Nc)+10KN≤g(b)+10K(1N+1N+1).g(a)\le g(a+Nc)+\frac{10K}{N} \le g(b)+10K\left(\frac1N+\frac1{N+1}\right).

Since KK is independent of NN, letting NN tend to infinity gives g(a)≤g(b)=f(b)g(a)\le g(b)=f(b). Finally f(a)≤g(a)f(a)\le g(a), so f(a)≤f(b)f(a)\le f(b). The pair a<ba<b was arbitrary.