MathLabs

Problem 5

Let Q>0\mathbb{Q}_{>0} be the set of all positive rational numbers. Let f:Q>0→Rf:\mathbb{Q}_{>0}\to\mathbb{R} be a function satisfying the following three conditions: (i) for all x,y∈Q>0x,y\in\mathbb{Q}_{>0}, f(x)f(y)≥f(xy)f(x)f(y)\ge f(xy); (ii) for all x,y∈Q>0x,y\in\mathbb{Q}_{>0}, f(x+y)≥f(x)+f(y)f(x+y)\ge f(x)+f(y); (iii) there exists a rational number a>1a>1 such that f(a)=af(a)=a. Prove that f(x)=xf(x)=x for all x∈Q>0x\in\mathbb{Q}_{>0}.
Step 2 of 6: f is increasing and bounded below by x − 1
f(x)≥x−1 for x≥1,f strictly increasingf(x) \ge x - 1 \text{ for } x \ge 1, \qquad f \text{ strictly increasing}
Detailed analysis

From (i) applied with x=m/n,y=nx=m/n,y=n we get f(m/n)f(n)≥f(m)f(m/n)f(n)\ge f(m) so f(q)>0f(q)>0 for every q∈Q>0q\in\mathbb{Q}_{>0}; then (ii) shows f(x+y)≥f(x)+f(y)>f(x)f(x+y)\ge f(x)+f(y)>f(x), so ff is strictly increasing. Combined with f(n)≥nf(n)\ge n from the previous step, for x≥1x\ge1 this gives f(x)≥f(⌊x⌋)≥⌊x⌋>x−1f(x)\ge f(\lfloor x\rfloor)\ge\lfloor x\rfloor>x-1.