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 4 of 6: Equality is forced exactly at powers of a
an=f(a)n≥f(an)≥an  ⟹  f(an)=ana^n = f(a)^n \ge f(a^n) \ge a^n \implies f(a^n) = a^n
Detailed analysis

Since a>1a>1, the previous step gives f(an)≥anf(a^n)\ge a^n; on the other hand (i) gives f(a)n≥f(an)f(a)^n\ge f(a^n), i.e. an≥f(an)a^n\ge f(a^n) because f(a)=af(a)=a. The two inequalities force f(an)=anf(a^n)=a^n for every positive integer nn.