Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Monotone sequences and Cauchy sequences
Get link
Facebook
X
Pinterest
Email
Other Apps
-
Deciding whether a given sequence \(\{a_n\}\) converges or diverges is usually very difficult. Sometimes it is possible to decide if a sequence converges without knowing its limit explicitly if certain conditions are met.
This sequence is monotone decreasing but it cannot be arbitrarily small because it is also bounded below. Therefore it must converge to some number (namely \(\sqrt{2}\) in this case). That such a real number exists is guaranteed by the continuity of real numbers. □
The observation in the above example can be generalized.
Theorem (Monotone convergence theorem)
Any bounded monotone sequence converges.
Proof. Suppose \(\{a_n\}\) is a bounded monotone increasing sequence. Then the set \(S = \{a_n\mid n\in\mathbb{N}\}\) is bounded above so that its supremum \(\alpha\) exists. For any \(\varepsilon > 0\), \(\alpha - \varepsilon\) is not an upper bound of \(S\) so there exists \(N\in\mathbb{N}\) such that \(\alpha - \varepsilon < a_N\). Since \(\{a_n\}\) is monotone increasing, for all \(n\geq N\), \(a_n \geq a_N > \alpha - \varepsilon\). Since \(\alpha\) is the supremum of \(\{a_n\}\), we have \(a_n \leq \alpha < \alpha + \varepsilon\). Thus we have \(\alpha -\varepsilon < a_n < \alpha + \varepsilon\) or \(|a_n -\alpha| < \varepsilon\) for all \(n\geq N\). Hence \(\lim_{n\to\infty}a_n = \alpha\).
We can prove similarly for the case of a bounded monotone decreasing sequence. ■
Definition (Cauchy sequence)
The sequence \(\{a_n\}\) is said to be a Cauchy sequence if and only if the following condition is met.
For any \(\varepsilon > 0\), there exists \(N\in\mathbb{N}\) such that for any \(k, l\geq N\), \(|a_k - a_l| < \varepsilon\).
Or, in a logical form,
\[\forall \varepsilon > 0, \exists N\in\mathbb{N}, \forall k,l\in\mathbb{N} ~ (k, l \geq N \implies |a_k - a_l| < \varepsilon).\]
Theorem
Any convergent sequence is a Cauchy sequence.
Proof. Suppose \(\lim_{n\to\infty}a_n = \alpha\). For any \(\varepsilon > 0\), there exists \(N\in\mathbb{N}\) such that for all \(k,l \geq N\),
\(2\varepsilon\) is an arbitrary positive real number. Therefore, \(\{a_n\}\) is a Cauchy sequence. ■
The converse is also true, but the proof is beyond the scope of this lecture.
Theorem
Any Cauchy sequence converges.
Corollary
A sequence converges if and only if it is a Cauchy sequence.
For later convenience, we provide the following theorem without proof.
Theorem (Bolzano-Weierstrass Theorem)
Let \(\{a_n\}\) be a sequence such that \(a_n \in [c, d]\) for all \(n\in\mathbb{N}\). Then there exists a subsequence \(\{a_{n_k}\}\) of \(\{a_n\}\) that converges to a value in the closed interval \([c,d]\).
Proof. Exercise. (Hint: use the squeeze theorem) ■
Open sets In \(\mathbb{R}\), we have the notion of an open interval such as \((a, b) = \{x \in \mathbb{R} | a < x < b\}\). We want to extend this idea to apply to \(\mathbb{R}^n\). We also introduce the notions of bounded sets and closed sets in \(\mathbb{R}^n\). Recall that the \(\varepsilon\)-neighbor of a point \(x\in\mathbb{R}^n\) is defined as \(N_{\varepsilon}(x) = \{y \in \mathbb{R}^n | d(x, y) < \varepsilon \}\) where \(d(x,y)\) is the distance between \(x\) and \(y\). Definition (Open set) A subset \(U\) of \(\mathbb{R}^n\) is said to be an open set if the following holds: \[\forall x \in U ~ \exists \delta > 0 ~ (N_{\delta}(x) \subset U).\tag{Eq:OpenSet}\] That is, for every point in an open set \(U\), we can always find an open ball centered at that point, that is included in \(U\). See the following figure. Perhaps, it is instructive to see what is not an open set. Negating (Eq:OpenSet), we have \[\exists x \in U ~ \forall \delta > 0 ~ (N_{\delta}(x) \not
We would like to study multivariate functions (i.e., functions of many variables), continuous multivariate functions in particular. To define continuity, we need a measure of "closeness" between points. One measure of closeness is the Euclidean distance. The set \(\mathbb{R}^n\) (with \(n \in \mathbb{N}\)) with the Euclidean distance function is called a Euclidean space. This is the space where our functions of interest live. The real line is a geometric representation of \(\mathbb{R}\), the set of all real numbers. That is, each \(a \in \mathbb{R}\) is represented as the point \(a\) on the real line. The coordinate plane , or the \(x\)-\(y\) plane , is a geometric representation of \(\mathbb{R}^2\), the set of all pairs of real numbers. Each pair of real numbers \((a, b)\) is visualized as the point \((a, b)\) in the plane. Remark . Recall that \(\mathbb{R}^2 = \mathbb{R}\times\mathbb{R} = \{(x, y) | x, y \in \mathbb{R}\}\) is the Cartesian product of \(\mathbb{R}\) with i
We can use multiple integrals to compute areas and volumes of various shapes. Area of a planar region Definition (Area) Let \(D\) be a bounded closed region in \(\mathbb{R}^2\). \(D\) is said to have an area if the multiple integral of the constant function 1 over \(D\), \(\iint_Ddxdy\), exists. Its value is denoted by \(\mu(D)\): \[\mu(D) = \iint_Ddxdy.\] Example . Let us calculate the area of the disk \(D = \{(x,y)\mid x^2 + y^2 \leq a^2\}\). Using the polar coordinates, \(x = r\cos\theta, y = r\sin\theta\), \(dxdy = rdrd\theta\), and the ranges of \(r\) and \(\theta\) are \([0, a]\) and \([0, 2\pi]\), respectively. Thus, \[\begin{eqnarray*} \mu(D) &=& \iint_Ddxdy\\ &=&\int_0^a\left(\int_0^{2\pi}rd\theta\right)dr\\ &=&2\pi\int_0^a rdr\\ &=&2\pi\left[\frac{r^2}{2}\right]_0^a = \pi a^2. \end{eqnarray*}\] □ Volume of a solid figure Definition (Volume) Let \(V\) be a solid figure in the \((x,y,z)\) space \(\mathbb{R}^3\). \(V\) is sai
Comments
Post a Comment