AlgebraDifficulty 6.4National OlympiadProve itSouth Africa
Let f:Q+→R+ be a function that satisfies f(x+y)−f(x−y)=4f(x)f(y) for all 0<y<x. (a) Prove that f(2x)=4f(x) for all x∈Q+. (b) Find all such functions.
Solution
Choose any positive rational p,q and let x=2p+q and y=2p−q. Then f(p)−f(q)=4f(x)f(y)>0, so f(p)>f(q) and hence f is strictly increasing.
Now we show that f has values arbitrarily close to 0, i.e., for any ϵ∈Q+, we can find x such that f(x)<ϵ. Substituting x=2y gives f(3y)−f(y)=4f(2y)f(y)>4f(y)f(y)=4f(y), and hence f(3y)>5f(y) or f(y)<5f(3y). Substituting this into itself gives f(y)<52f(32y), and repeating gives f(y)<5kf(3ky). Now let y=3k1, giving f(3k1)<5kf(1). Since f(1) does not depend on k, we can choose k sufficiently large so that 5kf(1) is less than ϵ and hence y satisfies the condition.
Consider the original equation again, and consider what happens as f(y) tends to zero. f(x) stays fixed so 4f(x)f(y) can be made arbitrarily small. Also, f(x) lies between f(x−y) and f(x+y), so for any δ we can choose a y such that f(x)−δ<f(x−y)<f(x)<f(x+y)<f(x)+δ.
Now let x=z+ϵ and x=z−ϵ. The original equation becomes f(2z)=4f(z+ϵ)f(z−ϵ)+f(2ϵ). By choosing ϵ sufficiently small, we can ensure that f(ϵ) is arbitrarily close to zero and f(z+ϵ) and f(z−ϵ) are arbitrarily close to f(z). The right hand side can thus be made arbitrarily close to 4f(z), and it follows that the left hand side must be 4f(z).
We can extend f(2z)=4f(z) to f(nz)=n2f(z) for all positive integers n. For n=1 and n=2 we already have it. Suppose it holds up to some n. We now show that it also holds for n+1. Let x=nx,y=x, giving f((n+1)x)=4f(nx)f(x)+f((n−1)x)=4n2f(x)f(x)+(n−1)2f(x)=4nf(x)+(n−1)2f(x)=(n+1)2f(x). The result follows by induction.
We can further extend this to positive rational coefficients. Let n,m be positive integers. n2f(x)=f(m⋅mn⋅x)=m2f(mn⋅x), from which it follows that f(mn⋅x)=(mn)2f(x).
Now let f(1)=a. By the above, f(x)=ax2 for all positive rationals x. Conversely, it is trivial to substitute this into the original equation to confirm that it is a valid solution, for any a∈Q+.
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: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.