Maths Olympiad Prep

Library / /62 of 64

Algebra Difficulty 8.4 Shortlist Find the answer

Find all functions ff from the interval (1,)(1, \infty) to (1,)(1, \infty) with the following property: if x,y(1,)x,y \in (1, \infty) and x2yx3x^2 \leq y \leq x^3, then (f(x))2f(y)(f(x))3(f(x))^2 \leq f(y) \leq (f(x))^3.

A number or a short expression. Spacing and $ signs are ignored.

Solution

It is obvious that for any c>0c>0, the function f(x)=xcf(x) = x^c has the desired property; we will prove that conversely, any function with the desired property has this form for some cc. Define the function g:(0,)(0,)g: (0, \infty) \to (0, \infty) given by g(x)=logf(ex)g(x) = \log f(e^x); this function has the property that if x,y(0,)x,y \in (0, \infty) and 2xy3x2x \leq y \leq 3x, then 2g(x)g(y)3g(x)2g(x) \leq g(y) \leq 3g(x). It will suffice to show that there exists c>0c>0 such that g(x)=cxg(x) = cx for all x>0x >0. Similarly, define the function h:\RR\RRh: \RR \to \RR given by h(x)=logg(ex)h(x) = \log g(e^x); this function has the property that if x,y\RRx,y \in \RR and x+log2yx+log3x + \log 2 \leq y \leq x + \log 3, then h(x)+log2h(y)h(x)+log3h(x) + \log 2 \leq h(y) \leq h(x) + \log 3. It will suffice to show that there exists c>0c>0 such that h(x)=x+ch(x) = x + c for all x\RRx \in \RR (as then h(x)=ecxh(x) = e^c x for all x>0x>0). By interchanging the roles of xx and yy, we may restate the condition on hh as follows: if xlog3yxlog2x - \log 3 \leq y \leq x - \log 2, then h(x)log3h(y)h(x)log2h(x) - \log 3 \leq h(y) \leq h(x) - \log 2. This gives us the cases a+b=0,1a+b=0,1 of the following statement, which we will establish in full by induction on a+ba+b: for any nonnegative integers a,ba,b, for all x,y\RRx,y \in \RR such that x+alog2blog3yx+alog3blog2, x + a \log 2 - b \log 3 \leq y \leq x + a \log 3 - b \log 2, we have h(x)+alog2blog3h(y)h(x)+alog3blog2. h(x) + a \log 2 - b \log 3 \leq h(y) \leq h(x) + a \log 3 - b \log 2. To this end, suppose that a+b>0a+b>0 and that the claim is known for all smaller values of a+ba+b. In particular, either a>0a>0 or b>0b>0; the two cases are similar, so we treat only the first one. Define the function j(t)=(a+b1)tb(log2+log3)a+b, j(t) = \frac{(a+b-1)t - b(\log 2 + \log 3)}{a+b}, so that j(alog2blog3)=(a1)log2blog3, j(a \log 2 - b \log 3) = (a-1) \log 2 - b \log 3, j(alog3blog2)=(a1)log3blog2. j(a \log 3 - b \log 2) = (a-1) \log 3 - b \log 2. For t[alog2blog3,alog3blog2]t \in [a \log 2 - b \log 3, a \log 3 - b \log 2] and y=x+ty = x+t, we have log2tj(t)log3\log 2 \leq t-j(t) \leq \log 3 and hence (a1)log2blog3h(x+j(t))h(x)(a1)log3blog2 (a-1) \log 2 - b \log 3 \leq h(x+j(t)) - h(x) \leq (a-1) \log 3 - b \log 2 log2h(y)h(x+j(t))log3; \log 2 \leq h(y)-h(x+j(t)) \leq \log 3; this completes the induction. Now fix two values x,y\RRx,y \in \RR with xyx \leq y. Since log2\log 2 and log3\log 3 are linearly independent over \QQ\QQ, the fractional parts of the nonnegative integer multiples of log3/log2\log 3/\log 2 are dense in [0,1)[0,1). (This result is due to Kronecker; a stronger result of Weyl shows that the fractional parts are uniformly distributed in [0,1)[0,1). In particular, for any ϵ>0\epsilon > 0 and any N>0N > 0, we can find integers a,b>Na,b > N such that yx<alog3blog2<yx+ϵ. y-x < a \log 3 - b \log 2 < y-x + \epsilon. By writing alog2blog3=log2log3(alog3blog2)b(log3)2(log2)2log3, a \log 2 - b \log 3 = \frac{\log 2}{\log 3}(a \log 3 - b \log 2) - b \frac{(\log 3)^2 - (\log 2)^2}{\log 3}, we see that this quantity tends to -\infty as NN \to \infty; in particular, for NN sufficiently large we have that alog2blog3<yxa \log 2 - b \log 3 < y-x. We thus have h(y)h(x)+alog2blog3<yx+ϵh(y) \leq h(x) + a \log 2 - b \log 3 < y-x + \epsilon; since ϵ>0\epsilon>0 was chosen arbitrarily, we deduce that h(y)h(x)yxh(y)-h(x) \leq y-x. A similar argument shows that h(y)h(x)yxh(y)-h(x) \geq y-x; we deduce that h(y)h(x)=yxh(y) - h(x) = y-x, or equivalently h(y)y=h(x)xh(y)-y = h(x) - x. In other words, the function xh(x)xx \mapsto h(x) - x is constant, as desired.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.