Maths Olympiad Prep

Library / /86 of 91

Algebra Difficulty 8.6 Shortlist Prove it India

Find all functions f:RRf : \mathbb{R} \to \mathbb{R} such that for all real numbers a,b,ca, b, c, we have
f(a+b+c)f(ab+bc+ca)f(a)f(b)f(c)=f(a+b)f(b+c)f(c+a). f(a + b + c)f(ab + bc + ca) - f(a)f(b)f(c) = f(a + b)f(b + c)f(c + a).

Solution

Let P(a,b,c)\mathcal{P}(a, b, c) denote the expression
f(a+b+c)f(ab+bc+ca)=f(a)f(b)f(c)+f(a+b)f(b+c)f(c+a). f(a + b + c)f(ab + bc + ca) = f(a)f(b)f(c) + f(a + b)f(b + c)f(c + a).

P(0,0,0)f(0)2=2f(0)3.\mathcal{P}(0, 0, 0) \Rightarrow f(0)^2 = 2f(0)^3. So, f(0)=12f(0) = \frac{1}{2} or f(0)=0f(0) = 0. Exclude the solution f0f \equiv 0.

Case 1 (f(0)=12f(0) = \frac{1}{2}):
P(a,0,0)14f(a)=12f(a)2a,f(a)=0\mathcal{P}(a, 0, 0) \Rightarrow \frac{1}{4}f(a) = \frac{1}{2}f(a)^2 \Rightarrow \forall a, f(a) = 0 or f(a)=12f(a) = \frac{1}{2}.

Now, if there is r0r \neq 0 such that f(r)=12f(r) = \frac{1}{2}, take any a(r3,r3)a \in \left(-\frac{|r|}{3}, \frac{|r|}{3}\right). Then, since (r+3a)(ra)>0(r + 3a)(r - a) > 0, we will find real solutions to x2+(ar)x+a(ar)=0x^2 + (a - r)x + a(a - r) = 0, which we call bb and cc. Then, (a+b+c)=r(a + b + c) = r and (ab+bc+ca)=0(ab + bc + ca) = 0. Therefore, P(a,b,c)f(a)f(b)f(c)+f(a+b)f(b+c)f(c+a)=14\mathcal{P}(a, b, c) \Rightarrow f(a)f(b)f(c) + f(a + b)f(b + c)f(c + a) = \frac{1}{4}, so f(a)=12f(a) = \frac{1}{2}. So f(a)=12f(a) = \frac{1}{2} for all a(r3,r3)a \in \left(-\frac{|r|}{3}, \frac{|r|}{3}\right).

If f(a+b)=0f(a+b) = 0, then P(a,b,0)12f(a)f(b)=0\mathcal{P}(a, b, 0) \Rightarrow \frac{1}{2}f(a)f(b) = 0, so f(a)=0f(a) = 0 or f(b)=0f(b) = 0. Therefore, if f(a)=f(b)=12f(a) = f(b) = \frac{1}{2}, then f(a+b)=12f(a+b) = \frac{1}{2}. Since f=12f = \frac{1}{2} in an interval containing 00, we can therefore conclude f=12f = \frac{1}{2} on R\mathbb{R}. Clearly, f12f \equiv \frac{1}{2} is a solution.

We claim that f(0)=12f(0) = \frac{1}{2} and f(x)=0f(x) = 0 for all x0x \neq 0 is a solution to the functional equation. If a=b=c=0a = b = c = 0, or (a+b)=(b+c)=(c+a)=0(a+b) = (b+c) = (c+a) = 0, then P(a,b,c)\mathcal{P}(a, b, c) is satisfied. So, we only need to show that if (a+b+c)=(ab+bc+ca)=0(a+b+c) = (ab+bc+ca) = 0, then a=b=c=0a = b = c = 0. However, in this case, a,b,ca, b, c are the three roots (with multiplicity) of x3abc=0x^3 - abc = 0, and the only way they can all be real is if a=b=c=0a = b = c = 0.

Case 2 (f(0)=0f(0) = 0):
Define sets R={xRf(x)=0}R = \{x \in \mathbb{R} \mid f(x) = 0\}, S={xRf(x)0}S = \{x \in \mathbb{R} \mid f(x) \neq 0\}. We know SS is nonempty and does not contain 00.

Claim 1. There are arbitrarily large negative numbers in SS.

Proof. Suppose cSc \in S. Then P(c,c,c)2cS\mathcal{P}(c, c, c) \Rightarrow 2c \in S or 3cS3c \in S. This implies that SS cannot be bounded on both sides, and if SS contains a negative real then it contains arbitrarily large negative reals. So suppose SS does not contain any negative reals, i.e. f(x)=0f(x) = 0 for negative xx. Then, for 2b>a>b>02b > a > b > 0,
P(a,b,a)f(ab)2f(2a)=f(ab)f(a22ab)+f(a)2f(b)=0. \mathcal{P}(a, -b, a) \Rightarrow f(a - b)^2 f(2a) = f(a - b)f(a^2 - 2ab) + f(a)^2 f(-b) = 0.
Let cSc \in S. Take b>cb > c and a=b+ca = b + c. Then f(2a)=0f(2a) = 0. So, f(x)=0f(x) = 0 for all x>4cx > 4c. So, S(0,4c]S \subset (0, 4c]. This contradicts that SS cannot be bounded on both sides. \square

Claim 2. c,dR(c+d)Rc, d \in R \Rightarrow (c + d) \in R.

Proof. If a+b=da + b = d, then P(a,b,c)f(c+d)f(ab+cd)=0\mathcal{P}(a, b, c) \Rightarrow f(c + d)f(ab + cd) = 0.
Varying a,ba, b over all reals such that a+b=da + b = d, abab takes all values in (,d24](-\infty, \frac{d^2}{4}]. Since SS contains arbitrarily large negative numbers, we can find f(ab+cd)0f(ab + cd) \neq 0 for some a,ba, b with a+b=da + b = d. Therefore f(c+d)=0f(c + d) = 0. \square

Claim 3. rR    rRr \in R \iff -r \in R. Also, sS    sSs \in S \iff -s \in S.

Proof. Take rR-r \in R. By Claim 2, nrR-nr \in R for all nNn \in \mathbb{N}.
P(2r,2r,r)f(r)2f(4r)=f(3r)f(0)+f(2r)2f(r)=0 \mathcal{P}(2r, 2r, -r) \Rightarrow f(r)^2 f(4r) = f(3r)f(0) + f(2r)^2 f(-r) = 0
So, rRr \in R or 8rR8r \in R. If 8rR8r \in R, then so is 8r+(7r)=r8r + (-7r) = r. So, rRr \in R in either case.
Therefore rR    rRr \in R \iff -r \in R. Since S=RRS = \mathbb{R} \setminus R, the other equivalence follows. \square

Claim 4. If rR{0}r \in R \setminus \{0\} and sSs \in S, then srR\frac{s}{r} \in R.

Proof.
P(r,sr,0)f(r+sr)f(s)=f(r+sr)f(r)f(sr)=0f(r+sr)=0 \mathcal{P}\left(r, \frac{s}{r}, 0\right) \Rightarrow f\left(r+\frac{s}{r}\right) f(s) = f\left(r+\frac{s}{r}\right) f(r) f\left(\frac{s}{r}\right) = 0 \Rightarrow f\left(r+\frac{s}{r}\right) = 0
Using Claim 2 and Claim 3, we get that sr=(r+sr)+(r)R\frac{s}{r} = \left(r + \frac{s}{r}\right) + (-r) \in R.

Claim 5. rR,sS(r+s)S,rsRr \in R, s \in S \Rightarrow (r+s) \in S, rs \in R

Proof. If (r+s)R(r+s) \in R, we will get s=(r+s)+(r)Rs = (r+s)+(-r) \in R , which is a contradiction. Thus, (r+s)S(r+s) \in S. Now,
P(r,s,0)f(rs)=f(r)f(s)=0rsR. \mathcal{P}(r, s, 0) \Rightarrow f(rs) = f(r)f(s) = 0 \Rightarrow rs \in R.

Claim 6. ff is injective at 00, i.e. R={0}R = \{0\}

Proof. We know there is some sSs \in S. Assume that we have rR{0}r \in R \setminus \{0\}. By Claim 5 and Claim 3, (r+s),(s)S(r+s), (-s) \in S. Also Claim 4 implies srR\frac{s}{r} \in R. Therefore, by Claim 5, we get (sr)(r+s)R(\frac{s}{r}) \cdot (r+s) \in R and (sr)(s)R(\frac{s}{r}) \cdot (-s) \in R. Then, by Claim 2, s=(sr)(r+s)+(sr)(s)Rs = (\frac{s}{r}) \cdot (r+s) + (\frac{s}{r}) \cdot (-s) \in R, which is a contradiction.
Therefore, we can conclude that R={0}R = \{0\}.

So, for any a,ba, b such that (a+b)0(a+b) \neq 0, P(a,b,0)f(ab)=f(a)f(b)\mathcal{P}(a,b,0) \Rightarrow f(ab) = f(a)f(b).
Given cSc \in S, P(a,a,c)f(a)f(a)f(c)=f(a2)f(c)f(a2)=f(a)f(a)\mathcal{P}(a, -a, c) \Rightarrow f(a)f(-a)f(c) = f(-a^2)f(c) \Rightarrow f(-a^2) = f(a)f(-a). These two statements combined imply that ff is multiplicative. So f(1)=1f(1) = 1.

Now, take abc=qabc = q and (a+b)(b+c)(c+a)=p(a+b)(b+c)(c+a) = p. Then, since ff is multiplicative,
f(p+q)=f((a+b+c)(ab+bc+ca))=f((a+b)(b+c)(c+a))+f(abc)=f(p)+f(q) f(p+q) = f((a+b+c)(ab+bc+ca)) = f((a+b)(b+c)(c+a)) + f(abc) = f(p) + f(q)

Lemma. Given any p,qR{0}p, q \in \mathbb{R} \setminus \{0\}, we can find a,b,cRa, b, c \in \mathbb{R} such that (a+b)(b+c)(c+a)=p(a+b)(b+c)(c+a) = p and abc=qabc = q.

Proof. If we find a,b,ca, b, c such that (a+b)(b+c)(c+a)abc=pq\frac{(a+b)(b+c)(c+a)}{abc} = \frac{p}{q}, then by scaling a,b,ca, b, c by (qabc)1/3\left(\frac{q}{abc}\right)^{1/3}, we will get appropriate numbers.
Now if we take b0b \neq 0 and c0c \neq 0 to have opposite signs such that (b+c)0(b+c) \neq 0, then (a+b)(b+c)(c+a)abc=pq    a2+(b+c)a+bc=apbcq(b+c)\frac{(a+b)(b+c)(c+a)}{abc} = \frac{p}{q} \iff a^2 + (b+c)a + bc = a \cdot \frac{pbc}{q(b+c)}. Treating this as a quadratic in aa, the discriminant is positive. Now, take aa to be one of the roots.

Therefore ff is additive. So, for any qQq \in \mathbb{Q}, we have f(q)=qf(1)=qf(q) = qf(1) = q. However, since f:RRf: \mathbb{R} \to \mathbb{R} is multiplicative as well, f(x)>0f(x) > 0 for all x>0x > 0, so ff is monotonically increasing. Since rationals are dense in R\mathbb{R}, we get f(x)=xf(x) = x for all xRx \in \mathbb{R}.

Final answer:
The solutions are:
- f(x)12f(x) \equiv \frac{1}{2} for all xRx \in \mathbb{R}.
- f(0)=12f(0) = \frac{1}{2} and f(x)=0f(x) = 0 for all x0x \neq 0.
- f(x)=xf(x) = x for all xRx \in \mathbb{R}.

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.