Lecture 6
Last time, we ended at discussion of two equivalent definitions of subsequential limit. I hope the Cantor's diagonalization trick was fun. Today, we prove the following results
If
sn converge to
s, then every subsequence of
sn converges to
s.
Every sequence has a monotone subsequence.
If there are infinitely many
sn, that is 'larger than its tails' (
sn≥sk for all
k≥n), then we can take the subsequences of such
sn, it is monotone decreasing.
Otherwise, you throw away an initial chunk that contains such
sn, then you can always build an increasing sequence (nothing can stop you)
Every bounded sequence has convergent subsequence. (just take a monotone sequence, then it will be convergent)
limsup and
liminf can be realized as subseq limits.
Let
(sn) be a seq, and
S denote the set of all subseq limits. Then,
S is non-empty.
supS=limsupsn and
infS=liminfsn.
limsn exists if and only if
S contains only one element. (All these are just summary of previously proven results)
S is closed under taking limits. (i.e.
S is a closed set)
Proof of this is fun. Suppose one has a sequence of
tn in
S, and
tn→t. Can we show that
t is in
S as well? Well, we need to show that for any
ϵ>0, there are infinitely many
sn in
(t−ϵ,t+ϵ. First, we find a
tn, such that
∣tn−t∣<ϵ/2, then we know there are infinitely many
sm with
∣tn−sm∣<ϵ/2, thus these same set of
sm will be
ϵ-close to
t.
Discussion time: Ross 11.2, 11.3, 11.5.