Math 2.0

statement proposition

Epsilon characterisation of Cauchy sequences

Statement

Let (X,d)(X, d) be a metric space and let (xn)n≥1(x_n)_{n \ge 1} be a sequence in XX. For each N≥1N \ge 1, let TN={xn:n≥N}T_N = \{x_n : n \ge N\}. Then the following two conditions are equivalent:

  1. For each real ε>0\varepsilon > 0 there is an integer NN such that d(xm,xn)<εd(x_m, x_n) < \varepsilon for all m,n≥Nm, n \ge N.
  2. The diameters diam⁡(TN)\operatorname{diam}(T_N) tend to 00 as N→∞N \to \infty.

The sequence (xn)(x_n) is a Cauchy sequence when it satisfies these conditions.

Remarks

Condition 1 is the usual definition of a Cauchy sequence. Each convergent sequence is a Cauchy sequence: if xn→xx_n \to x, then d(xm,xn)≤d(xm,x)+d(x,xn)d(x_m, x_n) \le d(x_m, x) + d(x, x_n). In Q\mathbb{Q} with the usual metric, the decimal approximations 1,1.4,1.41,1.414,…1, 1.4, 1.41, 1.414, \ldots of 2\sqrt{2} form a Cauchy sequence that does not converge in Q\mathbb{Q}. Each Cauchy sequence is bounded.

Explanations

L1 human

The terms of a Cauchy sequence get closer and closer to each other. You can check this without knowing a limit, and this is the point. A Cauchy sequence looks as if it converges. But the space can have no point for it to converge to.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

20 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Cauchy_sequence, In a metric space