Jump to content

upper and lower bound of the sequence


caseclosed

Recommended Posts

Well, the ratio test should tell you that this sequence is null; i.e. the limit is zero. Since all of the terms are positive, you should be able to get a lower bound trivially.

 

Moreover, [imath]a_{n+1} - a_n = \frac{2^{n-1}}{(n+1)!} \left( \frac{2}{n+2} - 1\right) < 0[/imath] for any n > 0. So the sequence is strictly decreasing, and it should be easy to find an upper bound from here.

Link to comment
Share on other sites

I got (2)/(n!(n+2)) so as n increases to infinity, the thing approaches 0 so that is why it is decreasing right? and less than 1 means it converges.

but I don't understand where the upper/lower bound, what is it.... suppose to be a finite number? or is it like lower bound 0 since it is approaching 0 and upper bound unbounded?

Link to comment
Share on other sites

Your sequence is a series of discrete points [math](a_1, a_2, a_3, \dots)[/math]. An upper bound is a number M such that [math]a_n \leq M[/math] for any N. A lower bound is a number m such that [math]a_n \geq m[/math] for any N. Notice that upper and lower bounds have no dependency on n at all.

 

Now, yes, your sequence does converge to zero. But that doesn't mean that it's decreasing. For example, take [imath]a_n = \frac{(-1)^n}{n}[/imath]. This is a sequence which tends to zero, but is not strictly decreasing. To show a sequence is stricly decreasing, you need to show that [imath]a_{n+1} - a_n < 0[/imath] for all n - which is what I have done above.

 

Basically, now that you know it's strictly decreasing, you know that you're not going to have places where the sequence might jump up and then start to fall down again, so you can say that the upper bound for the sequence is simply [imath]a_1[/imath]. The lower bound will trivially be zero.

Link to comment
Share on other sites

Incidentally I've been talking about "the" bounds for the sequence. In fact, for a bounded sequence there are infinitely many upper and lower bounds. When I say "the" upper bound, I'm actually talking about the least upper bound - i.e. the supremum, if you've covered that at all.

Link to comment
Share on other sites

Basically, yes. More formally, if [imath]a_n[/imath] is a decreasing sequence, then [imath]a_1 \geq a_n[/imath] for all n, and if, moreover, it is convergent then [imath]\lim_{n\to\infty} a_n \leq a_n[/imath].

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.