← 2018 Paper 2

UPSC 2018 Maths Optional Paper 2 Q4a — Step-by-Step Solution

20 marks · Section A

Real number system as ordered field with LUB property · Real Analysis · asked 2× in 13 yrs · Read the full method →

Question

Suppose R\mathbb R be the set of all real numbers and f:RRf:\mathbb R\to\mathbb R is a function such that the following equations hold for all x,yRx,y\in\mathbb R:

Show that xR\forall x\in\mathbb R either f(x)=0f(x)=0, or, f(x)=xf(x)=x.

Technique

Ring-homomorphism structure: (ii) at x=y=1x=y=1 splits into zero/identity cases; additivity fixes Q\mathbb Q; (ii) gives squares \to non-negatives \Rightarrow monotonicity; density of Q\mathbb Q + monotonicity \Rightarrow f=idf=\mathrm{id}.

Solution

We must show the only functions satisfying both Cauchy’s additive equation (i) and the multiplicative equation (ii) are the zero map and the identity map (and that one of these holds globally, not pointwise-mixed).

Step 1 — f(1)=0f(1)=0 or f(1)=1f(1)=1

Put x=y=1x=y=1 in (ii): f(1)=f(1)2f(1)=f(1)^2, so f(1)(f(1)1)=0f(1)\big(f(1)-1\big)=0, giving

f(1)=0orf(1)=1.f(1)=0\quad\text{or}\quad f(1)=1.

Case f(1)=0f(1)=0. For any xx, (ii) with y=1y=1 gives f(x)=f(x1)=f(x)f(1)=0f(x)=f(x\cdot1)=f(x)f(1)=0. So f0f\equiv0 — the zero map. From here assume f(1)=1f(1)=1.

Step 2 — ff fixes the integers, then the rationals

From (i), f(0)=f(0)+f(0)f(0)=0f(0)=f(0)+f(0)\Rightarrow f(0)=0, and f(x)=f(x)f(-x)=-f(x). By induction, additivity gives f(n)=nf(1)=nf(n)=nf(1)=n for all nZn\in\mathbb Z.

For a rational q=p/nq=p/n (pZ,nNp\in\mathbb Z,n\in\mathbb N): additivity gives f(nq)=nf(q)f(n\cdot q)=nf(q), and nq=pn\cdot q=p, so nf(q)=f(p)=pnf(q)=f(p)=p, hence

f(q)=pn=qfor all qQ.f(q)=\frac{p}{n}=q\qquad\text{for all }q\in\mathbb Q.

So ff is the identity on Q\mathbb Q.

Step 3 — ff is monotone (order-preserving) via squares

The key extra ingredient beyond Cauchy: ff maps squares to squares, hence non-negatives to non-negatives. For t0t\ge0, write t=s2t=s^2; then by (ii)

f(t)=f(s2)=f(s)20.f(t)=f(s^2)=f(s)^2\ge0.

Thus x0f(x)0x\ge0\Rightarrow f(x)\ge0. Now if xyx\le y then yx0y-x\ge0, so f(y)f(x)=f(yx)0f(y)-f(x)=f(y-x)\ge0 (using additivity and f(x)=f(x)f(-x)=-f(x)). Therefore

xy  f(x)f(y):f is monotone non-decreasing.x\le y\ \Longrightarrow\ f(x)\le f(y):\quad f\text{ is monotone non-decreasing.}

Step 4 — Monotone + identity on Q\mathbb Q forces f=idf=\mathrm{id}

Let xRx\in\mathbb R be arbitrary. Choose rationals q1xq2q_1\le x\le q_2. By monotonicity and Step 2,

q1=f(q1)f(x)f(q2)=q2.q_1=f(q_1)\le f(x)\le f(q_2)=q_2.

Since rationals are dense, we may let q1xq_1\uparrow x and q2xq_2\downarrow x; squeezing gives

f(x)=xfor all xR.f(x)=x\qquad\text{for all }x\in\mathbb R.

So in the case f(1)=1f(1)=1, ff is the identity.

Conclusion

Either f0f\equiv0 (case f(1)=0f(1)=0) or f(x)=xf(x)=x for all xx (case f(1)=1f(1)=1). In both cases, for every xx, f(x)=0f(x)=0 or f(x)=xf(x)=x:

Answer

  f0orf=idR.  \boxed{\;f\equiv0\quad\text{or}\quad f=\mathrm{id}_{\mathbb R}.\;}
We post more of this — worked solutions, CSAT trap breakdowns, guide chapters — a few times a week on Telegram. Free, no sign-in. Join

This solution is part of the Maths Coverage Map — 13 years, mapped. Get the take-away PDF free.