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 1, printed p. 109, and its deduction from Theorem 2 on p. 110 (PDF pp. 1–2).

Statement

If f:R→Rf:\mathbb R\to\mathbb R satisfies

2f(x)≤f(x+h)+f(x+2h)(x∈R, h>0),2f(x)\le f(x+h)+f(x+2h) \qquad(x\in\mathbb R,\ h>0),

then ff is nondecreasing. No measurability, continuity, or local boundedness hypothesis is required.

Dependencies. Theorem 2 and the bounded continued fraction of 2\sqrt2 recorded in the classical input page. The preceding source-specific proof chain is part of this compilation; general continued-fraction theory is the stated external input.

Bears on. This is the affirmative real-function conclusion in Problem 1125. It does not assert strict increase or a theorem on arbitrary rational-domain functions.

Proof

Choose any real a<ba<b and define

g(t)=f(a+(b−a)t).g(t)=f(a+(b-a)t).

For every real tt and s>0s>0, the original inequality applies with base point a+(b−a)ta+(b-a)t and positive step (b−a)s(b-a)s. Hence gg satisfies the same inequality. Restrict gg to G2=Z2+ZG_{\sqrt2}=\mathbb Z\sqrt2+\mathbb Z and apply Theorem 2. Since 0,1∈G20,1\in G_{\sqrt2},

f(a)=g(0)≤g(1)=f(b).f(a)=g(0)\le g(1)=f(b).

This proves nondecreasing monotonicity on all of R\mathbb R.