Thank you for coming to see a more challenging example! I commend your enthusiasm! For those not sure what I mean by this, check out this post before you read this one! One last thing, remember that:

Let’s get into it!
Practice makes Perfect
Here’s a trickier sequence than the one in the last post. Let’s define in the following manner:
Let and . Does converge? If so, what is its limit?
I recommend you give this a go before we discuss it! Make a guess, does it converge? Is this one more challenging because it doesn’t converge???????
Step 0: Getting a Grip
I will not list elements in the sequence only because I know you can do it! (At least with a calculators help!)
We will get a grip by studying the form of the inductive definition . First, off because I’m lazy and it’s quite an effort to type fractions, I will denote by the Greek letter (my favorite letter to write! I mean look at it, it’s a squiggle).1
Ok, let’s look at and .
.
So it at least looks like we might have a monotone-increasing sequence. This is a bold claim since all we looked at was the first term! But, if you keep this going you’ll notice this sequence does indeed increase monotonically ()
Next, does seem to be bounded? Hmmmm it’s hard to see. You could argue, since you are always adding a positive quantity, , to , we could think might go to infinity. On the other hand, if you’ve studied infinite series, you know that adding positive quantities forever doesn’t mean the sum goes to infinity.2 So, what’s happening here with ?
Keep pondering this. We’ll come back to it in step 2.
Ok game time.
Our game plan is the following: (i) Show that is monotone increasing using induction (ii) Show that is either bounded or unbounded using induction. From there we use the monotone convergence theorem (increasing case) to conclude or for some finite . (iii) If then take a nap because we’re already done! Or, use some limit tricks if .
Step 1: Incremental Increase
We induct on .
We already took care of our base case. But since we want a complete and localized induction proof I copied it here again.
For our base case, we must show . Indeed, since and
.
Now assume . We aim to show, . Actually, we will show the equivalent: . Observe,
.
Great! By induction, we conclude for all .
Step 2: To Bound or Not To Bound? That is the question…
Ok, did you make up your mind yet? Or did you just wait to read the answer haha! Either way, is bounded. The best way to see this is by guessing! For me, I asked whether I could show , or maybe , etc
I found that I couldn’t show , because . However, I could show since . As we will see, this is crucial.
Our base case is simply that, . Now let’s assume and show . This is the case since,
.
By induction, we conclude for all .
Step 3: Tricks of the Trade
We will do the exact same thing we did in the main blog post.
We have shown is a bounded monotonically increasing sequence. Thus, by the monotone convergence theorem for finite .
Thus, we have the chain of logic:
Thus, . This is a quadratic equation with solutions:
and .
The last step is to decide which is the limit. Got any ideas?
We already know that , and we can see that . Thus, is the smaller solution. We conclude:
.
And we’re done!
Closing Remarks
You should be proud! This was no mean feat! I hope seeing another example was helpful. Please let me know if you have any questions, or if I made a mistake/could have done a better job explaining the work!
- Pro-tip: Pronounce
as ksi. ↩︎ - A famous case is the sum
. See 3Blue1Brown’s AMAZING video if this astounds you! Actually, check it out even if it doesn’t! ↩︎

Leave a reply to Let’s Get Real… Analysis (Part 5): the Monotone Convergence Theorem – A Kick in the Discovery Cancel reply