Chapter 1: Problem 13
Prove: An isolated point of \(S\) is a boundary point of \(S^{c}\).
/*! 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 1: Problem 13
Prove: An isolated point of \(S\) is a boundary point of \(S^{c}\).
All the tools & learning materials you need for study success - in one app.
Get started for free
Find the supremum and infimum of each \(S .\) State whether they are in \(S\). (a) \(S=\left\\{x \mid x=-(1 / n)+\left[1+(-1)^{n}\right] n^{2}, n \geq 1\right\\}\) (b) \(S=\left\\{x \mid x^{2}<9\right\\}\) (c) \(S=\left\\{x \mid x^{2} \leq 7\right\\}\) (d) \(S=\\{x|| 2 x+1 \mid<5\\}\) (e) \(S=\left\\{x \mid\left(x^{2}+1\right)^{-1}>\frac{1}{2}\right\\}\) (f) \(S=\left\\{x \mid x=\right.\) rational and \(\left.x^{2} \leq 7\right\\}\)
Suppose that \(a_{1} \leq a_{2} \leq \cdots \leq a_{n}\) and \(b_{1} \leq b_{2} \leq \cdots \leq b_{n} .\) Let \(\left\\{\ell_{1}, \ell_{2}, \ldots \ell_{n}\right\\}\) be a permutation of \(\\{1,2, \ldots, n\\},\) and define $$ Q\left(\ell_{1}, \ell_{2}, \ldots, \ell_{n}\right)=\sum_{i=1}^{n}\left(a_{i}-b_{\ell_{i}}\right)^{2} $$ Show that $$ Q\left(\ell_{1}, \ell_{2}, \ldots, \ell_{n}\right) \geq Q(1,2, \ldots, n) $$
Let \(P_{n}\) be the proposition that $$ 1+2+\cdots+n=\frac{(n+2)(n-1)}{2} $$ (a) Show that \(P_{n}\) implies \(P_{n+1}\). (b) Is there an integer \(n\) for which \(P_{n}\) is true?
Suppose that \(m\) and \(n\) are integers, with \(0 \leq m \leq n .\) The binomial coefficient \(\left(\begin{array}{l}n \\ m\end{array}\right)\) is the coefficient of \(t^{m}\) in the expansion of \((1+t)^{n} ;\) that is, $$ (1+t)^{n}=\sum_{m=0}^{n}\left(\begin{array}{l} n \\ m \end{array}\right) t^{m} $$ From this definition it follows immediately that $$ \left(\begin{array}{l} n \\ 0 \end{array}\right)=\left(\begin{array}{l} n \\ n \end{array}\right)=1, \quad n \geq 0 $$ For convenience we define $$ \left(\begin{array}{r} n \\ -1 \end{array}\right)=\left(\begin{array}{c} n \\ n+1 \end{array}\right)=0, \quad n \geq 0 $$
Find and prove by induction an explicit formula for \(a_{n}\) if \(a_{1}=1\) and, for \(n \geq 1,\) (a) \(a_{n+1}=\frac{a_{n}}{(n+1)(2 n+1)}\) (b) \(a_{n+1}=\frac{3 a_{n}}{(2 n+2)(2 n+3)}\) (c) \(a_{n+1}=\frac{2 n+1}{n+1} a_{n}\) (d) \(a_{n+1}=\left(1+\frac{1}{n}\right)^{n} a_{n}\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.