Subsequence of a cauchy sequence in R

Click For Summary

Homework Help Overview

The discussion revolves around the properties of Cauchy sequences in the real numbers, specifically focusing on the existence of a subsequence that satisfies a certain distance condition. Participants are exploring how to construct a subsequence from a given Cauchy sequence and the implications of the Cauchy property on the distances between terms in the subsequence.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the definition of a Cauchy sequence and how to derive a subsequence that meets the specified distance criteria. There are attempts to clarify the notation and the implications of the conditions given, particularly regarding the indices of the subsequence.

Discussion Status

The conversation is ongoing, with participants providing insights and questioning each other's understanding of the problem. Some guidance has been offered regarding the construction of the subsequence, but there remains some uncertainty about the definitions and the approach to selecting indices.

Contextual Notes

There are mentions of potential typos and misunderstandings regarding the notation used for the subsequence. Participants are also considering the implications of the Cauchy property and how it relates to the selection of indices for the subsequence.

autre
Messages
116
Reaction score
0

Homework Statement



If [itex]\{a_{n}\}\in\mathbb{R}[/itex] is Cauchy, [itex]\forall\epsilon>0,\exists[/itex] a subsequence [itex]\{a_{k_{j}}\}[/itex] so that [itex]|a_{k_{j}}-a_{k_{j+1}}|<\frac{\epsilon}{2^{j+1}}[/itex].

The Attempt at a Solution



Since [itex]\{a_{k_{j}}\}[/itex] is Cauchy,[itex]\forall\epsilon>0[/itex],[itex]\exists N_{\epsilon}[/itex] such that for [itex]j,j+1\geq N_{\epsilon}[/itex],[itex]|a_{k_{j}}-a_{k+1}|<\epsilon[/itex].

I can't figure out how to incorporate [itex]\frac{\epsilon}{2^{j+1}}[/itex].
 
Last edited:
Physics news on Phys.org
autre said:

Homework Statement



If [itex]\{a_{n}\}\in\mathbb{R}[/itex] is Cauchy, [itex]\forall\epsilon>0,\exists[/itex] a subsequence [itex]\{a_{k_{j}}\}[/itex] so that [itex]|a_{k_{j}}-a_{k+1}|<\frac{\epsilon}{2^{j+1}}[/itex].

The Attempt at a Solution



Since [itex]\{a_{k_{j}}\}[/itex] is Cauchy,[itex]\forall\epsilon>0[/itex],[itex]\exists N_{\epsilon}[/itex] such that for [itex]j,j+1\geq N_{\epsilon}[/itex],[itex]|a_{k_{j}}-a_{k+1}|<\epsilon[/itex].

I can't figure out how to incorporate [itex]\frac{\epsilon}{2^{j+1}}[/itex].

I don't think [itex]|a_{k_{j}}-a_{k+1}|<\frac{\epsilon}{2^{j+1}}[/itex] makes much sense. [itex]k_{j}[/itex] is a sequence of integers. k itself doesn't have a value. I think you mean [itex]|a_{k_{j}}-a_{k_{j+1}}|<\frac{\epsilon}{2^{j+1}}[/itex]
 
Dick said:
I don't think [itex]|a_{k_{j}}-a_{k+1}|<\frac{\epsilon}{2^{j+1}}[/itex] makes much sense. [itex]k_{j}[/itex] is a sequence of integers. k itself doesn't have a value. I think you mean [itex]|a_{k_{j}}-a_{k_{j+1}}|<\frac{\epsilon}{2^{j+1}}[/itex]

Sorry, typo.
 
autre said:
Sorry, typo.

Start with j=1. Then there is an N such that for all m,n>=N, [itex]|a_m-a_n|<\epsilon/4[/itex]. Any idea how to chose a value for [itex]k_1[/itex]?
 
How about this --Since [itex]\{a_{n}\}[/itex] is Cauchy, [itex]\exists N_{1}>N s.t. \forall m,n>N_{1}, |a_{m}-a_{n}|<\frac{\epsilon}{4},k_{1}=m[/itex]. Continuing j+1 times, [itex]\exists N_{j+1}>N_{j} s.t. \forall m,n>N_{j+1},|a_{m}-a_{n}|<\frac{\epsilon}{2^{j+1}},k_{j}=m[/itex].
 
autre said:
How about this --


Since [itex]\{a_{n}\}[/itex] is Cauchy, [itex]\exists N_{1}>N s.t. \forall m,n>N_{1}, |a_{m}-a_{n}|<\frac{\epsilon}{4},k_{1}=m[/itex]. Continuing j+1 times, [itex]\exists N_{j+1}>N_{j} s.t. \forall m,n>N_{j+1},|a_{m}-a_{n}|<\frac{\epsilon}{2^{j+1}},k_{j}=m[/itex].

How can you put e.g. [itex]k_{1}=m[/itex]?? It was [itex]\forall m>N[/itex]. m doesn't have a definite value. Are you sure you understand that? It kind of looks like you saw a solution and copied it in a somewhat garbled form.
 
Dick said:
How can you put e.g. [itex]k_{1}=m[/itex]?? It was [itex]\forall m>N[/itex]. m doesn't have a definite value. Are you sure you understand that? It kind of looks like you saw a solution and copied it in a somewhat garbled form.

You've got me there, I'm still confused as to how to approach this. Any clues at to how I might arrive at [itex]k_{1}[/itex]?
 
autre said:
You've got me there, I'm still confused as to how to approach this. Any clues at to how I might arrive at [itex]k_{1}[/itex]?

Why not pick [itex]k_{1}=N_1[/itex]? Then all of the elements of the sequence with indices greater than [itex]N_1[/itex] are within [itex]\epsilon/4[/itex] of [itex]a_{N_1}[/itex]. Do you agree? Don't write a bunch of symbols down if you don't understand what they mean. Try and explain it in words. It would be great if you could actually understand this. Any idea how to pick [itex]k_{2}[/itex]?
 
Dick said:
Why not pick [itex]k_{1}=N_1[/itex]? Then all of the elements of the sequence with indices greater than [itex]N_1[/itex] are within [itex]\epsilon/4[/itex] of [itex]a_{N_1}[/itex]. Do you agree? Don't write a bunch of symbols down if you don't understand what they mean. Try and explain it in words. It would be great if you could actually understand this. Any idea how to pick [itex]k_{2}[/itex]?

Intuitively, I see {[itex]{a_{k_j}}[/itex]} converging to a point in R, so the higher [itex]N[/itex] the closer we get to that point. Then, we can can arbitrarily divide distance [itex]\epsilon[/itex] by 2,2^2,...2^j+1 as long as [itex]N_{2},...N_{j+1}[/itex] is sufficiently larger than the previous [itex]N_{i}[/itex], i = 1,...j+1.

Since {[itex]{a_{k_j}}[/itex]} is Cauchy, there exists ϵ>0 and N such that for all m,n>=N, |a_m−a_n|<ϵ/4. Since ϵ/4=ϵ/2^1+1, it is implicit that you are making j=1. Looking at the subsequence, that means you have |a_k1−a_k2|<ϵ/4. Now you are trying to move further along that what you did previously, so you would set a new [itex]N[/itex] that would make you move closer to the limit?
 
  • #10
autre said:
Intuitively, I see {[itex]{a_{k_j}}[/itex]} converging to a point in R, so the higher [itex]N[/itex] the closer we get to that point. Then, we can can arbitrarily divide distance [itex]\epsilon[/itex] by 2,2^2,...2^j+1 as long as [itex]N_{2},...N_{j+1}[/itex] is sufficiently larger than the previous [itex]N_{i}[/itex], i = 1,...j+1.

Since {[itex]{a_{k_j}}[/itex]} is Cauchy, there exists ϵ>0 and N such that for all m,n>=N, |a_m−a_n|<ϵ/4. Since ϵ/4=ϵ/2^1+1, it is implicit that you are making j=1. Looking at the subsequence, that means you have |a_k1−a_k2|<ϵ/4. Now you are trying to move further along that what you did previously, so you would set a new [itex]N[/itex] that would make you move closer to the limit?

Yes, now there is an [itex]N_2>N_1[/itex] such that [itex]|a_m-a_n|<\epsilon/8[/itex] for [itex]m,n>N_2[/itex], right? Any suggestions for picking [itex]j_2[/itex]?
 
  • #11
Dick said:
Yes, now there is an [itex]N_2>N_1[/itex] such that [itex]|a_m-a_n|<\epsilon/8[/itex] for [itex]m,n>N_2[/itex], right? Any suggestions for picking [itex]j_2[/itex]?

Do you mean [itex]k_2[/itex]? Wouldn't [itex]N_2[/itex] work?
 
  • #12
autre said:
Do you mean [itex]k_2[/itex]? Wouldn't [itex]N_2[/itex] work?

Yes and yes, now can you define [itex]k_3[/itex]?
 
  • #13
Dick said:
Yes and yes, now can you define [itex]k_3[/itex]?

I think I've got it:

Start with j=1. Then there is an N such that for all m,n>=N, |am−an|<ϵ/4. Since {[itex]a_{{k}_{j}}[/itex]} is Cauchy, there exists an [itex]N_2[/itex]=[itex]k_2[/itex] s.t. for all m,n>=[itex]N_2[/itex], |am−an|<ϵ/2^3. Continuing, there exists an [itex]N_j=k_j[/itex] s.t. for all m,n>=[itex]N_j[/itex], |am−an|<ϵ/2^(j+1). Does that look about right?
 
  • #14
autre said:
I think I've got it:

Start with j=1. Then there is an N such that for all m,n>=N, |am−an|<ϵ/4. Since {[itex]a_{{k}_{j}}[/itex]} is Cauchy, there exists an [itex]N_2[/itex]=[itex]k_2[/itex] s.t. for all m,n>=[itex]N_2[/itex], |am−an|<ϵ/2^3. Continuing, there exists an [itex]N_j=k_j[/itex] s.t. for all m,n>=[itex]N_j[/itex], |am−an|<ϵ/2^(j+1). Does that look about right?

It's 'about' right. It's still a little hazy around the edges, but it's a big improvement. The idea behind the whole proof is to use that the sequence [itex]{a_n}[/itex] (not the subsequence [itex]{a_{k_j}}[/itex]) is Cauchy to pick the N's. Then use those N's to define the [itex]k_j[/itex] of the subsequence. Say so. Don't just write [itex]N_j=k_j[/itex] and assume that they'll know that you are intending to define [itex]k_j[/itex] that way. And you'll want to make sure that you pick [itex]N_1<N_2<N_3<...[/itex]. And you forgot to define [itex]k_1[/itex].
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 28 ·
Replies
28
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
1
Views
970
Replies
7
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K