Real Analysis

Cauchy Sequence

(aₙ) is Cauchy iff for every ε > 0, ∃N: |aₘ − aₙ| < ε for all m, n ≥ N

A Cauchy sequence is one whose terms grow arbitrarily close together: for every ε > 0, there exists N such that |aₘ − aₙ| < ε for all m, n ≥ N. Named after Augustin-Louis Cauchy (1821, Cours d'analyse). The defining property of a complete space is that every Cauchy sequence converges. ℝ is complete (Bolzano-Weierstrass theorem); ℚ is not (the sequence 3, 3.1, 3.14, … is Cauchy in ℚ but its limit π is not in ℚ). Completing a metric space by adding limits of Cauchy sequences gives the construction of ℝ from ℚ, of p-adic numbers ℚₚ from ℚ, and of L² from continuous functions in functional analysis.

  • Definition|aₘ − aₙ| < ε ∀m,n ≥ N
  • AuthorCauchy 1821
  • ℝ is completeyes
  • ℚ is not completeπ example
  • Completionadd Cauchy limits
  • L² spacecompletion of continuous fn

Watch the 60-second explainer

A condensed visual walkthrough — narrated, captioned, under a minute.

Why Cauchy sequences matter

  • Foundation of ℝ. The reals are constructed as equivalence classes of rational Cauchy sequences — without Cauchy, irrational limits don't exist.
  • Convergence without a limit. Prove a sequence converges before knowing what it converges to — the standard tactic in ODE existence proofs and fixed-point iteration.
  • Banach space theory. A normed vector space is complete (Banach) iff every Cauchy sequence converges; foundational to functional analysis.
  • p-adic numbers. ℚₚ is the Cauchy completion of ℚ under |·|ₚ — opens number theory's most fertile non-archimedean toolset.
  • L² and Lebesgue spaces. L²([0,1]) is the completion of continuous functions under the integral norm; foundational for Fourier and quantum mechanics.
  • Picard-Lindelöf. The contraction mapping theorem proves ODE solutions exist by showing successive approximations form a Cauchy sequence in a Banach space.
  • Numerical analysis. An iterative algorithm terminates in finite digits because successive approximations form a Cauchy sequence — practical convergence test.

Common misconceptions

  • Cauchy ⇔ convergent. Equivalence holds only in complete spaces. In ℚ, Cauchy without rational limit is the rule for irrational targets.
  • Any sequence converges. No — only Cauchy sequences in a complete space; (−1)ⁿ is bounded but not Cauchy and doesn't converge.
  • Cauchy needs an explicit limit. The whole point is no limit appears in the definition — that's why it works for proving existence of new limits.
  • Term-to-term differences →0 suffices. No: |aₙ₊₁ − aₙ| → 0 doesn't imply Cauchy. The harmonic sequence Hₙ = 1 + 1/2 + … + 1/n has Hₙ₊₁ − Hₙ = 1/(n+1) → 0 but Hₙ → ∞.
  • Cauchy sequences are bounded — irrelevant. Boundedness is not optional but a direct consequence: it's the key step to invoking Bolzano-Weierstrass.
  • Completeness is automatic. No — every metric space has a unique completion, and many natural ones (ℚ, polynomials with sup-norm, continuous functions with L² norm) are incomplete.

Frequently asked questions

Why is the Cauchy criterion useful for proving convergence?

It lets you prove a sequence converges without first knowing the limit. The standard ε-N convergence definition requires |aₙ − L| < ε — but L is exactly what you don't know in advance. Cauchy replaces the unknown L with a comparison between two sequence terms |aₘ − aₙ| < ε, both of which exist as soon as the sequence does. In ℝ (and any complete space), Cauchy implies convergent, so you get convergence for free once you verify mutual closeness. This is the standard tool for showing series converge, integrals exist, and fixed-point iterations terminate.

What is a complete metric space?

A metric space (X, d) is complete if every Cauchy sequence in X converges to a point of X. ℝ is complete — a foundational fact often taken as the defining axiom of the real numbers. ℂ is complete. Any closed subset of a complete space is complete. Banach spaces are complete normed vector spaces; Hilbert spaces are complete inner-product spaces. Incompleteness is the absence of certain limits: ℚ is not complete because some Cauchy sequences (like rational approximations of π or √2) have limits that aren't rational.

How is ℝ constructed from ℚ via Cauchy sequences?

Take the set of all Cauchy sequences of rational numbers. Declare two sequences (aₙ), (bₙ) equivalent when (aₙ − bₙ) → 0. The equivalence classes form ℝ — each real number is identified with the set of all rational Cauchy sequences that should converge to it. Addition and multiplication descend term-by-term to operations on classes. The completeness of ℝ follows by construction: any Cauchy sequence of these classes itself converges to another class. This is one of two standard constructions; the other is Dedekind cuts. The Cauchy construction generalizes: completing any metric space by adding equivalence classes of Cauchy sequences yields a complete metric space containing the original densely.

Why is the Bolzano-Weierstrass theorem equivalent?

Bolzano-Weierstrass says every bounded sequence in ℝⁿ has a convergent subsequence. Combined with the fact that Cauchy sequences are bounded, this lets you extract a convergent subsequence from any Cauchy sequence. Once one subsequence converges, the Cauchy property forces the whole sequence to converge to the same limit. This is the standard short proof that ℝⁿ is complete. In abstract metric spaces, Bolzano-Weierstrass (sequential compactness of bounded closed sets) and completeness become independent properties.

What's the difference between Cauchy and convergent in general spaces?

Convergent always implies Cauchy: if aₙ → L, then |aₘ − aₙ| ≤ |aₘ − L| + |L − aₙ| can be made arbitrarily small by triangle inequality. The reverse holds only in complete spaces. In ℚ, the rational truncations of π form a Cauchy sequence (terms are eventually within 10⁻ᵏ) but no rational number serves as their limit — convergence fails. In a general metric space, the existence of "holes" where Cauchy sequences pile up without a limit is what completeness rules out.

How does completion work for general metric spaces?

Given any metric space (X, d), the completion (X̂, d̂) is the unique (up to isometry) complete metric space in which X embeds as a dense subset. Construction mirrors ℝ-from-ℚ: take Cauchy sequences in X, identify those that should have the same limit, define distance between equivalence classes as the limit of pairwise distances. Examples: ℂ((t)) (formal Laurent series) is the completion of ℂ[t, t⁻¹] under a t-adic metric; the p-adic numbers ℚₚ are the completion of ℚ under the p-adic absolute value; L²([0,1]) is the completion of continuous functions under the L² norm.