Access over 35 million academic & study documents

Solution To Advanced Calculus Problem Set

Content type
User Generated
Subject
Mathematics
Type
Homework
Rating
Showing Page:
1/14
Question 8.1:
(a) It’s obvious that
n
u
and therefore
lim
n
n
Uu
→
=
is either finite or
−
.
If U is finite, then for
0
, there exists
N
such that
n
U u U
+
for
nN
.
Hence,
implies that
for
nN
. Given
0
and
0m
, there exists
nm
such
that
n
Ua
−
by
sup :
nk
U u a k n =
.Hence, we obtain
limsup
n
n
Ua
→
=
.
If
U =
, then for any , there exists a positive integer N such that as n N,
we have
n
uM−
, which implies that
n
a
M for n N. Hence,
lim
n
n
a
→
= −
That is,
n
a
is not
bounded below. If
n
a
has a finite limit supremum a, then for
0
and
0m
, there exists n > m
such that
n
aa
−
, which contradicts to
lim
n
n
a
→
= −
. Hence,
limsup
n
n
Ua
→
=
.
(b) Similarly
(c) Since
limsup
n
n
Ua
→
=
, we have
For
0
, there exists
N
such that
as
nN
For
0
and
0m
, there exists an integer
( )
P m m
such that
( )
Pm
Ua
−
Hence,
( )
Pm
a
is a convergent subsequence of
n
a
that converges to U.
Similarly for the case of V.
(d) For
0
, there exists a positive integer N
1
such that as n N
1
, we have
, and there
exists
2
N
such that as
2
nN
, we have
n
Ua
−
. Therefore, for
( )
12
max ,n N N
, we have
n
U a U

+
. That is,
n
a
converges with limit u. Hence, every subsequence of
n
a
converges
to U.
Question 8.4:
We first prove
1
limsup limsup
n
n
n
nn
n
a
a
a
+
→ →

Sign up to view the full document!

lock_open Sign Up
Showing Page:
2/14
Assume
1
limsup
n
n
n
a
a
a
+
→
=
, where
a
is finite (if
a = +
then the inequality is trivial). For
0
, there
exists
N
such that
1n
n
a
a
a
+
+
for
nN
, which implies that
( )
k
N k N
a a a
+
+
, where k = 1, 2,
Hence,
( )
k
Nk
N k N k
N k N
a a a
+
++
+
+
, which gives
( )
limsup limsup
k
Nk
N k N k
N k N
kk
a a a a

+
++
+
→ →
+ = +
Therefore,
limsup
Nk
Nk
k
aa
+
+
→
So, we finally have,
1
limsup limsup
n
Nk
Nk
kn
n
a
aa
a
+
+
+
→ →
=
Similarly for proving
1
liminf liminf
n
n
n
nn
n
a
a
a
+
→ →
.
Question 8.5:
We have
( ) ( ) ( ) ( )
1
1
1 / 1 ! 1 / ! 1
1
1
/ ! / !
n n n
n
n
n n n
n
n n n n n
a
a n n n n n n
+
+
+ + + +

= = = = +


Hence,
1
1
lim lim 1
n
n
nn
n
a
e
an
+
→ →

= + =


By Exercise 8.4, we have
( ) ( )
( )
11
1/ 1/
1/
liminf liminf limsup limsup
liminf limsup
!!
lim
!
nn
nn
nn
n n n n
nn
nn
nn
n
n
aa
aa
aa
nn
ee
nn
n
ee
n
++
→ → →
→ →
→
which can be used to conclude
( )
1/
lim
!
n
n
n
e
n
→
=
, as desired.

Sign up to view the full document!

lock_open Sign Up
Showing Page:
3/14

Sign up to view the full document!

lock_open Sign Up
End of Preview - Want to read all 14 pages?
Access Now
Unformatted Attachment Preview
Question 8.1: (a) It’s obvious that u n and therefore U  lim un is either finite or  . n  If U is finite, then for   0 , there exists N  such that U  un  U   for n  N . Hence, un  U   implies that an  U   for n  N . Given    0 and m  0 , there exists n  m such that U     an by U  un  sup ak : k  n .Hence, we obtain U  lim sup an . n  If U   , then for any , there exists a positive integer N such that as n ≥ N, we have un   M , which implies that an ≤ −M for n ≥ N. Hence, lim an   That is, an  is not n  bounded below. If an  has a finite limit supremum a, then for   0 and m  0 , there exists n > m such that an  a   , which contradicts to lim an   . Hence, U  lim sup an . n  n  (b) Similarly (c) Since U  lim sup an , we have n  For   0 , there exists N  such that an  U   as n  N For   0 and m  0 , there exists an integer P  m  m such that U    aP m   Hence, aP m  is a convergent subsequence of an  that converges to U. Similarly for the case of V. (d) For   0 , there exists a positive integer N1 such that as n ≥ N1, we have an  U   , and there exists N 2  such that as n  N 2 , we have U    an . Therefore, for n  max  N1 , N2  , we have U  ...
Purchase document to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Anonymous
Excellent! Definitely coming back for more study materials.

Studypool
4.7
Indeed
4.5
Sitejabber
4.4