← 2020 Paper 2

UPSC 2020 Maths Optional Paper 2 Q1c — Step-by-Step Solution

10 marks · Section A

Cauchy sequences; completeness of R · Real Analysis · asked 3× in 14 yrs · Read the full method →

Question

Prove that the sequence (an)(a_n) satisfying the condition ∣an+1−an∣≤α∣an−an−1∣|a_{n+1}-a_n|\le\alpha|a_n-a_{n-1}|, 0<α<10<\alpha<1 for all natural numbers n≥2n\ge2, is a Cauchy sequence.

Technique

Geometric bound on consecutive differences ⇒\Rightarrow telescoping + geometric series tail; standard Cauchy ε\varepsilon–NN argument. (This is the “contraction” estimate underlying the Banach fixed-point theorem.)

Solution

Step 1 — Bound consecutive differences geometrically

Write dn=∣an+1−an∣d_n=|a_{n+1}-a_n| for n≥1n\ge1. The hypothesis says dn≤α dn−1d_n\le\alpha\,d_{n-1} for all n≥2n\ge2. Iterating,

dn≤α dn−1≤α2dn−2≤⋯≤α n−1d1,d_n\le\alpha\,d_{n-1}\le\alpha^2 d_{n-2}\le\cdots\le\alpha^{\,n-1}d_1,

i.e.

∣an+1−an∣≤α n−1∣a2−a1∣(n≥1).|a_{n+1}-a_n|\le\alpha^{\,n-1}|a_2-a_1|\qquad(n\ge1).

Let D=∣a2−a1∣D=|a_2-a_1|. (If D=0D=0 then all dn=0d_n=0 and the sequence is constant from a1a_1, hence trivially Cauchy. Assume D>0D>0.)

Step 2 — Bound ∣am−an∣|a_m-a_n| for m>nm>n via the triangle inequality

For m>n≥1m>n\ge1, telescoping and the triangle inequality give

∣am−an∣≤∑k=nm−1∣ak+1−ak∣≤∑k=nm−1α k−1D=D α n−1∑j=0m−n−1α j.|a_m-a_n|\le\sum_{k=n}^{m-1}|a_{k+1}-a_k|\le\sum_{k=n}^{m-1}\alpha^{\,k-1}D = D\,\alpha^{\,n-1}\sum_{j=0}^{m-n-1}\alpha^{\,j}.

Since 0<α<10<\alpha<1, the finite geometric sum is bounded by the convergent series:

∑j=0m−n−1α j<∑j=0∞α j=11−α.\sum_{j=0}^{m-n-1}\alpha^{\,j}<\sum_{j=0}^{\infty}\alpha^{\,j}=\frac{1}{1-\alpha}.

Therefore

∣am−an∣≤D α n−11−α(m>n).|a_m-a_n|\le \frac{D\,\alpha^{\,n-1}}{1-\alpha}\qquad(m>n).

Step 3 — α n−1→0\alpha^{\,n-1}\to0, so the tail is arbitrarily small

Since 0<α<10<\alpha<1, α n−1→0\alpha^{\,n-1}\to 0 as n→∞n\to\infty. Hence the right-hand side D α n−11−α→0\dfrac{D\,\alpha^{\,n-1}}{1-\alpha}\to0.

Formal ε\varepsilon argument. Let ε>0\varepsilon>0. Choose NN so large that

D α N−11−α<ε.\frac{D\,\alpha^{\,N-1}}{1-\alpha}<\varepsilon.

This is possible because α N−1→0\alpha^{\,N-1}\to0; explicitly any

N>1+log⁡ ⁣(ε(1−α)/D)log⁡αN>1+\frac{\log\!\big(\varepsilon(1-\alpha)/D\big)}{\log\alpha}

works (note log⁡α<0\log\alpha<0). Then for all m>n≥Nm>n\ge N, since α n−1≤α N−1\alpha^{\,n-1}\le\alpha^{\,N-1},

∣am−an∣≤D α n−11−α≤D α N−11−α<ε.|a_m-a_n|\le\frac{D\,\alpha^{\,n-1}}{1-\alpha}\le\frac{D\,\alpha^{\,N-1}}{1-\alpha}<\varepsilon.

(The case m=nm=n is trivial; m<nm<n follows by symmetry.)

Step 4 — Conclusion

For every ε>0\varepsilon>0 there exists NN with ∣am−an∣<ε|a_m-a_n|<\varepsilon for all m,n≥Nm,n\ge N. By definition, (an)(a_n) is a Cauchy sequence.

Answer

  ∣am−an∣≤∣a2−a1∣ α n−11−α→n→∞0 ⇒ (an) is Cauchy.  \boxed{\;|a_m-a_n|\le \dfrac{|a_2-a_1|\,\alpha^{\,n-1}}{1-\alpha}\xrightarrow[n\to\infty]{}0\ \Rightarrow\ (a_n)\text{ is Cauchy.}\;}
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.