Proof
Let be monotone and bounded. To show converges, we need a candidate limit. Let's assume the sequence is increasing (the decreasing case is handled similarly), and consider the set of points . By assumption, this set is bounded, so then:
Let . Since is a least upper bound for the set in question, then is not an upper bound. Hence, there is a point in the sequence such that . Now since is increasing then any has it that . Hence:
Consequently then by using the ends and the middle of the inequality.
☐
An alternate proof:
The idea is that if we have the set be the 's, then it must have a supremum, which must be the limit's value itself.
Proof
Let be bounded and assume it is increasing (from the monotonic part). Let where and is bounded. Let . We'll show that .
Let . Since is a suprema, then by the Suprema Lemma then where:
But , so then where . Then:
Now assume . Since is increasing. Then:
By flipping the signs:
That implies:
The decreasing version is proved in a very similar way.
☐
Example
Show that is convergent for all . Show it converges to .
Proof
Notice that is decreasing since . Similarly, is bounded since it's in . As such, the MST suggests that where .
But notice also that the ALT suggests that where . Notice that then so then .
☐