Math 2.0

General topology Proof

Proof of the diameter characterisation of Cauchy sequences

Builds on Metric spaceDiameter of a setSupremum

Proof

We prove each implication. Each TNT_N is nonempty, so its diameter is defined, with a value in [0,∞][0, \infty].

  1. Let (X,d)(X, d) be a metric space, let (xn)n≥1(x_n)_{n \ge 1} be a sequence in XX, and let TN={xn:n≥N}T_N = \set{x_n : n \ge N}.
  2. Assume condition 1. Let ε>0\varepsilon > 0 be real.
  3. By condition 1 applied to ε/2\varepsilon / 2, there is an integer NN with d(xm,xn)<ε/2d(x_m, x_n) < \varepsilon / 2 for all m,n≥Nm, n \ge N.
  4. Let M≥NM \ge N. Two points of TMT_M have the form xmx_m and xnx_n with m,n≥M≥Nm, n \ge M \ge N. So their distance is less than ε/2\varepsilon / 2 by step 3.
  5. So ε/2\varepsilon / 2 is an upper bound of all distances in TMT_M. The supremum is the least upper bound, so diam⁡(TM)≤ε/2<ε\operatorname{diam}(T_M) \le \varepsilon / 2 < \varepsilon.
  6. Step 5 holds for every M≥NM \ge N. Since ε\varepsilon was arbitrary, diam⁡(TN)→0\operatorname{diam}(T_N) \to 0 as N→∞N \to \infty. So condition 2 holds.
  7. Now assume condition 2. Let ε>0\varepsilon > 0 be real.
  8. By condition 2, there is an integer NN with diam⁡(TN)<ε\operatorname{diam}(T_N) < \varepsilon.
  9. Let m,n≥Nm, n \ge N. Then xmx_m and xnx_n lie in TNT_N.
  10. The diameter is an upper bound of the distances in TNT_N. So d(xm,xn)≤diam⁡(TN)<εd(x_m, x_n) \le \operatorname{diam}(T_N) < \varepsilon.
  11. Thus condition 1 holds. By steps 2 to 6 and 7 to 10, the two conditions are equivalent.

Idea

The diameter of a tail is the largest distance between two of its terms, up to a supremum. So "all late terms are within ε\varepsilon of each other" says the same as "some tail has diameter at most ε\varepsilon".

Reading path

To understand this page from the ground up, read these 20 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Element definition
  2. Extended real number line object
  3. Proposition concept
  4. Real numbers object
  5. Set bounded above definition
  6. Set definition
  7. Implication definition
  8. Predicate definition
  9. Supremum definition
  10. Ordered pair definition
  11. Existential quantifier definition
  12. Universal quantifier definition
  13. Cartesian product definition
  14. Subset definition
  15. Uniqueness quantifier definition
  16. Binary relation definition
  17. Function definition
  18. Metric space definition
  19. Diameter of a set definition
  20. Proof of the diameter characterisation of Cauchy sequences proof

Where this leads

522 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Cauchy_sequence, In a metric space
About this page
Tag427P0CRYS4
URIm2://427P0CRYS4
Kindproof
WritingW0 stub
MSC54E35
ProvesEpsilon characterisation of Cauchy sequences
UsesMetric space, Diameter of a set, Supremum
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

No page links to this page yet.