Errata and Suggestion Sheets

Advanced Calculus, Second Edition, by Patrick Fitzpatrick

December 29, 2013
Location

Error

Finder

Date

p.
p.
p.
p.
p.
p.

for p write r (four occurances)

for b2 < r write b2 < c
for . . . number a and b, write . . . numbers a and b,
Q\N should read Q\Z.
would if they exist be clearer than if they are defined?
1 T should read 1 r.

SI
HH
ME
JD
TT
RM

30 Sep 2013
1 Oct 2013
1 Feb 2010
6 Oct 2005
27 Oct 2013
7 Oct 2005

TT

8 Oct 2013

RM

10 Oct 2005

p. 31, ln. -11

p. 31, Proof
p. 36, ln. 16

for Let a be a nonzero number . . . write

Let a and b be nonzero numbers . . .
To slightly improve clarity, the Linearity Property
should come before Theorem 2.13.
for indices n N write indices n N1
Is there a reason to use N1 rather than N throughout?
for midpoint x = (a + b)/2 write midpoint s = (a + b)/2

MH
TT
MH

22 Oct 2013
22 Oct 2013
22 Oct 2013

p. 38, ln. -15,-14

for {an | n in N } write {an | n in N}

TS

14 Nov 2013

JD

17 Oct 2005

NS
TT
TT
TT
TT
HH
TT
TT
TT
LF
TB
LM
TT
TT
SH
JD
TT
TT
JF
JD
TT

28 Oct 2013
25 Oct 2013
1 Nov 2013
1 Nov 2013
1 Nov 2013
1 Nov 2013
1 Nov 2013
1 Nov 2013
1 Nov 2013
9 Feb 2008
11 Nov 2013
11 Nov 2013
28 Nov 2013
28 Nov 2013
9 Nov 2005
9 Nov 2005
18 Nov 2013
21 Nov 2013
9 Nov 2005
14 Nov 2005
2 Dec 2013

8, Fig. 1.1
11, ln. -3
13, ln. -1
16, 1c
16, # 4
18, ln. 14

p. 21, # 23
pp. 30, 32

1
2

1+

3
2 .

s4 +

p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.

for . . . converges to c. write . . . converges to x

for Let c be a number write Let c 6= 0 be a number
for . . . n is odd, write . . . n is odd and n 3,1

for {In }
n=1 write {In }n=2
N
for N
n=1 In write n=2 In
N
for S N
n=1 An write S n=1 In
for . . . n is odd, write . . . n is odd and n 3,

for {Jn }
n=1 write {Jn }n=2
for . . . (xnk ) nk k. . . write . . . (xnk ) > nk k. . .
sequence ({1/n} should read sequence {1/n}
for supremun write supremum
for on (0, 1] write on (0, 1)
See comment below.2
for in the interval [0, 1] write in the interval (0, 1]
1/n should read 1/n.3
2 + 1/n2 should read 2 1/n2 .
for at the domain D; write on the domain D;
for select  > 0. write let  > 0 be given.
monotonically increasing should read monotone.
D should appear D.
Neighborhood has already been defined on p. 87, ln. -7, -6.

Fig. 2.3
#5
ln. 3
ln. 11,13
ln. 13
ln. 6
ln. 13
ln. 16-19
ln. -13
ln. -9
Fig. 3.2
Fig. 3.3
#7
ln. 6
ln. 21
ln. 22
ln. 14
ln. 13
ln. 22
ln. 23
ln. 9,10

should read s4 +

1
2

p. 40, ln. 2
41,
42,
49,
49,
49,
50,
50,
50,
51,
54,
59,
59,
62,
62,
67,
67,
73,
75,
78,
81,
88,

=1+

3
2

1 Alternatively, one might let I (c n 1, c 1/n) to avoid the degenerate interval for the case n = 1. This would take
n
care of the three corrections on page 49 and the last two on page 50.
2 The last phrase following the semicolon seems quite a bit easier to prove than the problem as stated since you can ignore
the and f (x) > 0 for 0 x < x0 part. Furthermore, students are quite tempted to use the illegal at this time IVT from
the section following! I was a little stymied as well until I saw that one of my students constructed a very nice direct proof
without using the IVT.
3 Alternatively, one could let u = n + 1/n and v = n. This would take care of both errors on page 67.
n
n

Errata Sheets, cont.

Location

Error

p. 90, ln. 14

and

p. 90, ln. -1
& p. 91, ln. 1
p. 94, # 3
p. 97, ln. 15
p.
p.
p.
p.

99, (4.8)
107, ln. 8
107, ln. -15
112, ln. 3

lim

x0, x>0

f (x) f (0)
= 1. should read
x0
f (x) f (0)
and
lim
= 1.
x0, x<0
x0

... + xn2
+ xn1
should read
0
0
... + xxn2
+ xn1
.
0
0
The function value f (0) is defined twice.
for We expect that the tangent line. . .
write We expect that the slope of the tangent line. . .
x x should read x x0 in two denominators.
x0 < x0 + should appear x0 < x < x0 +
for In Section 9.5, write In Section 9.6,
g (n) (x0 ) = n! should appear g (n) (x) = n!
f (n) (xn )
f (n) (xn )

should
appear

g (n) (x0 )
g (n) (xn )

Finder
CB,
BH,

Date
18 Nov 2005

GV
JD

18 Nov 2005

JD
TT

14 Nov 2005
4 Dec 2013

RM
RM
AD
TT

7 Dec 2005
29 Nov 2005
31 Jan 2010
21 Jul 2009

KW

30 Nov 2005

p. 112, ln. 14

p.
p.
p.
p.
p.
p.
p.
p.
p.

120,
142,
144,
145,
149,
150,
152,
152,
153,

ln. 15
ln. -1
ln. -10
ln. 3
# 4 b.
ln. -10
ln. 5
ln. 12
ln. -1

TT
NR
JF
JF
JH
JF
BH
JH
AS

Jan 2008
25 Jan 2010
25 Jan 2006
25 Jan 2006
28 Jan 2008
21 Feb 2006
25 Jan 2006
3 Feb 2008
29 Mar 2009

p.
p.
p.
p.

156,
160,
162,
162,

ln.
ln.
ln.
ln.

CS
IB
IB
IB

28 Jan 2010
7 Feb 2008
7 Feb 2008
7 Feb 2008

p. 164, # 3

for inverse function R. write inverse function on R.

for . . . 1988), a clear. . . write . . . 1988), is a clear. . .
the second (6.19) should be (6.20)
for [a, b] : R R write f : [a, b] R
for (b a)/2 write (b2 a2 )/2
for The f is write Then f is
for L(f, Pn ) write U (g, Pn )
for L(f, P ) + U (g, P ) write U (f, P ) + U (g, P )
for U (f + g, Pn ) L(f, Pn ) + U (g, Pn ).
write U (f + g, Pn ) U (f, Pn ) + U (g, Pn ).
for [xi1 xi ] write [xi xi1 ]
for Section 7.4. write Section 7.3.
for L(f, P ) write L(F 0 , P )
for R(f, P ) write U (F 0 , P )
Rb
R6
for a f = 4 write 2 f = 4

IB

6 Feb 2008

p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.

See instructor for corrected lemma statement and proof.

Proof of theorem still true with corrected lemma.
for index i 1 write index i such that 1 i n
for Supose write Suppose
for x = 0 write x0 = 0
for x = 0 write x0 = 0
for x = 0 write x0 = 0
for x = 1 write x0 = 1
for strictly increasing. . . write strictly decreasing. . .
for at x = 0 write at x0 = 0
for (x x0 )n write (x x0 )n+1

TT
TT
JH
JF
LF
LF
LF
LF
RM
TT
RM

14 Aug 2009
14 Aug 2009
19 Mar 2008
20 Feb 2006
4 Mar 2008
4 Mar 2008
4 Mar 2008
4 Mar 2008
22 Feb 2006
11 Mar 2008
22 Feb 2006

184,
186,
187,
189,
201,
201,
201,
201,
202,
202,
203,

10-12
-2
-8
-8

Lemma
Thm
ln. -11
#8
ln. 4
ln. 8
ln. 12
ln. -7
ln. -10
ln. -1
ln. 10

Errata Sheets, cont.

Location

Error

p. 241, ln. 12
p. 241, Fig. 9.2

ln(n + 1) = ln 1 write ln(n + 1) ln 1

number n write number k
about x = 0 write about x0 = 0
1 k n. write 0 k n.
for index write for every index
(0, c) write (0, b)
 
 
ak
ak
for lim
write lim
n
k
bk
bk
for . . . value is 1. write . . . value is 1,
for . . . limn 1n = 0. write . . . limn 1n = 1.

p.
p.
p.
p.
p.

242,
243,
243,
243,
243,

ln. -1
ln. 8
ln. 9
ln. 10
Fig. 9.4

for
for
for
for
for

p.
p.
p.
p.
p.

251,
251,
257,
265,
265,

ln. 4
ln. -8
ln. -4
Fig. 9.6
Fig. 9.6

for 4[b a] write [4(b a)] (But [3(b a)] works!)

for 6[b a)] write [6(b a)] (But [2(b a)] works!)
for Cauchy on A write Cauchy on A
left figure: for (l , 2l) write (l, l)
Two comments: (1) It would be nice to use the same
script l as in the surrounding text. (2) It would be nice
if the graphs had the same scales for both x- and y-axes.

p.
p.
p.
p.
p.
p.

206,
217,
221,
225,
233,
235,

ln.
ln.
ln.
ln.
ln.
ln.

-1
6
10
-6
2
-9

p. 240, ln. -2

p. 266, ln. 16

for
for
for
for
for
for

. . . natural number k write . . . integer k

. . . number n, . . . write . . . number n 2, . . .
fn (0) = f (2/n) = write fn (0) = fn (2/n) =
and [2/n, 0] write and [2/n, 1]




n1 , 1 write n1 , n

279,
302,
324,
355,

ln.
ln.
ln.
ln.

6
7
8
4

p. 373, ln. 11
p.
p.
p.
p.

375, ln. -8
391, ln. 8
474, ln. -10
479,
ln. 14-15

p. 479, ln. 16

Date

RM
IB
TT
TT
TT
JD

22 Feb 2006
7 Mar 2008
11 Mar 2008
26 Feb 2006
01 Mar 2006
01 Mar 2006

TT

01 Mar 2006

AH
NC, AD,
NR
NR
TT
RM
RM
RM

26 Feb 2010
15 Mar 2010
26 Feb 2010
11 Mar 2008
06 Mar 2006
06 Mar 2006
06 Mar 2006

TT
TT
JD
AD
TT

05
05
08
15
21

TT

10 Mar 2006

for dist(u, u0 ) and write dist(u, u0 ) = 0 and

for A : R R write f : A R
for f : R R write f : I R
Is ei defined in the text (other than p. 281, H.W.#2)?
 
 
1
1
for
! write

k
k!

RM
JF
TT
JH

29 Mar 2006
15 Apr 2006
23 Apr 2010
21 Nov 2008

JF

22 May 2006

for h write h
for f (x) = 0 write f (x) = 0
the word integrable comes before it is defined (p. 475)
for in any one of the Pk (J)s write, perhaps,
in all of the corresponding Pk (J)s
X
X
for
U (...) L(...) write
[U (...) L(...)]

JH
SW
TT
JH

21 Nov 2008
May 2010
16 May 2006
21 Nov 2008

JH

21 Nov 2008

for

hk (x) write

k=1

p.
p.
p.
p.

Finder

J in P

hk (x)

Mar
Mar
Mar
Mar
Mar

2010
2010
2006
2010
2010

k=0

J in P

Errata Sheets, cont.

Location

Error

p. 479,
ln. 14-21

It does not seem that Pk can be chosen as indicated. One

suggestion is to:
Let Pk be the partition of I induced by the Pk (J)s. (By
this we mean that for all the Js in a common row of P,
we form the union of all the partition points of a common
edge of the corresponding Pk (J)s. This union then forms
one part of the partiton Pk for that corresponding edge.)
It should be clear that for each J, Pk (J) is a refinement of
Pk (J) so that

Finder

Date

TT

May 2010

JH
JH
TT

21 Nov 2008
21 Nov 2008
26 May 2006

TT
TT

26 May 2006
27 May 2010

TT

26 May 2006

TT
TT
TT
TT
TT

26 May 2006
4 Jun 2010
4 Jun 2010
4 Jun 2010
4 Jun 2010

U (f, Pk (J)) L(f, Pk (J)) (f, Pk (J)) L(f, Pk (J))

for all J and hence
U (f, Pk ) L(f, Pk )

X
J
X

[U (f, Pk (J)) L(f, Pk (J))]

[U (f, Pk (J)) L(f, Pk (J))]

J
<

1
.
k

1
km

Thus,
lim [U (f, Pk ) L(f, Pk )] = 0,

p. 479, ln. 19
p. 488, ln. 5
p. 488, ln. -11
p. 488, ln. -7
p. 489, ln. 6,7
p. 491, ln. 2

and therefore, by the ArchimedesRiemann Theorem, the

function f is integrable on I.
for L(f, Pk ] = write L(f, Pk )] =
for vol J write vol Ji (twice)
for For positive numbers a and b, show that the ellipse
write Show that the set
for that the ellipsoid write that the set
for in the interior of J write in the interior of I
Z
Z
for =
f, write =
f,
J

p.
p.
p.
p.
p.

493,
499,
500,
499,
500,

ln.
ln.
ln.
ln.
ln.

-15
10
2
10
2

for
for
for
for
for

I1

{(x, g(x)) . . . write {(x, f (x)) . . .

(19.3) write (19.1)
of mi and Mi write of Mi
(19.3) write (19.1)
of mi and Mi write of Mi