8.11: Exercises
- Page ID
- 101020
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)EXERCISE 8.1. Let \(S\) be the successor function in Definition 8.1. Prove that \[S(\emptyset) \neq \emptyset .\] Prove that for any set \(X\), \[S(X) \neq X .\] EXERCISE 8.2. Prove that no proper subset of \(\mathbf{N}\) (see equation 8.1) is inductive.
EXERCISE 8.3. Let \(\mathcal{F}=\left\{X_{\alpha} \mid \alpha \in Y\right\}\) be a family of inductive sets indexed by \(Y\). Prove that \[\bigcap_{\alpha \in Y} X_{\alpha}\] is inductive.
EXERCISE 8.4. Prove that addition and multiplication in \(\mathbb{N}\) (as formally defined in Section 8.1) are associative, commutative and distributive.
EXERCISE 8.5. Prove that the relation \(\leq\) defined on \(\mathbb{N}\) in Section \(8.1\) is a linear ordering of \(\mathbb{N}\).
EXERCISE 8.6. Prove that addition and multiplication in \(\mathbb{Z}\) (as formally defined in Section 8.2) are associative, commutative and distributive.
EXERCISE 8.7. Prove that the relation \(\leq\) defined on \(\mathbb{Z}\) in Section \(8.2\) is a linear ordering of \(\mathbb{Z}\).
EXERCISE 8.8. Prove that \(\leq\) is a well ordering of \(\mathbb{N}\) but not of \(\mathbb{Z}\) (using the formal definition of the relation).
EXERCISE 8.9. Prove that addition and multiplication in \(\mathbb{Z}\) and the relation \(\leq\) on \(\mathbb{Z}\) extends the operations and relation on \(\mathbb{N}\). Let \(I: \mathbb{N} \rightarrow \mathbb{Z}\) be defined by \[I(n)=[\langle n, 0\rangle] .\] Prove that \(I\) is an injection and that for all \(m, n \in \mathbb{N}\), \[I(m+n)=I(m)+I(n),\] \[I(m \cdot n)=I(m) \cdot I(n)\] and \[m \leq n \Rightarrow I(m) \leq I(n)\] Note that the operations on the left hand sides of equations \(8.24\) and \(8.25\) are defined in \(\mathbb{N}\) and on the right hand side are defined in \(\mathbb{Z}\). Similarly, the antecedent of statement \(8.26\) is defined in \(\mathbb{N}\) and the consequence is defined in \(\mathbb{Z}\).
EXERCISE 8.10. Prove that addition and multiplication \(\mathbb{Q}\) (as formally defined in Section 8.3) are associative, commutative and distributive.
EXERCISE 8.11. Prove that the relation \(\leq\) defined on \(\mathbb{Q}\) in Section \(8.3\) is a linear ordering of \(\mathbb{Q}\).
EXERCISE 8.12. Prove that addition and multiplication on \(\mathbb{Q}\) and the relation \(\leq\) on \(\mathbb{Q}\) extends the operations and relation on \(\mathbb{Q}\). Let \(I: \mathbb{Z} \rightarrow \mathbb{Q}\) be defined by \[I(a)=[\langle a, 1\rangle] .\] Prove that \(I\) is an injection and that for all \(a, b \in \mathbb{Z}\), \[\begin{gathered} I(a+b)=I(a)+I(b) \\ I(a \cdot b)=I(a) \cdot I(b) \end{gathered}\] and \[a \leq b \Rightarrow I(a) \leq I(b)\] Note that the operations on the left hand sides of equations \(8.27\) and \(8.28\) are defined in \(\mathbb{Z}\) and on the right hand side are defined in \(\mathbb{Q}\). Similarly, the antecedent of statement \(8.29\) is defined in \(\mathbb{Z}\) and the consequence is defined in \(\mathbb{Q}\).
EXERCISE 8.13. Prove that every non-zero element of \(\mathbb{Q}\) has a multiplicative inverse in \(\mathbb{Q}\). ExERCISE 8.14. Prove statements (1), (2) and (3) in Section 8.4.
EXERCISE 8.15. Prove Theorem 8.2.
EXERCISE 8.16. Let \(X \subseteq \mathbb{R}, Y \subseteq \mathbb{R}\) and let every element of \(X\) be less than every element of \(Y\). Prove that there is \(a \in \mathbb{R}\) satisfying \[(\forall x \in X)(\forall y \in Y) x \leq a \leq y .\] EXERCISE 8.17. Let \(X \subseteq \mathbb{R}\) be bounded above. Prove that the least upper bound of \(X\) is unique.
EXERCISE 8.18. Let \(X \subseteq \mathbb{R}\) be bounded below. Prove that \(X\) has a greatest lower bound.
EXERCISE 8.19. Only the special case of the Bolzano-Weierstrass Theorem (Theorem 8.6) was proved (where \([b, c]\) is the closed unit interval, \([0,1])\). Generalize the proof to arbitrary \(b, c \in \mathbb{R}\) where \(b \leq c\).
EXERCISE 8.20. Let \(X \subseteq \mathbb{R}\). We say that \(X\) is dense in \(\mathbb{R}\) if given any \(a, b \in \mathbb{R}\) with \(a<b\), there is \(x \in X\) such that \[a \leq x \leq b .\] a) Prove that \(\mathbb{Q}\) is dense in \(\mathbb{R}\).
b) Prove that \(\mathbb{R} \backslash \mathbb{Q}\) is dense in \(\mathbb{R}\).
EXERCISE 8.21. Let \(\left\langle a_{n}\right\rangle\) be an injective sequence. What is the cardinality of the set of all subsequences of \(\left\langle a_{n}\right\rangle\) ? What can you say about the set of subsequences of a non-injective sequence?
EXERCISE 8.22. Let \(s\) be an infinite decimal expansion, and for any \(n \in \mathbb{N}^{+}\), let \(s_{n}\) be the truncation of \(s\) to the \(n^{t h}\) decimal place. Prove that the sequence \(\left\langle s_{n}\right\rangle\) is a Cauchy sequence.
EXERCISE 8.23. Let \(\left\langle a_{n}\right\rangle\) be a convergent sequence and \(\left\langle a_{f(n)}\right\rangle\) be a subsequence of \(\left\langle a_{n}\right\rangle\). Prove that \[\lim _{n \rightarrow \infty} a_{n}=\lim _{n \rightarrow \infty} a_{f(n)} .\] ExERCISE 8.24. Prove the following generalization of the triangle inequality: if the series \(\sum_{n=0}^{\infty} a_{n}\) converges, then \[\left|\sum_{n=0}^{\infty} a_{n}\right| \leq \sum_{n=0}^{\infty}\left|a_{n}\right| .\] EXERCISE 8.25. Let \(f\) be a real function continuous at \(a\), and let \(\left\langle a_{n}\right\rangle\) be a sequence converging to \(a\). Prove that \[\lim _{n \rightarrow \infty} f\left(a_{n}\right)=f(a) .\] ExERCISE 8.26. Give an example of a continuous function on an open interval that achieves its extreme values on the interval. Give an example of a continuous function defined on an open interval that does not achieve its extreme values on the interval.
EXERCISE 8.27. Complete the proof of Theorem \(8.12\) - that is, prove the result for \(f(c)\) a minimum value of \(f\) on \((a, b)\).
EXERCISE 8.28. Prove Corollary 8.15.
EXERCISE 8.29. Prove that any continuous injective real function on an interval is monotonic on that interval.
EXERCISE 8.30. Prove that there is no continuous bijection from \((0,1)\) to \([0,1]\).
EXERCISE 8.31. Prove that every polynomial in \(\mathbb{R}[x]\) of odd degree has at least one real root.
EXERCISE 8.32. Prove that if you have a square table, with legs of equal length, and a continuous floor, you can always rotate the table so that all 4 legs are simultaneously in contact with the floor. (Hint: Apply the Intermediate value theorem to an appropriately chosen function). This is one of the earliest applications of mathematics to coffee-houses.
EXERCISE 8.33. The proof of Proposition 8.16 requires that nonzero real numbers have reciprocals (and hence quotients of real numbers are well-defined). Prove that non-zero real numbers have reciprocals. ExERCISE 8.34. Show that there are exactly 4 order-complete extensions of \(\mathbb{Q}\) in which \(\mathbb{Q}\) is dense.