Sequence and subsequence - real analysis

Dassinia
Messages
141
Reaction score
0
Hello,
Solving last exam and stuck in this exercise

Homework Statement


Consider an increasing sequence {xn} . We suppose ∃ x∈ℝ and {xnk} a sebsequence of {xn} and xnk→x
a/ Show that for any n∈ℕ , ∃ k∈ℕ as n≤nk
b/ Show that xn→x

Homework Equations


3. The Attempt at a Solution [/B]
For b/ it is easy.
But for a/ I really don't know how to do that

thanks
 
Physics news on Phys.org
Dassinia said:
∃ k∈ℕ as n≤nk

I don't know how to interpret that statement. What is it that happens "as" n \le n_k ?
 
If you mean "n∈ℕ , ∃ k∈ℕ such that n≤nk" that just says that, given any integer n, there exist an "nk", an index from the subsequence, larger than n. And that comes from the fact that the subsequence is infinite.
 
Yes sorry it is such that , it was late !
I don't know where to start from to get to this result ? :oldconfused:
 
Dassinia said:
Yes sorry it is such that , it was late !
I don't know where to start from to get to this result ? :oldconfused:

Well, what do you mean by nk ?

Isn't {nk} an increasing sequence in , so that {xnk} is a subsequence ?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top