Cauchy Sequences and Completeness in R^n ....

In summary, we discussed the completeness of $\mathbb{R}^n$ in Duistermaat and Kolk's "Multidimensional Real Analysis I: Differentiation" and examined the proof of Theorem 1.6.5. We focused on the statement that the whole sequence converges to the same limit if a subsequence of a Cauchy sequence converges to a limit, and demonstrated this formally and rigorously. This was done by choosing a specific $x_k$ in the subsequence that is close enough to the limit $a$, and showing that all elements after a certain point are also close to $a$, thus proving that the entire sequence converges to $a$.
  • #1
Math Amateur
Gold Member
MHB
3,998
48
I am reading "Multidimensional Real Analysis I: Differentiation" by J. J. Duistermaat and J. A. C. Kolk ...

I am focused on Chapter 1: Continuity ... ...

I need help with an aspect of the proof of Theorem 1.6.5 (Completeness of \(\displaystyle \mathbb{R}^n\)) ...

Duistermaat and Kolk"s Theorem 1.6.5 and its proof (including the preceding notes on Cauchy Sequences) read as follows:View attachment 7713
In the above proof of Theorem 1.6.5 we read the following:

" ... ... But then the Cauchy property implies that the whole sequence converges to the same limit. ... ... "D&K don't seem to prove this statement anywhere ... presumably they think the proof is obvious ... but I cannot see exactly why it must be true ...

Can someone please demonstrate formally and rigorously that if a subsequence of a Cauchy sequence converges to a
limit then the whole sequence converges to the same limit. ... ...Peter
 
Physics news on Phys.org
  • #2
Hi Peter,

Assume that the Cauchy sequence $(x_k)$ contains a subsequence $Y = (y_i)$ that converges to $a$. Given $\varepsilon>0$, there are integers $N_1$ and $N_2$ such that:

  • $k, n>N_1 \Rightarrow \Vert x_k-x_n\Vert<\varepsilon/2$
  • $m>N_2,x_m\in Y\Rightarrow\Vert x_m-a\Vert<\varepsilon/2$.

Take $N=\max(N_1,N_2)$, and choose $k>N$ such that $x_k$ belongs to the subsequence $Y$; this implies that $\Vert x_k-a\Vert<\varepsilon/2$. For any $n>N$, we have:

$$\Vert x_n-a\Vert \le \Vert x_n-x_k\Vert + \Vert x_k-a\Vert < \varepsilon$$​

and this shows that the sequence $(x_n)$ converges to $a$.
 
  • #3
castor28 said:
Hi Peter,

Assume that the Cauchy sequence $(x_k)$ contains a subsequence $Y = (y_i)$ that converges to $a$. Given $\varepsilon>0$, there are integers $N_1$ and $N_2$ such that:

  • $k, n>N_1 \Rightarrow \Vert x_k-x_n\Vert<\varepsilon/2$
  • $m>N_2,x_m\in Y\Rightarrow\Vert x_m-a\Vert<\varepsilon/2$.

Take $N=\max(N_1,N_2)$, and choose $k>N$ such that $x_k$ belongs to the subsequence $Y$; this implies that $\Vert x_k-a\Vert<\varepsilon/2$. For any $n>N$, we have:

$$\Vert x_n-a\Vert \le \Vert x_n-x_k\Vert + \Vert x_k-a\Vert < \varepsilon$$

and this shows that the sequence $(x_n)$ converges to $a$.
Hi castor28 ... thanks for the help !

But just a small point of clarification ... ... ,,, you write:

" ... ... Take $N=\max(N_1,N_2)$, and choose $k>N$ such that $x_k$ belongs to the subsequence $Y$ ... ... "This implies that there is an \(\displaystyle N\) such that for elements of the Cauchy sequence ... EVERY one of them after \(\displaystyle N\) belong to the subsequence ... how do we know that such an \(\displaystyle N\) exists ...

Hope you can clarify ...Thanks again for your help ...

Peter***EDIT*** Hmm ... already beginning to doubt that my interpretation of your statements is true ...

it appears that the term \(\displaystyle x_k\) in the expression

\(\displaystyle \Vert x_n-a\Vert \le \Vert x_n-x_k\Vert + \Vert x_k-a\Vert < \varepsilon\)

is just an element of the subsequence for which \(\displaystyle k \gt N\) ... ... Is that right?

I have to say that proving the above expression for all \(\displaystyle n \gt N\) by relying on specially chosen elements \(\displaystyle x_k\) surprised me ...

Peter
 
Last edited:
  • #4
Peter said:
***EDIT*** Hmm ... already beginning to doubt that my interpretation of your statements is true ...

it appears that the term \(\displaystyle x_k\) in the expression

\(\displaystyle \Vert x_n-a\Vert \le \Vert x_n-x_k\Vert + \Vert x_k-a\Vert < \varepsilon\)

is just an element of the subsequence for which \(\displaystyle k \gt N\) ... ... Is that right?

I have to say that proving the above expression for all \(\displaystyle n \gt N\) by relying on specially chosen elements \(\displaystyle x_k\) surprised me ...

Peter

Hi Peter,

Your last interpretation is correct. $N_1$ and $N_2$ correspond to the fact that $X$ is Cauchy and $Y$ is convergent, respectively. By taking $N=\max(N_1,N_2)$, we ensure that, in the part of the sequence after $x_N$, both inequalities are satisfied; of course, the second inequality is only relevant to elements of the sequence that belong to $Y$.

Now, the terms after $x_N$ contain at least one term of $Y$, because $Y$ is an infinite sequence and the condition $n>N$ only removes finitely many terms. We can therefore choose one such term $x_k\in Y$ with $k>N$. We can then keep $x_k$ fixed and show that all the elements $\{x_n\mid n>N\}$ satisfy $\Vert x_n-a\Vert<\varepsilon$, which means that $X$ converges to $a$.

Intuitively, the idea is quite simple. After a certain point, the elements of $X$ are close to each other. On the other hand, $Y\subset X$ contains infinitely many elements close to $a$. As the other points of $X$ are close to that point, they are also close to $a$.

It is true that the proof only uses one particular $x_k\in Y$. This is not a problem, since any $x_k$ close enough to $a$ will do, and we have an infinite supply of them.
 
  • #5
castor28 said:
Hi Peter,

Your last interpretation is correct. $N_1$ and $N_2$ correspond to the fact that $X$ is Cauchy and $Y$ is convergent, respectively. By taking $N=\max(N_1,N_2)$, we ensure that, in the part of the sequence after $x_N$, both inequalities are satisfied; of course, the second inequality is only relevant to elements of the sequence that belong to $Y$.

Now, the terms after $x_N$ contain at least one term of $Y$, because $Y$ is an infinite sequence and the condition $n>N$ only removes finitely many terms. We can therefore choose one such term $x_k\in Y$ with $k>N$. We can then keep $x_k$ fixed and show that all the elements $\{x_n\mid n>N\}$ satisfy $\Vert x_n-a\Vert<\varepsilon$, which means that $X$ converges to $a$.

Intuitively, the idea is quite simple. After a certain point, the elements of $X$ are close to each other. On the other hand, $Y\subset X$ contains infinitely many elements close to $a$. As the other points of $X$ are close to that point, they are also close to $a$.

It is true that the proof only uses one particular $x_k\in Y$. This is not a problem, since any $x_k$ close enough to $a$ will do, and we have an infinite supply of them.
Hi castor28 ... thanks for the help and the really clear explanation ... really helpful!

Peter
 

FAQ: Cauchy Sequences and Completeness in R^n ....

1. What is a Cauchy sequence?

A Cauchy sequence is a sequence of real numbers that gets arbitrarily close to each other as the sequence progresses. This means that for any small distance, there exists a point in the sequence where all subsequent points are within that distance from each other.

2. How is a Cauchy sequence different from a convergent sequence?

A Cauchy sequence is different from a convergent sequence in that a Cauchy sequence only needs to get close to each other, while a convergent sequence needs to approach a specific limit.

3. What is completeness in R^n?

Completeness in R^n refers to the property of a metric space where every Cauchy sequence in that space converges to a point within that space. In other words, there are no "gaps" or missing points in the space.

4. How is completeness related to the Bolzano-Weierstrass theorem?

The Bolzano-Weierstrass theorem states that every bounded sequence in R^n has a convergent subsequence. Completeness is related to this theorem because a complete metric space guarantees the existence of a limit for every Cauchy sequence, which is necessary for the existence of a convergent subsequence.

5. Can completeness be used to prove the convergence of a series?

No, completeness alone is not enough to prove the convergence of a series. It is necessary for a metric space to be complete for the Cauchy criterion to hold, but there are other conditions that must also be met, such as boundedness and monotonicity, for a series to converge.

Back
Top