Understanding Analysis · Chapter 2 · §2.6

The Cauchy Criterion

Exercise 2.6.4

Let (an)(a_{n}) and (bn)(b_{n}) be Cauchy sequences. Determine whether cn=∣an−bn∣c_{n} = |a_{n} - b_{n}| is a Cauchy sequence.

Proof.
To show cn=∣an−bn∣c_{n} = |a_{n} - b_{n}| is a Cauchy sequence, we need to show that for every ϵ>0\epsilon > 0, there exists N∈NN \in \mathbb{N} such that m,n≥Nm, n \geq N implies

∣∣an−bn∣−∣am−bm∣∣<ϵ||a_{n} - b_{n}| - |a_{m} - b_{m}|| < \epsilon

We use the reverse triangle inequality

∣∣an−bn∣−∣am−bm∣∣≤∣an−bn−(am−bm)∣≤∣an−am−bn+bm∣≤∣(an−am)+(bm−bn)∣(1)\begin{aligned} ||a_{n} - b_{n}| - |a_{m} - b_{m}|| &\leq |a_{n} - b_{n} - (a_{m} - b_{m})| \\ &\leq |a_{n} - a_{m} - b_{n} + b_{m}| \\ &\leq |(a_{n} - a_{m}) + (b_{m} - b_{n})| \end{aligned} \tag{1}

Using the triangle inequality

∣(an−am)+(bm−bn)∣≤∣an−am∣+∣bm−bn∣(2)|(a_{n} - a_{m}) + (b_{m} - b_{n})| \leq |a_{n} - a_{m}| + |b_{m} - b_{n}| \tag{2}

We are given that (an)(a_{n}) and (bn)(b_{n}) are Cauchy sequences. By the definition of Cauchy, there exists an NaN_{a} and NbN_{b} where the terms in (an)(a_{n}) and (bn)(b_{n}) get arbitrarily close. We then choose N=max{Na,Nb}N = \text{max}\{N_{a}, N_{b}\} such that

∣an−am∣<ϵ2and∣bm−bn∣<ϵ2|a_{n} - a_{m}| < \frac{\epsilon}{2} \quad \text{and} \quad |b_{m} - b_{n}| < \frac{\epsilon}{2}

for every m,n≥Nm, n \geq N.

Then we can combine with the LHS of (1) and substitute into the RHS of (2)

∣∣an−bn∣−∣am−bm∣∣≤∣(an−am)+(bm−bn)∣<ϵ2+ϵ2=ϵ||a_{n} - b_{n}| - |a_{m} - b_{m}|| \leq |(a_{n} - a_{m}) + (b_{m} - b_{n})| < \frac{\epsilon}{2} + \frac{\epsilon}{2} = \epsilon

We have found an NN where ∣∣an−bn∣−∣am−bm∣∣<ϵ||a_{n} - b_{n}| - |a_{m} - b_{m}|| < \epsilon for every m,n≥Nm, n \geq N. That means cn=∣an−bn∣c_{n} = |a_{n} - b_{n}| is Cauchy. ■\blacksquare

Stephen Abbott, Understanding Analysis, 2nd edition.