Proving Cauchy Sequences: Infinite Subsequences

clg211
Messages
4
Reaction score
0
Hi,

I need to prove that any infinite subsequence {xnk}of a Cauchy sequence {xn}is a Cauchy sequence equivalent to {xn}.

My problem is that it seemed way too easy, so I'm concerned that I missed something. Please see the attachment for my solution, and let me know what you think.

Thanks.
 

Attachments

  • Problem 45.png
    Problem 45.png
    31.3 KB · Views: 633
Physics news on Phys.org
The definition of "Cauchy" sequence is that |an- am| goes to 0 as m and n go to infinity, independently. That can be stated as "Given any \epsilon> 0, there exist N such that if m> N and n> N, then |a_n- a_m|< \epsilon. If an and am are from a subsequence, then they are also in the original sequence so that must be true.

Showing that the two sequences are "equivalent" means showing that the converge to the same limit. Again, if {an} converges to L, then, for any \epsilon> 0, there exist N such that if n> N then |a_n- L|< \epsilon. If an is from a subsequence, it is from the sequence and so that is still true.

Strictly speaking, you only need to prove the second because any convergent sequence is a Cauchy sequence.
 
For the the equivalence part, I want to show that the difference of the Cauchy sequence and its subsequence is a null sequence. Let xn and xnk exist in the Cauchy sequence where xnk is also an element in the subsequence. Therefore, |xn - xnk| < epsilon for n, nk < N, so Cauchy sequence - subsequence is null. Sound legitimate? Just seems too simple.

I hear where you're coming from with the limits being the same for equivalence, but we're supposed to use the "difference is null" definition.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top