A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Cauchy Sequences in Metric Spaces

Graduate Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
82topics build on this
365prerequisites beneath it
See this on the map →
The Topology Induced by a MetricCauchy Sequences and Completeness+1 more→→Completeness in Metric SpacesSequential Compactness in Metric Spaces
cauchy-sequences convergence

Core Idea

A sequence (xₙ) is Cauchy if for every ε > 0 there exists N such that d(xₙ, xₘ) < ε for all n,m > N. In ℝ every Cauchy sequence converges (completeness). In ℚ or incomplete spaces, Cauchy sequences may fail to converge. Cauchy sequences measure whether terms 'cluster' without requiring a limit point.

How It's Best Learned

Construct Cauchy sequences in ℚ that converge to irrational limits (e.g., rational approximations to √2). Show that in complete spaces every Cauchy sequence converges, and identify counterexamples in incomplete spaces.

Common Misconceptions

Explainer

You already understand Cauchy sequences in ℝ: a sequence (xₙ) is Cauchy if its terms eventually get arbitrarily close to *each other*, regardless of whether you can name a limit. The key insight is that the Cauchy property is *intrinsic* to the sequence — it doesn't depend on any proposed limit point. This makes it possible to ask whether a sequence is "trying to converge" even in a space where the limit might not exist.

In a metric space (X, d), the same definition applies word-for-word: (xₙ) is Cauchy if for every ε > 0 there exists N such that d(xₙ, xₘ) < ε for all n, m > N. The metric d(xₙ, xₘ) measures the distance between two terms of the sequence using whatever distance function defines your space. In ℝ, d is the usual absolute value, so this recovers the standard definition. But now consider ℚ with the same distance. The sequence 3, 3.1, 3.14, 3.141, 3.1415, … of rational approximations to π is Cauchy in ℚ — the terms get arbitrarily close together — but it does *not* converge in ℚ, because π is not a rational number. The sequence is clustering, but it's clustering around a point that doesn't exist in the space.

This gap between "Cauchy" and "convergent" is the key concept. In ℝ, every Cauchy sequence converges — this is the completeness of the real numbers, and it's essentially the defining property that distinguishes ℝ from ℚ. A metric space is called complete if every Cauchy sequence in it converges to a point within it. Complete spaces have no "holes" where sequences could try to converge but fail. ℝⁿ is complete, as are closed subsets of complete metric spaces. ℚ is not complete; neither is the open interval (0, 1) under the usual metric (the sequence 1/n is Cauchy but converges to 0, which isn't in the space).

The practical importance is that completeness licenses many of the most powerful theorems in analysis and functional analysis — the Banach fixed-point theorem, the open mapping theorem, Baire category theorem — all require complete metric spaces. When you work with function spaces or sequence spaces, checking completeness is often the first step before applying these tools. The Cauchy criterion provides a way to establish convergence without knowing the limit in advance: if you can show a sequence is Cauchy and your space is complete, convergence is guaranteed. This will become essential when you study completeness of metric spaces formally.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Closed Sets in Topological Spaces → Limit Points and Accumulation Points → Convergence of Sequences in Topological Spaces → Cauchy Sequences in Metric Spaces

Longest path: 77 steps · 365 total prerequisite topics

Prerequisites (3)

Leads To (2)