Chapter 12: Problem 20
Prove that a discrete metric space is separable if and only if it is countable.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! 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 12: Problem 20
Prove that a discrete metric space is separable if and only if it is countable.
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Show that a subset \(S\) of a metric space \(M\) is open if and only if \(S\) contains an open neighborhood of each of its points.
Let \(\mathcal{P}\) denote the metric space of all polynomials over \(\mathbb{C}\), with metric $$ d(p, q)=\sup _{x \in[a, b]}|p(x)-q(x)| $$ Is \(\mathcal{P}\) complete?
Prove Minkowski's inequality $$ \left(\sum_{n=1}^{\infty}\left|x_{n}+y_{n}\right|^{p}\right)^{1 / p} \leq\left(\sum_{n=1}^{\infty}\left|x_{n}\right|^{p}\right)^{1 / p}+\left(\sum_{n=1}^{\infty}\left|y_{n}\right|^{p}\right)^{1 / p} $$ as follows: a) Prove it for \(p=1\) first. b) Assume \(p>1\). Show that $$ \left|x_{n}+y_{n}\right|^{p} \leq\left|x_{n}\right|\left|x_{n}+y_{n}\right|^{p-1}+\left|y_{n}\right|\left|x_{n}+y_{n}\right|^{p-1} $$ c) Sum this from \(n=1\) to \(k\) and apply Hölder's inequality to each sum on the right, to get $$ \begin{aligned} &\sum_{n=1}^{k}\left|x_{n}+y_{n}\right|^{p} \\ &\quad \leq\left\\{\left(\sum_{n=1}^{k}\left|x_{n}\right|^{p}\right)^{1 / p}+\left(\sum_{n=1}^{k}\left|y_{n}\right|^{p}\right)^{1 / p}\right\\}\left(\sum_{n=1}^{k}\left|x_{n}+y_{n}\right|^{p}\right)^{1 / q} \end{aligned} $$ Divide both sides of this by the last factor on the right and let \(n \rightarrow \infty\) to deduce Minkowski's inequality.
Let \(M=\\{0,1\\}^{n}\) be the set of all binary \(n\)-tuples. Define a function \(h: S \times S \rightarrow \mathbb{R}\) by letting \(h(x, y)\) be the number of positions in which \(x\) and \(y\) differ. For example, \(h[(11010),(01001)]=3\). Prove that \(h\) is a metric. (It is called the Hamming distance function and plays an important role in the theory of error-correcting codes.)
Let \(1 \leq p<\infty\). a) If \(\boldsymbol{x}=\left(x_{n}\right) \in \ell^{p}\) show that \(x_{n} \rightarrow 0\) b) Find a sequence that converges to 0 but is not an element of any \(\ell^{p}\) for \(1 \leq p<\infty\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.