

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A proof of the theorem stating that every bounded monotone increasing sequence has a limit. The proof uses the binary expansion of numbers and the bin property. Students of mathematics, particularly those studying sequences and series, will find this document useful.
Typology: Study notes
1 / 2
This page cannot be seen from the preview
Don't miss anything!


MthT 430 Notes Chap7c Bounded Monotone Sequences Have Limits
BISHL: Bounded Increasing Sequences Have Limits
Theorem. Let {xn}
∞
n=
be a bounded monotone increasing sequence; i.e.
x 1 ≤ x 2
and there is a number M such that for n = 1, 2 ,.. .,
x n
Then there is a number L such that
lim
n→∞
xn = L.
Proof using (P13–BIN): Without loss of generality, we assume that
0 ≤ x 1 ≤ x 2 ≤... ≤ x n
We will construct a binary expansion for L.
A picture is helpful!
Divide the interval [0, 1) into two halves.
Is there an n 1 such that x n 1 ≥ m 0
1
2
bin
If NO, let c 1 = 0, a 1 = 0 = 0. bin
c 1 , b 1 = m 0 = a 1 +
1
2
. If YES, let c 1 = 1,
a 1 = m 0
1
2
bin
c 1 , b 1 = a 1
1
2
In both cases, for n ≥ n 1 , a 1
bin
c 1 ≤ x n ≤ b 1 = a 1
1
and b 1 − a 1
1
Next Divide the interval [a 1 , b 1
bin
c 1 , a 1
1
into two halves.
Is there an n 2
n 1 such that x n 2 ≥ m 1 = a 1
2
If NO, let c 2 = 0, a 2 = a 1
bin
c 1 c 2 , b 2 = m 1 = a 2
2
. If YES, let c 2
a 2 = m 1
bin
c 1 c 2 , b 2 = b 1 = a 2
2
In both cases, for n ≥ n 2 , a 2 = 0. bin
c 1 c 2 ≤ xn < b 2 = a 2 +
2
and b 2 − a 2 =
2
chap7c.pdf page 1/
By recursion (on k), if n k
n k− 1 , c 1 ,... , c k , a k
bin
c 1
... c k , b k = a k
k
have
been defined so that for n ≥ n k
a k
bin
c 1
... c k ≤ x n < b k = a k
k
divide the interval [a k , b k ) into two halves.
Is there an n k+
n k such that x nk+ ≥ m k = a k
k+
If NO, let c k+ = 0, a k+ = a k
bin
c 1 c 2
... c k+ , b k+ = m k = a k+
k+
. If
YES, let c k+ = 1, a k+ = m k
bin
c 1 c 2
... c k+ , b k+ = b k = a k+
k+
In both cases, n k+
n k , c 1 ,... , c k , c k+ , a k+
bin
c 1
... c k c k+ , b k+ = a k+
k+
have been defined so that for n ≥ n k+
a k+
bin
c 1
... c k+ ≤ x n < b k+ = a k+
k+
Let
bin
c 1... ck...
= lim
k→∞
a k
= lim
k→∞
b k
We have that L = limn→∞ xn since for all k, and n > nk,
0 ≤ L − x n ≤ b k − x n ≤ b k − a k
k
chap7c.pdf page 2/