Вы находитесь на странице: 1из 3

Errata and Suggestion Sheets

Advanced Calculus, Second Edition, by Patrick Fitzpatrick


June 4, 2010
Location

Error

p. 13, ln. -1
p. 16, 1c
p. 18, ln. 14

for . . . number a and b, write . . . numbers a and b,


Q\N should read Q\Z.
1 T should read 1 r.
To slightly improve clairity, the Linearity Property
should come before Theorem 2.13.
s4 + 12 = 1 + 32 should read s4 + 12 1 + 32 .
sequence ({1/n} should read sequence {1/n}
the value 0. should read zero or negative values.
1/n should read 1/n.
2 + 1/n2 should read 2 1/n2 .
monotonically increasing should read monotone.
D should appear D.

pp. 30, 32
p.
p.
p.
p.
p.
p.
p.

40,
54,
62,
67,
67,
78,
81,

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

2
-9
7
21
22
22
23

p. 90, ln. 14

lim

x0, x>0

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

p. 90, ln. -1
& p. 91, ln. 1
p. 94, # 3
p. 99, (4.8)
p. 107, ln. 8
p. 107, ln. -15
p. 112, ln. 3

... + xn2
+ xn1
should read
0
0
... + xxn2
+ xn1
.
0
0
The function value f (0) is dened twice.
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!

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

p.
p.
p.
p.

156,
160,
162,
162,

ln.
ln.
ln.
ln.

p.
p.
p.
p.
p.

164,
184,
186,
187,
189,

#3
Lemma
Thm
ln. -11
#8

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  , P )
for R(f, P ) write U (F  , P )
b
6
for a f = 4 write 2 f = 4
See instructor for corrected lemma statement and proof.
Proof of theorem still true with corrected lemma statement.
for index i 1 write index i such that 1 i n
for Supose write Suppose

10-12
-2
-8
-8

f (n) (xn )
f (n) (xn )
should appear (n)

g (n) (x0 )
g (xn )

Finder

Date

ME
JD
RM

1 Feb 2010
6 Oct 2005
7 Oct 2005

RM

10 Oct 2005

JD
LF
JF
SH
JD
JF
JD
CB,
BH,

17 Oct 2005
9 Feb 2008
2 Nov 2005
9 Nov 2005
9 Nov 2005
9 Nov 2005
14 Nov 2005
18 Nov 2005

GV
JD

18 Nov 2005

JD
RM
RM
AD
TT

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

KW

30 Nov 2005

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

CS
IB
IB
IB

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

IB
TT
TT
JH
JF

6 Feb 2008
14 Aug 2009
14 Aug 2009
19 Mar 2008
20 Feb 2006

Errata Sheets, cont.


Location
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.
p.

201,
201,
201,
201,
202,
202,
203,
206,
217,
221,
225,
233,
235,

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

Error
4
8
12
-7
-10
-1
10
-1
6
10
-6
2
-9

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

x = 0 write x0 = 0
x = 0 write x0 = 0
x = 0 write x0 = 0
x = 1 write x0 = 1
strictly increasing. . . write strictly decreasing. . .
at x = 0 write at x0 = 0
(x x0 )n write (x x0 )n+1
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 gure: 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.



for
hk (x) write
hk (x)

p. 240, ln. -2

p. 266, ln. 16

for
for
for
for
for
for
for
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

LF
LF
LF
LF
RM
TT
RM
RM
IB
TT
TT
TT
JD

4 Mar 2008
4 Mar 2008
4 Mar 2008
4 Mar 2008
22 Feb 2006
11 Mar 2008
22 Feb 2006
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, u ) and write dist(u, u ) = 0 and


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

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 dened (p. 475)
for in any one of the Pk (J)s write, perhaps,
in all of the corresponding Pk (J)s


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

k=1

p.
p.
p.
p.

Finder

J in P

Mar
Mar
Mar
Mar
Mar

2010
2010
2006
2010
2010

k=0

J in P

Errata Sheets, cont.


Location

Error

p. 479, ln. 19
p. 488, ln. 5
p. 488, ln. -11

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


for =
f, write =
f,

p. 488, ln. -7
p. 489, ln. 6,7
p. 491, ln. 2

p. 493, ln. -15


p. 499, ln. 10
p. 500, ln. 2

Finder

Date

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

26 May 2006
4 Jun 2010
4 Jun 2010

I1

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


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