Chapter 11: Problem 7
Show that if \(d\) is the discrete metric on a set \(S\), then every subset of \(S\) is both open and closed in \((S, d)\).
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 11: Problem 7
Show that if \(d\) is the discrete metric on a set \(S\), then every subset of \(S\) is both open and closed in \((S, d)\).
All the tools & learning materials you need for study success - in one app.
Get started for free
If \(K_{1}\) and \(K_{2}\) are disjoint nonempty compact sets, show that there exist \(k_{i} \in K_{i}\) such that \(0<\left|k_{1}-k_{2}\right|=\inf \left\\{\left|x_{1}-x_{2}\right|: x_{1} \in K_{i}\right\\}\)
If \(A \subseteq \mathbb{R}\), let \(A^{-}\) be the intersection of all closed sets containing \(A\); the set \(A^{-}\) is called the closure of \(A\). Show that \(A^{-}\) is a closed set, that it is the smallest closed set containing \(A\), and that a point \(w\) belongs to \(A^{-}\) if and ondy if \(w\) is either an interior point or a boundary point of \(A\).
Let \(K \neq \emptyset\) be a compact set in \(\mathbb{R}\). Show that inf \(K\) and sup \(K\) exist and belong to \(K\).
Use the Heine-Borel Theorem to prove the following version of the Bolzano- Weierstrass Theorem: Every bounded infinite subset of \(\mathbb{R}\) has a cluster point in \(\mathbb{R}\). (Note that if a sct has no cluster points, then it is closed by Theorem \(11.1 .8 .\) )
Using the notation of the preceding exercise, let \(A, B\) be sets in \(\mathbb{R}\). Show that we have \(A \subseteq\) \(A^{-},\left(A^{-}\right)^{-}=A^{-}\), and that \((A \cup B)^{-}=A^{-} \cup B^{-}\). Show that \((A \cap B)^{-} \subseteq A^{-} \cap B^{-}\), and give an example to show that the inclusion may be proper.
What do you think about this solution?
We value your feedback to improve our textbook solutions.