Escolar Documentos
Profissional Documentos
Cultura Documentos
RUDIN
DAVID SEAL
Contents
1. The Real and Complex Number System 1
2. Basic Topology 1
3. Numerical Sequences and Series 3
4. Continuity 8
5. Differentiation 10
References 11
Ok, now the real work. But, first a definition. A metric space is
called separable if it contains a countable dense subset. Problem #21
on page 45 asks you to prove that Rk is separable. The second definition
on this page is given in the following problem.
2. Basic Topology
Problem 1 (pg. 45, #23). A collection {Vα } of open subsets of X is
said to be a base for X if the following is true: For every x ∈ X and
every open set G ⊂ X such that x ∈ G, we have x ∈ Vα ⊂ G for some
1
2 DAVID SEAL
because this set has the property that each xi ∈ X1/n is at least 1/n
away from every other point in the set. Therefore, the process of
choosing the xi ’s is a finite
S one for any positive 1/n; we also have
the nice property that k B 1 (xk ) ⊃ X for every positive 1/n, (oth-
n
erwise we would have been able to choose an additional xi ). The set
SOLUTIONS TO SELECTED PROBLEMS FROM RUDIN 3
Solution (Part (1)). Rather than follow the books use of an m < n,
I will choose to fix an m, j ∈ N, and prove this with a m < m + j.
I believe this is much more explicit. Hence, the equation we seek to
prove can be reformulated as
am am+j rm+j
(2) +···+ > 1− .
rm rm+j rm
Since an > 0 for every n, we must have that rn is a decreasing sequence:
rm > rm+i for any i ∈ N. Hence, for any i ∈ N,
rm
(3) > 1.
rm+i
SOLUTIONS TO SELECTED PROBLEMS FROM RUDIN 5
Applying equation (3) a few times, in addition to the fact am+j > 0,
we have that
rm − rm+j = am + · · · + am+j−1
< am + · · · + am+j
rm rm
< am + am+1 + · · · + am+j .
rm+1 rm+j
Whence,
rm+j am am+1 am+j
1− < + +···+ ;
rm rm rm+1 rm+j
N +j
X ak rN +j
>1− ≥ 1/2.
k=N
rk rN
P an
This shows that rn
will never pass the cauchy criterion for conver-
gence, which means it must be divergent.
Solution (Part (2)). We will start by proving the inequality asked for.
The following inequalities each proceed from the previous one:
√ √ 2
0 < ( rn − rn+1 ) ;
√
0 < rn − 2 rn+1 rn + rn+1 ;
√
−rn+1 < rn − 2 rn+1 rn ;
√
rn − rn+1 < 2 (rn − rn+1 rn ) ;
√
an < 2 (rn − rn+1 rn ) .
an √ √
(4) √ < 2 ( rn − rn+1 ) .
rn
6 DAVID SEAL
To
P prove the second part for this question; namely the convergence of
√an , we might ask: what if we add up a bunch of these √an ’s?
rn rn
an an+1 an+j
√ + √ +···+ √
rn rn+1 rn+j
√ √ √ √
< 2 ( rn − rn+1 ) + · · · + ( rn+j − rn+j+1 )
√ √
= 2 rn − rn+j+1
√
< 2 rn .
√
The sequence sn := nk=1 √arkk is bounded above by r1 , and monoton-
P
by excercise 23, this limit exists. Show that the number ∆(P, Q)
is unchanged if {pn } and {qn } are replaced by equivalent se-
quences, and hence that ∆ is a distance function in X ∗ .
(3) Prove that the resulting metric space X ∗ is complete.
**I FIND THIS QUESTION DIFFICULT, AND HAVEN’T
SOLVED IT YET; BUT I HAVE WRITTEN SOME IDEAS
DOWN**
(4) for each p ∈ X, there is a Cauchy sequence all of whose terms
are p; let Pp be the element of X ∗ which contains this sequence.
Prove that
∆(Pp , Qq ) = d(p, q)
for all p, q ∈ X. In other words, the mapping ϕ : X → X ∗
defined by p 7→ Pp is an isometry.
Solution (Part (1)). There are three items we need for an equivalence
relation.
(1) {pn } ∼ {pn } since
lim d(pn , pn ) = lim 0 = 0.
n→∞ n→∞
SOLUTIONS TO SELECTED PROBLEMS FROM RUDIN 7
These values exist (from problem #23), and we desire to show that
a = a′ in order for ∆(P, Q) to be well defined.
Two applications of the triangle inequality give
0 ≤ d(pn , qn ) ≤ d(pn , p′n ) + d(p′n , qn′ ) + d(qn′ , qn ).
Sending n → ∞, we obtain
(5) 0 ≤ a ≤ a′ .
Applying the triangle inequality again:
0 ≤ d(p′n , qn′ ) ≤ d(p′n , pn ) + d(pn , qn ) + d(qn , qn′ );
so sending n → ∞, we obtain
(6) 0 ≤ a′ ≤ a.
Together, (5) and (6) show a = a′ .
Solution (Part (3)). In order to show that X ∗ is complete, we must
show that given a cauchy sequence {Pn } ∈ X ∗ , (under the ∆ metric),
there is a set P ∈ X ∗ such that limn→∞ Pn = P .
Suppose {Pn } ∈ X ∗ is cauchy. For every ǫ > 0 there exists a corre-
sponding N ∈ N such that for every j ∈ N, and every n ≥ N
∆(Pn , Pn+j ) < ǫ.
(n) (n+j)
Refering to the definition for ∆, if {pk } ∈ Pn and {pk } ∈ Pn+j ,
(n) (n+j)
lim d pk , pk = ∆(Pn , Pn+j ) < ǫ.
k→∞
Let’s start by defining P to be the set which would have the desired
property for which Pn 7→ P . Define:
n
(n)
(7) P := {pk }∞ k=1 : ∀ǫ > 0, ∃N ∈ N, ∀n ≥ N, ∃{qk } ∈ Pn ,
o
(n)
lim d pk , qk <ǫ .
k→∞
8 DAVID SEAL
The first task is to show this set is non-empty. To start, there exists
an N1 < N2 such that every n1 ≥ N1 , n2 ≥ N2 ,
∆(Pn1 , Pn1 +j ) < 2−1 ;
(8) ∆(Pn2 , Pn2 +j ) < 2−2 .
In order to fill in the whole sequence, take any p1 , p2 , . . . , pN1 −1 ∈ X.
(j )
According to (8), for N1 ≤ j1 ≤ N2 there are sequences {pk 1 } such
that
(j ) (N )
lim d(pk 1 , pk 1 ) < 2−1 .
k→∞
(N )
For these values, N1 ≤ k ≤ N2 , set pk = pk 1 . We proceed by in-
duction. Let i ∈ N, and suppose pk has been chosen for each k = 1,
2, . . . , Ni . There exists an Ni+1 , Ni < Ni+1 such that
(9) ∆(PNi , Pki ) < 2−(i+1) forNi ≤ ki ;
THIS ISN’T QUITE RIGHT. I’M INDEXING ON THE WRONG
VARIABLE...
The final part (4) will not be proven. We’re taking the limit of a
constant, so ∆(Pp , Qq ) = d(p, q) is obvious. This is pretty cool nonethe-
less! OK - these problems are taking SUPER long to type up. Maybe
I should start defining keyboard macros? Ok, I have a few defined, but
a lot of the keys are already being used...
4. Continuity
Problem 6 (pg. 101 #20). If E is a nonempty subset of a metric
space X, define the distance from x ∈ X to E by
pE (x) := inf (x, z).
d
both of which are closed sets, and fail to meet the criterion displayed
in the problem.
10 DAVID SEAL
5. Differentiation
Problem 8 (pg. 114, #4). If
C1 Cn−1 Cn
C0 + +···+ + ,
2 n n+1
where C0 , C1 , . . . , Cn are real constants, prove that the equation
C0 + C1 x + · · · + Cn−1 xn−1 + Cn xn = 0
has at least one real root between 0 and 1.
Solution. Consider the function, defined by
Z x
F (x) := f (t) dt,
0
where f (x) := C0 + C1 x + · · · + Cn−1xn−1 + Cn xn . Apply the mean
value theorem to F on the interval [0, 1].
Problem 9. Suppose f ′ is continuous on [a, b] and ǫ > 0. Prove that
there exists a δ > 0 such that
f (t) − f (x) ′
t−x − f (x) <ǫ
whenever 0 < |t − x| < δ, a ≤ x ≤ b, a ≤ t ≤ b.
Solution. Let ǫ > 0. As f ′ is a continuous function on a compact set,
f ′ is uniformly continuous. There exists a δ > 0, for every x, y ∈ [a, b],
|f ′ (x) − f ′ (y)| < ǫ if |x − y| < δ. Using this δ, apply the mean value
theorem to the interval [min{t, x}, max{t, x}].
SOLUTIONS TO SELECTED PROBLEMS FROM RUDIN 11
References
[1] Rudin, Walter “Principles of Mathematical Analysis,” McGraw Hill, 1990.