\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Real Limits
Absolute Value
Needed by:
Egoprox Sequences
Links:
Sheet PDF
Graph PDF

Real Egoprox Sequences

Why

In the case that it is not possible to easily identify (or guess) the limit of a sequence, we are naturally interested in a simple condition on the sequence which is equivalent to convergence.

Definition

A sequence $(x_n)_{n \in \N }$ in $\R $ is said to be egopox (or Cauchy or a Cauchy sequence) if for every $\epsilon > 0$, there exists $N \in \N $ so that for all $m, n > N$, $\abs{x_m - x_n} < \epsilon $. We call this property of the sequence (eventual) egoproximity.

Notation

We sometimes denote this property as

\[ \abs{x_n - x_m} \to 0 \quad \text{ as } \quad m, n \to \infty. \]

Examples

For example, consider $\lim_{N \to \infty} \sum_{n = 1}^{N} 1/n^3$.

Sufficiency in $\R $

Clearly a convergent sequence is egoprox.1 What of the converse? Recall that we think of egoprox sequences as “bunching up.” For the reals, if a sequence is bunching up, then our intuition is that it should be converging. In other words, an egoprox real sequence always converges. The egoprox condition is sufficient. Bunching up is sufficient.

If $(x_n)_{n \in \N }$ is egoprox, then there exists $x_0 \in \R $ so that $\lim_{n \to \infty} x_n = x_0$.

In other words, in $\R $ egoproximity is equivalent to convergence. The above is sometimes called the Bolzano-Weierstrass theorem.


  1. Future editions may elaborate here. ↩︎
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view