
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
The assignment questions for mat 472, a mathematics and statistics course at arizona state university, focused on metric spaces. The assignment includes three problems: proving that the product of two separable metric spaces is separable (problem 1), demonstrating that every totally bounded metric space is separable (problem 2), and showing that a metric space which is not totally bounded contains a sequence with no cauchy subsequence (problem 3). Students are expected to submit their solutions by october 4, 2005.
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

MAT 472 · FALL 2005
Problem 1. Let (E, dE ) and (F, dF ) be separable metric spaces. Prove that (E × F, d) is separable, where d is the metric on E × F defined by
d((e, f ), (e′, f ′)) = max{dE (e, e′), dF (f, f ′)}.
A metric space (E, d) is totally bounded if for each > 0 there exists a finite set F ⊆ E such that E =
p∈F
B(p).
Problem 2. Prove that every totally bounded metric space is separable.
Problem 3 (See Problem III.36). Suppose (E, d) is a metric space which is not totally bounded. Prove that there exists a sequence in E which has no Cauchy subsequence.
Date: September 29, 2005 / Due Date: Tuesday, October 4, 2005. S. Kaliszewski, Department of Mathematics and Statistics, Arizona State University. 1