
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 for mat 472, a university-level mathematics course, from the fall 2005 semester. The assignment focuses on problems related to compact sets in metric spaces, including proving that [0, 1] is a compact subset of r, the union of finite compact sets being compact, and showing that every sequentially compact set is compact. Students are expected to submit their solutions by october 11, 2005.
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

MAT 472 · FALL 2005
Also look at: Problems 26–38 from Chapter III of Rosenlicht.
Problem 1 (See Problem III.31). Prove directly that [0, 1] is a compact subset of R as follows: Given an open cover {Uα | α ∈ I} of [0, 1], define
S = {x ∈ (0, 1] | [0, x] ⊆ ∪α∈F Uα for some finite set F ⊆ I},
and show that sup S ∈ S and sup S = 1.
Problem 2 (Problem III.32). Prove that the union of a finite number of compact sets in any metric space is compact.
Problem 3 (Problem III.33). Let S be a sequentially compact set in a metric space (E, d), and let C be an open cover of S. Without assuming that S is compact, show that there exists > 0 such that for each p ∈ S, there exists U ∈ C such that B(p) ⊆ U.
Problem 4. Let S be a sequentially compact set in a metric space (E, d). Use the result of Problem 3 and the fact that every sequentially compact set is totally bounded to prove that S is compact.
Date: October 4, 2005 / Due Date: Tuesday, October 11, 2005. S. Kaliszewski, Department of Mathematics and Statistics, Arizona State University. 1