Carefully tear this page off the rest of your exam.

UNIVERSITY OF TORONTO SCARBOROUGH

MATA31H3 F : Calculus for Mathematical Sciences I
REFERENCE SHEET
Properties of real numbers
Throughout this course, we assume that there exists a set R endowed with two binary operations + and ,
as well as a special subset P R, which satisfy all the following properties:
(P1) a, b, c R, we have a + (b + c) = (a + b) + c.
(P2) There exists a number 0 R such that a R, a + 0 = 0 + a = a.
(P3) For each a R there exists a number a R such that a + (a) = (a) + a = 0.
(P4) a, b R, we have a + b = b + a.
(P5) a, b, c R, we have a (b c) = (a b) c.
(P6) There exists a number 1 R such that a R, a 1 = 1 a = a. Moreover, 1 = 0.
(P7) For each a R {0}, there exists a number a
1
R such that a a
1
= a
1
a = 1.
(P8) a, b R, we have a b = b a.
(P9) a, b, c R, we have a (b + c) = a b + a c.
(P10) For each number a R, one and only one of the following holds:
(a) a = 0
(b) a P
(c) a P
(P11) If a, b P, then a + b P.
(P12) If a, b P, then a b P.
(P13) If A R is nonempty and has an upper bound, then there exists a least upper bound of A.
NOTATION AND LEMMAS
sup A, the supremum of A, is the least upper bound of A.
inf A, the inmum of A, is the greatest lower bound of A.
Given a, b R, the notation a > b means that a + (b) P, and b < a is another way of writing a > b. The
symbol a b means that a + (b) P {0}, and b a means the same as a b.
Lemma 1: If a, b R and a > b, then a + c > b + c for all c R. Moreover, if c > 0, then a c > b c.
Lemma 2: If a, b, c R satisfy a > b and b > c, then a > c.
Lemma 3: 1 > 0.
UNIVERSITY OF TORONTO SCARBOROUGH
MATA31H3 F : Calculus for Mathematical Sciences I
FINAL EXAMINATION
December 15, 2011
Duration 3 hours
Aids: none
NAME (PRINT):
Last/Surname First/Given Name
STUDENT NO:
TUTORIAL:
Tutorial section Name of TA
(Number or Schedule)
Qn. # Value Score
1 10
2 20
3 5
4 5
5 13
Total 53
Qn. # Value Score
6 10
7 15
8 17
9 5
Total 47
TOTAL:
Please read the following statement and sign below:
I understand that any breach of academic integrity is a violation of The Code of Behaviour on Academic Matters. By
signing below, I pledge to abide by the Code.
SIGNATURE:
Final Exam MATA31H3 page 2 of 16
(1) For this problem, you must justify each step of your solution using properties (P1)(P13)
or Lemmas 1 3 listed on the reference sheet. (You do not need to prove these lemmas.)
(a) (5 points) Prove that if a R satises a + a > 0, then a > 0.
By (P10), we know that exactly one of the relations a > 0, a > 0, or a = 0 is
true. I will show that the latter two are impossible (thus proving the claim).
Case (i): a = 0
Then a + a = 0 by (P2). But by hypothesis, a + a > 0. (P10) guarantees that
these statements cannot simultaneously be true. This contradiction implies
that a cannot equal 0.
Case (ii): a > 0
Since a + a > 0, we deduce that a > a (see Lemma below for details).
If a > 0, then transitivity (called Lemma 2 on the reference page) would
imply that a > 0 as well. But this contradicts (P10), since only one of the two
conditions a > 0 or a > 0 can be valid.

Lemma: If a + a > 0 then a > a.

Proof: We have
a + a > 0 = (a + a) + (a) > 0 + (a) by Lemma 1
= a +
_
a + (a)
_
> a by (P1) on the LHS and (P2) on the RHS
= a + 0 > a by (P3)
= a > a by (P2)

(b) (5 points) Suppose a R satises 0 a < for every > 0. Prove that a = 0.
[Hint: Consider 2
1
a.]
Suppose a > 0. By the Lemma proved below, it would follow that
a > 2
1
a > 0. (*)
But our hypothesis would in turn imply that a < 2
1
a (taking = 2
1
a);
the two inequalities together contradict (P10). It follows that a cannot be
positive, and hence, that a = 0 as claimed.
Lemma: If a > 0, then (*) holds.
Proof: We have
2
1
a + 2
1
a =
_
2
1
a
_
(1 + 1) by (P6) and (P9)
= a
_
2
1
2
_
by (P1) and (P8)
= a by (P6) and (P7).
It follows from part (a) above that
2
1
a > 0. (**)
Applying Lemma 1 and (P2) to (**) yields
a = 2
1
a + 2
1
a > 0 + 2
1
a = 2
1
a. (***)
Combining inequalities (**) and (***) proves the claim.
continued on page 3
Final Exam MATA31H3 page 3 of 16
Page intentionally left blank for scratch work.
continued on page 4
Final Exam MATA31H3 page 4 of 16
(2) (a) (5 points) Given a nested sequence of nonempty closed intervals
I
1
I
2
I
3

Prove that

n=1
I
n
= .
Since each interval I
n
is closed and nonempty, we can write I
n
= [a
n
, b
n
] for
some real numbers a
n
b
n
. Moreover, since I
n
I
n+1
, we have a
n
a
n+1
and b
n
b
n+1
for all n N. It follows that
b
n
a
k
k, n N.
Indeed, if k n we have a
k
a
n
b
n
, while if n k we have a
k
b
k
b
n
.
Now let A = {a
n
: n N}. This is clearly non-empty and bounded above
(e.g. by b
1
), so by (P13) there exists a least upper bound, . I claim that I
n
for every n N:
a
n
because is an upper bound on A; and
b
n
because is the least upper bound.
Thus,

n=1
I
n
. In particular, the intersection is nonempty.
(b) (5 points) Let J
n
=
_
a
n
4
n
,
a
n
+ 1
4
n
_
for every n N, where a
n
is dened recursively by
a
1
= 1 and a
n+1
= 4a
n
+ 1. Prove that the set

n=1
J
n
consists of a single real number.
[Hint: you do not need to determine this number or establish an explicit formula for a
n
.]
Ill do this in two steps: rst, Ill show that the intersection is non-empty, and
then Ill show that it cannot contain more than a single element.
To show that the intersection is non-empty, by part (a) it sufces to show that
the intervals J
n
are nested. In other words, we must show that J
n
J
n+1
for
every n N. This is equivalent to proving that
a
n
4
n

a
n+1
4
n+1
and
a
n
+ 1
4
n

a
n+1
+ 1
4
n+1
Neither of these is particularly hard to prove. Heres a proof of the rst one:
a
n+1
4
n+1
=
4a
n
+ 1
4
n+1
=
a
n
4
n
+
1
4
n+1
>
a
n
4
n
.
Onto the second inequality:
a
n+1
+ 1
4
n+1
=
4a
n
+ 1
4
n+1
<
4a
n
+ 4
4
n+1
=
a
n
+ 1
4
n
.
Thus we have shown that the intervals are nested, so by part (a) we conclude
that the intersection is non-empty.
Now pick any two elements c and c

in

n=1
J
n
. Then c, c

J
n
for every n N,
whence |c c

| 4
n
for every n N. This implies that |c c

| = 0 (e.g. by
problem 1(a) of this exam), which in turn is only possible if c = c

. In other
words,

n=1
J
n
cannot contain two different elements. Since we know this set
does contain at least one element, we conclude that it must contain exactly
one element.
continued on page 5
Final Exam MATA31H3 page 5 of 16
(c) (5 points) Recall from part (b) that a
1
= 1 and a
n+1
= 4a
n
+ 1 for every n N. Prove
that
a
n
=
4
n
1
3
n N.
We prove this by induction on n.
Base case: When n = 1, we have
4
1
1
3
= 1, so the claim holds in this case.
n n + 1: Suppose a
n
=
4
n
1
3
for some n N. Then
a
n+1
= 4a
n
+ 1 = 4
4
n
1
3
+ 1 =
4
n+1
4
3
+ 1 =
4
n+1
1
3
.
Thus if the claim holds for n N, it must also hold for n + 1.
By induction, we conclude that the claim holds for all n N.
(d) (5 points) From part (b), you know that

n=1
J
n
consists of a single real number. Deter-
mine this number (with proof).
Combining the result of part (b) with the proof of part (a), we see that we can
write

n=1
J
n
= {} where is the supremum of the set A =
_
a
n
4
n
: n N
_
.
Moreover, from part (c) we know
a
n
4
n
=
1
3

1
3 4
n
.
Claim: = 1/3.
Proof: It is clear that 1/3 is an upper bound of A, so it sufces to show that it
is the least upper bound.
Suppose b is any upper bound of A. This means that b
1
3

1
34
n
for every
n N. It follows that
1
3
b
1
34
n
for every n N. Thus if
1
3
b 0, problem
1(a) implies that
1
3
b = 0. We conclude that
1
3
b 0. This shows that 1/3
is the least upper bound, as claimed.
continued on page 6
Final Exam MATA31H3 page 6 of 16
Page intentionally left blank for scratch work.
continued on page 7
Final Exam MATA31H3 page 7 of 16
(3) (5 points) Suppose that
__
3
2

1
n
, 2
n
_
: n N
_
f
where f is a function. Prove that f is not continuous on [1, 2]. (You may refer to any
theorems covered in lecture or the textbook.)
First, note that 3/2 1/n [1, 2] for all n 2. It follows that for every n 2,
f attains the value 2
n
somewhere in the interval [1, 2]. In particular, f must be
unbounded on this interval. By Theorem 7-2 of Spivak, we conclude that f cannot
be continuous on [1, 2].
(4) (5 points) Explain why the existence of

2 cannot be proved using only (P1)(P12). You
may refer to any theorems proved in lecture or in the textbook (i.e. you may state any
theorems you need without proving them). Your explanation can be quite short, so long as
it is convincing.
All of the properties (P1) (P12) are satised by Q. This means that any theorem
deduced from (P1) (P12) would have to be true in a universe consisting entirely
of rational numbers! And in such a universe

2 wouldnt exist (since we proved
in lecture that

2 Q). Therefore, there cannot possibly be a way to deduce the
existence of

2 from these 12 properties alone.

continued on page 8
Final Exam MATA31H3 page 8 of 16
(5) Consider the function f : R
>0
R dened by
f(x) =
1
x
sin x +
1
x
2
cos x.
(a) (5 points) Prove that f(x) has a positive root. (Recall that a positive root of f is a number
a > 0 such that f(a) = 0.) You may refer to any theorems proved in lecture or the
textbook.
First, note that f is continuous for all x > 0. This is because sin x and cos x are
both continuous everywhere on R, and x and x
2
are continuous and non-zero
everywhere on R
>0
. A theorem from Spivak then implies that 1/x and 1/x
2
are both continuous on R
>0
. Another theorem from Spivak asserts that the
product of any two continuous functions is also continuous, so both
1
x
sin x
and
1
x
2
cos x are continuous on R
>0
. Finally, yet another theorem from Spivak
states that the sum of any two continuous functions is continuous. We thus
conclude that f is continuous for all x > 0.
Now note that
f() =
1

2
< 0 and f(2) =
1
(2)
2
> 0
By Theorem 7-1 of Spivak, we conclude that f has a root in the interval
[, 2].
(b) (3 points) Prove that f(x) has innitely many positive roots.
Note that for any natural number n, we have
f
_
(2n 1)
_
=
1
(2n 1)
2

2
< 0 and f(2n) =
1
(2n)
2
> 0
Thus again by Theorem 7-1, for each n N there exists c
n
[(2n 1), 2n]
such that f(c
n
) = 0.
Finally, I claim the set {c
n
: n N} is innite. It sufces to prove that all
the c
n
s are distinct (because then we have a 1-1 correspondence with N).
Suppose m and n are distinct natural numbers. Without loss of generality,
we may assume that m > n. Then mn 1, whence we have
c
n
2n 2(m1) < (2m1) c
m
.
In other words, weve shown that n < m implies that c
n
< c
m
. In particular,
all the c
n
s must be distinct, so there must be innitely many of them.
continued on page 9
Final Exam MATA31H3 page 9 of 16
(c) (5 points) What is lim
x
f(x)? Give an proof that your answer is correct.
Claim: lim
x
f(x) = 0
Proof: Given > 0. For all x > max
_
1,
2

_
, we have
|f(x) 0| =

sin x
x
+
cos x
x
2

| sin x|
x
+
| cos x|
x
2
by the triangle inequality

1
x
+
1
x
2

1
x
+
1
x
since x > 1 implies that
1
x
< 1
< since x >
2

continued on page 10
Final Exam MATA31H3 page 10 of 16
(6) (a) (5 points) Prove that if a function f is continuous and non-zero at a, then f is non-zero
in a neighbourhood of a.
By denition of continuity, there exists a > 0 such that
|f(x) f(a)| <
|f(a)|
2
for every x (a , a + ). It follows that for all x in this neighbourhood of
a, we have
f(a)
|f(a)|
2
< f(x) < f(a) +
|f(a)|
2
. ()
If f(a) < 0, the upper bound of () shows that f(x) <
f(a)
2
< 0 for every x in
a neighbourhood of a. Similarly, if f(a) > 0, the lower bound of () shows
that f(x) >
f(a)
2
> 0 for every x in a neighbourhood of a. Either way, f(x) is
non-zero for all x (a , a + ).
(b) (5 points) Suppose that a function f is continuous on all of R and satises f(x) = 0 for
all x Q. Prove that f(x) = 0 for all x R.
Suppose f(a) = 0 for some a R. By part (a) there exists > 0 such that
f(x) = 0 for all x (a , a + ). Recall that Q is dense in R, so there must
be a rational point q (a , a + ). But f(q) = 0, which is a contradiction!
Therefore no such a can exist. In other words, f(a) = 0 for every a R.
continued on page 11
Final Exam MATA31H3 page 11 of 16
Page intentionally left blank for scratch work.
continued on page 12
Final Exam MATA31H3 page 12 of 16
(7) (a) (5 points) Prove that

|a| |b|

|a b| for all a, b R.
By triangle inequality, we see that
|a b| +|b| |a|,
which immediately implies that |a| |b| |a b|. It follows (by exchanging
a and b) that |b| |a| |b a|. Since |a b| = |b a|, we conclude.
(b) (5 points) Prove that if f is continuous at a, then |f| is continuous at a.
Given > 0, by denition of continuity there exists > 0 such that
|f(x) f(a)| <
for all x (a , a + ). By part (a), we have

|f(x)| |f(a)|

|f(x) f(a)| <

for all x (a , a + ). It follows that |f| is continuous at a.
(c) (5 points) Is the converse of (b) true? In other words, if |f| is continuous at a, must f be
continuous at a as well? If yes, prove it. If no, provide a supporting example.
No. Consider the function
f(x) =
_
1 if x < 0
1 if x 0.
This function is not continuous at 0, since every neighbourhood around 0
contains a negative number x (whence |f(x) f(0)| > 1). However, the
function |f| is continuous: it is the constant function 1!
continued on page 13
Final Exam MATA31H3 page 13 of 16
(8) (a) (2 points) State the Intermediate Value Theorem.
If a function f is continuous on a non-empty closed interval [a, b], then for
any [c, d] [a, b], every value between f(c) and f(d) is attained by f some-
where in [c, d].
(b) (5 points) Give an example of a function which is dened everywhere on some closed
interval [a, b] and satises the conclusion of the Intermediate Value Theorem, but is not
continuous on [a, b].
Let
f(x) =
_
sin
1
x
if x = 0
0 if x = 0.
This function is dened everywhere on the closed interval [1, 1]. Moreover,
from Spivak we know that this function is continuous everywhere in this in-
terval except at the point 0. (It cannot be continuous at 0 no matter how we
dene f(0), since the limit as x 0 doesnt exist.)
Why does this function satisfy the conclusion of the IVT? Consider any
[c, d] [1, 1]. If [c, d] does not contain 0, then it is evident that every value
between f(c) and f(d) must be attained, since f is continuous on [c, d] so that
the IVT actually holds! Thus, it remains only to show that if [c, d] contains 0
then every value between f(c) and f(d) is attained by f somewhere in the
interval [c, d].
Now, if c = d = 0, this is trivially true. Otherwise, the interval [c, d] must
contain a non-empty open interval of the form (0, d) or (c, 0); denote this in-
terval by I. Pick any number y between f(c) and f(d). I claim that f attains
the value y somewhere on the interval I. In fact, I will prove the stronger
statement that every y [1, 1] is attained by f somehwere in I.
Observe that for all n Z, we have
sin
_

2
+ 2n
_
= 1 and sin
_

2
+ 2n
_
= 1.
Since sin x is continuous, the IVT guarantees that (for any n Z) there exists
a real number

n

_

2
+ 2n,

2
+ 2n
_
such that sin
n
= y. Now pick n sufciently large (positive or negative) so
that both
1

2
+ 2n
I and
1

2
+ 2n
I
Then
1
n
I as well, and f
_
1
n
_
= y by construction. This shows that every
value between 1 and 1 is attained by f somewhere in [c, d].
continued on page 14
Final Exam MATA31H3 page 14 of 16
(c) (5 points) Let g : R R be dened by
g(x) =
_

_
x if x =
1
4
,
3
4
3
4
if x =
1
4
1
4
if x =
3
4
.
Prove that g is not continuous at 1/4.
To prove this, we must show that lim
x1/4
g(x) = g(1/4). There are several ap-
proaches; perhaps the easiest is to determine the limit.
Claim: lim
x1/4
g(x) = 1/4.
Proof: Given > 0. Then for all x such that
0 < |x 1/4| < min{, 1/4} ()
we have g(x) = x (since () implies that x = 1/4 and x = 3/4). Therefore, for
all x satisfying (),
|g(x) 1/4| = |x 1/4| < .
This concludes the proof.

It follows that lim

x1/4
g(x) = 3/4, so g is discontinuous at 1/4.
(d) (5 points) Carefully explain why the function g from the previous part doesnt satisfy
the conclusion of the Intermediate Value Theorem on the interval [0, 1].
Consider the closed interval [1/8, 3/8] [0, 1]. We have g(1/8) = 1/8 and
g(3/8) = 3/8; but g does not attain the value 1/4 anywhere in this interval.
Therefore g does not satisfy the conclusion of the IVT.
continued on page 15
Final Exam MATA31H3 page 15 of 16
(9) (5 points) Let I denote the interval (0, 1). Prove that I I is in one-to-one correspondence
with I. (Recall that if A and B are two sets, A B = {(a, b) : a A and b B}.)
I leave this as a challenge for you to work on over the break. Congratulations on
completing MATA31, and happy holidays!
continued on page 16
Final Exam MATA31H3 page 16 of 16
Page intentionally left blank for scratch work.
Total Marks = 100 points