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.
A subspace of a complete metric space is complete iff it is closed, and a complete subspace of any metric space is closed
Statement
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric) and let carry the subspace metric (Isometry, isometric embedding, and the subspace metric on a subset). Then:
- If is complete (Complete metric space: every Cauchy sequence converges in the space), then is closed in (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). No hypothesis on is needed.
- If is complete and is closed in , then is complete.
Consequently, for a complete a subset is complete if and only if it is closed.
Facts & Assumptions
Given: A metric space and a subset with the subspace metric .
Completeness of : every -Cauchy sequence in converges in to a point of (Complete metric space: every Cauchy sequence converges in the space, Cauchy sequence in a metric space).
Completeness of : every -Cauchy sequence in converges in to a point of (Complete metric space: every Cauchy sequence converges in the space).
Distances inside are computed in : for (Isometry, isometric embedding, and the subspace metric on a subset). Hence a sequence in is -Cauchy exactly when it is -Cauchy, and for it converges to in exactly when it converges to in (Cauchy sequence in a metric space, Convergence of a sequence in a metric space: iff in ).
A point lies in if and only if some sequence in converges to it in ; and a subset is closed if and only if every sequence in converging in has its limit in (A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space). The first claim, in the direction that manufactures a sequence, spends the Axiom of Countable Choice (The Axiom of Countable Choice ()).
A convergent sequence in a metric space is Cauchy (Every convergent sequence in a metric space is Cauchy).
Limits in a metric space are unique (A sequence in a metric space has at most one limit).
is closed in if and only if , and always (A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).
Proof
For claim 1, assume [A1] and let ; by [L2] there is a sequence with for every and in .
For claim 2, assume [A2], assume closed, and let be a -Cauchy sequence in ; by [L1] it is -Cauchy in , so by [A2] it converges in to some .
That sequence is -Cauchy by [L3], hence -Cauchy by [L1], since all its terms lie in .
The sequence lies in and converges in , and is closed, so by [L2]; by [L1] the sequence then converges to in , and , so is complete. This is claim 2.
By [A1] it therefore converges in to some , and by [L1] it converges to in as well.
The sequence converges in both to and to , so by [L4]; as was arbitrary, , hence and is closed. This is claim 1.
Claims 1 and 2 hold, by steps 4.1 and 2.2; for a complete they combine into the stated equivalence.
Remarks
- Claim 1 needs nothing about . A complete subspace is closed in whatever ambient metric space it sits in, complete or not, because the argument only compares a limit that exists in with a limit that exists in and uses uniqueness. This is what makes completeness so useful as a hypothesis: it is inherited downward by closed subsets and it forces closedness upward.
- Both directions are genuinely about the metric. closed and complete are hypotheses about ; replacing by a topologically equivalent metric preserves closedness and can destroy completeness (FALSE: completeness of a metric space is determined by its topology), so no reading of this theorem survives the passage to the bare topology.
- Where choice enters. Only in claim 1, and only through A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed, whose forward direction spends (The Axiom of Countable Choice ()) to manufacture a sequence out of adherence. Claim 2 uses the choice-free direction of that theorem.
- The standard application. A closed interval, a closed ball, or any closed subset of is a complete metric space, because is ( and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ). Every appeal to Banach's fixed point theorem on a closed subset of passes through this remark.
Depends on
- Complete metric space: every Cauchy sequence converges in the space
- Isometry, isometric embedding, and the subspace metric on a subset
- A point lies in the closure of $A$ iff some sequence in $A$ converges to it, and a set is closed iff it is sequentially closed
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Cauchy sequence in a metric space
- A sequence in a metric space has at most one limit
- Every convergent sequence in a metric space is Cauchy
- Convergence of a sequence in a metric space: $x_k \to x$ iff $d(x_k, x) \to 0$ in $\mathbb{R}$
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- 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
- 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
- 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
- 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 C¹ map uniformly close to the identity derivative sandwiches a cube between contracted and expanded cubes 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
- Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded Theorem
- If (Y,d) is complete then Y^X is complete in the uniform metric, and so is C(X,Y) Theorem
- The Euclidean inverse function theorem Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 87 results over 14 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)