Chapter 10: Problem 6
If \(f(x):=1 / x\) for \(x \in[1, \infty)\), show that \(f \notin \mathcal{R}^{*}[1, \infty)\).
/*! 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 10: Problem 6
If \(f(x):=1 / x\) for \(x \in[1, \infty)\), show that \(f \notin \mathcal{R}^{*}[1, \infty)\).
All the tools & learning materials you need for study success - in one app.
Get started for free
(a) If \(\left(f_{k}\right)\) is a bounded sequence in \(\mathcal{M}[a, b]\) and \(f_{k} \rightarrow f\) a.e., show that \(f \in \mathcal{M}[a, b]\). [Hint: Use the Dominated Convergence Theorem.] (b) If \(\left(g_{k}\right)\) is any sequence in \(\mathcal{M}[a, b]\) and if \(f_{k}:=\operatorname{Arctan} \circ g_{k}\), show that \(\left(f_{k}\right)\) is a bounded sequence in \(\mathcal{M}[a, b]\). (c) If \(\left(g_{k}\right)\) is a sequence in \(\mathcal{M}[a, b]\) and if \(g_{k} \rightarrow g\) a.e., show that \(g \in \mathcal{M}[a, b]\).
If \(f, g \in \mathcal{C}\\{a, b]\) and if \(g\) is bounded and monotone, show that \(f g \in \mathcal{L}[a, b]\). More exactly, if \(|g(x)| \leq B\), show that \(\|f g\| \leq B\|f\|\).
Let \(f \in \mathcal{R}^{*}[a, \gamma]\) for all \(\gamma \geq a\). Show that \(f \in R^{*}[a, \infty)\) if and only if for every \(\varepsilon>0\) there exists \(K(\varepsilon) \geq a\) such that if \(q>p \geq K(\varepsilon)\), then \(\left|\int_{\rho}^{q} f\right|<\varepsilon\).
Let \(g_{n}(x):=-1\) for \(x \in[-1,-1 / n)\). let \(g_{n}(x):=n x\) for \(x \in[-1 / n, 1 / n]\) and let \(g_{n}(x):=1\) for \(x \in(1 / n, 1]\). Show that \(\left\|g_{m}-g_{n}\right\| \rightarrow 0\) as \(m, n \rightarrow \infty\), so that the Completeness Theorem \(10.2 .12\) implies that there exists \(g \in \mathcal{L}[-1,1]\) such that \(\left(g_{n}\right)\) converges to \(g\) in \(\mathcal{L}[-1,1]\). Find such a function \(g\).
(a) If \(\dot{\mathcal{P}}\) is a tagged partition of \([a, b]\), show that cach tag can belong to at most two subintervals in \(\dot{\mathcal{P}}\) (b) Are there tagged partitions in which every tag belongs to exactly two subintervals?
What do you think about this solution?
We value your feedback to improve our textbook solutions.