Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last update: 9 July 2014
Lecture 10
Sequences
Let be a set. A sequence
in is a function
Let Let
be a sequence in The sequence
is increasing if
satisfies
if then
The sequence is
decreasing if satisfies
if then
A sequence is monotone if
is increasing or decreasing.
Let be a metric space. Let
be a sequence in The sequence is bounded if the set
is bounded.
The sequence
is contractive if
satisfies: There exists such that
if then
The sequence
is Cauchy if satisfies
if then there exists
such that if and
and then
Let The sequence
converges to if satisfies
if then there exists
such that if and then
Let
be a sequence in (or more generally, any totally ordered set with the order topology). The upper limit of
is
The lower limit of
is
If then
Let
be a sequence in Then
(a)
and
(b)
Boundedness, sup, inf, limsup and liminf
Let
(a)
Show that is bounded.
(b)
Find such that is
decreasing for such that
(c)
Show that
Since
is less than for
is equal to for and
is greater than for
the function
is decreasing for and has a maximum at
Since for
and for
for
So is bounded by and
and
is decreasing if
(in particular, if
(c)
Analyse the sequence
is bounded above by
is bounded below by
and
and
does not exist
because, as gets larger and larger, oscillates between close to
in this case) and
in this case).
If is a sequence in (or a totally ordered set
such that
(a)
is increasing,
(b)
is bounded, and
(c)
exists,
then converges to
Note: In
always exists, in
does not always exist.
Proof.
Let To show:
To show: If then there exists
such that if
and then
Proof by contradiction.
Assume that there exists such that there does not exist
such that
if and
then
So, if then there exists
with such that
so, if then
So is an upper bound of
Contradiction to
So
Notes and References
These are notes from a 2010 course on Real Analysis 620-295. This page comes from 100322suggLect10.pdf and was given on 22 March 2010.