How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Complete metric space: every Cauchy sequence converges in the space
Definition
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
is complete if every Cauchy sequence in (Cauchy sequence in a metric space) converges to a point of (Convergence of a sequence in a metric space: iff in ).
A subset is called complete when the metric subspace is complete (Isometry, isometric embedding, and the subspace metric on a subset); as always, the metric is part of the data, and is the restriction of to .
The limit is unique when it exists, since limits in a metric space are unique (A sequence in a metric space has at most one limit), so a complete space assigns to each of its Cauchy sequences one point and not a set of points.
Completeness is a property of the pair , not of and not of the topology of . Both quantifiers in the definition are about the metric: the Cauchy condition is stated with distances, and so is convergence. Two metrics on the same set can have the same open sets while exactly one of them is complete, which is the content of FALSE: completeness of a metric space is determined by its topology and its witness. Read the word complete as an abbreviation for complete with respect to this metric, always.
Remarks
- Do not confuse this with Dedekind completeness. The least-upper-bound property of Complete ordered field (least-upper-bound property) is an order condition on an ordered field and is what defines ; the condition here is a metric condition and makes sense in any metric space, with no order in sight. On the first implies the second (The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges, and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ) and the two are not the same statement: the rationals with the usual metric are an ordered field that fails both, while there are complete metric spaces with no field structure at all.
- Every convergent sequence is Cauchy (Every convergent sequence in a metric space is Cauchy), so completeness is exactly the assertion that the two classes of sequences coincide. It is the converse inclusion that carries all the content.
- Three sources of completeness are proved on this page. The real line and are complete ( and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ); a closed subset of a complete space is complete (A subspace of a complete metric space is complete iff it is closed, and a complete subspace of any metric space is closed); and every metric space sits densely and isometrically inside a complete one (Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences).
Depends on
- Cauchy sequence in a metric space
- Convergence of a sequence in a metric space: $x_k \to x$ iff $d(x_k, x) \to 0$ in $\mathbb{R}$
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- A sequence in a metric space has at most one limit
- Isometry, isometric embedding, and the subspace metric on a subset
- Complete ordered field (least-upper-bound property)
Used by
- A uniformly continuous real function on a subset D ⊆ ℝ extends uniquely to a uniformly continuous function on the closure of D Corollary
- The a priori bound d(x^*, xₙ) ≤ qⁿ d(x₁,x₀)/(1-q) and the a posteriori bound d(x^*, xₙ₊₁) ≤ q d(xₙ₊₁,xₙ)/(1-q) Corollary
- On ℕ with d(m,n) = 1 + 1/(m+n) for m ≠ n the sets {n, n+1, …} are nested, closed, bounded and complete with empty intersection Counterexample
- On the positive integers the metrics |m-n| and |1/m - 1/n| both induce the discrete topology, and only the first is complete Counterexample
- The open interval (0,1) is totally bounded and not compact, the cover by the intervals (1/(k+2), 1) having no finite subcover Counterexample
- x ↦ x + 1/x on [1,∞) strictly decreases every distance and has no fixed point Counterexample
- x ↦ x/2 maps (0,1] into itself, is a 1/2-contraction, and has no fixed point Counterexample
- A completion of a metric space: a complete metric space together with an isometric embedding onto a dense subspace Definition
- A Lipschitz function on ℚ extends uniquely to a Lipschitz function on ℝ with the same constant Example
- C([0,1], ℝ) is complete, and on it the uniform metric and the supremum metric induce the same topology Example
- The bounded real-valued functions on a set, with the supremum metric, form a complete metric space Example
- The completion of ℚ under the usual metric is ℝ Example
- The map x ↦ (x + 2/x)/2 is a contraction of [1,2] with fixed point √2, and the a priori bound gives the error after n steps Example
- With the discrete metric d(x,y) = 1 for x ≠ y, a space is compact iff it is totally bounded iff it is finite, and it is complete whatever its size Example
- FALSE: a totally bounded metric space is compact False statement
- FALSE: completeness of a metric space is determined by its topology False statement
- FALSE: d(fx, fy) < d(x,y) for all x ≠ y on a complete metric space forces a fixed point False statement
- FALSE: every Cauchy sequence in a metric space converges False statement
- A sequentially compact metric space is complete, with no choice principle used Lemma
- Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and (0,∞) has it without being complete Lemma
- Completeness belongs to the metric; the topological invariant is complete metrizability, which this page introduces and only a much later page characterises Remark
- A compact metric space is complete and totally bounded, and neither implication uses any choice principle Theorem
- A complete, totally bounded metric space is compact, proved from countable choice used exactly once Theorem
- A completion is unique up to a unique isometry fixing the original space, and uniformly continuous maps into complete spaces extend through it Theorem
- A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point Theorem
- A subspace of a complete metric space is complete iff it is closed, and a complete subspace of any metric space is closed Theorem
- A uniformly continuous map from a dense subspace into a complete metric space extends uniquely to a uniformly continuous map on the whole space Theorem
- An absolutely convergent series in ℝⁿ converges, and every rearrangement converges to the same sum Theorem
- C(K,ℝ) is complete in the supremum metric for every nonempty compact metric space K Theorem
- Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences Theorem
- For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice Theorem
- For n ≥ 1 a sequence in ℝⁿ converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and ℝⁿ is complete in every norm Theorem
- If (Y,d) is complete then Y^X is complete in the uniform metric, and so is C(X,Y) Theorem
- In a complete metric space nested nonempty closed sets whose diameters tend to 0 meet in exactly one point, and this property characterises completeness Theorem
- ℝ and ℝⁿ for n ≥ 1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in ℝ Theorem
- Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 60 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Complete metric space (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (standard reference, not scraped)