Solutions Manual Introduction To Real Analysis Edition by William F Trench Compress
Solutions Manual Introduction To Real Analysis Edition by William F Trench Compress
https://buklibry.com/download/solutions-manual-introduction-to-real-analysis-edition-by-william-f-trench/
INTRODUCTION
TO REAL ANALYSIS
William F. Trench
Professor Emeritus
Trinity University
San Antonio, Texas, USA
[email protected]
©Copyright 2009 William F. Trench, all rights reserved
Updated May 2012
No part of this document may be circulated or posted on any website
without the author’s permission. Under US copyright law,
Contents
CHAPTER 1
THE REAL NUMBERS
multiplication is associative.
Axiom C. Since
0; if a D 0;
a.b C c/ D ab C ac D
b C c; if a D 1;
the distributive law holds.
Axiom D. Eqns. (1.1.1) and (1.1.2) imply that 0 and 1 have the required properties.
g.x0 /, Theorem 2.3.14 implies that there is a constant M such jF ˇ n .g.x// Fn .Gn .x//j ˇ
ˇ Fn .g.x// Fn .Gn .x// ˇ
M jg.x/ Gn .x/j for x in some neighborhood of x0. Therefore, ˇˇ ˇ
ˇ
ˇ ˇ .x x0 /n
ˇ g.x/ Gn .x// ˇ
M ˇˇ ˇ; hence (B) lim Fn .g.x// Fn .Gn .x// D 0, since lim g.x/ Gn .x/ D
.x x0 /n ˇ x!x0 .x x0/n x!x0 .x x0 /n
f .g.x// Fn .Gn .x//
0 (Lemma 2.5.2). (A) and (B) imply that lim D 0, and the con-
x!x0 .x x0 /n
clusion follows from Exercise 2.5.8(b).
x2 x4 x3
(b) F4 .x/ D 1 C and G4 .x/x . Forming F4 .G4 .x// and discarding powers
2 24 6
2
x 5x 2
x k with k > 4 yields H4 .x/ D 1 C . Therefore, h0 .0/ D 0, h00 .0/ D 1,
4 24
h000 .0/ D 0, and h.4/ .0/ D 5.
Pn r
2:5:12. (a) With f .y/ D 1=y and y0 D 1, Fn .y/ D r D0 . 1/ .y 1/r . Apply
Exercise 2.5.11(a).
1 1 4 X 4
(b) (i) g.x/ D sin x, so G4 .x/ D 1 x C x . Forming Œ1
2 2 24 2
r D1
k 1 2
G4 .x/r and discarding powers x with k > 4 yields H4 .x/ D 1 C x C
2 2 2
5 4
x , so h0 .=2/ D 0, h00 .=2/ D 1, h000 .=2/ D 0, and h.4/ .=2/ D 5.
24 2
X 4
(ii) g.x/ D 1 C x C x 2, so G4 .x/ D 1 C x C x 2 . Forming Œ1 G4.x/r and discarding
r D1
powers x k with k > 4 yields H4 .x/ D 1 x C x 3 x 4 so h0 .0/ D 1, h00 .0/ D 0,
h000 .0/ D 6, and h.4/ .0/ D 24.
p p
(iii) We first consider h0 .x/ D .sec x/= 2, for which g0 .x/ D 2 cos x, which satisfies
the normalization condition g0 .=2/ D 1. The fourth Talylor polynomial of g0 about
1 2 1 3 1 4
=4 is G4 .x/ D 1 x x C x C x . Forming
4 2 4 6 4 24 4
X 4
k
Œ1 G4 .x/r and discarding powers x with k > 4 yields the fourth Taylor
r D1
4
3 2 11 3 19
polynomial H4 .x/ D 1 C x C x C x C x for
p p 4 2
p 4 6 p 4 8 4p
h= 2, so h0 .=4/ D 2, h00 .=4/ D 3 2, h000 .=4/ D 11 2, and h.4/ .=4/ D 57 2.
X 4
x2 x3 x4
(iv) g.x/ D 1 C log.1 C x/, so G4.x/ D 1 C x C . Forming Œ1 G4.x/r
4 3 4 r D1
k 3 2 7 3 11 4
and discarding powers with k > 4 yields H4 .x/ D 1 xC x x C x , so
2 3 3
h .0/ D 1, h .0/ D 3, h000 .0/ D 14, and h.4/ .0/ D 88.
0 00
(c) Since hg D 1, which is its own Taylor polynomial for every n, Exercise 2.5.10 implies
that Hn Gn D 1C powers of .x x0 / higher than n. However, Hn .x/Gn .x/ D 1 C
.m C 1/ < .j C 1/ if 0 < 2 < < 2; hence, j sin.m C 1/j > sin .
(b) The series converges (Example 4.3.22). To see that it does not converge absolutely,
assume without loss of generality that 0 < 2 < < 2 and use Exercise 4.3.31, with
Bn
an D n p , bn D j sin nj, and wn D n. From (a), lim > 0. Also, an anC1 e
X n!1 n
p.n C 1/ p 1 , so n.an anC1 / D 1.
X1 X1
. 1/nC1 1 1
4:3:33. Insert parentheses: D .
nD1
n mD1
2m 1 2m
X1 X1
bn 1 2 1
4:3:34. Insert parentheses: D C .
n 3m C 1 3m C 1 3m C 3
nD1 mD0
4:3:35. Their partial sums are the same for sufficiently large n.
4:3:36. In all parts we use the notation introduced in the proof for finite and , and
m0 D n0 D 0.
(a) Suppose that k 1. Let mk be an integer such that
mk nk
X X1
mk > mk 1 and ˛i ˇj C k: .A/
i D1 j D1
Then (A) implies that lim Bn D 1. Since nk is the smallest integer for which (B) holds,
n!1
From the second inequality in (C), Bn for infinitely many values of n. However, since
limj !1 ˇj D 0, (F) implies that if > 0, then Bn < for only finitely many values
of n. Therefore, lim Bn D .
n!1
Z Z
3 1 5 1
so f .x; y; ´/ d.x; y/ D ´C and f .x; y; ´/ d.x; y/ D ´C .
e
R 4 2 e
R 4 2
Z 1
(c) f .x; y; ´/ dx D y C ´ for all x;
0
Z y Z 1 ˇ1 Z 1
y2 ˇ 1
dy f .x; y; ´/ dx D .y C ´/ dy D C y´ ˇˇ D C ´I
0 0 0 2 0 2
Z 1 Z y Z 1 Z 1 ˇ
1 ´ ´2 ˇˇ1
d´ dy f .x; y; ´/ dx D C ´ d´ D C D 1:
0 0 0 0 2 2 2 ˇ0
7:2:9. Let a D x0 < x1 < < xr D b and c D y0 < y1 < < ys D b be partitions of
Œa; b and Œc; d .
Z d
(a) From Exercise 3.2.6(a) with g.x/ D f .x; y/ dy,
c
Z Z ! r Z Z !
b d X xi d
f .x; y/ dy dx D f .x; y/ dy dx .A/
a c i D1 xi 1 c
Z d s
X
From Exercise 3.2.6(a) with g.y/ D f .x; y/ (x fixed), f .x; y/ dy D Fj .x/, with
c j D1
Z yj
Fj .x/ D f .x; y/ dy. Since
yj 1
8 9
<Xs
ˇ = s
X ˚ ˇ
inf Fj .x/ ˇ xj 1 x xj inf Fj .x/ ˇ xj 1 x xj ;
: ;
j D1 j D1
Since !
Z xi Z yj
f .x; y/ dy dx mij .xi xi 1 /.yj yj 1/
xi 1 yj 1
with ˚ ˇ
mij D inf f .x; y/ ˇ xi 1 x xi ; yj 1 y yj ;
Z b Z d !
(B) implies that f .x; y/ dy dx is an upper bound for all lower sums of f over
a c
Z
partitions of R D Œa; b Œc; d . Since f .x; y/ d.x; y/ is the supremum of this set,
R
Z Z Z !
b d
f .x; y/ d.x; y/ f .x; y/ dy dx.
R a c