0% found this document useful (0 votes)
635 views7 pages

Solutions Manual Introduction To Real Analysis Edition by William F Trench Compress

Uploaded by

Aigerim Bolat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
635 views7 pages

Solutions Manual Introduction To Real Analysis Edition by William F Trench Compress

Uploaded by

Aigerim Bolat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Full file at

https://buklibry.com/download/solutions-manual-introduction-to-real-analysis-edition-by-william-f-trench/

Instructor’s Solution Manual

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,

“Uploading or downloading works protected by copyright without the au-


thority of the copyright owner is an infringement of the copyright owner’s
exclusive rights of reproduction and/or distribution. Anyone found to
have infringed a copyrighted work may be liable for statutory damages up
to $30,000 for each work infringed and, if willful infringement is proven
by the copyright owner, that amount may be increased up to $150,000 for
each work infringed. In addition, an infringer of a work may also be li-
able for the attorney’s fees incurred by the copyright owner to enforce his
or her rights.”

Download full file from buklibry.com


Full file at
https://buklibry.com/download/solutions-manual-introduction-to-real-analysis-edition-by-william-f-trench/

Contents

Chapter 1 The Real Numbers 1

1.1 The Real Number System 1


1.2 Mathematical Induction 4
1.3 The Real Line 13

Chapter 2 Differential Calculus of Functions of One Variable 17

2.1 Functions and Limits 17


2.2 Continuity 24
2.3 Differentiable Functions of One Variable 30
2.4 L’Hospital’s Rule 36
2.5 Taylor’s Theorem 43

Chapter 3 Integral Calculus of Functions of One Variable 53

3.1 Definition of the Integral 53


3.2 Existence of the Integral 56
3.3 Properties of the Integral 61
3.4 Improper Integrals 66
3.5 A More Advanced Look at the Existence
of the Proper Riemann Integral 77

Chapter 4 Infinite Sequences and Series 79

4.1 Sequences of Real Numbers 79


4.2 Earlier Topics Revisited With Sequences 87
4.3 Infinite Series of Constants 89
4.4 Sequences and Series of Functions 100
4.5 Power Series 107

Download full file from buklibry.com


Full file at
https://buklibry.com/download/solutions-manual-introduction-to-real-analysis-edition-by-william-f-trench/

Chapter 5 Real-Valued Functions of Several Variables 116

5.1 Structure of Rn 116


5.2 Continuous Real-Valued Function of n Variables 121
5.3 Partial Derivatives and the Differential 123
5.4 The Chain Rule and Taylor’s Theorem 130

Chapter 6 Vector-Valued Functions of Several Variables 141

6.1 Linear Transformations and Matrices 141


6.2 Continuity and Differentiability of Transformations 146
6.3 The Inverse Function Theorem 152
6.4 The Implicit Function Theorem 160

Chapter 7 Integrals of Functions of Several Variables 170

7.1 Definition and Existence of the Multiple Integral 170


7.2 Iterated Integrals and Multiple Integrals 187
7.3 Change of Variables in Multiple Integrals 207

Chapter 8 Metric Spaces 217

8.1 Introduction to Metric Spaces 217


8.2 Compact Sets in a Metric Space 224
8.3 Continuous Functions on Metric Spaces 226

Download full file from buklibry.com


Full file at
https://buklibry.com/download/solutions-manual-introduction-to-real-analysis-edition-by-william-f-trench/

Section 1.1 The Real Number System 1

CHAPTER 1
THE REAL NUMBERS

1.1 THE REAL NUMBER SYSTEM

1:1:1. Note that ja bj D max.a; b/ min.a; b/.


(a) a C b C ja bj D a C b C max.a; b/ min.a; b/ D 2 max.a; b/.
(b) a C b ja bj D a C b max.a; b/ C min.a; b/ D 2 min.a; b/.
ˇ ˇ
(c) Let ˛ D aCbC2cCja bjCˇaCb 2cCja bjˇ. From (a), ˛ D 2 Œmax.a; b/ C c C j max.a; b/ cj Ddf
ˇ. From (a) with a and b replaced by max.a; b/ and c, ˇ D 4 max .max.a; b/; c/ D
4 max.a; b; c/.
ˇ ˇ
(d) Let ˛ D aCbC2c ja bj ˇaCb 2c ja bjˇ. From (b), ˛ D 2 Œmin.a; b/ C c j min.a; b/ cj Ddf
ˇ. From (a) with a and b replaced by min.a; b/ and c, ˇ D 4 min .min.a; b/; c/ D
4 min.a; b; c/.
1:1:2. First verify axioms A-E:
Axiom A. See Eqns. (1.1.1) and (1.1.2).
Axiom B. If a D 0 then .a C b/ C c D b C c and a C .b C c/ D b C c, so .a C b/ C
c D a C .b C c/. Similar arguments apply if b D 0 or c D 0. The remaining case is
a D b D c D 1. Since .1 C 1/ C 1 D 0 C 1 D 1 and 1 C .1 C 1/ D 1 C 0 D 1, addition
is associative. Since

0; unless a D b D c D 1;
.ab/c D a.bc/ D
1; if a D b D c D 1;

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.

Download full file from buklibry.com


Full file at
https://buklibry.com/download/solutions-manual-introduction-to-real-analysis-edition-by-william-f-trench/

Section 2.5 Taylor’s Theorem 47

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

Download full file from buklibry.com


Full file at
https://buklibry.com/download/solutions-manual-introduction-to-real-analysis-edition-by-william-f-trench/

Section 4.3 Infinite Series of Constants 97

.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

Let nk be the smallest integer such that


mk nk
X X
nk > nk 1 and ˛i ˇj  : .B/
i D1 j D1

Then (A) implies that lim Bn D 1. Since nk is the smallest integer for which (B) holds,
n!1

 ˇnk < Bmk Cnk  ; k  2: .C/

Since bn < 0 if mk C nk 1 < n  mk C nk ,

Bmk Cnk  Bn  Bmk Cnk 1


; mk C nk 1  n  mk C nk : .D/

Since bn > 0 if mk C nk < n  mkC1 C nk ,

Bmk Cnk  Bn  BmkC1 Cnk ; mk C nk  n  mkC1 C nk : .E/

From the first inequalities in (C), (D), and (E),

Bn   ˇnk ; mk C nk 1  n  mkC1 C nk : .F/

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

Download full file from buklibry.com


Full file at
https://buklibry.com/download/solutions-manual-introduction-to-real-analysis-edition-by-william-f-trench/

Section 7.2 Iterated Integrals and Multiple Integrals 197

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

(A) implies that


Z b Z ! s Z
r X Z !
d X xi yj
f .x; y/ dy dx  f .x; y/ dy dx: .B/
a c i D1 j D1 xi 1 yj 1

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

Download full file from buklibry.com

You might also like