← 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 13 yrs · Read the full method →
Question
Prove that the sequence ( a n ) (a_n) ( a n ) satisfying the condition ∣ a n + 1 − a n ∣ ≤ α ∣ a n − a n − 1 ∣ |a_{n+1}-a_n|\le\alpha|a_n-a_{n-1}| ∣ a n + 1 − a n ∣ ≤ α ∣ a n − a n − 1 ∣ , 0 < α < 1 0<\alpha<1 0 < α < 1 for all natural numbers n ≥ 2 n\ge2 n ≥ 2 , is a Cauchy sequence.
Technique
Geometric bound on consecutive differences ⇒ \Rightarrow ⇒ telescoping + geometric series tail; standard Cauchy ε \varepsilon ε –N N N argument. (This is the “contraction” estimate underlying the Banach fixed-point theorem.)
Solution
Step 1 — Bound consecutive differences geometrically
Write d n = ∣ a n + 1 − a n ∣ d_n=|a_{n+1}-a_n| d n = ∣ a n + 1 − a n ∣ for n ≥ 1 n\ge1 n ≥ 1 . The hypothesis says d n ≤ α d n − 1 d_n\le\alpha\,d_{n-1} d n ≤ α d n − 1 for all n ≥ 2 n\ge2 n ≥ 2 . Iterating,
d n ≤ α d n − 1 ≤ α 2 d n − 2 ≤ ⋯ ≤ α n − 1 d 1 , d_n\le\alpha\,d_{n-1}\le\alpha^2 d_{n-2}\le\cdots\le\alpha^{\,n-1}d_1, d n ≤ α d n − 1 ≤ α 2 d n − 2 ≤ ⋯ ≤ α n − 1 d 1 ,
i.e.
∣ a n + 1 − a n ∣ ≤ α n − 1 ∣ a 2 − a 1 ∣ ( n ≥ 1 ) . |a_{n+1}-a_n|\le\alpha^{\,n-1}|a_2-a_1|\qquad(n\ge1). ∣ a n + 1 − a n ∣ ≤ α n − 1 ∣ a 2 − a 1 ∣ ( n ≥ 1 ) .
Let D = ∣ a 2 − a 1 ∣ D=|a_2-a_1| D = ∣ a 2 − a 1 ∣ . (If D = 0 D=0 D = 0 then all d n = 0 d_n=0 d n = 0 and the sequence is constant from a 1 a_1 a 1 , hence trivially Cauchy. Assume D > 0 D>0 D > 0 .)
Step 2 — Bound ∣ a m − a n ∣ |a_m-a_n| ∣ a m − a n ∣ for m > n m>n m > n via the triangle inequality
For m > n ≥ 1 m>n\ge1 m > n ≥ 1 , telescoping and the triangle inequality give
∣ a m − a n ∣ ≤ ∑ k = n m − 1 ∣ a k + 1 − a k ∣ ≤ ∑ k = n m − 1 α k − 1 D = D α n − 1 ∑ j = 0 m − 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}. ∣ a m − a n ∣ ≤ k = n ∑ m − 1 ∣ a k + 1 − a k ∣ ≤ k = n ∑ m − 1 α k − 1 D = D α n − 1 j = 0 ∑ m − n − 1 α j .
Since 0 < α < 1 0<\alpha<1 0 < α < 1 , the finite geometric sum is bounded by the convergent series:
∑ j = 0 m − n − 1 α j < ∑ j = 0 ∞ α j = 1 1 − α . \sum_{j=0}^{m-n-1}\alpha^{\,j}<\sum_{j=0}^{\infty}\alpha^{\,j}=\frac{1}{1-\alpha}. j = 0 ∑ m − n − 1 α j < j = 0 ∑ ∞ α j = 1 − α 1 .
Therefore
∣ a m − a n ∣ ≤ D α n − 1 1 − α ( m > n ) . |a_m-a_n|\le \frac{D\,\alpha^{\,n-1}}{1-\alpha}\qquad(m>n). ∣ a m − a n ∣ ≤ 1 − α D α n − 1 ( m > n ) .
Step 3 — α n − 1 → 0 \alpha^{\,n-1}\to0 α n − 1 → 0 , so the tail is arbitrarily small
Since 0 < α < 1 0<\alpha<1 0 < α < 1 , α n − 1 → 0 \alpha^{\,n-1}\to 0 α n − 1 → 0 as n → ∞ n\to\infty n → ∞ . Hence the right-hand side D α n − 1 1 − α → 0 \dfrac{D\,\alpha^{\,n-1}}{1-\alpha}\to0 1 − α D α n − 1 → 0 .
Formal ε \varepsilon ε argument. Let ε > 0 \varepsilon>0 ε > 0 . Choose N N N so large that
D α N − 1 1 − α < ε . \frac{D\,\alpha^{\,N-1}}{1-\alpha}<\varepsilon. 1 − α D α N − 1 < ε .
This is possible because α N − 1 → 0 \alpha^{\,N-1}\to0 α N − 1 → 0 ; explicitly any
N > 1 + log ( ε ( 1 − α ) / D ) log α N>1+\frac{\log\!\big(\varepsilon(1-\alpha)/D\big)}{\log\alpha} N > 1 + log α log ( ε ( 1 − α ) / D )
works (note log α < 0 \log\alpha<0 log α < 0 ). Then for all m > n ≥ N m>n\ge N m > n ≥ N , since α n − 1 ≤ α N − 1 \alpha^{\,n-1}\le\alpha^{\,N-1} α n − 1 ≤ α N − 1 ,
∣ a m − a n ∣ ≤ D α n − 1 1 − α ≤ D α N − 1 1 − α < ε . |a_m-a_n|\le\frac{D\,\alpha^{\,n-1}}{1-\alpha}\le\frac{D\,\alpha^{\,N-1}}{1-\alpha}<\varepsilon. ∣ a m − a n ∣ ≤ 1 − α D α n − 1 ≤ 1 − α D α N − 1 < ε .
(The case m = n m=n m = n is trivial; m < n m<n m < n follows by symmetry.)
Step 4 — Conclusion
For every ε > 0 \varepsilon>0 ε > 0 there exists N N N with ∣ a m − a n ∣ < ε |a_m-a_n|<\varepsilon ∣ a m − a n ∣ < ε for all m , n ≥ N m,n\ge N m , n ≥ N . By definition, ( a n ) (a_n) ( a n ) is a Cauchy sequence .
Answer
∣ a m − a n ∣ ≤ ∣ a 2 − a 1 ∣ α n − 1 1 − α → n → ∞ 0 ⇒ ( a n ) 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.}\;} ∣ a m − a n ∣ ≤ 1 − α ∣ a 2 − a 1 ∣ α n − 1 n → ∞ 0 ⇒ ( a n ) is Cauchy.