Calculus Lecture1
Calculus Lecture1
1. What is the negation of the above definition, that is, what does it mean when we say xn does not
converge to x?
1 n 1
2. Show, using rigorous " N definition, that lim = 0 and lim = .
n!1 n2 n!1 2n + 5 2
3. (a) Suppose that you have a sequence {xn } in which every term is non-negative, that is, xn 0
for all n 1. Show that if xn converges, the limit is also non-negative. Would your answer
change if only the first thousand terms were negative?
(b) Suppose that you have a sequence {xn } such that xn a for some real number a. Show that
if xn converges, then the limit is a. (Hint: use part (a))
(c) Suppose that there are two convergent sequences {xn } and {yn } with xn ! x, yn ! y and
xn yn for every n 1. (We often write: the sequence xn dominates yn .) Show that x y.
(Hint: use (a))
p p
4. Show that if xn ! x where xn and x are both non-negative, then xn ! x. (We will later
p
rephrase this as · is a continuous function.)
5. (a) Show that if xn ! x, then x2n ! x2 . (You can use the definition but I am expecting a cleverer
solution.)
(b) Is the converse of part (a) true?
(c) Show that part (a) holds for every positive integral power, i.e., xkn ! xk for all k 2 N whenever
xn ! x.
(d) Using part (c), prove that for every polynomial P with real coefficients, xn ! x implies that
P (xn ) ! P (x).
6. Suppose that xn is a convergent sequence but yn is not. Can it happen that (xn yn ) converges?
7. Suppose that you have a convergence sequence. Can you change it to a divergent sequences by
fudging (adding, deleting or changing) finitely many terms? Can you make a divergent sequence
convergent by changing finitely many terms?
So, before we begin with the second lecture, you know what a sequence means, what it means for it to
converge (or not converge) to a point, how we can define an algebra on their limits and how convergence
implies boundedness. You also know that the limit of a non-negative sequence is non-negative and that
limit of a sequence is preserved by certain functions (under certain conditions), such as polynomials.
Summary.
1. A sequence is a map from N to some set X. (Typically, we deal with real sequences and set
X = R.) This is just a complicated way of saying that a sequence is an enumerated infinite set
that looks like {a1 , a2 , a3 , . . . }. Note that it is not a set and is always infinite. We say that a
sequence {an } is bounded if there exists M > 0 such that |an | M for every n 1. We say that
it is monotone increasing (resp. decreasing) if an+1 an (resp. an+1 an ) for every n 1. For
example, {tan(1/n)}n 1 is both bounded and monotone (decreasing) but {tan n}n 1 is monotone
increasing and unbounded.
2. We say that a sequence xn converges to x i↵ given any " > 0, there exists some N 2 N such that
for all n N, |xn x| < " () xn 2 (x ", x + "). All this means is that the terms of the
sequence eventually get arbitrarily close to the point x. Here is an alternate phrasing: the positive
distance between xn ’s and x becomes arbitrarily small for all sufficiently large n. Do not ignore
any of the quantifiers in the preceding sentences: ‘eventually’, ‘sufficiently’ and ‘arbitrarily’. Do
not proceed unless you fully understand what role each component plays in the above definition
and can flow freely between alternate phrasings of the same.