← 2017 Paper 2

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

15 marks · Section A

Taylor's Series for Analytic Functions · Complex Analysis · Read the full method →

Question

For a function f:C→Cf:\mathbb C\to\mathbb C and n≥1n\ge1, let f(n)f^{(n)} denote the nnth derivative of ff and f(0)=ff^{(0)}=f. Let ff be an entire function such that for some n≥1n\ge1, f(n) ⁣(1k)=0f^{(n)}\!\left(\dfrac{1}{k}\right)=0 for all k=1,2,3,…k=1,2,3,\ldots. Show that ff is a polynomial.

Technique

Derivatives of entire functions are entire; Identity Theorem on f(n)f^{(n)} using the accumulation point 00 of {1/k}\{1/k\}; then f(n)≡0⇒ff^{(n)}\equiv0\Rightarrow f polynomial of degree <n<n.

Solution

The strategy: derivatives of an entire function are entire, so f(n)f^{(n)} is entire; it vanishes on a set with an accumulation point, hence is identically zero by the Identity Theorem; an entire function whose nnth derivative is 00 is a polynomial of degree <n<n.

Step 1 — f(n)f^{(n)} is entire

Since ff is entire (analytic on all of C\mathbb C), it is infinitely complex-differentiable, and every derivative of an analytic function is again analytic. In particular g:=f(n)g:=f^{(n)} is entire.

Step 2 — The zero set has an accumulation point in C\mathbb C

By hypothesis g ⁣(1k)=f(n) ⁣(1k)=0g\!\left(\tfrac1k\right)=f^{(n)}\!\left(\tfrac1k\right)=0 for all k=1,2,3,…k=1,2,3,\ldots. The points zk=1kz_k=\tfrac1k are distinct, lie in C\mathbb C, and satisfy

zk=1k⟶0(k→∞).z_k=\frac1k\longrightarrow 0\quad(k\to\infty).

So the zero set {zk}\{z_k\} has the accumulation point 00, and crucially 0∈C0\in\mathbb C — it is in the domain C\mathbb C on which gg is analytic. (By continuity g(0)=lim⁡kg(1/k)=0g(0)=\lim_k g(1/k)=0 too, so 00 is itself a zero, but the accumulation is the key point.)

Step 3 — Identity Theorem ⇒g≡0\Rightarrow g\equiv0

Identity Theorem. If a function analytic on a connected open set has zeros accumulating at a point inside that set, then it is identically zero there.

C\mathbb C is connected and open; g=f(n)g=f^{(n)} is analytic on it; its zeros {1/k}\{1/k\} accumulate at 0∈C0\in\mathbb C. Therefore

f(n)(z)≡0for all z∈C.f^{(n)}(z)\equiv0\quad\text{for all }z\in\mathbb C.

Step 4 — f(n)≡0f^{(n)}\equiv0 forces ff to be a polynomial of degree <n<n

Integrating nn times: f(n)≡0f^{(n)}\equiv0 gives f(n−1)≡cn−1f^{(n-1)}\equiv c_{n-1} (constant), then f(n−2)(z)=cn−1z+cn−2f^{(n-2)}(z)=c_{n-1}z+c_{n-2}, and inductively ff is a polynomial of degree at most n−1n-1. (Equivalently, in the Taylor expansion f(z)=∑m≥0amzmf(z)=\sum_{m\ge0}a_m z^m, we have f(n)(z)=∑m≥nm!(m−n)!amzm−n≡0f^{(n)}(z)=\sum_{m\ge n}\frac{m!}{(m-n)!}a_m z^{m-n}\equiv0, which forces am=0a_m=0 for all m≥nm\ge n.)

Hence ff is a polynomial:

Answer

  f(n) ⁣(1k)=0 ∀k ⟹ f(n)≡0 ⟹ f is a polynomial of degree≤n−1.  \boxed{\;f^{(n)}\!\left(\tfrac1k\right)=0\ \forall k\ \Longrightarrow\ f^{(n)}\equiv0\ \Longrightarrow\ f\text{ is a polynomial of degree}\le n-1.\;}
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 — 14 years, mapped. Get the take-away PDF free.