Thread Closed

bounded sequence as convergent

 
Share Thread Thread Tools
Jan16-06, 03:16 PM   #1
 

bounded sequence as convergent


Some rule says that not all bounded sequence must be convergent sequence , one example is the sequence with general bound:
Xn=(-1)^n

could anyone help?!
thanks in advance!
 
PhysOrg.com
PhysOrg
mathematics news on PhysOrg.com

>> Mathematicians analyze social divisions using cell phone data
>> Can math models of gaming strategies be used to detect terrorism networks?
>> Mathematician proves there are infinitely many pairs of prime numbers less than 70 million units apart
Jan16-06, 03:25 PM   #2
 
What is it that you want help with? To show that x_n is divergent, it suffices to find two subsequences of x_n which converge to different numbers.
 
Jan16-06, 03:38 PM   #3
 
Recognitions:
Homework Helper Homework Help
Science Advisor Science Advisor
Ooh, erm, let me think... how about looking at the bloody definitions? Yes, I am tired, so delete as applicable, but quite frankly, I've seen enough of this for one day.
 
Jan16-06, 09:38 PM   #4
 

bounded sequence as convergent


Quote by electronic engineer
Some rule says that not all bounded sequence must be convergent sequence , one example is the sequence with general bound:
Xn=(-1)^n
could anyone help?!
thanks in advance!
if a sequence converges then it's bounded, but if it's bounded it might not converge as that example shows.
 
Jan17-06, 08:19 AM   #5
 
Quote by fourier jr
if a sequence converges then it's bounded, but if it's bounded it might not converge as that example shows.
you're right, the question is how to prove that,could you help?!
 
Jan17-06, 08:37 AM   #6
 
Recognitions:
Homework Helper Homework Help
Science Advisor Science Advisor
What is the negation of: x_n converges to x? Show that this is satisfied. Of course if x_n converges to x then all subsequences of x_n converge to x as well, maknig for an easy proof that it doesn't converge. If you're not used to working out the negations of propositions then say so.
 
Jan17-06, 10:46 AM   #7
 
Quote by electronic engineer
you're right, the question is how to prove that,could you help?!
suppose that the sequence {a_n} converges. then a_n --> L for some finite L. now look at the definition of convergence & see that for ANY epsilon (yadda yadda)... for n>N but to make things easier just choose epsilon=1 & if n>N get 2 inequalities |a_n| < |a_n - L| + |L| < 1 + |L| (i think that's right, you check it). if n<N then |a_n| < something else.

so for any n>0, |a_n| < M where M=max{a certain set of numbers}. end of proof
 
Jan17-06, 10:56 AM   #8
 
Recognitions:
Gold Membership Gold Member
Science Advisor Science Advisor
Retired Staff Staff Emeritus
Quote by electronic engineer
you're right, the question is how to prove that,could you help?!
Prove what? That there exist bounded sequences that are not convergent? You do that by exhibiting one, just as you did.

Prove that that particular sequence is not convergent? Just as Muzza said in the very first response to your post: show that there exist two different subsequences that converge to two different limits- in this case the subsequence with n even: 1, 1, 1, ... converges to 1, the subsequence with n odd: -1, -1, -1, ... converges to -1. Since arbitrarily far into the sequnce there exist numbers arbitrarily close to 1 and numbers arbitrarily close to -1, taking [itex]\epsilon= 1/3[/itex] will show that no number can be the limit of the entire sequence.
 
Thread Closed
Thread Tools


Similar Threads for: bounded sequence as convergent
Thread Forum Replies
uniformly convergent sequence Calculus 1
Every sequence of bounded functions that is uniformly converent is uniformly bounded Calculus & Beyond Homework 4
Bounded sequence implies convergent subsequence Calculus & Beyond Homework 1
Convergent sequence of functions? Calculus & Beyond Homework 19
convergent sequence? Set Theory, Logic, Probability, Statistics 1