Lecture 1
Reminders: Students are highly encouraged to come to office hours for consultation. This is a difficult course for
many, but not all students. Although there are lecture notes, students should attend all lectures and tutorials as
lectures notes are only brief records of materials covered in class, which may contain typographical errors. Of course,
questions from students and answers from instructors or other digressions will not be recorded. Students are advised
to take your own notes. All materials presented in lectures and tutorials as well as proper class conduct are the
students responsibility. The instructor reserves the right to make any changes to the course throughout the
semester. The only way to succeed in this course is to do the work.
Sometimes we explain facts by examples or pictures. For instance, the statement that every odd degree polynomial
with real coefficients must have at least one root is often explained by some examples or some pictures. In our lifetime,
we can only do finitely many examples and draw finitely many pictures. Should we believe something is true by seeing
a few pictures or examples?
Draw the graphs of a few continuous functions on [0; 1]: Do you think every continuous function on [0; 1]
is differentiable in at least one point on .0; 1/? Or do you think there exists a continuous function on [0; 1] not
differentiable at any point of .0; 1/?
Consider the function f .n / D n 2 n C 41: Note f .1/ D 41; f .2/ D 43; f .3/ D 47; f .4/ D 53; f .5/ D
61; f .6/ D 71; f .7/ D 83; f .8/ D 97; f .9/ D 113; f .10/ D 131 are prime numbers. Should you believe that f .n /
is a prime number for every positive integer n? What is the first n that f .n / is not prime?
In order to have confident, you have to be able to judge the facts you learned are absolutely correct. Almost
correct is not good enough in mathematics.
Chapter 1. Logic
To reason correctly, we have to follow some rules. These rules of reasoning are what we called logic. We will
only need a few of these rules, mainly to deal with taking opposite of statements and to handle conditional statements.
We will use the symbol (or :) to denote the word not. Also, we will use the symbol 8 to denote for all,
for any, for every. Similarly, the symbol 9 will denote there is (at least one), there exists, there are (some)
and usually followed by such that. The symbols 8 and 9 are called quantifiers.
Negation. Below we will look at rules of negation (i.e. taking opposite). They are needed when we do indirect
proofs (or proofs by contradiction). For any expression p; we have . p/ D p:
Examples. (1)
expression :
opposite expression :
z } {
z } {
rule : . p and q / D . p/ or . q /
expression : x < 0 or x > 1
opposite expression : x 0 and x 1
rule : . p or q / D . p/ and . q /
(2)
(3)
statement :
quantified statement :
opposite statement :
quantified opposite statement :
(4)
statement :
quantified statement :
opposite statement :
quantified opposite statement :
9x 0
. y 2 D x /:
There exists x 0 such that for every y 0; y 2
9 x 0;
8y 0
. y 2 D x /:
9y 0
6D x : (False)
From examples (3) and (4), we see that the rule for negating statements with quantifiers is first switch every
8 to 9 and every 9 to 8, then negate the remaining part of the statement.
Ifthen Statements. Ifthen statements occur frequently in mathematics. We will need to know some equivalent
ways of expressing an ifthen statement to do proofs. The statement if p; then q may also be stated as p implies q,
p only if q, p is sufficient for q, q is necessary for p and is commonly denoted by p H) q. For example,
the statement if x D 3 and y D 4; then x 2 C y 2 D 25 may also be stated as x D 3 and y D 4 are sufficient for
x 2 C y 2 D 25 or x 2 C y 2 D 25 is necessary for x D 3 and y D 4.
Example. (5)
Remark. Note
D .
D .
. q //
p/ or . q /
p/ or q :
For the statement if p; then q . p H) q /; there are two related statements: the converse of the statement is if
q, then p (q H) p) and the contrapositive of the statement is if . q /; then . p/ ( q H) p).
Examples. (6)
statement :
converse :
contrapositive :
(7)
(8)
If x D 3; then x 2 D 9: (True)
If x 2 D 9; then x D 3: (False, as x may be 3.)
If x 2 6D 9; then x 6D
statement :
converse :
contrapositive :
statement :
converse :
contrapositive :
3: (True)
x D 3 H) 2x D
2x D 6 H) x D
2x 6D 6 H) x 6D
6 (True)
3 (True)
3 (True)
Remarks. Examples (6) and (7) showed that the converse of an ifthen statement is not the same as the statement
nor the opposite of the statement in general. Examples (6), (7) and (8) showed that an ifthen statement and its
contrapositive are either both true or both false. In fact, this is always the case because by the remark on the last page,
. q /
H)
. p/
D . q / or
. p/
. p/ or q
p H) q :
. p/
D q or
D
D
Chapter 2. Sets
To read and write mathematical expressions accurately and concisely, we will introduce the language of sets. A
set is a collection of objects (usually numbers, ordered pairs, functions, etc.) If object x is in a set S, then we say x is
an element (or a member) of S and write x 2 S : If x is not an element of S, then we write x 62 S : A set having finitely
many elements is called a finite set, otherwise it is called an infinite set. The empty set is the set having no objects and
is denoted by ;:
A set may be shown by listing its elements enclosed in braces (eg. f1; 2; 3g is a set containing the objects 1; 2; 3; the
positive integer N D f1; 2; 3; : : :g, the integer ZD f: : : ; 2; 1; 0; 1; 2; : : :g, the empty set ; D fg) or by description
enclosed in braces (eg. the rational numbers Q D f mn : m 2 Z; n 2 Ng; the real numbers R D fx : x is a real numberg
and the complex numbers C D fx C iy : x ; y 2 Rg:) In describing sets, the usual convention is to put the form of the
objects on the left side of the colon and to state the conditions on the objects on the right side of the colon. The set
will consist of all elements satisifying all the conditions. It is also common to use a vertical bar in place of colon in set
descriptions.
Examples. (i) The closed interval with endpoints a ; b is [a ; b] D fx : x 2 R and a x bg:
(ii) The set of square numbers is f1; 4; 9; 16; 25; : : :g D fn 2 : n 2 Ng:
(iii) The set of all positive real numbers is RC D fx : x 2 R and x > 0g: (If we want to emphasize this is a subset
of R; we may stress x is real in the form of the objects and write RC D fx 2 R : x > 0g: If numbers are always
taken to mean real numbers, then we may write simply RC D fx : x > 0g:)
(iv) The set of points (or ordered pairs) on the line `m with equation y D mx is f.x ; mx / : x 2 Rg:
For sets A; B ; we say A is a subset of B (or B contains A) iff every element of A is also an element of B : In
that case, we write A B : (For the case of the empty set, we have ; S for every set S :) Two sets A and B are
equal if and only if they have the same elements (i.e. A D B means A B and B A:) So A D B if and only if
(x 2 A () x 2 B). If A B and A 6D B ; then we say A is a proper subset of B and write A B : (For example,
if A D f1; 2g; B D f1; 2; 3g; C D f1; 1; 2; 3g; then A B is true, but B C is false. In fact, B D C: Repeated
elements are counted only one time so that C has 3 elements, not 4 elements.)
For a set S ; we can collect all its subsets. This is called the power set of S and is denoted by P . S / or 2S : For
examples, P .;/ D f;g; P .f0g/ D f;; f0gg and P .f0; 1g/ D f;; f0g; f1g; f0; 1gg: For a set with n elements, its power
set will have 2n element. This is the reason for the alternative notation 2S for the power set of S : Power set is one
operation of a set. There are a few other common operations of sets.
Definitions. For sets A1 ; A2 ; : : : ; An ;
(i) their union is A1 [ A2 [ [ An D fx : x 2 A1 or x 2 A2 or or x 2 An g;
(ii) their intersection is A1 \ A2 \ \ An D fx : x 2 A1 and x 2 A2 and and x 2 An g;
(iii) their Cartesian product is
A1 A2 An D f.x 1 ; x 2 ; : : : ; x n / : x 1 2 A1 and x 2 2 A2 and and x n 2 An g;
(iv) the complement of A2 in A1 is A1 n A2 D fx : x 2 A1 and x 62 A2 g:
Examples. (i) f1; 2; 3g [ f3; 4g D f1; 2; 3; 4g; f1; 2; 3g \ f2; 3; 4g D f2; 3g; f1; 2; 3g n f2; 3; 4g D f1g:
(ii) [ 2; 4] \ N D f1; 2; 3; 4g; [0; 2] [ [1; 5] [ [4; 6] D [0; 6]:
(iii) .[0; 7] \ Z/ n fn 2 : n 2 Ng D f0; 1; 2; 3; 4; 5; 6; 7g n f1; 4; 9; 16; 25; : : :g D f0; 2; 3; 5; 6; 7g:
(iv) R R R D f.x ; y ; z / : x ; y ; z 2 Rg; Q .R n Q/ D f.a ; b/ : a is rational and b is irrationalg:
Remarks. (i) For the case of the empty set, we have
A [ ; D A D ; [ A;
A \ ; D ; D ; \ A;
A ; D ; D ; A;
5
A n ; D A and ; n A D ;:
(ii) The notions of union, intersection and Cartesian product may be extended to infinitely many sets similarly. The
union is the set of objects in at least one of the sets. The intersection is the set of objects in every one of the sets.
The Cartesian product is the set of ordered tuples such that the ith coordinate must belong to the ith set.
(iii) The set A1 [ A2 [ [ An may be written as
n
[
k D1
1
[
k D1
Ak or
[ k 2N
x 2S
\h
n2N
0; 1 C
h
1 h
1 h
1
1
D [0; 2/ \ 0; 1
\ 0; 1
\ 0; 1
\ D [0; 1]:
n
2
3
4
\
m 2R
`m
D f.0; 0/g:
[
m 2R
`m
D R2 n f.0; y / : y 2 R; y 6D 0g
z 2 [x] () z x () z y () z 2 [y]: If x 6 y ; then [x] \ [y] D ; because assuming z 2 [x] \ [y] will
lead to x z and z y ; which imply x y ; a contradiction. So every pair of equivalence classes are either the same
or disjoint. Therefore, R partitions the set E into mutually disjoint equivalence classes.
6
Examples. (1) (Geometry) For triangles T1 and T2 ; define T1 T2 if and only if T1 is similar to T2 : This is an
equivalence relation on the set of all triangles as the three properties above are satisfied. For a triangle T ; [T ] is the set
of all triangles similar to T :
(2) (Arithmetic) For integers m and n ; define m n if and only if m n is even. Again, properties (a), (b), (c) can
easily be verified. So this is also an equivalence relation on Z: There are exactly two equivalence classes, namely
[0] D f: : : ; 4; 2; 0; 2; 4; : : :g (even integers) and [1] D f: : : ; 5; 3; 1; 1; 3; 5; : : :g (odd integers). Two integers
in the same equivalence class is said to be of the same parity.
(3) Some people think that properties (b) and (c) imply property (a) by using (b), then letting z D x in (c) to conclude
.x ; x / 2 R : This is false as shown by the counterexample that E D f0; 1g and R D f.1; 1/g; which satisfies properties
(b) and (c), but not property (a). R fails property (a) because 0 2 E ; but .0; 0/ 62 R as 0 is not in any ordered pair in R :
A function (or map or mapping) f from a set A to a set B (denoted by f : A ! B) is a method of assigning to
every a 2 A exactly one b 2 B : This b is denoted by f .a / and is called the value of f at a : Thus, a function must be
welldefined in the sense that if a D a 0 ; then f .a / D f .a 0 /: The set A is called the domain of f (denoted by dom f )
and the set B is called the codomain of f (denoted by codom f ). We say f is a Bvalued function (eg. if B D R; then
we say f is a realvalued function.) When the codomain B is not emphasized, then we may simply say f is a function
on A: The image or range of f (denoted by f . A/ or im f or ran f ) is the setf f .x / : x 2 Ag: (To emphasize this is a
subset of B ; we also write it as f f .x / 2 B : x 2 Ag:) The set G D f x ; f .x / : x 2 Ag is called the graph of f : Two
functions are equal if and only if they have the same graphs. In particular, the domains of equal functions are the same
set.
Examples. The function f : Z ! R given by f .x / D x 2 has dom f D Z; codom f D R: Also, ran f D
f0; 1; 4; 9; 16; : : :g: This is different from the function g : R ! R given by g .x / D x 2 because dom g D R 6D dom f :
Also, a function
may have more than one parts in its definition, eg. the absolute value function h : R ! R defined by
n
x
if x 0
: Be careful in defining functions. The following is bad: let x n D . 1/n and i .x n / D n : The
h .x / D
x if x < 0
rule is not welldefined because x 1 D
1 D x 3 ; but i .x 1 / D 1 6D 3 D i .x 3 /:
: f . A/ ! A defined by
Remarks (Exercises). (a) Let f : A ! B be a function. We have f is a bijection if and only if there is a function
g : B ! A such that g f D I A and f g D I B : (In fact, for f bijective, we have g D f 1 is bijective.)
(b) If f : A ! B and h : B ! C are bijections, then h f : A ! C is a bijection.
(c) Let A; B be subsets of R and f : A ! B be a function. If for every b 2 B ; the horizontal line y D b intersects the
graph of f exactly once, then f is a bijection.
Example. Show that f : [0; 1] ! [3; 4] defined by f .x / D x 3 C 3 is a bijection.
Method 1 If f .x / D f . y /; then x 3 C 3 D y 3 C 3; which implies x 3 D y 3 : Taking cube roots of both sides,pwe get
x D y : Hence f is injective. Next, for every y 2 [3; 4]; solving the equation x 3 C 3 D y for x ; we get x D 3 y 3:
Since y 2 [3; 4] implies y 3 2 [0; 1]; we see x 2 [0; 1]: Then f .x / D y : Hence f is surjective. Therefore, f is
bijective.
p
Method 2. Define g : [3; 4] ! [1; 2] by g . y / D 3 y 3: For every x 2 [0; 1] and y 2 [3; 4]; .g f /.x / D g .x 3 C 3/ D
p
p
3
.x 3 C 3/ 3 D x and . f g /. y / D f . 3 y 3/ D . 3 y 3/3 C 3 D y : By remark (a) above, f is a bijection.
To deal with the number of elements in a set, we introduce the following concept. For sets S1 and S2 ; we will
define S1 S2 and say they have the same cardinality (or the same cardinal number) if and only if there exists a
bijection from S1 to S2 : This is easily checked to be an equivalence relation on the collection of all sets. For a set S ; the
equivalence class [S] is often called the cardinal number of S and is denoted by card S or j S j: This is a way to assign
a symbol for the number of elements in a set. It is common to denote, for a positive integer n ; card f1; 2; : : : ; n g D n ;
card N D @0 (read alephnaught) and card R D c (often called the cardinality of the continuum).
Chapter 3. Countability
Often we compare two sets to see if they are different. In case both are infinite sets, then the concept of countable
sets may help to distinguish these infinite sets.
Definitions. A set S is countably infinite iff there exists a bijection f : N ! S (i.e. N and S have the same cardinal
number @0 :) A set is countable iff it is a finite or countably infinite set. A set is uncountable iff it is not countable.
Remarks. Suppose f : N ! S is a bijection. Then f is injective means f .1/; f .2/; f .3/; : : : are all distinct and f
is surjective means f f .1/; f .2/; f .3/; : : :g D S : So n 2 N $ f .n / 2 S is a onetoone correspondence between N
and S : Therefore, the elements of S can be listed in an orderly way (as f .1/; f .2/; f .3/; : : : ) without repetition or
omission. Conversely, if the elements of S can be listed as s1 ; s2 ; : : : without repetition or omission, then f : N ! S
defined by f .n / D sn will be a bijection as no repetition implies injectivity and no omission implies surjectivity.
Bijection Theorem. Let g: S ! T be a bijection. S is countable if and only if T is countable.
(Reasons. The finite set case is clear. For infinite sets, it is true because S countable implies there is a bijective function
f : N ! S ; which implies h D g f : N ! T is bijective, i.e. T is countable. For the converse, h is bijective implies
f D g 1 h is bijective.)
Remarks. Similarly, taking contrapositive, S is uncountable if and only if T is uncountable.
Basic Examples. (1) N is countably infinite (because the identity function IN.n / D n is a bijection).
(2) Zis countably infinite because the following function is a bijection (onetoone correspondence):
N D
f
Z D
1; 2;
#
0; 1;
3;
4;
1; 2;
n
2
n 1
2
5;
#
6;
#
2; 3;
7;
#
3;
8;
9;
:::
:::
4; : : :
4;
g
g:
if n is even
and its inverse function g : Z! N is given
if n is odd
2m
if m > 0
by g .m / D
: Just check g f D IN and f g D IZ:
1 2m if m 0
(3) N N D f.m ; n /: m ; n 2 Ng is countably infinite.
.1; 1/
(Diagonal Counting Scheme) Using the diagram on the right, define f : N ! N N by f .1/ D .1; 1/, f .2/ D .2; 1/, f .3/ D .1; 2/,
.2; 1/
f .4/ D .3; 1/, f .5/ D .2; 2/, f .6/ D .1; 3/, : : : , then f is injective
because no ordered pair is repeated. Also, f is surjective because
.3; 1/
!
mX
Cn 2
.m C n 2/.m C n 1/
.m ; n / D f
kCn D f
Cn :
2
k D0
.4; 1/
::
:
.1; 2/
.1; 3/
.2; 2/
.2; 3/
.3; 2/
::
:
::
:
::
:
::
:
::
:
::
:
.1; 4/
::
:
::
:
::
:
::
:
::
:
::
:
(4) The open interval .0; 1/ D fx: x 2 R and 0 < x < 1g is uncountable. Also, R is uncountable.
f .1/
f .2/
f .3/
f .4/
::
:
D
D
D
D
::
:
To determine the countability of more complicated sets, we will need the theorems below.
9
n2N [
[
As D
A f .n/ is countable. (Briefly,
(say f : N ! S is a bijection) and As is countable for every s 2 S ; then
s 2S
n2N
countable union of countable sets is countable.)
1
n D1
(8) Show that the set A D fr m : m 2 N; r 2 .0; 1/g is uncountable, but the set B D fr m : m 2 N; r 2 Q \ .0; 1/g
is countable.
Solution. Taking m[
D 1; we see that .0; 1/ A: Since .0; 1/ is uncountable,
is uncountable. Next we will
[ Ap
p
observe that B D
Bm ; where Bm D fr m : r 2 Q \ .0; 1/g D
fr m g for each m 2 N: Since
m 2N
r 2Q\.0;1/
p
Q \ .0; 1/ is countable and fr m g has 1 element for every r 2 Q \ .0; 1/; Bm is countable by the countable union
theorem. Finally, since N is countable and Bm is countable for every m 2 N; B is countable by the countable
union theorem.
(9) Show that the set L of all lines with equation y D mx C b; where m ; b 2 Q; is countable.
Solution. Note that for each pair m ; b of rational numbers, there is a unique line y D mx C b in the set L : So the
function f : Q Q ! L defined by letting f .m ; b/ be the line y D mx C b (with f 1 sending the line back to
.m ; b/) is a bijection. Since Q Q is countable by the product theorem, so the set L is countable by the bijection
theorem.
(10) Show that if An D f0; 1g for every n 2 N; then A1 A2 A3 is uncountable. (In particular, this shows that
the product theorem is not true for infintely many countable sets.)
Solution. Assume A1 A2 A3 D f.a1 ; a2 ; a3 ; : : :/ : each ai D 0 or 1g is countable and f : N !
A1 A2 A3 is a bijection. Following example (4), we can change the nth coordinate of f .n / (from 0 to
1 or from 1 to 0) to produce an element of A1 A2 A3 not equal to any f .n /; which is a contradiction.
So it must be uncountable.
(11) Show that the power set P .N/ of all subsets of N is uncountable.
Solution. As in example (10), let AnD f0; 1g for every n 2 N: Define g : P .N/ ! A1 A2 A3 by
1 if m 2 S
g . S / D .a1 ; a2 ; a3 ; : : :/; where am D
: (For example, g .f1; 3; 5; : : :g/ D .1; 0; 1; 0; 1; : : :/:) Note
0 if m 62 S
g has the inverse function g 1 .a1 ; a2 ; a3 ; : : :/ D fm : am D 1g: Hence g is a bijection. Since A1 A2 A3
is uncountable, so P .N/ is uncountable by the bijection theorem.
10
(12) Show that the set S of all nonconstant polynomials with integer coefficients is countable.
Solution. For n 2 N; the set of Sn of all polynomials of degree n with integer coefficients is countable because
the function f : Sn ! .Zn f0g/ Z Zdefined by f .an x n C an 1 x n 1 C C a0 /[
D .an ; an 1 ; : : : ; a0 /
is a bijection and .Zn f0g/ Z Zis countable by the product theorem. So, S D
Sn is countable by
n2N
the countable union theorem.
(13) Show that there exists a real number, which is not a root of any nonconstant polynomial with integer coefficients.
Solution. For every nonconstant polynomial f with integer coefficients, let R f denotes the set of roots of f : Then
R f has at most (deg f ) elements, hence R f is countable. Let S be [
the set of all nonconstant polynomials with
R f is the set of all roots of nonconstant
integer coefficients, which is countable by the last example. Then
f 2S
polynomials
with integer coefficients. It is countable by the countable union theorem. Since R is uncountable,
[
Rn
R f is uncountable by the fact in example (6). So there exist uncountably many real numbers, which are
f 2S
x2 A
Chapter 4. Series
Definitions. A series is the summation of a countable set of numbers in a specific order. If there are finitely many
numbers, then the series is a finite series, otherwise it is an infinite series. The numbers are called terms. The sum of
the first n terms is called the nth partial sum of the series.
1
X
{z}
{z}
1st term
2nd term
3rd term
k D1
ak :
The first partial sum is S1 D a1 . The second partial sum is S2 D a1 C a2 . The n th partial sum is Sn D a1 C a2 C : : : C an .
Series are used frequently in science and engineering to solve problems or approximate solutions. (E.g. trigonometric or logarithm tables were computed using series in the old days.)
1
1
1
Examples.(1) 1C 21 C 14 C 18 C 16
C: : : D? (Sn D 1 C 12 C 14 C: : : C 21n D 2 21n ; 1 C 21 C 14 C 18 C 16
C: : : D lim 2
D 2.)
n!1
2n
We say the series converges to 2, which is called the sum of the series.
(2) 1 C 1 C 1 C 1 C 1 C 1 C : : : D 1 (Sn D 1 C 1 C{z: : : C 1} D n, lim Sn D 1.) We say the series diverges (to 1).
1C1
(3) 1
1C1
Definitions. A series
1 C : : :. (Sn D
1C1
1
X
k D1
n!1
1
0
if n is odd
, lim Sn doesnt exist.) We say the series diverges.
if n is even n!1
n!1
1
X
n!1
ak D S and say S is the sum of the series. A series diverges to 1 iff the partial sum Sn
k D1
tends to infinity as n tends to infinity. A series diverges iff it does not converge to any number.
Remarks. (1) For every series
1
X
k D1
ak , there is a sequence (of partial sums) f Sn g. Conversely, if the partial sum sequence
a1 C : : : C an D S1 C . S2
S1 / C : : : C . Sn
S1 , : : : , ak D Sk
Sk
k D1
series and sequences are equivalent. So to study series, we can use facts about sequences.
(2) Let N be a positive integer.
because
1
X
k D1
n!1
1
X
kD N
ak converges to B D A
.a1 C C a N 1 / D A
1
X
.a1 C C a N 1 /
.a1 C C a N 1/:
1
X
k D1
ak converges to A and
1
X
k D1
.a k C b k / D A C B
1
X
k D1
ak C
1
X
k D1
1
X
k D1
bk ;
bk converges to B ; then
1
X
k D1
.ak
bk / D A
BD
1
X
k D1
ak
1
X
k D1
bk ;
1
X
k D1
cak D c A D c
1
X
k D1
ak
1
X
r nC1
r D lim .1 C r C r C : : : C r / D lim
D
n!1
n!1 1
r
k D0
k
tions!
n!1
Examples. (1)
(2)
1
X
k D1
.5 1 = k
1
X
1
if jr j < 1 :
1 r
doesnt exist otherwise
9
9
9
9
1
C
C
C D
.
/ D 1 D 1:000 : So 1 has two decimal representa1
10 100 1000
10 1 10
Example. 0:999 D
D lim .b1
1
X
k D1
.bk
b 2 / C .b 2
b3 / C C .bn
bnC1 /
n!1
k .k C 1/
k D1
51=.kC1// D .5
n!1
1
X
1
k
k D1
k C1
5/ C . 5
/D 1
p
3
1
1
C
2
2
1
1
C
3
3
1
C D 1
4
lim 51=.kC1/ D 5
5/ C D 5
k !1
lim
n!1
1
D 1:
nC1
50 D 4:
If a series is not geometric or telescoping, we can only determine if it converges or diverges. This can be done
most of the time by applying some standard tests. If the series converges, it may be extremely difficult to find the sum!
1
X
k !1
(Reason. Suppose
1
X
k D1
k D1
1
X
k !1
1
X
k D1
ak diverges.) If
k D1
k !1
k !1
Sk 1 / D S
S D 0.)
Term test is only good for series that are suspected to be divergent!
Examples. (1) 1 C 1 C 1 C 1 C : : :. Here ak D 1 for all k, so lim ak D 1. Series diverges.
(2)
(3)
k !1
1
X
1
1
1
1
cos. / D cos 1 C cos C cos C : : : diverges because lim cos. / D cos 0 D 1 6D 0.
k !1
k
2
3
k
k D1
1
X
k D1
cos k D cos 1 C cos 2 C cos 3 C : : : diverges because lim cos k 6D 0: (Otherwise, lim cos k D 0: Then
k !1
contradiction.)
(4) 1
1
2
C 14
1
8
k !1
k !1
cos2
k !1
C : : :. Here ak D
k !1
1 k 1
2
k !1
4 times
8 times
D n has limit 1:
13
1
X
k D1
1
X
k D1
1
X
k D1
ak converges to a number or
1
X
k D1
n!1
k D1
ak D S
1
X
1
X
k D1
f .k / 6D
1
X
k D1
f .x / dx :)
1/ C
f (1)
f (2)
f (3)
f (2)
...
...
1
4 ...
4 ...
1
X
1
:
1
C
k2
k D1
1
Z 1
1
1
D
As x % 1; 1 C x 2 % 1; so
&
0
:
Now
dx
D
arctan
x
2
1 C x2
1
C
x
2
1
1
converges.
1
X
1
1
and
.
k ln k
k .ln k /2
k D2
k D2
k ln k
diverges. Next
2
4
< 1: So
1
X
1
1
C
k2
k D1
1
X
1 1
X
dx
D
x .ln x /2
1 1
D
ln x
2
1
X
1 dx
x ln x
1
D ln.ln x / D 1:
So
1
1
< 1: So
converges.
ln 2
k .ln k /2
k D2
1
X
1
1
1
1
D 1C
C
C
C : : : converges if and only if p > 1.
p
p
p
p
k
2
3
4
k D1
(Reason. For p 0; the terms are at least 1, so the series diverges by term test. For p > 0; f .x / D x1p decreases
1
Z 1
Z 1
1
x p C1
1
1
to 0 as x ! C1. Since
dx D
if p > 1;
d x D .ln x /j1
1 D 1 if p D 1 and
D p
p
p
x
p
C
1
1
x
1
1
1
Z 1
1
1
x p C1
dx D
D 1 if p < 1, the integral test gives the conclusion.)
p
x
p C 1 1
1
Theorem (ptest). For a real number p; . p/ D
Remarks. For even positive integer p; the value of . p/ was computed by Euler back in 1736. He got
.2/ D
2
6
; .4/ D
4
90
; : : : ; .2n / D . 1/nC1
14
.2/2n B2n
; :::;
2.2n /!
k 1
X
kC1
where B0 D 1 and .k C 1/ Bk D
Bm for k 1: The values of .3/; .5/; : : : are unknown. Only in the
m
m D0
1980s, R. Apery was able to show .3/ was irrational.
Theorem (Comparison Test). Given vk u k 0 for every k. If
diverges, then
1
X
k D1
k D1
vk
k D1
vk converges, then
1
X
k D1
vk
1
X
k D1
u k 0. If
1
X
k D1
vk is a number, then
k D1
u k converges. If
1
X
k D1
uk
1
X
k D1
u k is a number. If
1
X
k D1
u k D C1, then
D C1.)
1
X
1
X
vk diverges.
(Reason. vk u k 0 )
1
X
1
X
k !1
1
1
X
X
v
vk converge) or (both diverge to C1). If lim k D 0; then
u k converges )
vk converges. If
k !1 u k
k D1
k D1
k D1
k D1
1
1
X
X
vk
lim
D 1; then
u k diverges )
vk diverges.
k !1 u k
k D1
k D1
P
P
P
vk
(Sketch of Reason. For k large,
L. For L > 0;
vk Lu k D L u k . If one series converges, then the
uk
other also converges. If one diverges (to C1), so does the other. For L D 0; vk < u k eventually. For L D 1; vk > u k
u k and
1
X
vk
uk
eventually. So the last two statements follow from the comparison test.)
Examples. Consider the convergence or divergence of the following series:
1
X
(2)
1
X
3k
(3)
1
X
1
X
kC1
1
(4)
sin
.
2
2 C 5k
k
1
k
k
k D2
k D1
k D1
1 1
1 1
X
X
1
1
1
1
Solutions. (1) Since 0 < 2 cos
< 2 and
converges
by
ptest,
cos
converges.
2
2
k
k
k
k
k
k
k D1
k D1
1
1
(1)
cos
2
k
k
k D1
1 3
1 3k
X
X
3 k
3k
k
2
for k 2 and
diverges by the geometric series test,
diverges.
2
k
1
2
k2 1
k D2
k D2
p
k C1
kC1
k
1
k 2 C5k
(3) When k is large, 2
2 D 3=2 . We compute lim p
D lim
k
k !1
k !1
k C 5k
k
k
2
1
X
1 1
X
k C 1 k2
D
1
:
Since
k k 2 C 5k
k 3 =2
k D1
kC1
converges by ptest,
converges by the limit comparison test.
2
k C 5k
k D1
1
1
1
sin
(4) When k is large, is close to 0, so sin
is close to because lim
D 1 (i.e. sin as ! 0).
!0
k
k
k
1
1
1
X
X
sin. k /
sin
1
1
We compute lim
D
lim
D
1.
Since
diverges
by
ptest,
sin
diverges by the limit
1
k !1
!0
k
k
k D1
k D1
k
comparison test.
For series with alternate positive and negative terms, we have the following test.
Theorem (Alternating Series Test). If ck decreases to 0 as k ! 1 (i.e. c1 c2 c3 : : : 0 and lim ck D 0),
then
1
X
k D1
. 1/kC1 ck
k !1
D c1
c2 C c3
c4 C c5
: : : converges.
15
Sn 1 j D
n!1
Examples. Both
1
X
. 1 /k
and
1
X
e
k ln k
k D2
k D1
and ek % 1; so 1=.k ln k / & 0 and e
. 1/k :
For series with arbitrary positive or negative term, we have the following tests.
Theorem (Absolute Convergence Test). If
1
X
k D1
1
X
k D1
1
X
1
X
k D1
k D1
Definition. We say
converges, but
1
X
k D1
1
X
k D1
ak D
1
X
1
X
k D1
k D1
.ak C jak j/
1
X
k D1
ak converges.
1
X
k D1
jak j converges.)
1
X
k D1
1
X
k D1
ak
jak j diverges.
1
X
cos k
k3
k D1
Solutions. (a)
(b)
1
X
cos k
.
1Ck
k D1
1 cos k X
1 1
X
.
k3
k3
k D1
k D1
1
X
1
X
cos k
comparison test. So
converges absolutely by the absolute convergence test.
k3
k D1
(b)
1 cos k X
1
X
D
1Ck
k D1
However,
k D1
1
1Ck
1
1Ck
1 dx
1
X
D ln.1 C x / D 1 )
diverges.
1Cx
1Ck
1
k D1
converges. Therefore
1 cos k
X
1
Since
converges
by
ptest,
it
follows
that
k 3 converges by the
k3
k D1
k D1
1
X
cos k
converges conditionally.
1Ck
k D1
1
X
1
X
cos k
1
D
. 1/k
1
C
k
1
C
k
k D1
k D1
Theorem (Ratio Test). If ak 6D 0 for every k and lim jakC1 =ak j exists, then
k !1
8
>
>
<
>
>
>
>
>
>
ak C1 <
D
lim
k !1
ak >
>
>
>
>
>
>
>
:>
1
X
k D1
ak converges absolutely
1
X
1
X
1
)
ak may converge e:g:
2
k
k D1
k D1
1
X
k D1
ak diverges
16
1
X
1
or diverge e:g:
k
k D1
ak C1
a
a
a
, then for k large, k C1 , k C2 , : : :, k Cn r, so jak Cn j jak jr n and
(Sketch of reason. Let r D lim
k !1
ak
ak
akC1
akCn 1
2
3
jak j C jakC1 j C jakC2 j C : : : jak j.1 C r C r C r C : : :/ which converges if r < 1 by the geometric series test and
P
P
akCn ak r n diverges if r > 1 by the term test.)
p
k
k !1
lim
k !1
8
>
>
<
>
>
>
>
>
>
<
jak j
1
X
1
)
ak may converge e:g:
k2
k D1
k D1
)
ak converges absolutely
k D1
1
X
D1
>
>
>
>
>
>
>
>
:>
1
X
1
X
k D1
1
X
ak diverges
P k
p
P
jak j, then for k large, k jak j r: So jak j r k ,
r .)
jak j
1
3kC1 2kC1
1
3k 2k
D lim
k !1
k !1
test,
1
X
k D1
1
3k
2k
1
2k
3
D
lim
2kC1 k!1 1
3k
3kC1
1
3k
2k
D lim p
k
k !1
. 23 /k 13
. 23 /kC1
3k
2k
1
X
1
1
< 1; by the ratio test,
k
3
3
2k
k D1
D lim
k !1
. /
2 k
3
1
< 1, by the root
3
converges.
.k C 1/! k k
k !1 .k C 1/k C1 k!
k !1
1
or diverge e:g:
k
k D1
D lim
k !1
.1 C 1k /k
1 k!
X
1
< 1; by the ratio test,
converges.
e
kk
k D1
Remarks. You may have observed that in example (1), the limit you got for applying the root test was the same as the
limit you got for applying the ratio test. This was not an accident!
akC1
p
D r 2 R; then lim k ak D r: (This implies that the root test can be
k !1 ak
k !1
applied to more series than the ratio test.)
Theorem. If ak > 0 for all k and lim
k !1
p
a k C1
k C1
k
D lim
D 1: So, lim
k D 1:
k
!1
k
!1
ak
k
p
k
k!
akC1
1
p
k!
1
k k
(2) Let ak D k ; then lim
D as above. So lim k ak D lim
D ; i.e. when k is large, k!
;
k !1 ak
k !1
k !1 k
k
e
e
e
which is a simple version of what is called Stirlings formula. It is useful in estimating n! when n is large. For
100
100
example, since log10
1:566; so
101:566; then we get 100! 10156:6; which has about 157 digits.
e
e
j
X
k D1
n
X
k D1
ak D a1 C a2 C : : : C a j and 1bk D
ak bk D Sn bn
17
n 1
X
k D1
S k 1b k :
bkC1 bk
D bkC1
.k C 1/ k
bk ; then
Sk
ak bk D S1 b1 C . S2
S1/b2 C : : : C . Sn
S1 .b2
D Sn bn
b1 /
:::
Sn 1 /bn
Sn 1 .bn
1
X
sin k
converges.
k
k D1
1
1
1
Let ak D sin k and bk D : Using the identity sin m sin D
cos.m
k
2
2
cos 12
1
/
2
1
cos.m C / ; we have
2
cos.k C 12 /
2 sin 12
1
Sn
for every k : Applying summation by parts and noting that lim
D 0; we get
n
!1
sin.1=2/
n
This implies j Sk j
1
X
n
X
sin k
sin k
D lim
D lim
n
!1
n!1
k
k
k D1
k D1
Now
bn 1 /:/
1 1
X
Sk
k
C1
k D1
1
X
n 1
X
Sn
n
1 1
X
1
sin.1=2/ kD1 k
k D1
1
X
sin k
D
Sk
absolute convergence test,
k
k D1
k D1
kC1
1
k
Sk
1
k
D
1
k
kC1
!
1
X
k D1
Sk
1
k
1
kC1
1
by the telescoping series test. So by the
sin.1=2/
converges.
1
X
k D1
bk is obtained from
1
X
k D1
p : N[f0g ! N[f0g such that p.0/ D 0; b1 D a1 C C ap .1/ ; b2 D ap .1/C1 C C ap .2/ ; b3 D ap .2/C1 C C ap .3/; : : : :
(Note bn is the sum of kn D p.n / p.n 1/ terms.)
Grouping Theorem. Let
1
X
k D1
bk be obtained from
1
X
k D1
ak by inserting parentheses. If
1
X
n!1
(Reason. Let sn D
let p.n /
cr; j D
p .n
ap .i /Cr
0
n
X
k D1
ak and tn D
n
X
k D1
k D1
1
X
k D1
bk converges to s ; then
1
X
k D1
bk D lim tn D lim
n!1
n!1
ak converges to s ; then
1
X
k D1
p .n/
X
k D1
1
X
k D1
bk
ak will converge to s :
1/ be bounded by M : For a positive integer j ; let p.i / j < p.i C 1/: For r D 1; 2; : : : ; M ; define
1
X
if p.i / C r j
: Then
ak D lim s j D lim ti C lim .c1; j C C c M ; j / D s C 0 C C 0 D s :)
if p.i / C r > j
j !1
i !1
j !1
k D1
1
X
1
1 1 1
1
D C C C
C converges to 1, so by the theorem,
k
2
2
4
8
16
k D1
1
C
2
1 1
C
4 8
1
1
1
C
C
16 32 64
1
1
1
1
C
C
C
128 256 512 1024
18
C D 1:
(2) .1
1 / C .1
1
2
(3) Since 1
son test with
Definition.
1
X
k D1
1
X
1
3
1
4
C D
1
X
j D1
1
), so by the theorem, 1
2
j
j D1
1
X
bk is a rearrangement of
k D1
1
2j
1
2j
1
X
1
converges (by the limit compari2 j .2 j 1/
j D1
1 . 1/kC1
X
1
C D
converges to the same sum.
4
k
k D1
1 1
C
2 3
1 1 1 1 1
Example. Given ln 2 D 1
C
C
C : : : (which converges conditionally). Consider the rearrangement
2 3 4 5 6
1 1 1 1 1 1
1
1
C : : :. Observe that
1C
C C
C C
3
2
5
7
4
9
11
6
 {z } {z}  {z } {z}  {z } {z}
2C
2C
2C
.1
1
2
1
2
/ C . 13
1
4
1
4
/ C . 15
1
6
C 16
C . 13
1
2
/C
1
5
1
X
1
X
k D1
a .k/ of
1
X
k D1
pk ;
1
X
k D1
1
X
k D1
ak such that
1
X
k D1
if ak 0
and qk D
if ak < 0
ak
0
k D1
/ C . 17
1
8
1
8
/ C : : : D ln 2
: : : D 12 ln 2
C . 17
1
4
/ C : : : D 32 ln 2:
a .k / D x :
0
if ak 0
: Then ak D pk
jak j if ak < 0
1
X
ak D
k D1
1
X
k D1
pk
1
X
k D1
1
X
k D1
qk and jak j D pk C qk :
also.) Let u n ; vn be sequences of real numbers having limits x and u n < vn ; v1 > 0: Now let P1 ; P2 ; : : : be the
nonnegative terms of
1
X
k D1
ak in the order they occur and Q 1 ; Q 2 ; : : : be the absolute value of the negative terms in
1
X
k D1
Pk ;
1
X
k D1
Q k differ from
1
X
k D1
pk ;
1
X
k D1
1
X
k D1
1
X
k D1
ak .
19
1
X
k D1
a .k/
1
X
k D1
1
X
k D1
pk ;
1
X
k D1
As n ! 1; we get
1
X
1
X
k D1
1
X
k D1
k D1
p .k/
1
X
1
X
k D1
q .k/ D q : Then
1
X
k D1
a .k / D p
1
X
k D1
n
X
k D1
1
2
1
1
1
1
1
C 2 C 4
C 8
3
2 2
2 {z 2 } 2
1
1
C 6
7
2 {z 2
1
1
C 16
5
2 } 2
1
1
C 10
11
2
2
2 terms
is a rearrangement of
1
X
k D1
1
1
C 14
15
2
2
4 terms
1
1
C 12
13
2 {z 2
k D1
p .k / p :
ak :)
1
C : : : converges (absolutely) to
25
1
k D1
1
X
pk
1
1
C
23 24
ak and inserting
pk D p: Since pk 0; the
k D1
qD
k D1
1
1
C
2 22
Example.
1 k
/ D
2
m
X
p .k/ D p: Similarly,
1
X
zeros where a .k/ < 0: For any positive integer m ; the partial sum sm D
partial sum sm is also increasing, hence
1
2
1
.
3
1
C:::
29}
8 terms
1 k
/ , so it also converges to
2
1
.
3
Remarks. As a consequence of the rearrangement theorem, the sum of a nonnegative series is the same no matter how
the terms are rearranged.
Complex Series
Complex numbers S1 ; S2; S3 ; : : : with Sn D u n C i vn are said to have limit lim Sn D u C i v iff lim u n D u
n!1
n!1
and lim vn D v: A complex series is a series where the terms are complex numbers. The definitions of convergent,
n!1
absolutely convergent and conditional convergent are the same. The remarks and the basic properties following the
definitions of convergent and divergent series are also true for complex series.
The geometric series test, telescoping series test, term test, absolute convergence test, ratio test and root test are
also true for complex series. For z k D x k C iyk ; we have
to x and
1
X
k D1
1
X
k D1
1
X
k D1
x k converges
yk converges to y : So complex series can be reduced to real series for study if necessary.
k
z
2
n!1
n!1
1 1
X
1 zk
X
1
X
k D1
1
and
converges by ptest implies
converges absolutely. However, if
k
k2
k2
k2
k D1
k D1
1 zk
k C1
X
k 2
k2
z
jz j > 1; then lim
D
lim
j
z
j
D
j
z
j
>
1
implies
diverges by the ratio test.
k !1 .k C 1/2 z k
k !1 .k C 1/2
k2
k D1
(2) If jz j 1; then
20
As above, we define S to be bounded below if there is some m 2 R such that m x for all x 2 S. Such an m is
called a lower bound of S. The infimum or greatest lower bound (denoted by inf S or glb S) of S is a lower bound mQ
of S such that m mQ for all lower bounds m of S.
inf S
sup S
lower bounds
are here
upper bounds
are here
Remarks (Exercises). (1) Let B D f x : x 2 B g: (This is the reflection of B about 0.) If B is bounded below,
then B is bounded above and inf B D sup. B /: Similarly, if B is bounded above, then B is bounded below and
sup B D inf . B /: From these and the completeness axiom, we get the following statement.
(Completeness Axiom for Infimum) Every nonempty subset of R which is bounded below has an infimum in R.
B
(
inf(B)
sup(B)
infB
)
A
infA
supA
supB
(2) For a set B, if it is bounded above and c 0; then let cB D fcx: x 2 B g: (This is the scaling of B by a factor of
c:) We have sup cB D c sup B : If ; 6D A B, then inf B inf A whenever B is bounded below and sup A sup B
whenever B is bounded above.
c units
infB
supB
inf(c+B)
c+B
sup(c+B)
(3) For c 2 R; let c C B D fc C x : x 2 B g: (This is a translation of B by c units.) It follows that B has a supremum
if and only if c C B has a supremum, in which case sup.c C B / D c C sup B : The infimum statement is similar, i.e.
inf.c C B / D c C inf B : More generally, if A and B are bounded, then letting A C B D fx C y : x 2 A; y 2 B g; we
have sup. A C B / D sup A C sup B and inf. A C B / D inf A C inf B :
If S is bounded above and below, then S is bounded. Note sup S, inf S may or may not be in S. Also, if S
is bounded, then for all x 2 S ; jx j D max.x ; x / max.sup S ; inf S / (because x sup S and x inf S :)
Conversely, if there is c 2 R such that for all x 2 S ; jx j c; then c x c so that S is bounded (above by c and
below by c:)
Simple Consequences of the Axioms.
Theorem (Infinitesimal Principle). For x, y 2 R, x < y C " for all " > 0 if and only if x y : (Similarly, y
for all " > 0 if and only if y x.)
"<x
Proof. If x y, then for all " > 0, x y D y C 0 < y C " by (iv) of the field axiom and (iii) of the order axiom.
Conversely, if x < y C " for all " > 0; then assuming x > y ; we get x y > 0 by (iii) of the order axiom. Let
D x
y ; then x D y C "0 : Since "0 > 0; we also have x < y C "0 : These contradict (i) of the order axiom. So
x y : The other statement follows from the first statement since y " < x is the same as y < x C ":
"0
Remarks. Taking y D 0, we see that jx j < " for all " > 0 if and only if x D 0. This is used when it is difficult to
show two expressions a ; b are equal, but it may be easier to show ja bj < " for every " > 0:
Theorem (Mathematical Induction). For every n 2 N, A.n / is a (true or false) statement such that A.1/ is true and
for every k 2 N, A.k / is true implies A.k C 1/ is also true. Then A.n / is true for all n 2 N.
22
Proof. Suppose A.n / is false for some n 2 N. Then S D fn 2 N: A.n / is falseg is a nonempty subset of N. By the
wellordering axiom, there is a least element m in S : Then A.m / is false. Also, if A.n / is false, then m n. Taking
contrapositive, this means that if n < m ; then A.n / is true.
Now A.1/ is true, so m 6D 1 and m 2 N imply m 2. So m 1 1: Let k D m 1 2 N; then k D m 1 < m
implies A.k / is true. By hypothesis, A.k C 1/ D A.m / is true, a contradiction.
Theorem (Supremum Property). If a set S has a supremum in R and " > 0; then there is x 2 S such that
sup S " < x sup S.
Proof. Since sup S " < sup S, sup S " is not an upper bound of S. Then there is x 2 S such that sup S " < x.
Since sup S is an upper bound of S, x sup S. Therefore sup S " < x sup S.
Theorem (Infimum Property). If a set S has an infimum in R and " > 0; then there is x 2 S such that inf S C " >
x inf S.
Proof. Since inf S C " > inf S, inf S C " is not a lower bound of S. Then there is x 2 S such that inf S C " > x. Since
inf S is a lower bound of S, x inf S. Therefore inf S C " > x inf S.
Theorem (Archimedean Principle). For any x 2 R, there is n 2 N such that n > x.
Proof. Assume there exists x 2 R such that for all n 2 N; we have n x : Then N D fn: n 2 Ng has an upper
bound x. By the completeness axiom, N has a supremum in R. By the supremum property, there is n 2 N such that
sup N 1 < n, which yields the contradiction sup N < n C 1 2 N.
Question. How is Q contained in R? How is R n Q contained in R?
Below we will show that Q is dense in R in the sense that between any two distinct real numbers x ; y, no matter
how close, there is a rational number. Similarly, R n Q is dense in R: First we need a lemma.
Lemma. For every x 2 R; there exists a least integer greater than or equal to x : (In computer science, this is called
the ceiling of x and is denoted by dx e:) Similarly, there exists a greatest integer less than or equal to x : (This is denoted
by [x]: In computer science, this is also called the floor of x and is denoted by bx c:)
Proof. By the Archimedean principle, there is n 2 N such that n > jx j: Then n < x < n : By (iii) of the order axiom,
0 < x C n < 2n : The set S D fk 2 N : k x C n g is a nonempty subset of N because 2n 2 S : By the wellordering
axiom, there is a least positive integer m x C n : Then m n is the least integer greater than or equal to x : So the
ceiling of every real number always exist.
Next, to find the floor of x ; let k be the least integer greater than or equal to
less than or equal to x :
x ; then
Theorem (Density of Rational Numbers). If x < y, then there is mn 2 Q such that x < mn < y.
Proof. By the Archimedean principle, there is n 2 N such that n > 1=. y x /: So ny nx > 1 and hence nx C 1 < ny :
Let m D [nx] C 1; then m 1 D [nx] nx < [nx] C 1 D m : So nx < m nx C 1 < ny ; i.e. x < mn < y :
Theorem (Density of Irrational Numbers). If x < y, then there is w 2 R n Q such that x < w < y.
Proof. Let w0 2 R n Q. By the density of rational numbers, there is mn 2 Q such that jwx0 j < mn < jwy0 j : (If mn D 0;
then pick another rational number between 0 and jwy0 j : So we may take mn 6D 0:) Let w D mn jw0 j; then w 2 R n Q and
x < w < y:
Examples. (1) Let S D . 1; 3/ [ .4; 5]; then S is not bounded below and so S has no infimum. On the other hand,
S is bounded above by 5 and every upper bound of S is greater than or equal to 5 2 S : So sup S D 5:
(2) Let S D f 1n : n 2 Ng D f1; 12 ; 13 ; 14 ; : : :g: In the examples following the definition of supremum, we saw sup S D 1:
Here we will show inf S D 0: (Note 0 62 S.) Since n1 > 0 for all n 2 N; 0 is a lower bound of S. So by the
completeness axiom for infimum, inf S must exist. Assume S has a lower bound t > 0: By the Archimedean
principle, there is n 2 N such that n > 1= t : Then t > 1= n 2 S ; a contradiction to t being a lower bound of S : So
0 is the greatest lower bound of S :
23
(3) Let S D [2; 6/ \ Q: Since 2 x < 6 for every x 2 S ; S has 2 as a lower bound and 6 as an upper bound. We
will show inf S D 2 and sup S D 6: (Note 2 2 S and 6 62 S.) Since 2 2 S ; so every lower bound t satisfy t 2:
Therefore inf S D 2: For supremum, assume there is an upper bound u < 6: Since 2 2 S ; so 2 u : By the
density of rational numbers, there is a r 2 Q such that u < r < 6: Then r 2 [2; 6/ \ Q D S : As u < r contradicts
u being an upper bound of S ; so every upper bound u 6: Therefore, sup S D 6:
24
Chapter 6. Limits
Limit is the most important concept in analysis. We will first discuss limits of sequences, then limits of functions.
Definitions. An (infinite) sequence in a set S (e.g. S D R or S D [0; 1]) is a list x 1 ; x 2 ; x 3 ; : : : of elements of S in a
specific order. Briefly it is denoted by fx n g: (Mathematically it may be viewed as a function x: N ! S with x .n / D x n
for n 2 N:) We say the sequence fx n g is bounded above iff the set fx 1 ; x 2 ; x 3 ; : : :g is bounded above. (Bounded below
and bounded sequences are defined similarly.) We will also write supfx n g for the supremum of the set fx 1 ; x 2 ; x 3 ; : : :g
and inf fx n g for the infimum of the set fx 1 ; x 2 ; x 3 ; : : :g:
CAUTION: Since we seldom talk about a set with one element from now on, so notations like fx n g will denote
sequences unless explicitly stated otherwise.
For x ; y 2 R; the distance between x and y is commonly denoted by d .x ; y /; which equals jx y j: Below we will
need a quantitative measure of what it means to be close for a discussion of the concept of limit. For " > 0; the open
interval .c "; c C "/ is called the "neighborhood of c: Note x 2 .c "; c C "/ if and only if d .x ; c/ D jx cj < ";
i.e. every number in .c "; c C "/ has distance less than " from c:
Limit of a sequence fx n g is often explained by saying it is the number the x n s are closer and closer to as n gets
larger and larger. There are two bad points about this explanations.
(1) Being close or large is a feeling! It is not a fact. It cannot be proved by a logical argument.
(2) The effect of being close can accumulate to yield large separation! If two numbers having a distance less than or
equal to 1 are considered close, then 0 is close to 1 and 1 is close to 2 and 2 is close to 3, : : : ; 99 is close to 100,
but 0 is quite far from 100.
So what is the meaning of close? How can limit be defined so it can be checked? Intuitively, a sequence fx n g gets
close to a number x if and only if the distance d .x n ; x / goes to 0. This happens if and only if for every positive "; the
distance d .x n ; x / eventually becomes less than ": The following example will try to make this more precise.
2n 2 1
gets close to 2. For " D 0:1; how soon (that is, for
n2 C 1
what n) will the distance d .x n ; 2/ be less than "? (What if " D 0:01? What if " D 0:001? What if " is an arbitrary
positive number?)
2
2n
1
3
Solution. Consider d .x n ; 2/ D 2
2 D 2
< ": Solving for n ; we get n 2 > .3="/ 1: If " D 0:1; then
n
C
1
n
C
1
p
n > 29: So as soon as n 6; the distance between x n and 2 will be less than " D 0:1:
p
p
(If " D 0:01; then n >
299: So n 18 will do. If " D 0:001; then n > 2999: So n 55 will do.
p
If 0 < " 3; then n [ .3="/ 1] C 1 will do. If " > 3; then since n23C1 < 3 < " for every n 2 N; so
n 1 will do. So for every " > 0; there is a K 2 N so that as soon as n K ; the distance d .x n ; 2/ will be less
than ":) Note the value of K depends on the value of "I the smaller " is, the larger K will be. (Some people write K "
to indicate K depends on ":)
Example. As n gets large, intuitively we may think x n D
Definition. A sequence fx n g converges to a number x (or has limit x) iff for every " > 0, there is K 2 N such that for
every n K ; it implies d .x n ; x / D jx n x j < " (which means x K ; x K C1 ; x K C2 ; : : : 2 .x "; x C "/:/
Remarks. (i) From the definition, we see that fx n g converges to x ; fx n x g converges to 0 and fjx n x jg converges
to 0 are equivalent because in the definition, jx n x j is the same as j.x n x / 0j D jjx n x j 0j:
(ii) To show fx n g converges to x means for every " > 0; we have to find a K as in the definition or show such a K
exists. On the other hand, if we are given that fx n g converges to x, then for every " > 0; (which we can even
choose for our convenience,) there is a K as in the definition for us to use.
Let us now do a few more examples to illustrate how to show a sequence converges by checking the definition.
Later, we will prove some theorems that will help in establishing convergence of sequences.
25
Examples. (1) Let vn D c: For every " > 0, let K D 1, then n K implies jvn
1
1
: For every " > 0, there exists an integer K > (by the Archimedean principle). Then n K
n
"
1
1
cj D
< ". So fwn g converges to c:
n
K
(2) Let wn D c
implies jwn
(3) Let x n D
.cos n /
1
Solution. For every " > 0; there exists an integer K > 1 C by the Archimedian principle. Then n K implies
"
n
cos n
1
1
. 1/ D
< ": So fx n g converges to 1:
.cos n / n
.cos n / n
n 1
K 1
(4) Let yn D . 1/n : Show that f yn g does not converge.
Solution. Assume f yn g converges, say to y : Let " D 0:1: Then there exists K 2 N such that n K implies
j. 1/n
y j < " D 0:1: Taking an odd integer n k ; we get j 1 y j < 0:1; which implies y 2 . 1:1; 0:9/:
Taking a even integer n K ; we get j1 y j < 0:1; which implies y 2 .0:9; 1:1/: Since no y is in both . 1:1; 0:9/
and .0:9; 1:1/; we have a contradiction.
(5) Let z n D n 1= n : Show that fz n g converges to 1 by checking the definition.
Solution. (Let u n D jz n
1j D z n
n D z nn D .1 C u n /n D 1 C nu n C
r
so that u n
implies jz n
2
n
1/
2
u 2n C C u nn
1j D u n
2
n
2
K
"2
n .n
1/
2
u 2n
Theorem (Uniqueness of Limit). If fx n g converges to x and y, then x D y (and so we may write lim x n D x).
n!1
Proof. For every " > 0, we will show jx y j < ". (By the infinitesimal principle, we will get x D y.) Let "0 D "=2 > 0:
By the definition of convergence, there are K 1 , K 2 2 N such that n K 1 ) jx n x j < "0 and n K 2 ) jx n y j < "0 .
Let K D max. K 1 ; K 2 /. By the triangle inequality, jx y j D j.x x K / C .x K y /j jx x K jCjx K y j < "0 C "0 D ".
Boundedness Theorem. If fx n g converges, then fx n g is bounded.
Proof. Let lim x n D x. For " D 1, there is K 2 N such that n K ) jx n x j < 1 ) jx n j D j.x n
n!1
Let M D max.jx 1 j, : : :, jx K 1 j, 1 C jx j/; then for every n 2 N; jx n j M (i.e. x n 2 [ M ; M]).
x / C x j < 1 Cjx j.
Remarks. The converse is false. The sequence f. 1/n g is bounded, but not convergent by example (4). In general,
bounded sequences may or may not converge.
Theorem (Computation Formulas for Limits). If fx n g converges to x and f yn g converges to y, then
(i) fx n yn g converges to x y, respectively, i.e. lim .x n yn / D lim x n lim yn ,
(ii) fx n yn g converges to x y, i.e. lim .x n yn / D
n!1
n!1
lim x n
n!1
lim yn ,
n!1
n!1
n!1
Proof. (i) For every " > 0, there are K 1 ; K 2 2 N such that n K 1 ) jx n x j < "=2 and n K 2 ) j yn
Let K D max. K 1 ; K 2 /: Then n K implies n K 1 and n K 2 : So for these ns,
j.x n yn /
.x y /j D j.x n
x / . yn
y /j jx n
x j C j yn
y j < "=2.
n!1
x y / C lim x y D lim x n . yn
n!1
n!1
n!1
y / C lim y .x n
n!1
x / C x y D 0 C 0 C x y D x y:
(iii) Note 12 j y j > 0: Since f yn g converges to y ; there is K 0 2 N such that n K 0 implies j yn y j < 12 j y j: By
y j < 12 j y j ) 12 j y j < j yn j for n K 0 : Then for every n 2 N;
the triangle inequality, j y j j yn j j yn
j yn j m D min.j y1 j; : : : ; j y K 0 1 j; 12 j y j/ > 0:
1
1
xn
1
1
x
(then by (ii), lim
Next we will show lim
D
D lim .x n / D x D ). For every " > 0; let
n!1 yn
n!1 yn
n!1
y
yn
y
y
"0 D m j y j" > 0: Since lim yn D y 6D 0, there is K 2 N such that n K ) j yn y j < "0: Then
n!1
nK
1
)
y
1 j y yn j
"
D
< 0 D ":
y
j yn jj y j
mj yj
Remarks. (1) As in the proofs of the uniqueness of limit and part (i) of the computation formulas, when we
have n K 1 ) jan a j < "1 and n K 2 ) jbn bj < "2 ; we may as well take K D max. K 1 ; K 2 / to say
n K ) jan a j < "1 and jbn bj < "2 from now on.
(2) By mathematical induction, we can show that the computation formulas also hold for finitely many sequences.
However, the number of sequences must stay constant as the following example shows
1
1
1
1
C C
6
D
lim C C lim D 0 C C 0 D 0:
n!1 n
n!1 n
n!1 n
n

{z
}
1 D lim
n terms
Sandwich Theorem (or Squeeze Limit Theorem). If x n wn yn for all n 2 N and lim x n D lim yn D z ; then
n!1
n!1
lim wn D z.
n!1
[10n 2]
Example. Let wn D
2 Q for every n 2 N: (Note w1 D 1:4; w2 D 1:41; w3 D 1:414; w4 D 1:4142; : : : :)
10n p
p
p
p
10n 2 1
10n 2 p
10n 2 1 p
Then
<
w
D
2
:
Since
lim
D 2; by the sandwich theorem, lim wn D 2:
n
n
n
n
n!1
n!1
10
10
10
Theorem (Limit Inequality). If an 0 for all n 2 N and lim an D a, then a 0.
n!1
Proof. Assume a < 0. Then for " D ja j, there is K 2 N such that n K ) jan
a " < an < a C " D a C . a / D 0, a contradiction.
Remarks. By the limit inequality above, if x n yn , lim x n D x, lim yn D y, then taking an D yn x n 0; we get
n!1
n!1
the limit y x 0; i.e. x y : Also, if a x n b and lim x n D x ; then lim a D a lim x n D x lim b D b;
n!1
n!1
n!1
n!1
1
1
i.e. x n 2 [a ; b] and lim x n D x imply x 2 [a ; b]: (This is false for open intervals as n 2 .0; 2/; lim D 0 62 .0; 2/:)
n!1
n!1 n
27
Supremum Limit Theorem. Let S be a nonempty set with an upper bound c: There is a sequence fwn g in S converging
to c if and only if c D sup S.
Proof. If c D sup S ; then for n 2 N, by the supremum property, there is wn 2 S such that c n1 D sup S n1 < wn
1
sup S D c. Since lim .c
/ D lim c D c, the sandwich theorem implies lim wn D c D sup S.
n!1
n!1
n!1
n
Conversely, if a sequence fwn g in S converges to c; then wn sup S implies c D lim wn sup S : Since c is an
n!1
upper bound of S ; so sup S c: Therefore c D sup S :
Infimum Limit Theorem. Let S be a nonempty set with a lower bound c: There is a sequence fwn g in S converging
to c if and only if c D inf S.
Examples. (1) Let S D f n1 : n 2 Ng D f1; 12 ; 13 ; : : :g: Since 0 n1 for all n 2 N; 0 is a lower bound of the set S : Now
the sequence f n1 g in S converges to 0: By the infimum limit theorem, inf S D 0:
(2) Let S D fx C 1y : x 2 Q \ .0; 1]; y 2 [1; 2]g: Since 12 x C 1y for all x 2 Q \ .0; 1] and y 2 [1; 2]; 12 is a
lower bound of S : Now the sequence f 1n C 12 g in S converges to 12 : By the infimum limit theorem, inf S D 12 :
(3) Let A and B be bounded in R: Prove that if A 2B D fa 2b : a 2 A; b 2 B g; then sup. A 2B / D sup A 2 inf B :
Solution. Since A and B are bounded, sup A and inf B exist by the completeness axiom. For x 2 A 2B ; we
have x D a 2b for some a 2 A and b 2 B : So x D a 2b sup A 2 inf B : Hence sup A 2 inf B is an upper
bound for A 2B : By the supremum limit theorem, there is a sequence an 2 A such that fan g converges to sup A:
By the infimum limit theorem, there is a sequence bn 2 B such that fbn g converges to inf B : Then fan 2bn g is a
sequence in A 2B and fan 2bn g converges to sup A 2 inf B by the computation formulas for limits. By the
supremum limit theorem, therefore sup. A 2B / D sup A 2 inf B :
Definition. A subsequence of fx n g is a sequence fx n j g, where n j 2 N and n 1 < n 2 < n 3 < : : :.
Examples. For the sequence x 1 ; x 2 ; x 3 ; x 4 ; x 5 ; x 6 ; : : : ; if we set n j D j 2; we get the subsequence x 1 ; x 4 ; x 9 ; x 16 ; : : : :
If n j D 2 j C 1; then we get the subsequence x 3 ; x 5 ; x 7 ; x 9 ; : : : : If n j is the j th prime number, then we get the
subsequence x 2 ; x 3 ; x 5 ; x 7 ; : : : :
Remarks. (1) Taking n j D j ; we see that every sequence is a subsequence of itself. A subsequence can also be
thought of as obtained from the original sequence by throwing away possibly some terms. Also, a subsequence of a
subsequence of fx n g is a subsequence of fx n g:
(2) By mathematical induction, we have n j j for all j 2 N because n 1 1 and n j C1 > n j j implies n j C1 j C 1:
Subsequence Theorem. If lim x n D x, then lim x n j D x for every subsequence fx n j g of fx n g. (The converse is
n!1
j !1
x j < ".
Question. How can we tell if a sequence converges without knowing the limit (especially if the sequence is given by
a recurrence relation)?
For certain types of sequences, the question has an easy answer.
8
>
<
increasing
x1 x2 x3 : : : >
>
>
=
<
=
decreasing
x1 x2 x3 : : :
monotone
Definitions. fx n g is
iff
; respectively. fx n g is
iff
strictly monotone
>
>
: strictly increasing >
;
: x1 < x2 < x3 < : : : >
;
strictly decreasing
x1 > x2 > x3 > : : :
increasing or decreasing
fx n g is
; respectively.
strictly increasing or decreasing
Monotone Sequence Theorem. If fx n g is increasing and bounded above, then lim x n D supfx n g. (Similarly, if fx n g
is decreasing and bounded below, then lim x n D inffx n g.)
n!1
28
n!1
Proof. Let M D supfx n g, which exists by the completeness axiom. By the supremum property, for any " > 0, there is
x K such that M " < x K M. Then j K ) M " < x K x j M ) jx j M j D M x j < ":
Remark. Note the completeness axiom was used to show the limit of x n exists (without giving the value).
Examples. (1) Let 0 < c < 1 and x n D c1= n : Then x n < 1 and cnC1 < cn ) x n D c1= n < c1=.nC1/ D x nC1 : So by
2
the monotone sequence theorem, fx n g has a limit x : Now x 2n
D .c1=2n /2 D c1= n D x n : Taking limits and using the
2
subsequence theorem, we get x D x : So x D 0 or 1. Since 0 < c D x 1 x ; the limit x is 1. Similarly, if c 1; then
c1= n will decrease
to the limit 1.
r
q
2C
(2) Does
2C
Here we have a nested radical defined by x 1 D 2 and x nC1 D 2 C x n : The question is whether fx n g
converges to a real number x. (Computing
p a few terms, we suspect that fx n g is increasing. To find an upper bound,
observe that if lim x n D x ; then x D 2 C x implies x D 2:) Now by mathematical induction, we can show that
n!1
x n < x nC1 < 2: (If x n < x nC1 < 2; then 2 C x n < 2 C x nC1 < 4; so taking square roots, we get x nC1 < x nC2 < 2:)
By the monotone sequence theorem, fx n g has a limit x : We have x 2 D lim x n2C1 D lim 2 C x n D 2 C x : Then
xD
1 or 2. Since
n!1
2 D x 1 x ; so x D 2:
n!1
Another common type of sequences is obtained by mixing a decreasing sequence and an increasing sequence into
one of the form a1 ; b1 ; a2 ; b2 ; a3 ; b3 ; : : : : In the next example, we will have such a situation and we need two theorems
to handle these kind of sequences.
1
nD1
1
nD1
n!1
n!1
[
a1
[
a2
[
a3 ...
]
b3
]
b2
]
b1
Proof. I1 I2 I3 : : : implies fan g is increasing and bounded above by b1 and fbn g is decreasing and bounded
below by a1 . By the monotone sequence theorem, fan g converges to a D supfan g and fbn g converges to b D inffbn g.
Since an bn for every n 2 N, taking limits, we have an a b bn . Consequently, x 2 [an ; bn ] (i.e. an x bn )
1
and \ In
nD1
n!1
n!1
D fa g:
an / D b
n!1
nD1
a ; then a D b
Remarks. Note in the proof, the monotone sequence theorem was used. So the nested interval theorem also implicitly
depended on the completeness axiom.
Intertwining Sequence Theorem. If fx 2m g and fx 2m 1 g converge to x ; then fx n g also converges to x :
Proof. For every " > 0; since fx 2m g converges to x ; there is K 0 2 N such that m K 0 ) jx 2m x j < ": Since fx 2m 1 g
also converges to x ; there is K 1 2 N such that m K 1 ) jx 2m 1 x j < ": Now if n K D max.2K 0 ; 2K 1 1/;
then either n D 2m 2K 0 ) jx n x j D jx 2m x j < " or n D 2m 1 2K 1 1 ) jx n x j D jx 2m 1 x j < ":
1
Example. Does
represent a number?
1
1C
1 C
Here we have a continued fraction defined by x 1 D 1 and x nC1 D 1=.1 C x n /: We have x 1 D 1; x 2 D 1=2; x 3 D
2=3; x 4 D 3=5; : : : : Plotting these on the real line suggests 1=2 x 2n < x 2nC2 < x 2nC1 < x 2n 1 1 for all n 2 N:
This can be easily established by mathematical induction. (If 1=2 x 2n < x 2nC2 < x 2nC1 < x 2n 1 1; then
1 C x 2n < 1 C x 2nC2 < 1 C x 2nC1 < 1 C x 2n 1 : Taking reciprocal and applying the recurrence relation, we have
x 2nC1 > x 2nC3 > x 2nC2 > x 2n : Repeating these steps once more, we get x 2nC2 < x 2nC4 < x 2nC3 < x 2nC1 :)
Let In D [x 2n ; x 2n 1 ]; then I1 I2 I3 : Now
jx m
1
x m C1 j D
1Cx
1
m 1
1 C xm
jx m 1 x m j
.1 C x m 1/.1 C x m /
29
<
jx m 1
xm j
.1 C /.1 C /
1
2
1
2
4
jx m
9
x m j:
x 2n j <
4
jx 2n
9
x 2n 1 j <
44
jx 2n
99
x 2n 2 j < <
4
4
jx 1
9
9
 {z }
x2 j D
4 2n
9
21
2n 2
n!1
n!1
1
nD1
x : So x
5/=2: Since x 2 I1 ; x D . 1 C
5/=2:
lim x nC1 D
n!1
(Instead of estimating the lengths of the In s and squeezing them to 0 to see their intersection is a single point,
we can also do the following. Let In D [x 2n ; x 2n 1 ] be as above so that I1 I2 I3 : By the nested interval
1
1
theorem, \ In D [a ; b]; where a D lim x 2n and b D lim x 2n 1 : Taking limits on both sides of x 2nC1 D
and
n!1
n!1
nD1
1 C x 2n
1
1
1
x 2n D
; we get b D
and a D
: Then b.1 C a / D 1 D a .1 C b/; which yields b C ab D a C ab;
1 C x 2n 1
1Ca
1Cb
1
n D1
x n j < ".
Remark. Roughly, the condition says that the terms of these sequences are getting closer and closer to each other.
1
1
1
1
1
: (Note that if m ; n K ; say m n ; then we have jx m x n j D 2
< 2 2 :)
n2
n
m2
n
K
1
For every " > 0; we can take an integer K > p (by the Archimedean principle). Then m ; n K implies
Example. Let x n D
jx m
1
x n j 2 < ": So fx n g is a Cauchy sequence.
K
"
j !1
30
j !1
Remarks. In the proof, the nested interval theorem was used, so the BolzanoWeierstrass theorem depended on the
completeness axiom.
Alternate Proof. We will show every sequence fx n g has a monotone subsequence. (If fx n g is bounded, then the
monotone sequence theorem will imply the subsequence converges.)
Call x m a peak of fx n g if x m x k for all k > m : If fx n g has infinitely many peaks, then we order the peaks by
strictly increasing subscripts m 1 < m 2 < m 3 < : By the definition of a peak, x m 1 x m 2 x m 3 : So fx m j g
is a decreasing subsequence of fx n g: On the other hand, if fx n g has only finitely many peaks x m 1 ; ; x m k ; then let
n 1 D maxfm 1 ; ; m k g C 1: Since x n1 is not a peak, there is n 2 > n 1 such that x n2 > x n1 : Inductively, if x n j is not a
peak, there is n j C1 > n j with x n j C1 > x n j : So fx n j g is a strictly increasing subsequence of fx n g:
Remarks. This alternate proof used the monotone sequence theorem, so it also depended on the completeness axiom.
Cauchys Theorem. fx n g converges if and only if fx n g is a Cauchy sequence.
Proof. The only if part was proved. For the if part, since fx n g is a Cauchy sequence, fx n g is bounded. By the
BolzanoWeierstrass theorem, fx n g has a subsequence fx n j g that converges in R, say lim x n j D x.
j !1
We will show lim x n D x. For every " > 0, since fx n g is a Cauchy sequence, there is K 1 2 N such that m,
n K 1 ) jx m
n!1
x j jx n
jx m
xn D
1
1
1
xn j
C C 2 <
C C
D
.n C 1/2
m
n .n C 1 /
.m 1/m
m
X
k DnC1
1
n
x n J j C jx n J
x j < "=2. If
sin k
for k D 2; 3; 4; : : :?
k2
m
X
sin k
xk 1 / D
and
k2
k DnC1
.x k
1
nC1
C C
So for " > 0; by the Archimedean principle, there is K > 1=": Then m ; n K ) jx m
the Cauchy theorem, fx n g converges.
1
m
1
1
D
m
n
xn j <
1
K
1
1
< :
m
n
Limits of Functions
Let S be an interval (or more generally a set). Suppose f : S ! R is a function. We would like to define lim f .x /.
x ! x0
For this to be a meaningful expression, in the interval case, x 0 must be a point on the interval or an endpoint. In the
general case, x 0 must be approachable by the points of S.
CONVENTION. In discussing the limit of a function f : S ! R at x 0 ; x 0 is always assumed to be the limit of some
sequence in S n fx 0 g so that x 0 can be approached by points of S : (We say x 0 is an accumulation (or limit or cluster)
point of S iff x 0 is the limit of a sequence fx n g in S n fx 0 g:)
y = f (x)
y = f (x)
x0
)(
x0
Example. Let f .x / D .x 3 3x 2 /=. x 3/: If x gets close to 3 and x 6D 3; then f .x / D x 2 should be close to 9. In
other words, the distance d f .x /; 9 D j f .x / 9j goes to 0 when the distance d .x ; 3/ D jx 3j gets small. So for
31
every positive "; the distance j f .x / 9j will soon or later be less than " when the
3j becomes small
distance jx
enough. For " D 0:1; how small d .x ; 3/ be (that is, for what x) will make d f .x /; 9 D j f .x / 9j < "? Equivalently,
we are seeking a positive so that 0 < jx 3j < ) j f .x / 9j < ":
p
Now j f .x / 9j < " , 8:9 < f .x / < 9:1: So 2:9833 8:9 < x <
0:0166: If we take D 0:016; then 0 < jx 3j < ) j f .x / 9j < ":
(For smallp" > 0; j f .x /
take D min. 9 C " 3; 3
9j
p
3<
0:0167 < x
9C"
3<
3: So we may
Following the example, we are ready to state the precise definition of the limit of a function.
Definition. Let f : S ! R be a function. We say f .x / converges to L (or has limit L) as x tends to x 0 in S iff for
every " > 0, there is > 0 such that for every x 2 S ; 0 < jx x 0 j < implies j f .x / L j < ". This is denoted by
lim f .x / D L (or lim f .x / D L in short.)
x ! x0
x 2S
x ! x0
In the definition, depends on " and x 0 : For different " (or different x 0 ), will be different. If a limit value exists,
then it is unique. The proof is similar to the sequential case and is left as an exercise for the readers.
Examples. (1) For g : [0; 1/ ! R defined by g .x / D
x !4
Solution. For every " > 0; let D "2 : Then for every x 2 [0; 1/; 0 < jx 0j < implies jg .x / 0j D
This takes care of the checking for the first limit.
x<
D ":
jx
4j
jx
4j
2j D p
: For every " > 0; let D 2": Then for every
2
x C2
4j
jx
4j < implies jg .x / 2j
< D ":
2
2
1
1
: Show that lim f .x / D
by checking the " definition.
x !2
5x
10
1 jx 2j
jx
2j
Solution. (Note that
D
for x 2 .1; 3/:) For every " > 0; take D min.1; 10"/: Then
10
10x
10
1 jx 2j
1 and 10": For every x 2 R n f0g; 0 < jx 2j < implies x 2 .1; 3/: So f .x /
<
"
10
10
10
and we are done.
n!1
In quantifier symbols (8 D for any, for every, for all, 9 D there is, there exists),
x ! x0
x 2S
lim f .x / D L
()
8"
> 0;
9
x ! x0
x 2S
lim f .x / 6D L
()
9"
2 S; 0
< jx
x 0 j < ) j f .x /
L j < ";
9x 2 S ; 0
< jx
x 0 j < and j f .x /
L j ":
Proof. If xlim
!x0 f .x / D L ; then for every " > 0, there is > 0 such that for x 2 S, 0 < jx
x 2S
lim f .x n / D L.
n!1
32
x 0 j < ) j f .x /
x 0 j < .) j f .x n /
L j < ".
L j < "/. So
Conversely, if xlim
!x f .x / 6D L ; then there is " > 0 such that for every > 0; there is x 2 S with 0 < jx
x 2S
x0 j <
and j f .x / L j ". Now, setting D n1 ; there is x n 2 S with 0 < jx n x 0 j < D n1 and j f .x n / L j ". By the
sandwich theorem, x n ! x 0 in S n fx 0 g: So lim f .x n / D L : Then 0 D lim j f .x n / L j ", a contradiction.
n!1
n!1
Remarks. If lim f .x n / exists for every x n ! x 0 in S n fx 0 g; then all the limit values are the same. To see this, suppose
n!1
x n ! x 0 and wn ! x 0 in S n fx 0 g: Then the intertwining sequence fz n g D fx 1 ; w1 ; x 2 ; w2 ; x 3 ; w3; : : :g converges to x 0
in S n fx 0 g: Since f f .x n /g and f f .wn /g are subsequences of the convergent sequence f f .z n /g, they have the same limit.
Consequences of Sequential Limit Theorem.
(1) (Computation Formulas) If f ; g : S ! R are functions, lim f .x / D L 1 and lim g .x / D L 2 ; then
x ! x0
x 2S
lim
x !x
x 2S
f .x /
8 9
C
>
< >
=
>
: >
;
g .x / D L 1
8 9
C
>
< >
=
>
: >
;
x ! x0
x 2S
L 2 D xlim
!x f .x /
x 2S
8 9
C
>
< >
=
lim g .x /
x !x
>
: >
; x 2S 0
respectively (in the case of division, provided g .x / 6D 0 for every x 2 S and L 2 6D 0).
Proof. Since f .x / and g .x / have limits L 1 and L 2 ; respectively, as x tends to x 0 in S ; by the sequential limit
theorem, f .x n / and g .x n / will have limits L 1 and L 2 ; respectively, for every x n ! x 0 in S n fx 0 g: By the
computation formulas for sequences, the limit of f .x n / C g .x n / is L 1 C L 2 for every x n ! x 0 in S n fx 0 g: By the
sequential limit theorem, f .x / C g .x / has limit L 1 C L 2 as x tends to x 0 in S : Replacing C by ; ; =; we get the
proofs for the other parts.
Alternate Proof. If xlim
!x0 f .x / D L 1 and xlim
!x0 g .x / D L 2 ; then for every " > 0; there are 1 > 0 such that for
x 2S
every x 2 S ; 0 < jx
x 2S
x 0 j < 1 implies j f .x /
"
L 1j <
"
x 0 j < 2
implies jg .x / L 2 j < : Now we take D min.1 ; 2 / > 0 so that 1 and 2 : Then, for every x 2 S ;
2
0 < jx x 0 j < implies both 0 < jx x 0 j < 1 and 0 < jx x 0 j < 2 so that
f .x / C g .x /
. L 1 C L 2/ D j. f .x /
L 1 / C .g .x /
L 2 /j j f . x /
L 1 j C jg .x /
L 2j <
"
2
"
2
":
The other parts of the computation formulas can be proved by adapting the arguments for the sequential case.
(2) (Sandwich Theorem or Squeeze Limit Theorem) If f .x / g .x / h .x / for every x 2 S and xlim
! x0 f . x / D L D
x 2S
x ! x0
x 2S
x ! x0
x 2S
The proofs of (2) and (3) can be done by switching to sequences like the first proof of (1) or by adapting the
arguments of the sequential cases and checking the " definition like the alternate proof of (1).
Next we will discuss onesided limits.
Definitions. For f : .a ; b/ ! R and x 0 2 .a ; b/; the left hand limit of f at x 0 is f .x 0 / D lim f .x / D
The right hand limit of f at x 0 is f .x 0 C/ D limC f .x / D
x ! x0
lim
x ! x0
x 2. x0 ;b /
f .x /:
33
x ! x0
lim
x ! x0
x 2.a ; x0 /
f .x /.
Proof. If lim f .x / D L ; then for every " > 0; there is > 0 such that for x 2 .a ; b/; 0 < jx
x ! x0
x0j < )
Conversely, if f .x 0 / D L D f .x 0 C/; then for every " > 0; there is 1 > 0 such that for x 2 .a ; x 0 /;
0 < jx x 0 j < 1 ) j f .x / L j < " and there is 2 > 0 such that for x 2 .x 0 ; b/; 0 < jx x 0 j < 2 ) j f .x / L j < ":
As D min.1 ; 2 / 1 and 2 ; we have for x 2 .a ; b/; 0 < jx x 0 j < ) j f .x / L j < ": So lim f .x / D L :
x ! x0
8
>
<
increasing
f .x /
>
>
=
<
decreasing
f .x /
Definitions. A function f : S ! R is
on S iff for every x, y 2 S, x < y )
strictly
increasing
f
>
>
>
:
;
: .x / <
strictly
decreasing
f .x / >
monotone
increasing or decreasing
Also, f is
on S iff f is
on S ; respectively.
strictly monotone
strictly increasing or strictly decreasing
(
bounded above
For a nonempty subset S0 of S ; we say f is bounded below on S0 iff f f .x / : x 2 S0 g is
bounded
respectively. If The set S0 is not mentioned, then it is the domain S :
f . y/ >
=
f . y/
:
f . y/ >
;
f . y/
bounded above
bounded below
bounded
For monotone functions, the following theorem is analogous to the monotone sequence theorem.It will be used
dx
dy
D1
rule later.
in the next chapter to prove the continuous inverse theorem, which will be used to prove the
dy
dx
Also, it will be used again in the chapter on integration.
Monotone Function Theorem. If f is increasing on .a ; b/, then for every x 0 2 .a ; b/, f .x 0 / D supf f .x / : a <
x < x 0 g and f .x 0 C/ D inff f .x / : x 0 < x < bg and f .x 0 / f .x 0 / f .x 0 C/. If f is bounded below, then
f .a C/ D inff f .x / : a < x < bg: If f is bounded above, then f .b / D supf f .x / : a < x < bg: Also f has countably
many discontinuous points on .a ; b/; i.e. J D fx 0 : x 0 2 .a ; b/; f .x 0 / 6D f .x 0 C/g is countable. (The theorem is
similarly true for decreasing functions and all other kinds of intervals.)
Proof. If a < x < x 0 < b, then f .x / f .x 0 /. So M D supf f .x / : a < x < x 0 g f .x 0 /: By the supremum
property, for every " > 0; there is c 2 .a ; x 0 / such that M " < f .c/ M : If we let D x 0 c; then
8x 2 .a ; x 0 /; 0
< jx
x0j < ) c D x0
) j f .x /
Mj M
So lim f .x / D M f .x 0 /. Similarly, f .x 0 / limC f .x / D inff f .x / : x 0 < x < bg. In the case f is bounded
x ! x0
x ! x0
q (x1)
q(x 0 )
x0
x1
Definitions. (1) A sequence fx n g diverges to C1 (or has limit C1) iff for every r 2 R; there is K 2 N (depending on
r) such that n K implies x n > r: Similarly, a sequence fx n g diverges to 1 (or has limit 1) iff for every r 2 R;
there is K 2 N (depending on r) such that n K implies x n < r:
(2) A function f : S ! R diverges to C1 (or has limit C1) as x tends to x 0 in S iff for every r 2 R; there is
2 S ; 0 < jx
x 0 j < implies f .x / > r: Similarly, a function
f : S ! R diverges to 1 (or has limit 1) as x tends to x 0 in S iff for every r 2 R; there is > 0 (depending on r
and x 0 ) such that for every x 2 S ; 0 < jx x 0 j < implies f .x / < r:
Limit at infinity for functions are defined similarly as for sequences as follow.
Definitions. (1) Let f : S ! R be a function such that C1 is an accumulation point of S (i.e. there is a sequence
in S diverges to C1:) We say f .x / converges to L (or has limit L) as x tends to C1 in S iff for every " > 0; there
is K 2 R such that for every x 2 S ; x K implies j f .x / L j < ": Similarly, let f : S ! R be a function such
that 1 is an accumulation point of S (i.e. there is a sequence in S diverges to 1:) We say f .x / converges to L
(or has limit L) as x tends to 1 in S iff for every " > 0; there is K 2 R such that for every x 2 S ; x K implies
j f .x / L j < ":
(2) Let f : S ! R be a function such that C1 is an accumulation point of S (i.e. there is a sequence in S
diverges to C1:) We say f .x / diverges to C1 (or has limit C1) as x tends to C1 in S iff for every r 2 R; there is
K 2 R such that for every x 2 S ; x K implies f .x / > r: Similarly, let f : S ! R be a function such that 1 is
an accumulation point of S (i.e. there is a sequence in S diverges to 1:) We say f .x / diverges to C1 (or has limit
C1) as x tends to 1 in S iff for every r 2 R; there is K 2 R such that for every x 2 S ; x K implies f .x / > r:
By replacing f .x / > r with f .x / < r; we get the definitions of limit equal to 1 as x tends to 1 in S :
It is good exercises for the readers to formulate the computation formulas and properties for these limits, which
can be proved by checking these definitions just like the finite cases.
35
Chapter 7. Continuity
Definitions. A function f : S ! R is continuous at x 0 2 S iff lim f .x / D f .x 0 /; i.e. for every " > 0, there is > 0
x ! x0
x 2S
n!1
n!1
x ! x0
x ! x0
x ! x0
So f C g is continous at x 0 by definition. The subtraction, multiplication and division cases are similar.
Theorem. If f : S ! R is continuous at x 0 , f . S / S 0; g : S 0 ! R is continuous at f .x 0 /, then g B f is continuous
at x 0 .
Proof. By the sequential continuity theorem, all we need to show is that lim .g f /.x n / D .g f /.x 0 / for every
n!1
sequence fx n g converging to x 0 : Since f is continuous at x 0 , by the sequential continuity theorem, the limit of f .x n /
is f .x 0 /: Since g is continuous at f .x 0 /; so lim g . f .x n // D g . lim f .x n // D g . f .x 0 //:
n!1
n!1
Define g .x / D y0
f .x / on [a ; b]. Since g .x 0 / > 0, by the sign preserving property, there is x 1 > x 0 such that
g .x 1 / > 0: Then f .x 1 / < y0 . So x 0 < x 1 2 S ; which contradicts x 0 D sup S. Therefore, f .x 0 / D y0 .
Examples. (1) The equation x 5 C 3x C sin x D cos x C 10 has a solution. To see this, let f .x / D x 5 C 3x C sin x
cos x 10; then f .0/ D 11 and 26 f .2/ 30: Since f is continuous, the intermediate value theorem implies
f .x / D 0 for some x 2 .0; 2/:
36
(2) Suppose p.x / D x n C a1 x n 1 C C an with n odd. Let x 0 D 1 C ja1 j C C jan j 1; then we have
p.x 0 / D x 0n C a1 x 0n 1 C C an and p. x 0 / D x 0n C a1 x 0n 1 C an : So x 0n p.x 0 / D a1 x 0n 1 an
and x 0n C p. x 0 / D a1 x 0n 1 C an : By the triangle inequality,
x 0n p.x 0 /
x 0n C p. x 0 /
Then p.x 0 / > 0 and p. x 0 / < 0: By the intermediate value theorem, there is a root of p.x / between
x 0 and x 0 :
x0
w0
Proof. We first show f .[a ; b]/ D f f .x / : x 2 [a ; b]g is bounded above. Assume it is not bounded above. Then each
n 2 N is not an upper bound. So there is z n 2 [a ; b] such that f .z n / > n : By the BolzanoWeierstrass theorem, fz n g
in [a ; b] has a subsequence fz n j g converging to some z 0 2 [a ; b]: Since f is continuous at z 0 ; lim f .z n j / D f .z 0 /;
j !1
which implies f f .z n j /g is bounded by the boundedness theorem. However, f .z n j / > n j j implies f f .z n j /g is not
bounded, a contradiction.
By the completeness axiom, M D supf f .x / : x 2 [a ; b]g exists. By the supremum limit theorem, there is a
sequence fx n g in [a ; b] such that lim f .x n / D M. By the BolzanoWeierstrass theorem, fx n g has a subsequence fx nk g
n!1
such that lim x nk D x 0 in [a ; b]. Since f is continuous at x 0 2 [a ; b], M D lim f .x nk / D f .x 0 / by the subsequence
k !1
k !1
dx
D1
dy
dy
rule in the next chapter.
dx
Continuous
Injection Theorem. If f is continuous and injective on [a ; b], then f is strictly monotone on [a ; b] and
f [a ; b] D [ f .a /; f .b/] or [ f .b/; f .a /]. (This is true for any nonempty interval in place of [a ; b]: The range is an
interval with f .a /; f .b/ as endpoints.)
Proof. Since f is injective, either f .a / < f .b/ or f .a / > f .b/. Suppose
f (y)
f .a / < f .b/. Let y 2 .a ; b/. Then f . y / cannot be greater than f .b/, otherwise
by the intermediate value theorem, there is w 2 .a ; y / such that f .w/ D f .b/,
contradicting injectivity. Similarly, f . y / cannot be less than f .a /. Therefore,
f (b)
f .a / < f . y / < f .b/. If a x < y b, then similarly f .a / f .x / <
f (a)
f . y / f .b/, i.e. f is strictly increasing on [a ; b] and f [a ; b] D [ f .a /; f .b/]
by the intermediate value theorem.
a
y
b
The case f .a / > f .b/ leads to f strictly decreasing on [a ; b].
n!1
n!1
. y0C/ D f 1. y0 /. So f
x 2[a ;b]
a/
Z b
f .x / d x M .b
a /:
Here we will mention that there is a version of the extreme value theorem for continuous functions defined on
closed disks of finite radius on the plane. As an application of this fact, we can sketch a proof of the fundamental
theorem of algebra, which asserts that every nonconstant polynomial with complex coefficients must have a root.
Let p.z / D z n C a1 z n
jz n j D p.z /
n
X
k D1
So for jz j large, 1
ak z n k j p.z /j C
n
X
k D1
n
X
k D1
jak jjz jn k ) j p .z /j jz jn
1
jak jjz j k : For a very large K
2
j p .z /j jz jn 1
n
X
k D1
>
p
n
jak jjz j k
n
X
k D1
jak jjz jn k D jz jn 1

n
X
k D1
jak jjz j k
{z
!1 as jzj!1
1 n
1
jz j > K n > m :
2
2
Let D K be the closed disk fz : jz j K g: We have m D inffj p.z /j : z 2 C g D inffj p.z /j : z 2 D K g D j p.z 0 /j for some
z 0 2 D K by the extreme value theorem, since j p.z /j is continuous on D K :
We claim m D j p.z 0 /j D 0: Suppose m 6D 0: Then f .z / D p.z C z 0 /= p.z 0 / is a polynomial of degree n and
f .0/ D 1: So f .z / D 1 C b1 z C C bn z n for some b1 ; : : : ; bn with bn 6D 0: Let k be the smallest positive integer such
that bk 6D 0: Then f .z / D 1 C bk z k C C bn z n : Since j p.z C z 0 /j m D j p.z 0 /j; we get ./ j f .z /j 1 for all z :
Introduce the notation ei D cos C i sin ; which describes the points on the unit circle. Since the absolute value
of jbk j=bk is 1, so jbk j=bk D ei for some : Let D = k ; then eik bk D e i bk D jbk j: Considering w D rei
with r < jbk j 1= k .) 1 r k jbk j > 0/; we have j1 C bk wk j D j1 C bk r k eik j D 1 r k jbk j D 1 r k jbk j and
j f .w/j D j1 C bk wk C C bn wn j j1 C bk wk j C jbkC1 wkC1 j C C jbn wn j
D1
D1
38
{z
Chapter 8. Differentiation
Definitions. Let S be an interval of positive length. A function f : S ! R is differentiable at x 0 2 S iff f 0 .x 0 / D
f .x / f .x 0 /
lim
exists in R. Also, f is differentiable iff f is differentiable at every element of S :
x ! x0
x x0
x 2S
lim f .x / D lim
x ! x0
x ! x0
f .x /
x
f .x 0 /
.x
x0
x 0 / C f .x 0 / D f 0 .x 0 / 0 C f .x 0 / D f .x 0 /:
x ! x0
lim
x ! x0
.f
g /.x /
.f
x0
. f g /.x /
x
x ! x0
D lim
x ! x0
x0
f
g
. /.x /
lim
. f g /.x 0 /
g /.x 0 /
f
g
x ! x0
f .x /
x
. /.x 0 /
f .x 0 /
g .x /
x0
x
f .x 0 /
g .x /
g .x / C f .x 0 /
x0
x
g .x 0 /
D f 0 .x 0 / g 0.x 0 /;
x0
g .x 0 /
D f 0 .x 0 /g .x 0 / C f .x 0 /g 0 .x 0 /;
x0
x0
D lim
f .x /
x
1
f .x / f .x 0 /
g .x 0 /
x ! x0 g . x / g . x 0 /
x x0
f 0 .x 0 /g .x 0 / f .x 0 /g 0 .x 0 /
:
g .x 0 /2
lim
g .x /
x
g .x 0 /
f .x 0 /
x0
lim h . y / D g 0. f .x 0 // D h . f .x 0 //. So g . y /
y ! f . x0 /
g . f .x 0 // D h . y /. y
f .x 0 // holds
x ! x0
g B f .x /
x
g B f .x 0 /
f .x /
D lim h . f .x //
x
!
x
0
x0
x
f .x 0 /
D h . f .x 0 // f 0 .x 0 / D g 0. f .x 0 // f 0 .x 0 /:
x0
Remarks. Note f differentiable at x 0 does not imply f 0 is continuous at x 0 : In fact, the function f .x / D x 2 sin 1x for
1
x 6D 0 and f .0/ D lim x 2 sin D 0 is continuous and differentiable with f 0 .x / D 2x sin 1x cos 1x for x 6D 0 and
x !0
x
1
1
1
2
0
f .0/ D lim .x sin
0/=x D 0: However, f 0 is not continuous at 0 because lim f 0 .x / D lim 2x sin
cos does
x !0
x !0
x !0
x
x
x
1
2
0
not exist, hence not equal to f .0/: In particular, f is not twice differentiable. (Also, the function g .x / D x sin 2
x
for x 6D 0 and g .0/ D 0 is differentiable on R; but g 0.x / is not continuous at 0 and g 0.x / is unbounded on every open
interval containing 0.)
39
Notations. C 0 . S / D C . S / is the set of all continuous functions on S : For n 2 N; C n . S / is the set of all functions
f : S ! R such that the nth derivative f .n/ is continuous on S. C 1 . S / is the set of all functions having nth derivatives
for all n 2 N. Functions in C 1 . S / are said to be continuously differentiable on S :
Inverse Function Theorem. If f is continuous and injective on .a ; b/
and f 0 .x 0 / 6D 0 for some x 0 2 .a ; b/, then f 1
dx
1
dy
is differentiable at y0 D f .x 0 / and . f 1 /0 . y0 / D 0
, i.e.
D1
.
f .x 0 /
dy
dx
8
x x0
>
if x 6D x 0
<
1
f .x / f .x 0 /
Proof. The function g .x / D
D g .x 0 /:
is continuous at x 0 because lim g .x / D 0
1
x ! x0
>
f .x 0 /
:
if
x
D
x
0
f 0 .x 0 /
Since f is continuous and injective on .a ; b/; f 1 is continuous by the continuous inverse theorem. So lim f 1 . y / D
f
. y/
y
f 1 . y0 /
D lim g f
y ! y0
y0
y ! y0
1
1
. y / D g .x 0 / D 0
:
f .x 0 /
then f 0 .x 0 / D 0:
x ! x0
f .x /
x
x 2.a ;b /
f .x 0 /
f .x /
D f 0 .x 0 / D lim
x0
x
x ! x0
f .x 0 /
0: So f 0 .x 0 / D 0:
x0
w0
x 2[a ;b]
x0
x0
x 2[a ;b]
w0 is in .a ; b/: By the last theorem, f 0 .x 0 / D 0 or f 0 .w0 / D 0:
Examples. (1) For a < b; show j sin b sin a j jb a j: (By the meanvalue theorem, there is x 0 2 .a ; b/ such that
sin b sin a D .cos x 0 /.b a /; so j sin b sin a j jb a j:)
(2) Show .1 C x / 1 C x for x 1 and 1: (Let f .x / D .1 C x /
x > 0 or x 0 2 .x ; 0/ if 1 < x < 0 such that
. 1 C x /
(3) Show ln x x
that
D f .x /
f .0/ D f 0 .x 0 /.x
x C 1 D f .x / D f .x /
x ; then there is x 0
0/ D ..1 C x 0 /
2 .0; x / if
1/x 0:/
f 0 .x 0 /.x
1/ D
1
x0
1 .x
1/ 0:
>
>
>
>
>
:
f0
f0
f0
f0
f0
f0
0>
>
>
0>
>
>
=
0
< 0>
>
>
6 0>
D
>
;
8
9
increasing
>
>
>
>
>
strictly increasing >
>
>
>
>
<
=
decreasing
on .a ; b/; respectively.
0
constant
Proof. If x, y 8
2 .a ; b / and x < y, then by the mean value theorem, there is x 0 2 .x ; y / such that f . y /
9
8
9
f .x / f . y / >
> 0>
>
>
>
>
>
>
>
>
f .x / < f . y / >
>
>
>
>> 0>
>
>
>
<
=
<
=
0
f .x / f . y /
0
f .x 0 /. y x /
. Therefore,
:
< 0>
f .x / > f . y / >
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
: 6D 0 >
;
: f .x / 6D f . y / >
;
D0
f .x / D f . y /
f .x / D
Local Tracing Theorem. If f : [a ; b] ! R is continuous and f 0 .c/ > 0 for some c 2 [a ; b]; then there are c0 ; c1 2 R
such that c0 < c < c1 and f .x / < f .c/ < f . y / for all x 2 .c0 ; c/ \ [a ; b] and all y 2 .c; c1 / \ [a ; b]: A similar result
for the case f 0 .c/ < 0 and the inequality becomes f .x / > f .c/ > f . y /:
Proof. Let f 0 .c/ > 0: Assume there is no such c0 : Then for every n 2 N; there is x n 2 .c n1 ; c/ \ [a ; b] such that
f .x n / f .c/
f .x n / f .c/: This leads to f 0 .c/ D lim
0; a contradiction. The other parts of the theorem are
n!1
xn c
similar.
1
Remarks. If f 0 .c/ 0; we may not have f .x / f .c/ f . y / similar to above as the function f .x / D x 2 sin with
x
f .0/ D 0 satisfies f 0 .0/ D 0; but f takes positive and negative values on every open interval about 0.
Exercise. A function f : [a ; b] ! R is said to have the intermediate value property iff for every y0 in the open interval
with endpoints f .a / and f .b/; there exists at least one x 0 2 .a ; b/ such that f .x 0 / D y0 : We have already showed
that continuous functions on [a ; b] satisfied this property. Prove that if g is differentiable on [a ; b]; then g 0 has the
intermediate value property. In particular, if g 0.x / 6D 0 for all x 2 [a ; b]; then g 0 > 0 or g 0 < 0 everywhere on [a ; b]:
Next we will introduce the generalized meanvalue theorem, which has two very important applications, namely
Taylors theorem and LHopitals rule.
Generalized MeanValue Theorem. Let f , g be continuous on [a ; b] and differentiable on .a ; b/. Then there is
x 0 2 .a ; b/ such that g 0.x 0 /. f .b/ f .a // D f 0 .x 0 /.g .b/ g .a //. (Note the case g .x / D x is the meanvalue theorem.)
Proof. Let F .x / D f .x /.g .b/ g .a // . f .b/ f .a //.g .x / g .a //, then F .a / D f .a /.g .b/ g .a // D F .b/. By
Rolles theorem, there is x 0 2 .a ; b/ such that 0 D F 0 .x 0 / D f 0 .x 0 /.g .b/ g .a // g 0.x 0 /. f .b/ f .a //:
Taylors Theorem. Let f : .a ; b/ ! R be n times differentiable on .a ; b/. For every x, c 2 .a ; b/, there is x 0 between
x and c such that
f . x / D f .c / C
f 0 .c/
.x
1!
c/ C
f 00.c/
.x
2!
c/2 C : : : C
f .n 1/.c/
.x
.n 1/!
c/n
f .n / . x 0 /
.x
n!
Proof. Let I be the closed interval with endpoints x and c. For t 2 I , define g .t / D .n
where f .0/ D f ; .x
.x
t /n
n
41
: We have g 0.t /
f .n / . x 0 /
.x
n!
c/n :
D f .n/ .t /.x
f .k/ .t /
.x
k!
k D0
n 1
X
t /n
t /k ;
and p0 .t / D
.x t /n 1 : By the generalized mean value theorem, there is x 0 between x and c such that
p0 .x 0 / [ g .x /
 {z }
{z}
.x x0 /n 1 .n 1/! f .x /
g .c/]. Then f .x / D
g .c/
f .n/ .x 0 /
C
.x
.n 1/!
n!
c/n D
f .k/ .c/
.x
k!
k D0
n 1
X
g 0.x 0 /
[ p.x /
p.c/] D
 {z }

{z
}
.x c /n = n
f .n/ . x0 /. x x0 /n 1
f .n / . x /
c/k C
n!
.x
c/n :
Lemma. Let h : .a ; b/ ! [0; C1/ be a bounded function, where a may be real or 1 and b may be real or
C1: We have lim h .x / D 0 if and only if lim supfh .t / : a < t < x g D 0: Similarly, lim h .x / D 0 if and only if
C
C
x !a
x !a
x !b
x !b
Proof. For right hand limits at a ; limC h .x / D 0 is the same as for every " > 0; there exists r 2 R such that
x !a
for all a < x < r implies h .x / D jh .x / 0j < ": The later part is the same as for all a < x < r implies
supfh .t / : a < t < x g "; which is limC supfh .t / : a < t < x g D 0: The statement for the left hand limits at b is
x !a
similar.
LHopitals Rule ( 00 Version). Let f , g be differentiable on .a ; b/ and g .x /; g 0.x / 6D 0 for all x 2 .a ; b/; where
1 a < b C1: If
f 0.x /
(a) limC 0
D L ; where
x !a g . x /
1 L C1; and
then limC
x !a
x !a
f .x /
D L : (Similarly, the rule is also true if x ! b :)
g .x /
n f 0 t /
o
f .x /
.
Taking limit of y ! a C on both sides, we get
sup 0
: a < t < x : By condition (a) and the lemma,
g .x /
g .t /
the right side goes to 0. So by the sandwich theorem, we get the left side go to 0, which is the conclusion.
For f 0 =g 0 ! L D C1; there is r 2 R such that a < t < r implies f 0 .t /=g 0.t / > 1 so that f 0 and g 0 are both
f .x / f . y /
f 0 .t /
positive or both negative when x 2 .a ; r /: Next for a < y < x < r; we have
D 0
> 1: As y ! a C;
g .x / g . y /
g .t /
f .x /
we see
1: So f and g are both positive or both negative when x 2 .a ; r /: Now g 0= f 0 ! 0; g ! 0 and f ! 0
g .x /
as x ! a C: So by above, g = f ! 0: Hence f =g ! C1: The cases L D 1 and x ! b are similar.
f 0 .x /
f .x /
Example. (Even if lim f .x / D 0 D lim g .x / and lim 0
does not exist, lim
may still exist as the following
x !a
x !a
x !a g . x /
x !a g . x /
1
1
example will show.) Let f .x / D x 2 sin , g .x / D sin x, a D 0, then x 2 x 2 sin x 2 implies lim f .x / D 0
x !0
x
x
2x sin 1x cos 1x
0 cos 1x
f 0 .x /
by sandwich theorem, lim g .x / D 0, lim 0
D lim
D lim
does not exist. However,
x !0
x !0 g . x /
x !0
x !0
cos x
1
f .x /
x
1
lim
D lim
.x sin / D 1 0 D 0.
x !0 g . x /
x !0 sin x
x
f 0.x /
(a) limC 0
D L ; where
x !a g . x /
1 L C1; and
(b) limC g .x / D C1
x !a
then limC
x !a
f .x /
D L : (Similarly, the rule is also true if x ! b or g .x / !
g .x /
1).
Proof. We will modify the proof above as follow. If L 2 R; then we can reduce to L D 0 as above. In the case
f 0 =g 0 ! L D C1; for x ; s 2 .a ; b/; by generalized meanvalue theorem, there is t between x and s such that
f 0 .t /
f .x / D f .s / C 0 .g .x / g .s // ! C1 as x ! a C by (a) and (b). So we may replace f =g by g = f to may assume
g .t /
g . y /
g .x /
L D 0: Multiplying the left and right sides of (*) by
; we get for a < y < x < c;
g . y/
n 0
o
f .x / f . y /
g . y /
f .t /
g .x /
sup 0
: a < t < x
:
g . y/
g .t /
g . y/

{z
! L D0 as x ! a C by lemma
} 
{z
! 1 as y ! a C
n f 0 .t /
o
f .x /
"
For every " > 0; there is x 2 .a ; b/ such that sup 0 : a < t < x < : Also, limC
D 0: Then there is
y !a g . y /
g .t /
4
g . y/
f .x / "
g .x /
r < x such that for all y 2 .a ; r /; we can get
and
<
< 2. Then
g . y/
2
g . y/
f . y / f .x / f . y / f .x / "
"
C 2 D ":
C
<
g . y/
g . y/
g . y/
2 4
1; x ! b
and g .x / !
1 are similar.
f 0 .x /
f .x /
does not exist, lim
may still exist as the fol0
x !a
x !a
x !a g . x /
x !a g . x /
lowing example will show.) Let f .x / D x C sin x, g .x / D x sin x, a D C1, then lim f .x / D C1 D lim g .x /,
Examples. (1) (Even if lim f .x / D C1 D lim g .x / and lim
x !C1
x !C1
f 0 .x /
1 C cos x
f .x /
1 C .sin x /=x
lim 0
D lim
does not exist. However, lim
D lim
D 1:
x !C1 g . x /
x !C1 1
x
!C1
x
!C1
cos x
g .x /
1 .sin x /=x
xr
D 0 for every r 2 R:
x !C1 e x
Solution. There is an integer n jr j (by the Archimedian principle). We have x r x n on [1; C1/: So 0
on [1; 1/: Since
xr
xn
ex
ex
dn n
n!
xn
x
D
n!
and
lim
D
0
;
applying
LH
o
pitals
rule
n
times,
we
see
lim
D 0; which
x !C1 e x
x !C1 e x
dx n
xr
D 0 by the sandwich theorem.
x !C1 e x
implies lim
(3) Let f : .a ; C1/ ! R be differentiable. Show that lim f 0.x / C f .x / D 0 if and only if lim f .x / D 0 and
x !C1
x !C1
lim f 0 .x / D 0: (This type of result is often needed in the studies of differential equations. Here if lim g .x / D 0;
x !C1
dy
then every solution y D f .x / of the equation
C y D g .x / will have limit 0 as x ! C1:)
dx
x !C1
Solution. The if part follows by the computation formulas for limit. For the only if part, consider f .x / D
0
f .x /e x
: Note
ex
f .x /e x
the denominator on the right side tend to C1 as x tend to C1: Since lim
D lim f 0 .x / C f .x / D 0;
x !C1
x !C1
.e x /0
f .x /e x
by LHopitals rule, we get lim f .x / D lim
D 0 and lim f 0 .x / D lim f 0 .x / C f .x /
f . x / D 0:
x
x !C1
x !C1
x
!C1
x
!C1
e
43
f (b)
t /b t f .a / C .1
t / f .b/:
t /b t f .a / C .1
t / f .b/:
f (a)
.1
a
ta+(1 t ) b
convex function
(b, f (b))
(a, f ( a ))
(x, f (x))
a
f .x /
x
f .a /
f .b/
a
b
f .x /
b
() f .x /
x
b
x
x
f .a / C
a
b
a
f .b/ () f t a C .1 t /b t f .a / C .1 t / f .b/:
a
f .x 0 / f .u /
f .v/ f .x 0 /
x0 u
v x0
f .w/ f .v/
x 0 / C f .x 0 / f .v/
.v x 0/ C f .x 0 /:
Proof. For x 0 2 .a ; b/, consider u, v , w 2 .a ; b/ such that u < x 0 < v < w. Then
f .w/
f .u /
.v
u
w v
C
Taking limit as v ! x 0 , we have f .x 0 / f .x 0 C/ f .x 0 /, i.e. f .x 0 C/ D f .x 0 /. Similarly, we can show
f .x 0 / D f .x 0 / by taking u < v < x 0 < w: Therefore, lim f .x / D f .x 0 / for every x 0 2 .a ; b/.
f .v/
f .x 0 /
x0
x ! x0
0 if 0 x < 1
Example. The function f .x / D
is convex on [0; 1] by checking the slopes of the chords over [0; 1],
1 if x D 1
but f is not continuous at 1 because lim f .x / D 0 6D 1 D f .1/.
x !1
Remark. The proof of the last theorem uses the fact that on an open interval, at any point x 0 , there are points on its
left and points on its right, which is not true for endpoints of a closed interval.
Example.
Prove
thatpif a ; b 0 and 0 < r < 1; then jar
p
p
n
n
have j a
bj n ja bj:)
b r j ja
a = x0 x1 x2 . . .
xn  1 xn = b
(Note K m j f .t j / M j K implies
U . f ; P / K .b a /: )
n
X
j D1
K .b
n
X
k Pk!0 j D1
M j 1x j :
a / L . f; P / S
(1) As the choices of the t j s may vary, it is hard to say how close the Riemann sum is to the actual integral. In
particular, it is not clear if the Riemann sum is greater than or less than the integral at any time.
(2) The type of limit involved is not the limit of a sequence nor the limit of a function. In fact, there are many variables
in a Riemann sum!
Instead of dealing with these technicalities, we introduce integral following the approach of J. Gaston Darboux in 1875.
Definition. We say P 0 is a refinement of P or P 0 is finer than P iff P and P 0 are partitions of [a ; b] and P P 0 :
Refinement Theorem. If P 0 is a finer partition of [a ; b] than P, then L . f ; P / L . f ; P 0 / U . f ; P 0 / U . f ; P /.
Proof. P 0 can be obtained from P by adding one point at a time. It suffices to consider
the case P 0 D P [ fwg with w 62 P D fx 0 ; x 1 ; : : : ; x n g. Suppose x j 1 < w < x j :
wj
xj  1
xj
Observe that L . f ; P / underestimates the area under the curve; U . f ; P / overestimates the area under the
curve.
Definitions. The lower integral of f on [a ; b] is
.L /
Z b
.U /
Z b
Rb
Rb
U( f, P)  L ( f, P)
= sum of areas
of shaded regions
Rb
Proof. If for every " > 0; there is a partition P of [a ; b] such that U . f ; P / L . f ; P / < ", then 0 .U / a f .x / d x
R
R
R
. L / ab f .x / dx U . f; P / L . f; P / < ": By the infinitesimal principle, we get . L / ab f .x / d x D .U / ab f .x / d x ;
i.e. f is (Riemann) integrable on [a ; b]:
Conversely, if f is (Riemann) integrable on [a ; b]; then for every " > 0; by the supremum property, we have
R
R
. L / a f .x / dx "=2 < L . f; P1 / . L / ab f .x / d x for some partition P1 of [a ; b]: Similarly, .U / ab f .x / d x
Rb
U . f ; P2 / < .U / a f .x / dx C "=2 for some partition P2 of [a ; b]: Let P D P1 [ P2 ; then by the refinement
Rb
theorem, L . f ; P1 / L . f ; P / U . f ; P / U . f ; P2 /: Since U . f ; P2 / L . f ; P1 / < [.U / a f .x / d x C "=2]
Rb
[. L / a f .x / d x "=2] D "; so U . f ; P / L . f ; P / U . f ; P2 / L . f ; P1 / < ":
Rb
1 if x 2 Q
is not continuous anywhere. Partitioning an interval [a ; b] into
0 if x 62 Q
subintervals [x j 1; x j ], we get by the density of rational numbers and irrational numbers that m j D 0 and M j D 1: Then
Example. Recall the function f .x / D
L . f ; P / D 0 and U . f ; P / D b
.L /
Z b
f .x / d x D c.b
a / D .U /
Z b
Z b
f .x / d x D 0, .U /
Z b
f .x / d x D b
a.
Z b
f .x / dx D c.b
a /:
Uniform Continuity Theorem. If f : [a ; b] ! R is continuous, then f is uniformly continuous (in the sense that for
every " > 0; there exists a > 0 such that for all x ; t 2 [a ; b]; jx t j < implies j f .x / f .t /j < ":)
Proof. Suppose f is not uniform continuous. Then there is an " > 0 such that for every D n1 ; n 2 N; there are
x n ; tn 2 [a ; b] such that jx n tn j < D n1 and j f .x n / f .tn /j ": By the BolzanoWeierstrass theorem, fx n g has
1
a subsequence fx n j g converging to some w 2 [a ; b]: Since jtn j wj jtn j x n j j C jx n j wj
C jx n j
wj; by
nj
the sandwich theorem, ftn j g converges to w: Then 0 D j f .w/ f .w/j D lim j f .x n j / f .tn j /j " > 0; which is a
j !1
contradiction.
Examples. For 2 .0; 1]; a function f : S ! R is Holder continuous of order iff f staisfies the condition that
there exists constant M > 0 such that for all x ; y 2 S ; j f .x /
f . y /j M jx y j : In case D 1; f is said to
be Lipschitz. The constant M is called the Lipschitz constant or Holder constant for f : All functions with
bounded
p
derivatives
(such
as
cos
x
with
M
D 1) are Lipschitz by the meanvalue theorem. The function f .x / D x satisfies
p
p
p
j x
y j jx y j on [0; C1/ is Holder continuous of order 12 : All Holder functions are uniformly continuous,
since for every " > 0; we can take D ."= m /1= :
Theorem. If f is continuous on [a ; b], then f is integrable on [a ; b].
Proof. For " > 0, since f is uniformly continuous on [a ; b], there is > 0 such that x, w 2 [a ; b], jx wj < )
f .w/j < "=.b a /. Let P D fa D x 0 ; x 1 ; : : : ; x n D bg be a partition of [a ; b] with max jx j x j 1 j < . By
j f .x /
1 j n
46
L . f; P / D
n
X
j D1
"
f .w j /
f .u j / 1x j <
n
X
a j D1
.x j
xj
/D
".x n
b
x0/
D ":
a
1
X
1
[ .an ; bn / and
jan
nD1
n D1
bn j < " .
(ii) We say a property holds almost everywhere iff the property holds except on a set of measure 0. (It is common to
abbreviate almost everywhere by a.e. in advanced courses. In probability, almost surely is used instead of almost
everywhere.)
Remarks. For example, it is known that monotone functions on intervals are differentiable almost everywhere (see
H.L. Roydens book, Real Analysis, 3rd ed., p. 100). Also, H. Rademacher proved that Lipschitz functions on intervals
are differentiable almost everwhere (see L.C. Evans book, Partial Differential Equations, p. 281).
Lebesgues Theorem(1902). For a bounded function f : [a ; b] ! R; f is integrable on [a ; b] if and only if the set
S f D fx 2 [a ; b]: f is discontinuous at x g is of measure 0 (i.e. f is continuous almost everywhere).
For a proof of Lebesgues theorem, please go to appendix 1 of this chapter.
1
nD1
1
X
nD1
j0
"
fx 1 ; x 2 ; x 3 ; : : :g .x 1
"
; x 1 C / [ .x 2
4
"
"
"
"
; x2 C
2
/ [ .x 3
2
; x3 C
3
/ [ and
3
1
X
2"
2"
D
< ":
n
4
3
nD1
So every monotone function on [a ; b] is integrable on [a ; b]; since the set of discontinuities S is countable, hence
of measure 0.
(3) There exist uncountable sets, which are of measure 0 (eg. the Cantor set).
(4) A countable union of sets of measure 0 is of measure 0. (If S1 ; S2; S3 ; : : : are of measure 0 and S is their union,
1
nD1
then for every " > 0; since Sk is of measure 0, there are intervals .ak;n ; bk;n / such that Sk [ .ak;n ; bk;n / and
1
X
1 X
1
1 "
X
X
1 1
"
[ [ .ak;n ; bk;n / and
jak;n
bk;n j <
D
< ":)
k
k D1 nD1
4
4
3
nD1
k D1 nD1
k D1
(5) If a set S is of measure 0 and S 0 S ; then S 0 is also of measure 0. (For S 0; use the same intervals .an ; bn / for S :)
n
1 if x D r1 or r2 or : : : or rn
(6) Arrange Q \ [0; 1] in a sequence r ; r ; r ; : : : and define f .x / D
: Then f .x /
jak;n
bk;n j <
"
: Then S
k
otherwise
is integrable on [0; 1]; since the set of discontinuities S f n D fr1 ; r2 ; : : : ; rn g is finite, hence of measure 0. Now
47
1 if x 2 Q
is not integrable on [0; 1] since Sf D fx 2 [0; 1] : f is discontinuous at x g D
0 if x 62 Q
[0; 1]; which is not of measure 0. So the limit of a sequence of Riemann integrable functions may not be Riemann
integrable.
lim fn .x / D f .x / D
n!1
Proof. If f and g are integrable on [a ; b]; then f and g are bounded on [a ; b]: So f C g ; f
on [a ; b]:
Observe that if f and g are continuous at x ; then f C g is continuous at x : Taking contrapositive, we see that if
f C g is discontinuous at x ; then f or g is discontinuous at x : So if x 2 S f Cg ; then x 2 S f or x 2 Sg ; which implies
S f Cg S f [ Sg : Since f ; g are integrable on [a ; b]; by Lebesgues theorem, S f ; Sg are of measure 0. By example
(4), S f [ Sg is of measure 0. By example (5), S f Cg is also of measure 0. Therefore, by Lebesgues theorem f C g is
integrable on [a ; b]: Using a similar argument, we can see that f g ; f g are integrable on [a ; b]:
Remarks. By a similar argument, we can show that if f : [a ; b] ! R is integrable on [a ; b] and g is bounded and
continuous on f .[a ; b]/; then Sg f S f : (This is because if f is continuous at x ; then g f is continuous at x : Taking
contrapositive, we get if x 2 Sg f ; then x 2 S f : So Sg f S f :) Since S f is of measure 0, by example (5), Sg f is
of measure 0. So g f : [a ; b] ! R is integrable on [a ; b]: In particular, if f is integrable on [a ; b]; then taking
g .x / D jx j; x 2 ; e x ; cos x ; : : : ; respectively, we get j f j; f 2 ; e f ; cos f ; : : : are integrable on [a ; b]:
However, even if f : [a ; b] ! [c; d] is integrable on [a ; b] and g : [c; d] ! R is integrable on [c; d]; g f may
not be integrable on [a ; b]: (For example, define f : [0; 1] ! [0; 1] by f .0/ D 1; f .m = n / D 1= n ; where m ; n are
positive integers with no common prime factors, and f .x / D 0 for every x 2 [0; 1] n Q: Next, define g : [0; 1] ! [0; 1]
by g .0/ D 0 and g .x / D 1 for every x 2 .0; 1]: As an exercise, it can be showed that S f D [0; 1] \ Q and Sg D f0g: So
f and g are integrable on [0; 1]: However, g f is the nonintegrable function that is 1 on [0; 1] \ Q and 0 on [0; 1] n Q:)
There is even an example of a continuous function f : [0; 1] ! [0; 1] and an integrable function g : [0; 1] ! R
such that g f is not integrable (see B. R. Gelbaum and J. M. H. Olmstads book Counterexample in Analysis,
pp. 106107).
Up to now, we have been trying to determine which functions are integrable. Below we will look at how the
integrals of functions can be computed.
Theorem (Simple Properties of Riemann Integrals). Let f and g be integrable on [a ; b]:
Z b
(1)
f .x / g .x / dx D
Z b
f .x /dx
(3)
f .x / dx D
Z c
f .x / dx C
Z b
Z b
a
Z b
g .x /dx ;
Z b
c f .x / d x D c
f .x / d x
Z b
Z b
a
f .x / d x for every c 2 R.
Z b
g .x / dx. Also,
f .x / d x
Z b
j f .x /j d x.
f .x / dx for c 2 [a ; b]:
Proof. To get (1), by the supremum and infimum properties, for every " > 0; there is a partition P of [a ; b] such that
Z b
a
f .x / dx C
Z b
g .x / dx
" < L . f ; P / C L .g ; P / L . f
C g; P/
Z b
a
48
f .x / C g .x / dx
U . f C g ; P / U . f ; P / C U .g ; P /
Z b
f .x / C g .x / dx D
inf. S / D
sup S ; we get
Z b
f .x / dx D
Z b
f .x /
g .x / dx D
f .x / d x C
Z b
g .x / d x C ":
g .x / dx : Next, from U .
f; P / D
L . f ; P / and
f .x / d x : Then
f .x / C . g .x // d x D
Z b
f .x / d x C
Z b
g .x / dx D
Z b
Z b
Z b
f .x / dx
0 f .x / dx D 0 D 0
Z b
Z b
Z b
f .x / dx C
Z b
Z ab
Z b
<
Z b
g .x / d x :
f .x / dx : If c > 0; then
Z b
f .x /dx :
If c < 0; then
Z b
c f .x / dx D
Z b
. c/ f .x / dx
Z b
. c/
f .x / dx D supf L .g
f .x / d x D c
f 0 on [a ; b] implies L .g
g .x /
. c/ f .x / dx
Z b
Z b
f .x / d x :
Z b
f .x / d x
Z b
j f j f j f j on [a ; b]; we get
Z b
j f .x /j d x
Z b
g .x / d x :
f .x / dx
Z b
j f .x /j d x :
For (3), let P be a partition of [a ; b]; P 0 D P [ fcg; P1 D P 0 \ [a ; c] and P2 D P 0 \ [c; b]: Then P 0 is a finer
partition of [a ; b] than P ; P1 is a partition of [a ; c]; P2 is a partition of [c; b] and L . f ; P 0 / D L . f ; P1 / C L . f ; P2 /: Let
a
Since P 0 is also a partition of [a ; b]; we see B A and so sup B sup A: By the refinement theorem, L . f ; P /
L . f ; P 0 / sup B : Hence sup A sup B : Therefore, sup A D sup B and
Z b
a
f .x / dx D sup A D sup B
D supf L . f ; P1 / C L . f ; P2 /: P1 ; P2 are partitions of [a ; c]; [c; b]; respectivelyg
D supf L . f ; P1 /: P1 is a partition of [a ; c]g C supf L . f ; P2 /: P2 is a partition of [c; b]g
Z c
f .x / dx C
Z b
f .x / dx :
The most important tool for computing an integral is to find an antiderivative or primitive function of the integrable
function, which is a function whose derivative is the integrable function. What can we say about such a function?
Example. For x 2 [ 1; 1]; define f .x / D
1
1
Z x
if x 0
: Since f .x / has only one point of discontinuity at 0, f .x /
if x < 0
f .t / dt D
49
x
x
if x 0
D jx j
if x < 0
is continuous on [ 1; 1]; hence uniformly continuous there by the uniform continuity theorem, but F .x / is not
differentiable at 0, the same point where f .x / is discontinuous!
Theorem. If f is integrable on [a ; b] and c 2 [a ; b]; then F .x / D
Z x
Proof. Recall there is K > 0 such that j f .t /j K for every t 2 [a ; b]: For every " > 0; let D K" : Then jx
Z
x
implies j F .x / F .x 0 /j D
f .t / dt K jx x 0 j < ":
x0j <
x0
The next theorem is the most important theorem in calculus. It not only tells us how to compute an integral,
but also the deep fact that differentiation
and integration
inverse operations on functions. Roughly, it may be
Z x
Z are
x
x
d
d
summarized by the formulas
h .t / dt D h .t / :
h .t / dt D h .x / and
c
dx c
c dt
Fundamental Theorem of Calculus. Let c; x 0 2 [a ; b]:
(1) If f is integrable on [a ; b], continuous at x 0 2 [a ; b] and F .x / D
Z x
c
f .t / dt , then F 0 .x 0 / D f .x 0 /.
Z b
g .x / dx D G .b/
G .a /.
x ! x0
F .x /
x
F .x 0 /
x0
R
x
f .x 0 / D c
f .t /dt
x
R x0
c
f .t /dt
Rx
x0
R x
x0 . f .t /
D
x
f .x 0 /dt
x0
x0
Z b
(2) The conclusion will follow from the infinitesimal principle if we can show
R x
x0 "=2 dt
x
x0
f .x 0 //dt
x0
g .x / d x
G .b/
< ":
G .a / < "
for every " > 0: Now for every " > 0; since g is integrable on [a ; b]; by the integral criterion, there is a partition
P D fa D x 0 ; x 1 ; : : : ; x n D bg such that U .g ; P / L .g ; P / < ": For j D 1; 2; : : : ; n ; by the mean value theorem,
there exists t j 2 .x j 1 ; x j / such that G .x j / G .x j 1 / D G 0 .t j /.x j x j 1/ D g .t j /1x j : Then
L .g ; P /
Also, L .g ; P /
Z b
n
X
j D1
g .ti /1x j D
n
X
j D1
g .x / dx U .g ; P /: Then
.G .x j /
Z b
G .x j
g .x / d x
// D G .b/
G .b/
G .a / U .g ; P /:
G .a / U .g ; P /
L .g ; P / < ":
Remarks. In (2) above, the condition G 0 is integrable is important. The function G .x / D x 2 sin
1
for x 6D 0 and
x2
0
G .0/ D 0 is differentiable on R; but G .x / is unbounded on [0; 1]; hence not integrable there. In Y. Katznelson and
K. Strombergs paper Everywhere Differentiable, Nowhere Monotone Functions, American Mathematical Monthly,
vol. 81, pp. 349354, there is even an example of a differentiable function on R such that its derivative is bounded, but
not Riemann integrable on any interval [a ; b] with a < b:
Theorem (Integration by Parts). If f , g are differentiable on [a ; b] with f 0, g 0 integrable on [a ; b], then
Z b
f .x /g 0 .x / dx D f .b/g .b/
f .a /g .a /
Z b
a
50
f 0 .x /g .x / dx :
Z b
continuous on [a ; b] , then
Proof. Let g .x / D
f .x / 0 .x /: So
Z .x /
Z b
.a /
Z .b /
.a /
f .t / dt D
Z b
f .x / 0 .x / dx :
f .t / dt : By part (1) of the fundamental theorem of calculus and chain rule, g 0.x / D
f .x / 0.x / dx D
Z b
g 0.x / d x D g .b/
g .a / D g .b/ D
Z .b /
.a /
f .t / dt :
1
j D1
t j < implies j f .x / f .t /j < ":
Lemma. Let f : [a ; b] ! R be a function continuous on a subset K D [a ; b] n [ . j ; j /: Then for every " > 0;
there exists a > 0 such that for all x 2 K ; t 2 [a ; b]; jx
Proof. Suppose the lemma is false. Then there is an " > 0 such that for every D n1 ; n 2 N; there are x n 2 K ; tn 2 [a ; b]
f .tn /j ": By the BolzanoWeierstrass theorem, fx n g has a subsequence
such that jx n tn j < D n1 and j f .x n /
fx n j g converging to some w 2 [a ; b]: Since
jtn j
w j jt n j
x n j j C jx n j
wj
1
C jx n j
nj
wj;
1
j D1
f .w/j D lim j f .x n j /
j !1
which is a contradiction.
Proof of Lebesgues Theorem. First suppose f : [a ; b] ! R is integrable. Note that if f is discontinuous at x ; then
there is an " > 0 such that for every > 0; there is z 2 .x ; x C / \ [a ; b] such that j f .x / f .z /j ": Let Dk be the
1
set of all x 2 [a ; b] such that for every open interval I with x 2 I ; there is z 2 I \ [a ; b] such that j f .x / f .z /j > :
k
1
Since every positive " > for some positive integer k by the Archimedian principle and every open interval I with x 2 I
k
1
contains an interval .x ; x C / for some > 0; it follows that S f D fx 2 [a ; b] : f is discontinuous at x g D [ Dk :
k D1
For every " > 0; by the integral criterion, there is a partition P D fx 0 ; x 1 ; : : : ; x n g of [a ; b] such that
"
1
: If there is x 2 Dk \ .x j 1; x j /; then M j m j j f .x / f .z /j > for some z 2
U . f; P / L . f; P / <
2k
k
.x j 1; x j /: Let J be the set of j such that Dk \ .x j 1; x j / 6D ;: Then Dk n fx 0 ; x 1; : : : ; x n g [ .x j 1; x j / and
X
j2J
jx j 1
xjj
X
j2J
k . Mj

m j / 1x j k U . f ; P /
{z
>1= k
L . f; P / <
51
"
j2J
"
"
; where N is an upper
1
bound for j f .x /j on [a ; b]: By the definition of measure 0, there are intervals .i ; i / such that S f [ .i ; i /
i D1
1
X
1
and
ji
i j < "0: Then f is continuous on K D [a ; b] n [ .i ; i /: Now take the in the lemma for "0 and
i D1
i D1
a partition P D fx 0 ; x 1 ; : : : ; x n g such that jx j 1 x j j < for j D 1; 2; : : : ; n : If K \ [x j 1 ; x j ] D ;; then
1
[x j 1; x j ] [ .i ; i /: If there is x 2 K \ [x j 1; x j ]; then M j m j D supfj f .t0 /
f .t1 /j : t0 ; t1 2 [x j 1 ; x j ]g
i D1
supfj f .t0 / f .x /j C j f .x / f .t1 /j : t0 ; t1 2 [x j 1; x j ]g 2"0 : So
U . f; P /
L . f; P / D
. M j m j / 1x j C
{z
}

K \[x j
1 ; x j ]D;
2N
K \[x j
3. N C b
. M j m j / 1x j
{z
}
2"0
;x j ]6D; 
a/
2N "0 C 2"0 .b
a / < ":
we have j f .x /
L j < ": Based on this, Riemanns approach of integral can be defined as follow.
n
X
k Pk!0 j D1
> 0 such that for every partition P of [a ; b] with k P k < and every choice t j
have
X
n
j D1
f .t j /1x j
2 [x j 1; x j ]; j D 1; 2; : : : ; n ; we
Below we will show Darbouxs approach is the same as Riemanns by establishing the following theorem.
Darbouxs Theorem. Let f be a bounded function on [a ; b]: Then the following are equivalent:
Z b
(a)
f .x / dx D I I
(b) lim
n
X
k Pk!0 j D1
f .t j /1x j D I I
(c) for every " > 0; there is a partition P of [a ; b] such that for every refinement Q D fx 0 ; x 1 ; : : : ; x n g of P ; every
choice t j 2 [x j
X
n
; x j ]; we have
limit.)
Proof. .a / ) .b/ Suppose
j D1
Z b
f .t j /1x j
f .x / dx D I : For every " > 0; by the proof of the integral criterion, there is a
"
"
< L . f; P" / U . f; P" / < I C : Let D
; where
2
2
4q K
K D supfj f .x /j : x 2 [a ; b]g: If P D fx 0 ; x 1 ; : : : ; x n g is a partition of [a ; b] with k P k < ; then U . f ; P / D S1 C S2 ;
a
"
where S1 is the sum of the terms from intervals not containing points in P" and S2 the sum of the remaining terms.
"
Note the rectangles for the terms of S1 are inside the rectangles for U . f ; P" /: So we have S1 < U . f ; P" / < I C :
2
Since P" D fw0 ; w1 ; : : : ; wq g; S2 has at most 2q terms (one for w0 ; wq each and at most two for w1 ; : : : ; wq 1
52
each). Then S2 2q . K k P k/ 2q K D
I
" < L . f; P /
n
X
j D1
"
2
: Thus U . f; P / D S1 C S2 < I
X
n
f .t j /1x j
j D1
C ": Similarly, L . f ; P /
> I
": So
< ":
.b/ ) .c/ For every " > 0; take as the definition above. Let P be any partition of [a ; b] with k P k < : Then for
every refinement Q of P ; we have k Q k k P k < and so (c) follows from the conclusion of (b).
"
.c/ ) .a / For " > 0; let P be the partition in (c) for : For each j D 1; 2; : : : ; n ; by the supremum limit theorem, there
3
n
X
"
are sequences t j ;k such that lim f .t j ;k / D M j D supf f .x / : x 2 [x j 1; x j ]g: Since
f .t j ;k /1x j I < ; so taking
k !1
3
j D1
"
"
2"
< ":
limit, we get jU . f ; P / I j : Similarly, we can also get j L . f ; P / I j : Then jU . f ; P / L . f ; P /j
3
Z b
Z b
f .x / d x D lim
Z d
d !b
exists in R; and we say f is improper integrable on [a ; b/ in that case. For f locally integrable on an interval of the
form .a ; b]; where a is real or 1 and b is real, the definitions of the improper (Riemann) integral of f on .a ; b] and
f is improper (Riemann) integrable on .a ; b] are similar.
Case 2: (Unbounded near both endpoints) Let f be locally integrable on .a ; b/; with a ; b real or infinity, and x 0 2 .a ; b/.
We define the improper (Riemann) integral of f on .a ; b/ to be
Z b
a
f .x / d x D limC
c !a
Z x0
f .x / d x C lim
d !b
Z d
f .x / d x
x0
provide both limits exist in R; and say f is improper integrable on .a ; b/ in that case. (Note the integral is the same
regardless of the choices of x 0 2 .a ; b/.)
Case 3: (Unbounded inside interval) Let f be improper integrable on intervals [a ; c/ and .c; b]: The improper integral
of f on [a ; b] is the sum of the improper integrals on the two intervals. The cases where a or b is excluded are similarly
defined.
In each case, if the improper integral is a number, then we say the improper integral converges to the number,
otherwise we say it diverges.
Examples.(1) Consider the unbounded function f .x / D ln x on .0; 1]. Observe that f is continuous, hence integrable,
on every closed subinterval of .0; 1]: So f 2 L loc .0; 1]: Now limC
c !0
Z 1
ln x dx D
53
Z 1
c
ln x d x D limC. 1
c !0
c ln c C c/ D
1, so
1
on the unbounded interval [2; C1/. Observe that f 2 L loc[2; C1/ because of continuity.
x2
Z d
Z 1
1
1
1 1
1
1
1
Now lim
dx
D lim
C
D , so
dx D and 2 is improper integrable on [2; C1/:
2
2
d !C1 2 x
d !C1
d
2
2
x
2
x
2
(3) Consider f .x / D e x on R D . 1; C1/: Since f is continuous everywhere, f 2 L loc. 1; C1/: Now take a
(2) Consider f .x / D
Z 0
e x d x D lim .1
c!
ec / D 1; but lim
d !C1 0
Z d
e x d x D lim .ed
d !C1
1/
Remarks. By taking limits, many properties of Riemann integrals extend to improper Riemann integrals as well.
There are also some helpful tests to determine if a function is improper integrable.
ptest. For 0 < a < 1; we have
1 1
xp
Z a
0
1 1
xp
1
d x < 1 if and only if p < 1:
xp
Z 1
a
1
d x < 1; we
xp
1
1=c
1
1
1
get the first statement. Next, by the change of variable y D ; we have
d
x
D
dy : Taking limit as
p
2 p
x
x
y
c
1
Z 1
Z 1
1
1
c ! 0C; we see that
d x < 1 if and only if
d y < 1: By the first statement, this is the same as
p
2
y p
0 x
1
Z a
1
d x < 1; we get the second statement.
2 p > 1; i.e. p < 1: Again adding
p
1 x
g .x / dx : So
Z b
f .x / d x D lim
Z d
d !b
Z d
f .x / dx is an increasing
g .x /
is a
x !a C f . x /
Z b
Z b
g .x /
positive number L ; then either (both
f .x / d x and
g .x / dx converge) or (both diverge). If lim
D 0;
x
!
a
C
f .x /
a
Z b
Z ab
Z b
g .x /
then
f .x / dx converges implies
g .x / dx converges. If lim
D 1; then
f .x / dx diverges implies
x
!
a
C
f .x /
a
a
Z b a
g .x /
g .x / dx diverges. In the case [a ; b/; we take lim
and the results are similar.
x
!
b
f .x /
a
Theorem (Limit Comparison Test). Suppose f .x /; g .x / > 0 on .a ; b] and f ; g 2 L loc..a ; b]/: If lim
g .x /
L
is a positive number L ; then for " D > 0; there is > 0 such that for every x 2 .a ; a C /; we
x !a C f . x /
2
Z
Z a C
Z
L
g .x /
3L
L a C
3L a C
have
DL
"<
< L C " D : Then
f .x / dx
g .x / dx
f .x / dx : So either
2
f .x /
2
2 a
2 a
a
Proof. If lim
Z b
(both
f .x / dx and
If lim
x !a C
Z b
g .x /
g .x /
D 0; then there exists 0 > 0 such that for every x 2 .a ; a C 0 /; we have 0 <
< 1; which
f .x /
f .x /
Z a C 0
a
g .x / dx
Z a C0
a
f .x / d x : So
Z b
a
54
f .x / d x < 1 )
Z b
a
g .x / d x < 1:
g .x /
g .x /
D 1; then there is 00 > 0 such that for every x 2 .a ; a C 00/; we have
> 1; which implies
x !a C f . x /
f .x /
If lim
g .x / > f .x /: Hence
Z a C00
g .x / dx
Z a C00
f .x / d x : So
Z b
f .x / dx D 1 )
Z b
g .x / dx D 1:
Theorem (Absolute Convergence Test). If f 2 L loc. I / and j f j is improper integrable on I , then f is improper
integrable on I .
Proof. We have j f j f j f j on I ; which implies 0 f C j f j 2j f j on I : By the comparison test, f C j f j is
improper integrable on I : Therefore, f D . f C j f j/ j f j is improper integrable on I :
ln x
improper integrable on .0; 1]? Observe first that the function is locally integrable on .0; 1]
1 C x2
ln x
j ln x j on .0; 1]: Since j ln x j D
ln x is improper integrable on .0; 1] (cf.
by continuity. Also,
2
1
C
x
ln x
ln x
is improper integrable on .0; 1] by the comparison test. Then
example (1)), so
is improper
2
1Cx
1 C x2
integrable on .0; 1] by the absolute convergence test.
Z C1
1
1
dx
1
1
p
converge? Observe that on [2; C1/; 0 <
p
: Both and p 2
are
(5) Does
2
2
x
x
x
1
x
1
x
1
2
Z C1
1
continuous, hence locally integrable, on [2; C1/: Now
d x D 1 by ptest. By the comparison test,
x
2
Z C1
dx
p
diverges.
x2 1
2
Z C1
sin x
sin x
(6) Does
dx converge? Since
is continuous on [1; C1/; it is locally integrable there. Integrating
x
x
1
by parts,
Z c
Z c
sin x
cos c
cos x
dx D
C cos 1
dx:
x
c
x2
1
1
Examples. (4) Is
cos c
1
cos x
D 0: Since 2 2 on [1; C1/ and
c !C1 c
x
x
C1 cos x
x2
1
converges.
Z
1
C1 1
x2
dx converges by the comparison test and the absolute convergence test. Therefore,
1
Z 1
dx
dx
; the integrand is continuous (hence locally integrable) on [0; 1/: Observe that
1 x3
1
D
and the second factor on the right has a positive limit as x ! 1 : More precisely,
1 x3
1 x 1 C x C x2
Z 1
Z d
1=.1 x /
dx
dx
2
since lim
D lim .1 C x C x / D 3 and
D lim
D lim
ln.1 d / D 1;
3
x !1 1=.1
d !1
d !1
x / x !1
x
x
0 1
0 1
Z 1
dx
by the limit comparison test,
diverges.
1
x3
0
C1 sin x
Z 5
dx
p
3
55
c !C1
1 1 C x2
1
1
Z 0
dx D lim
c!
Z d
1
1 C x2
d !C1 0
x dx D lim
c!
f .x / d x D lim
1
1 1
dx
1 1 C x2
1
dx D lim . tan
c! 1
1 C x2
dx C lim
Z 0
exist.
f .x / dx is P:V:
1
1
Z d
d !C1 0
c !C1
f .x / d x .
Z c
D lim
c !C1
c/ C lim .tan
d !C1
1
1 C x2
dx
d / D :
Z c
x d x D lim
x dx C lim
c
Z c
1
1
c !C1
c !C1
c2
d2
x d x D lim .
/ C lim . / does not
c! 1
d !C1 2
2
1
1
1
1
Z c
f .x / dx D lim
c !C1
Z 0
c !C1
Z 0
D lim
d!
f .x / dx D lim
f .x / dx C lim
f .x / dx and lim
f .x / dx C
Z c
0
f .x / dx D
Z c
f .x / d x
c !C1 0
c !C1 0
Z 0
f .x / dx
1
1
f .x / dx :
Definition. For a ; b 2 R or 1; let f : [a ; c/ [ .c; b] ! R be locally integrable on [a ; c/ and on .c; b]: Define
P:V:
Z b
a
f .x / dx D limC
" !0
Z c "
f .x / dx C
Z b
c C"
Z 1
Example. Consider the improper sense and the principal value sense of
1
f .x / dx :
1
dx :
x
Z 1
1
dx D limC
c !0
x
0
D lim . ln c/ does not exist. So the improper integral on [ 1; 0/ [ .0; 1] does not exist. However,
C
Because of continuity,
1
x
Z 1
c
1
dx
x
c !0
P:V:
Z 1
1
1
dx D limC
"!0
x
Z
"
1
1
1
1
dx C
dx
x
x
"
D lim .ln j
"!0C
"j
ln j"j/ D 0:
Z 1
1
dx D ln j 1j ln j1j D 0; which attempts to use part (2) of the fundamental
1 x
theorem of calculus, but here f .x / D ln jx j is not differentiable on [ 1; 1] failing the required condition.
Remarks. (1) It is incorrect to say
(2) There is a similar theorem for this type of principal value integrals as the theorem above.
56
f . x / D f .c / C
f 00.c/
.x
2!
c/ C
f .n 1/.c/
.x
.n 1/!
c/2 C : : : C
c/n
f .n / . x 0 /
.x
n!
f .n / . x 0 /
.x
n!
c/n :
Proof. Note
d
dt
f .x /
.x
C Rn .x /;
where Rn .x / D
f .c / D
Z x
f 0 .t / 1 dt D
.n
1/!
.x t /n
f .n/ .t / dt :
1 times, we get
0
.x
t / dt
D f 0 .c/.x
D
f 0 .t /
Z x
x
t / C
.x
f 0 .t /.x
Z x
Z x
c/ C
f 0 .c/.x
t / f 00.t / dt
f 00.t /
c/ C C
t /2 x
.x
2!
f .n 1/ .c/
.n
1/!
.x
1
2!
Z x
c/
n 1
t /2 f 000 .t / dt D
.x
.n
Z b
f .x /g .x / d x D f .x 1 /
Z b
1
b
Z
a
b
Z x
1
1/!
Z b
.x
t /n
f .n/ .t / dt :
f .x / d x D f .x 1 /.b
a / for some
Proof. The first statement is the special case of the second statement when g .x / D 1: So we only need to prove the
second statement. Let M and m be the maximum and the minimum of f on [a ; b]; respectively. Since m f .x / M
on [a ; b]; we have m
Z b
implies
Z b
a
Z b
g .x / dx
Z b
f .x /g .x / dx M
Z b
a
g .x / d x : If
Z b
g .x / dx ; we see that
Z b
a
f .x /g .x / dx
,Z
Z b
a
b
this expression equals f .x 1 / for some x 1 2 [a ; b]; which gives the second statement.
57
Theorem (Taylors Formula with Cauchy Form Remainder). Let f be n times differentiable on .a ; b/: For
x ; c 2 .a ; b/; if f .n/ is continuous on the closed interval with endpoints x and c; then there is x 1 between x and c such
that
f . x / D f .c / C
f 0 .c/
.x
1!
c/ C C
f .n 1/ .c/
.x
.n 1/!
1/n
C Rn .x /;
.x
where Rn .x / D
c/.x
x 1 /n 1 f .n/ .x 1 /
:
.n 1/!
Proof. This follows by applying the mean value theorem for integrals to the integral remainder of Taylors formula
above.
Remarks. For every x 2 R; the series
D lim
k !1
jx j
kC1
D0
1 xk
X
k D0
k!
Examples.
x k C1 k!
lim
k !1 .k C 1/! x k
D 0 for every x 2 R:
1 . 1/k x 2kC1
X
x7
C D
7!
.2k C 1/!
k D0
x3
x5
C
3!
5!
sin x D x
jx j18
.=2/18
Remarks. For 0 x ; j R18 .x /j
< 6 10
2
18!
18!
compute sin x to 10 decimal places.
for
13
: So x
x3
x 17
C C
can be used to
3!
17!
x2
x4
C
2!
4!
1 . 1/k x 2k
X
x6
C D
6!
.2k /!
k D0
for
(3) For f .x / D e x , f .n/ .x / D e x : Taking c D 0; we have f .n/ .0/ D 1 for every n 2 N: By Taylors theorem,
n 1 k
X
x
e x0 n
max.e0 ; e x / n
ex D
C Rn .x / for every x 2 R: Now j Rn .x /j D
jx j
jx j ! 0 as n ! 1 by the
k!
n!
n!
k D0
remarks above. So
ex D 1 C x C
1 xk
X
x2
x3
C
C D
2!
3!
k!
k D0
for
Remarks. The Taylor series for sin x ; cos x and e x also converge if x is a complex number! In fact, this is how
the sine, cosine, and exponential functions are defined for complex numbers. For every x 2 R; we have
eix D
1
X
k D0
.ix /k
k!
1
X
. 1/n x 2n
.2n /!
nD0
Ci
58
1
X
. 1/n x 2nC1
.2n C 1/!
nD0
D cos x C i sin x :
.1 C x /a
D 1 C ax C
a .a 1/ 2 a .a
x C
2!
1/.a
3!
2/
Z x
.n
1/!
.x
t /n
f .n/ .t / dt D
x3 C D 1 C
1/ .a
a .a
1
X
a .a
1/ .a
k!
k D1
n C 1/.1 C x /a
1/ .a n C 1/
.n 1/!
xk:
Z x
x
0
k C 1/
t n 1
.1 C t /a
1Ct
dt :
x t
1 x
has derivative g 0.t / D
< 0: On [0; x]; g .t / g .0/ D x : Let
1Ct
.1 C t /2
Z x
n 1
ja .a 1/ .a n C 1/kx
j
bnC1
ja n jjx j
kD
.1 C t /a 1 dt ; then j Rn .x /j
: Since nlim
D lim
D
!1 bn
n!1
.n 1/!
n
0
For x 2 [0; 1/; the function g .t / D
jx j
1
X
nD1
{z
call this bn
n!1
theorem. So the binomial formula is true for x 2 [0; 1/: The case x 2 . 1; 0] is similar.
Here are a few more common Taylor series. (Note the series only equal the functions on a small interval.) They
1
are obtained from the cases a D 1; a D 1 (with x replaced by x 2 ) and a D
(with x replaced by x 2 ) of the
2
binomial theorem by termbyterm integration.
ln.1 C x / D x
tan
sin
xDxC
xDx
x2
x3
C
2
3
x3
x5
C
3
5
1 . 1/k 1 x k
X
x4
C D
4
k
k D1
for
1<x 1
1 . 1/k x 2kC1
X
x7
C D
7
2k C 1
k D0
for
1x 1
1 1 3 5 .2k 1/ x 2kC1
X
1 x3
1 3 x5
C
C D x C
2 3
24 5
2 4 6 .2k / 2k C 1
k D1
for
1x1
Remarks. Unfortunately, the Taylorseries of a function does not always equal to the function away from the center.
1= x 2
if x 6D 0 can be shown to be infinitely differentiable and f .n/ .0/ D 0
For example, the function f .x / D e
0
if x D 0
for every n 2 N: So the Taylor series of f .x / about c D 0 is
1
X
k D0
59
1)
j < :
x !0
(d) If x C bx C c D 0; then x D
2
bC
x !0
b2
4c
or x D
b2
2
4c
.a ; b / Q
Does
D fx : x 2 Q and a
2 Q and a x
< bg:
1
[
1 1
[
1
[ ; 2/ Q D
. ; 2/ Q ?
n
n
nD1
n D1
0 if x > 0
and g .x / D 1
1 if x 0
injective or surjective. Compute f g and g f :
15. (i) Let f : A ! B be a function. Show that if there is a function g : B ! A such that g f D I A and f g D I B ;
then f is a bijection. (Comment: Such a g is f 1 :)
(ii) Show that if f : A ! B and h : B ! C are bijections, then h f : A ! C is a bijection.
16. Let A; B be subsets of R and f : A ! B be a function. If for every b 2 B ; the horizontal line y D b intersects
the graph of f at most once, then show that f is injective. If at most once is replaced by at least once, what
can be said about f ?
For each of the sets in exercises 17 to 26, determine if it is countable or uncountable:
17. intervals .a ; b/ and [a ; b], where we assume a < bI
18. Q .R n Q/I
19. A D f
1
1
C m : n ; m 2 ZgI
2n
3
20. B D fx C
2y : x ; y 2 NgI
*29. From K 0 D [0; 1]; remove the middle thirds to get K 1 D [0; 1] n . 31 ; 23 / D [0; 13 ] [ [ 23 ; 1]: Then remove the middle
thirds of the 2 subintervals of K 1 to get K 2 D [0; 19 ] [ [ 29 ; 13 ] [ [ 23 ; 79 ] [ [ 89 ; 1]: Inductively, remove the middle
thirds of the 2n subintervals of K n to get K nC1 : The set K D K 0 \ K 1 \ K 2 \ K 3 \ is called the Cantor set.
Prove that K is uncountable.
(Hint: Consider base 3 representations, i.e. representations of the form
.:a1 a2 a3 : : :/3
a1
a2 a3
C 2 C 3 C ;
3
3
3
where each ai D 0; 1 or 2. What do the base 3 representations of numbers in K n have in common? Note some
numbers have 2 representations, e.g. 13 D .:1000 : : :/3 and .:0222 : : :/3 :)
30. For each of the following series, determine if it converges or diverges.
1
k D1
1
k
1
1
(c) 6 ln 1 C
k
k D1
1 ln k
k D2 k
1
k D1
1
k .k C 1/.k C 2/
(term test)
(b) 6 p
(find sum)
1 1 1
(d) 6
C
k
k D1 2
k
1 cos 2k
k D1
k2
(e) 6
(f) 6
1 kC2 2 k
k D1 k C 1
3
1
k2
(i) 6 ke
k D1
1 Arctan k
(k) 6 2
k D1 k C 1
1
k C1
(m) 6 tank
k D1
k
1
1
(o) 6 k 2 sin p
(depends on p)
k
k D1
1 cos k
p
k D1
k
1
k
(j) 6
k D1 .k C 1/!
1 1
(l) 6
(compare with a pseries)
1
k D1 k 1C k
1
1
(n) 6 1 cos
(compare with a pseries)
k D1
k
p
p
1
(p) 6 . 1/kC1 . k C 1
k/
k D1
(g) 6
(h) 6
1
k D1
1
k D1
31. Let a1 a2 a3 : : : 0: Prove that 6 ak converges if and only if 6 2k a2k converges. (This is called
k D3
1
converges.
k ln k ln.ln k /
k
2
3
4
D C 2 C 3 C converges and find the sum. (Hint: Compare the same series with
2k 1
2 2
2
index from 1 to 1:)
k D2
(Probabilistic interpretation: the sum is the expected number of births to get babies of both sex. The probability
2
1
of the kth birth finally resulted in babies of both sex is k D k 1 :)
2
2
1 1
diverges. (Hint:
k D1 pk
1 1
1
Suppose it converges to s : Then the partial sum sn has limit s ; as n ! 1: So for some n ; s sn D 6
< : Let
p
2
k DnC1 k
N
1
1
1
1 j
Q D p1 p2 pn : Show, by considering the prime factorization of 1 C m Q ; that 6
6
6
m D1 1 C m Q
j D1 k DnC1 pk
for every positive integer N ; which will lead to a contradiction.)
62
For exercises 34 to 36, use definitions, Archimedean principle, density of rationals, density of irrationals, etc. to
support your reasonings.
34. For each of the following sets, if it is bounded above, give an upper bound and find its supremum with proof. If
it is bounded below, give a lower bound and find its infimum with proof.
p
p
1
(a) A D f m C n : m ; n 2 Ng
(b) B D . 1; ] [ 4
:n2N
n
(c) C D
1
1
C m : m; n 2 N
n
2
(d) D D Q \ .0;
2]
35. Let A and B be nonempty subsets of R; which are bounded above. Let
S D f x y : x 2 A; y 2 B g
and
T D fx
y : x 2 A; y 2 B g:
Must S or T be bounded above? Give a proof if you think the answer is yes or give a counterexample if you
think the answer is no.
36. Let A and B be nonempty subsets of R; which are bounded above. Let
C D fx C y : x 2 A; y 2 B g:
Show that C is bounded above and sup C D sup A C sup B : (Hint: If sup C < sup A C sup B ; then consider
" D .sup A C sup B sup C /=2: Apply supremum property to get a contradiction.)
4n C 5
37. Let wn D
; then fwn g should converge to 0. For a given " > 0; show there is a positive integer K such
n3
that if n K ; then jwn 0j < ": If " D 0:1; give one such positive integer K :
[x] C [2x] C C [nx]
: Show that fan g converges to
n2
(Here [y] is the greatest integer less than or equal to y :)
x
2
39. Show that if x is a real number, then there is a sequence of rational numbers converging to x :
40. If lim an D A; then show that lim jan j D j Aj: (Hint: Show jx j
n!1
n!1
converse true?
an C anC1
41. If fan g converges to A; then
2
should converge to
AC A
D A: Prove this by checking the definition.
2
4.1 C x n /
for n D 1; 2; 3; : : : : Plot the first 3 terms on the real line. Then prove the
4 C xn
j y j jx
1C
1 n o
is increasing and bounded above.
n
44. Let fx n g be a bounded sequence in R; Mn D supfx n ; x nC1 ; x nC2 ; : : :g and m n D inffx n ; x nC1 ; x nC2 ; : : :g for n 2 N:
(a) Prove that both sequence f Mn g and fm n g converge. (The limit of Mn is called the limit superior of x n and is
denoted by limsup x n ; while the limit of m n is called the limit inferior of x n and is denoted by liminf x n :)
n!1
n!1
(b) Prove that lim x n D x if and only if lim Mn D x D lim m n (i.e. limsup x n D x D liminf x n ).
n!1
n!1
n!1
63
n!1
n!1
1
k D2
46. If 6 jx k
xn C xn
2
for n D 2; 3; 4; : : : : Plot the first 4 terms on the real line. Then prove
x k 1 j converges, then show the sequence fx n g is a Cauchy sequence by checking the definition of
Cauchy sequence.
p
47. If an 0 for all n 2 N and fan g is a Cauchy sequence, then show that f an g is also a Cauchy sequence by
checking the definition of Cauchy sequence.
48. Let 0 < k < 1: If jx nC1
x n j k jx n
a1 C a2 C C an
49. Prove that if fan g converges to A; then fn g converges to A; where n D
: Show that the
n
converse is false.
b1 C b2 C C bn
(Hint: Let bn D an A and n D
; then the first part of the problem becomes showing fn g
n
converges to 0. Here use fbn g converges to 0 and so jb K 0 j; jb K 0C1 j; : : : is small when K 0 is large. For n K 0 ;
write
b C b2 C C b K 0 1 b K 0 C C bn
n D 1
C
:/
n
n
50. If fx n g is bounded and all its convergent subsequences have the same limit x ; then prove that lim x n D x :
n!1
51. Let S D f2
an
/ D 0: Prove that lim an D 0:
n!1
2
x n 2 / D 0: Prove that lim
n!1
xn
xn
n
D 0:
55. For a sequence fan g of nonzero numbers, we say the infinite product
1
Y
nD1
has value L) if lim a1 a2 ak D L : We say it diverges if the limit is 0 or does not exist. Determine if each of the
k !1
following infinite products converges or diverges. Find the values of the infinite products that converge.
(a)
(c)
1
Y
n D2
2
n .n C 1/
1 n3
Y
1
3
n C1
n D2
(b)
(d)
1
Y
n D2
1
Y
n D0
1
n2
.1 C z 2 / for jz j < 1:
n
Remarks: In Apostols book, the following theorem is proved: In the case every an 0; we have
1
Y
n D1
.1
1
n D1
1
Y
nD1
.1 C an /;
an /; 6 an all converge or all diverge. Try to do the above exercises without using this theorem.
56. Prove that every bounded infinite subset of R has an accumulation point. (This is also often called the BolzanoWeierstrass theorem.)
64
8x
if x is rational,
2x 2 C 8 if x is irrational.
59. If f : R ! R is continuous and f .x / D 0 for every rational number x ; show that f .x / D 0 for all x :
60. (a) Find all functions f : Q ! R such that f .x C y / D f .x / C f . y / for all x ; y 2 Q:
(b) Find all strictly increasing functions f : R ! R such that f .x C y / D f .x / C f . y / for all x ; y 2 R:
61. For a function f : R ! R; we say f has a local (or relative) maximum at x 0 if there exists an open interval
.a ; b/ containing x 0 such that f .x / f .x 0 / for every x 2 .a ; b/: Similarly, we say f has a local (or relative)
minimum at x 1 if there exists an open interval .c; d / such that f .x / f .x 1 / for every x 2 .c; d /: If f : R ! R is
continuous and has a local maximum or a local minimum at every real number, show that f is a constant function.
62. If f .x / D x 3 ; then f . f .x // D x 9 : Is there a continuous function g : [ 1; 1] ! [ 1; 1] such that g .g .x // D
for all x 2 [ 1; 1]? (Hint: If such a function g exists, then it is injective.)
x9
63. A fixed point of a function f is a number w such that f .w/ D w: Show that if f : [0; 1] ! [0; 1] is continuous,
then f has at least one fixed point. (Hint: Consider g .x / D f .x / x :)
64. Let f : [0; 1] ! [0; 1] be an increasing function (perhaps discontinuous). Suppose 0 < f .0/ and f .1/ < 1;
show that f has at least one fixed point. (Hint: Sketch the graph of f and consider the set ft 2 [0; 1] : t < f .t /g.
Does it have a supremum?)
65. Let f : R ! R be a continuous function such that j f .x /
f . y /j jx y j for all x ; y 2 R: Show that f is
bijective. (Hint: Easy to show f is injective. To show f is surjective, let w 2 R and M D jw f .0/j, show that
w and f .0/ are between f . M / and f . M /:)
*66. Let f : [0; 1] ! .0; C1/ be continuous and M D supf f .x / : x 2 [0; 1]g: Show that
Z 1
f .x / d x
n
lim
n!1
n1
D M
if the limit exists. (Hint: M D f .x 0 /: For every k 2 N; use the sign preserving property to show that
f .x 0 / k1 f .x / M on an interval containing x 0 . Squeeze the integral.)
x2
x
if x D
6 0
and g .x / D j cos x j:
if x D 0
68. Let f : R ! R be differentiable at c and In D [an ; bn ] be such that I1 I2 I3 and \ [an ; bn ] D fcg:
f .bn /
Prove that if an < bn for all n 2 N; then f 0 .c/ D lim
n!1
bn
f .an /
:
an
nD1
69. Let f .x / D jx j3 for every x 2 R: Show that f 2 C 2 .R/: However, f 000 .0/ does not exist.
70. Let f : R ! R satisfies j f .a /
f .b/j ja bj2 for every a ; b 2 R: Show that f is a constant function. If
the exponent 2 in the inequality is replaced by a number greater than 1, must f be a constant function? If 2 is
replaced by 1, must f be a constant function?
65
72. Let f : [0; 1/ ! R be continuous and f .0/ D 0: If f 0 .x / f .x / for every x > 0; then show that f .x / 0 for
every x 2 [0; 1/: (Hint: What if f 0 .x / D f .x /?)
1
n
converges. Also, show lim f .x / exists. (Hint: Check fx n g is a Cauchy sequence. For the second part, consider
73. If f : .0; C1/ ! R is differentiable and j f 0 .x /j 2 for all x > 0; then show that the sequence x n D f
x !0 C
2
75. Let f : [0; 1/ ! R be continuous and f .0/ D 0: If j f 0 .x /j j f .x /j for every x > 0; show that f .x / D 0 for
every x 2 [0; 1/: (Hint: Let j f j has maximum value M on [0; 12 ]: Apply the mean value theorem to f on [0; 12 ]:)
76. Let f : R ! R be differentiable. If f 0 is differentiable at x 0 ; show that
f .x 0 C h / C f .x 0
h!0
h2
h/
lim
2
cos 1
2 f .x 0 /
2
D f 00 .x 0 /:
4
2
2
24
(Hint: Apply Taylors theorem to the four times differentiable function cos :)
78. Let f : .0; C1/ ! Rbe twice differentiable, M0 D supfj f .x /j : x > 0g < 1; M1 D supfj f 0 .x /j : x > 0g < 1
and M2 D supfj f 00.x /j : x > 0g < 1: Show that M12 4M0 M2 : (Hint: Let h > 0: Apply Taylors theorem to
f .x / with x D c C 2h ; then solve for f 0 .c/:)
79. (a) If f : .a ; b/ ! Ris differentiable and j f 0 .x /j 2 for all x 2 .a ; b/; then show that f is uniformly continuous.
(b) Show that f : .0; C1/ ! R defined by f .x / D sin
1
is not uniformly continuous.
x
80. (a) Prove that if the union of a collection of open intervals contains [a ; b]; then there are finitely many of these
intervals, whose union also contains [a ; b]: (Hint: Suppose this is false. Let m 1 D .a C b/=2: Then one of [a ; m 1 ]
or [m 1 ; b] is not contained in the union of finitely many of these open intervals. Proceed as in the proof of the
Bolzano Weierstrass theorem.)
(b) Give a proof of the uniform continuity theorem using part (a).
81. If f is continuous on [a ; b]; f .x / 0 for all x 2 [a ; b] and
Z b
x 2 [a ; b]:
82. Let f : [a ; d] be a bounded function and a b c d :
(i) Use the integral criterion to show that if f is integrable on [a ; b] and [b; c]; then f is integrable on [a ; c]:
(ii) Use the integral criterion to show that if f is integrable on [a ; d]; then f is integrable on [b; c]:
83. Let f : [a ; b] ! R be bounded and fx 2 [a ; b] : f is discontinuous at x g D fx 1 ; x 2 ; : : : ; x n g; where x 1 < x 2 <
< x n : Use the integral criterion to show that f is integrable on [a ; b]: (Hint: Divide [a ; b] into subintervals
where f is continuous except at one endpoint and note part (i) of problem above.)
66
. f .x / C g .x // d x
Z b
f .x / d x C
Z b
g .x / d x :
" < L . f ; P / C L .g ; P / L . f
1 dx
(a)
Z 1
(c)
0
Z 1
(e)
0
(b)
ex
sin x dx
0
Z 1
dx
(d)
x 2 C 5x
1 cos x
dx
x . x 1/
dx
x
p
3
(f)
0
1 C x2
dx
86. Find the principal value of each of the following integrals if it exists.
Z
(a) P.V.
Z 2
C1 x
2 dx
1 ex
(b) P.V.
0
87. Prove that for 0 < x < 1; the improper integral 0.x / D
dx
x2 1
t x 1e
k D1
89. For each of the following sets S, determine if it is countable or uncountable. Be sure to give reasons to support
your answer.
(a) S is the set of all intersection points .x ; y / of the line y D x with the graphs of all equations y D x 3 C x C m ;
where m 2 Z:
(b) S is the set of all intersection points .x ; y / of the graph of y D x 3 C x C 1 with all lines y D mx ; where
m 2 Z:
1
(c) S is the set of all intersection points .x ; y / of the circle x 2 C y 2 D 1 with all hyperbolas x y D ; where
m
m 2 N:
67
o
1
:n2N
2
no
1
1
: x 2 [0; 1] \ Q; n 2 N n 1;
n
2
o
: x 2 .R n Q/ \ [; 1/
(b) S D x C y : x ; y 2
n
1
;1
o
n 2
(c) S D x
nx
(d) S D
xC
nx
o
(e) S D
: x 2 Q \ [0; 1/
xC
(f) S D fx 3p
C y 3 : x 2 Q \ [0; 1]; y 2 . 1; 0]g
n
o
2
1
(g) S D
C p : m; n; k 2 N
m Cn
k 2
1
[
1
1
(h) S D
[1
;1
/
2k
1
2k
k D1
(i) S D
(j) S D
np
n1
x C y 2 : x ; y 2 .0; 1] \ Q
C x : x 2 [0; 1] \ Q; n D 1; 2; 3; : : :
n
(k) S D fx C y : x 2 [0; 1] \ Q; y 2 [0; 1] \ .R n Q/g
(l) S D fx 2 R : x .x C 1/ p
0 and x 2 R n Qg
(m) S D f n!k : k ; n 2 N; n!k < 2g
1
nQ
n
n 2
n D1
2
3
4
(o) S D fx C y C z : x 2 . 1; 0/ n Q; y 2 .0; 1/ \ Q; z 2 . 1; 1/g
(n) S D
10
[
;2
92. For each of the following sequences fx n g; show it converges and find its limit.
xn p
C x n for n D 1; 2; 3; : : : :
(a) x 1 D 1 and x nC1 D
2
p
p
(b) x 1 D 1; x 2 D 2 and x nC1 D x n C x n 1 for n D 2; 3; 4; :
2 xn
(c) x 1 D 1 and x nC1 D
for n D 1; 2; 3; : : : :
3 C xn
nx
o
p
nC1
(d) x 1 D 15
and
x
D
1
1
x
for
n
D
1
;
2
;
3
;
:
Also,
do
the
sequence
:
n
C
1
n
16
xn
a n C1
(e) x n D
; for n D 1; 2; 3; : : : ; where a1 D 1; a2 D 2 and anC1 D an C an 1 for n D 2; 3; 4; :
an
1
(f) x 1 D 1 and x nC1 D 1
for n D 1; 2; 3; : : : :
4x
n
1
4
4
(g) x 1 D 4 and x nC1 D
xn C
for n D 1; 2; 3; : : : : (Hint: Sketch the graph of f .x / D x C for x 2:)
2
xn
x
4
(h) x 1 D 5 and x nC1 D 3 C
for n D 1; 2; 3; :
xn
1
(i) x 1 D 2 and x nC1 D 2
for n D 1; 2; 3; :
xn
2
x C4
(j) x 1 D 0 and x nC1 D n
for n D 1; 2; 3; : : : :
5
p
1
(k) x 1 D 1 and x nC1 D x n
for n D 1; 2; 3; : : : :
4
s
1
(l) x 1 D 3 and x nC1 D 1
for n D 1; 2; 3; : : : :
xn C 1
(m) 0 < x 1 < 1 and 7x nC1 Dp
x n3 C 6 for n D 1; 2; 3; : : : : (Hint: x 3 7x C 6 D .x 1/.x 2/.x C 3/:)
(n) x 1 2 [1; 1/ and x nC1 D 3x n 2 for n D 1; 2; 3; : : : :
(o) x 1 D 0; x 2 2 [0; 12 ] and x nC1 D 13 .1 C x n C x n3 1 / for n D 2; 3; 4; : : : :
93. If fan g is a decreasing sequence (of nonnegative real numbers) converging to 0, show that the sequence fx n g
69
converges, where
x n D 6 . 1/kC1 ak D a1
n
C . 1/nC1 an :
a2 C a3
k D1
an C bn
94. Let 0 < a < b and a1 D a ; b1 D b; anC1 D
; bnC1 D
2
and fbn g both converge and their limits are the same.
95. (i) If a b and 0 < t < 1, then show that a t a C .1
an2 C bn2
for n D 1; 2; 3 : : : : Show that fan g
2
t /b b:
(ii) Let
x 1 D 1;
x 2 D 2 and
x nC1 D
1
2
xn C xn
3
3
for n D 2; 3; 4; :
x 0 D 0;
x 1 D 1 and
x nC1 D
1 2 3 2
x C x
4 n 4 n
for n 2 N
10
[
k D1
An D max.x 1 ; x 2 ; : : : ; x 10/:
100. Use the definitions of infimum and supremum to explain the statement: Let f : R R ! [0; 1] be a function,
g .x / D supf f .x ; y / : y 2 Rg and h . y / D inff f .x ; y / : x 2 Rg: Show that supfh . y / : y 2 Rg inffg .x / : x 2
Rg:
101. Show that for every x 2 R; there is a strictly increasing sequence of irrational numbers fx n g converging to x :
1
102. Prove that lim 2
n!1 n
103. Prove that lim
n!1
2
nC1
2
D 0 by checking the definition of limit.
n3
1
D 0 by checking the definition of limit.
n2
n!1
1
: Prove that lim x nn D 0 by checking the definition of limit.
n!1
2
1
D 0 by checking the definition of limit.
n
n!1
p
3
107. Given sequences fx n g and f yn g both converge to A: For n 2 N; let z n D max.x n ; yn /: Show that fz n g converges
to A by checking the definition.
108. If fx n g is a sequence such that jx kC1
xk j <
1
for k D 1; 2; 3; : : : ; then show that fx n g is a Cauchy sequence.
2k
109. (a) Let S be an open interval and x 0 2 S : For a function f : S ! R; state the definition of f .x / converges to L
(or has limit L) as x tends to x 0 in S :
1
9
(b) Let f : .1; 3/ ! R be defined by f .x / D x 2 C : Prove that lim f .x / D by checking the definition.
x
!
2
x
2
(c) Let f : .1; 4/ ! R be defined by f .x / D jx 2 9j: Prove that lim f .x / D 5 by checking the definition.
x !2
110. If f ; g : .0; 1/ ! R are increasing functions, show that h .x / D max. f .x /; g .x // has countably many jumps on
the interval .0; 1/:
111. Give an example of a function f : R ! R that is continuous at x 2 Z; but discontinuous at every x 62 Z: Be sure
to give reasons to support your example.
112. (a) State the intermediate value theorem.
(b) Let f : [0; 2] ! Rbe continuous and f .0/ D f .2/: Show that there exists c 2 [0; 1] such that f .c/ D f .cC1/:
(c) Show that there is a nonzero function g : R ! R such that g .t / C g .2t / C g .3t / D g .4t / C g .5t / for every
t 2 R: (Hint: Try g .t / D jt jr for some constant r:)
113. (a) Show that the set T D fx : sin x 2 Qg is countable. (Hint: For a fixed rational r; how many solutions of
sin x D r are there in the interval [k ; k C 2/?)
(b) If f : [0; 1] ! R is continuous and sin f .x / 2 Q for every x 2 [0; 1]; then show that f is a constant function.
114. Show that there is no continuous function f : R ! R such that for every c 2 R, f .x / D c has exactly 2 solutions.
115. Suppose f : R ! R is a function such that f .x C y / D f .x / C f . y / for every x ; y 2 R and j f .x /j x 4 =jx j for
every x 6D 0:
(a) Show that f is continuous at some x 2 R:
(b) Show that f is continuous at every x 2 R:
(c) Give an example of such a function.
116. Suppose f ; g : [1; 2] ! [3; 4] are continuous functions and also fg .x / : x 2 [1; 2]g D [3; 4]: Show that there is
c 2 [1; 2] such that f .c/ D g .c/:
117. Let f : R ! R be continuous such that j f .x / f . y /j 12 jx y j for every x ; y 2 R:
(a) Let w 2 R: Define x 1 D w and x nC1 D f .x n / for n 2 N: Show that fx n g is a Cauchy sequence. (Hint: How is
jx kC1 x k j compared to jx 2 x 1 j?)
(b) Show that there is x 2 R such that f .x / D x :
118. Give an example of a function f : .0; 2/ ! R that is differentiable for every x 2 .0; 2/; but f 0 .x / is not
continuous at x D 1: Be sure to give reasons to support your example.
119. Let f : .0; / ! R satisfies
function.
j f .a /
f .b/j sin ja
f .a /j K jb
71
a j holds for
122. Use the mean value theorem to prove that f .x / D sin 5x is uniformly continuous.
123. Prove that if f : R ! .0; C1/ is uniformly continuous, then the function g .x / D
continuous.
f .x / is also uniformly
n!C1
1 cos 3x
d x exists or not.
1Z 11C x 2
cos 3x
dx exists or not.
1
C x2
Z 1 1
1
(c) Determine if the improper integral
p
d x exists or not.
3
x
1
Z 1
1
(d) Determine if the principal value P.V.
p
dx exists or not.
3
x
1
Z
1
Z 1
128. (2002 L1 Midterm) Let f .x / D x 2 C 3: Determine if the set S D f f .w C z / : w 2 [0; 1] \ Q; z 2 [2; 3] n Qg has
an infimum and a supremum. If they exist, find them and give reasons to support your answers.
p
1 2k k
1
1
and 6 .cos k / sin 2 converges or diverges.
k
k D1 .2k /!
k D1
130. (2002 L1 Midterm) Let S be the set of all lines L on the coordinate plane such that L passes through two distinct
points in Q Q and T be the set of all points, each of which is the intersection of a pair of distinct lines in S :
Determine if T is a countable set or not.
131. (2002 L1 Midterm) Given x n 6D
n!1
xn
D 0 by checking
1 C xn
132. (2002 L1 Midterm) Given fx n g converges to w 2 R and x n < w for all n 2 N: For every n 2 N; let
n
yn D sup x 2k : k 2 N; k
n C 1o
:
2
1 .2k C 1/5
1
cos k
and 6 4
converges or diverges.
k!
k D1
k D1 k C k C 1
135. (2002 L2
Let S be the set of all circles on the coordinate plane that pass through .1; 1/ and another
pMidterm)
p
point .x 2; x 2/ for some x 2 Q: Determine if S is a countable set or not.
136. (2002 L2 Midterm) Given x n 6D 1 for all n 2 N: If lim x n D 0; then show that lim
n!1
definition of limit.
n!1
xn
xn
D 0 by checking the
137. (2002 L2 Midterm) Given fx n g converges to w 2 R and x n > w for all n 2 N: For every n 2 N; let
n
yn D inf x 2k : k 2 N; k
n C 1o
:
2
1 2k
1 1
and 6
3
k D1 k .3k /!
k D1 e
1 k
sin k converges or diverges.
k
1 2
140. (2002 L3 Midterm) Let x 1 D 1 and x nC1 D
x C 4x n for n D 1; 2; 3; : : : : Show that fx n g converges. Find the
2 n
limit of fx n g:
141. (2002 L3 Midterm) Let S be the set of all ordered pairs . p; C /; where p D .x ; y / 2 Q Q and C is the circle
with center p and radius jx y j C 1: Determine if S is a countable set or not.
142. (2002 L3 Midterm) If lim x n D 1; then show that lim .x n2
n!1
n!1
1
k D1
144. (2004 L1 Midterm) Find (with proof) all positive numbers b such that the series 6 b C
1 k
converges.
k
and
T D f : 2 R; sin 62 Ag:
and
x nC1 D
x n2 C 4
for n D 1; 2; 3; : : :
2x n C 3
n!1
definition of limit.
xn
xn C 1
1
; then prove that lim x n D 1 by checking the
n!1
2
1
148. (2004 L1 Midterm) Let S [0; ]; T D fcos2 a C cos2 b : a ; b 2 S g and U D fsin c : c 2 S g: If sup T D ;
2
2
then find the infimum of U with proof.
149. (2004 L2 Midterm) Let S be the set of all intersection points .x ; y / 2 R2 of the graphs of the equations
x 2 C my 2 D 1 and mx 2 C y 2 D 1; where m 2 Zn f 1; 1g: Determine if S is countable or uncountable. Provide a
proof of your answer.
p
x n C 2x n
for n D 1; 2; 3; : : : : Prove that fx n g converges. Find the
3
1
k D1
151. (2004 L2 Midterm) Let ak > 0 for k D 1; 2; 3; : : : and 6 ak converges. Determine all positive real number b
1 .b C a k /k
converges. Be sure to give a proof of your answers.
k D1
k
152. (2004 L2 Midterm) Prove that if lim x 2k D 0:5 and lim x 2kC1 D 0:6; then the sequence lim x nn D 0 by checking
n!1
k !1
k !1
the definition of limit.
153. (2004 L2 Midterm) Let I be a[nonempty set. For every t 2 I ; let At be a nonempty subset of [0; 1]: Let
x t D sup At : Prove that if A D
At ; then sup A D supfx t : t 2 I g:
t 2I
Z 1
cos 3x
p
dx exists or not.
x
155. (2002 Final) Prove that there does not exist any continuous function f : R ! R such that f f .x / C x D 0 for
every x 2 R:
156. (2002 Final) Let fx n g be a Cauchy sequence of real numbers. Prove that fsin 5x n g is also a Cauchy sequence by
checking the definition of a Cauchy sequence.
157. (2002 Final) Let f ; g : [0; 2] ! R be Riemann integrable. Prove that h : [0; 2] ! R defined by
h .x / D
max f .x /; g .x /
min f .x /; g .x /
if x 2 [0; 1]
if x 2 .1; 2]
1
k D1
1 1
1
and 6
k
k D1
cos.1= k /
converges or not.
1= k 2
159. (2003 Final) Let A be a nonempty subset of R such that inf A D 0 and sup A D 1: Determine the infimum and
supremum of S D fa 3 4a C 1 : a 2 Ag:
160. (2003 Final) Let P be a countable set of points in R2 : Prove that there exists a circle C with the origin as center
and positive radius such that every point of the circle C is not in P : (Note points inside the circle do not belong
to the circle.)
161. (2003 Final) Let f : R ! [u ; v ] be a function and w 2 R: For every r > 0; let
M .r / D supf f .t / : 0 < jt
wj < r g and m .r /
74
D inf f f .t / : 0
< jt
wj < r g:
r !0C
r !0 C
r !0C
1 sin x
x 3=2
1
is
1 C f .x /2
d x converge or not.
165. (2004 Final) Let f : R ! R be an increasing function and g : R ! R be a decreasing function. Prove that
f .x /g .x / is discontinuous for only countably many x 2 R:
(
0
166. (2004 Final) Let f .x / D 1
1= n
if x 2 [0; 1] n Q
if x D 0
if x D m = n for m ; n 2 N with no common prime factor.
Prove that there exists a Riemann integrable function g : [0; 1] ! [0; 1] such that the composition function g f :
[0; 1] ! [0; 1] is not Riemann integrable on [0; 1]:
167. (2004 Final) Let f : .0; C1/ ! R satisfy j f .x / f . y /j j sin.x 2 /
sequence x 1 ; x 2 ; x 3 ; : : : given by x n D f .1= n / is a Cauchy sequence.
1 n1
nD1 x
n 2
: x 2 .2; 3] n Q :
2 C 3x
is continuous at 2 by checking
x2 C 4
170. (2005 Spring Final) Let x n > 0 for n D 1; 2; 3; : : : : If fx n g is a Cauchy sequence, then prove that fe
Cauchy sequence by checking the definition of a Cauchy sequence.
xn
g is a
171. (2005 Spring Final) (a) Let S [0; 1]: If S is a set of measure 0, then prove that T D fx 2 : x 2 S g is a set of
measure 0.
p
(b) Let f : [0; 1] ! [0; 1] be integrable. Prove that h : [0; 1] ! [0; 1] defined by h .x / D f . x / is integrable.
(Caution: In general it is false that f integrable and g continuous on [a ; b] imply h D f g integrable on [a ; b]:)
1 3k
converges or not.
k D1 .2k /!k!
1
1 ak
1 for k D 1; 2; 3; : : : and 6 jak j converges. Determine with proof if 6
converges or not.
k D1
k D1 1 C ak
x nC1 D 4
4
xn
174. (2005 Fall Exam, Version 1) Let A be a nonempty bounded subset of R such that sup A D 1 and inf A D 0: Let
S D fx
y 2 : x 2 A; y 2 [ 2; 2/g:
75
n!1
n!1
1 .3k /!
k D1
converges or not.
k!2k
(b) Let cos ak 6D 0 for k D 1; 2; 3; : : : and 6 jak j converges. Determine with proof if 6
k D1
k D1
x nC1 D
x n2 C 15
8
ak
converges or not.
cos ak
178. (2005 Fall Exam, Version 2) Let A be a nonempty bounded subset of R such that sup A D 6 and inf A D 2: Let
SDf
x
y
x y : x 2 A; y 2
1
; 1 g:
179. (2005 Fall Exam, Version 2) If lim an D 1 and all an 6D n ; then prove that lim
definition of limit.
n!1
180. (2006 Spring Exam)(a) Let f : S ! R be a function and x 0 be an accumulation point of S : State the definition
of f .x / converges to a real number L as x tends to x 0 :
r
xC
n
nC1
p
1
: Prove that lim f .x / D 2 by checking the definition.
x !1
x
an C
cos n
for n D 1; 2; 3; : : : : Prove that lim nan
n!1
.n C 1/3
182. (2006 Spring Exam) Let a ; b 2 R with a < b and f : [a ; b] ! R be continuous. Also, let f .x / be differentiable
for all x 2 .a ; b/: Prove that if the graph of f is not a line segment, then there exist numbers x 1 and x 2 in the open
interval .a ; b/ such that
f .b/ f .a /
f 0 .x 1 / <
< f 0 .x 2 /:
b a
183. (2006 Spring Exam) Let f ; g : [0; 1] ! R be continuous. If there exists a sequence of numbers x 1 ; x 2 ; x 3 ; : : : 2
[0; 1] such that g .x n / D f .x nC1 / for n D 1; 2; 3; : : : ; then prove that there exists w 2 [0; 1] such that g .w/ D
f .w/:
Caution Be careful, x ni converges does not imply x ni C1 converges !!!
76