
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: REAL ANALYSIS; Subject: Mathematics; University: University of Washington - Seattle; Term: Unknown 1989;
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Problem 1. Let (X, d) be a compact metric space. We denote by C(X) the family of closed subsets of X. For A, B ∈ C(X) define the Hausdorff distance between A and B by,
D[A, B] = sup a∈A
d(a, B) + sup b∈B
d(b, A),
where d(a, B) = inf{d(a, b) : b ∈ B} denotes the distance from the point a to the set B, and d(b, A) = inf{d(b, a) : a ∈ A} the distance of the point b to the set A.
1.1 Show that D defines a metric on C(X).
1.2 Prove that (C(X), D) is a complete metric space.
1.3 Prove that (C(X), D) is totally bounded; that is, for every > 0 there exists a finite cover of C(X) by -balls for the metric D.
Together, these imply that (C(X), D) is a compact metric space.
Let (X, ρ) be a metric space. Let E ⊂ X.
Problem 2. Prove that a nonempty perfect set in Rn^ is uncountable.
Problems from Royden: Chapter 7, Section 4: problems 14, 15.
Chapter 7, Section 5: problem 21. Chapter 7, Section 7: problem 27.