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 point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed
Statement
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric), let , let and let . Call sequentially closed when every sequence in that converges in has its limit in . Then:
- (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space) if and only if there is a sequence with for every and in (Convergence of a sequence in a metric space: iff in ).
- is 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) if and only if is sequentially closed.
The Axiom of Countable Choice is used, once. The direction of claim 1 that manufactures a sequence out of adherence makes one choice per natural number, and that is exactly (The Axiom of Countable Choice ()). The converse direction, and the direction of claim 2 that goes from closed to sequentially closed, are choice free. This is flagged at the step that spends it.
Facts & Assumptions
Given: A metric space , a subset , a point , and a subset ; for write .
Convergence in : means that for every rational there is with for all , and it is enough to produce such a for every REAL , since below any positive real lies a positive rational (Convergence of a sequence in a metric space: iff in , Limits and Cauchy sequences of reals, The rationals embed densely in the reals, Nonnegativity of a metric is a consequence of the other axioms, not an axiom); and for all , which is the symmetry axiom (M2) (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
The balls , , are open, contain , and form a neighbourhood base at : every open contains one of them (The balls , , form a countable neighbourhood base at , so every metric space is first countable).
Canonical naturals and reciprocals: for naturals one has and hence (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order); and contains , so for every (The natural numbers (von Neumann)).
Countable choice: for a family of nonempty sets there is a function with for every (The Axiom of Countable Choice ()).
The closure is the smallest closed superset, so is closed if and only if (The closure of a nonempty is , equals together with its limit points, and is the smallest closed superset).
Proof
Suppose is a sequence with for every and , and let be an arbitrary real; then there is with for all , so by the symmetry axiom (M2) of [A2] and hence , and since was arbitrary .
Suppose ; then for every the radius is a positive real and is nonempty, so countable choice supplies a sequence with for every .
That sequence converges to : given a real , the ball is open and contains , so there is a natural with ; for every we have , hence and , that is .
If is closed and is a sequence in converging to some , then by step 1.1 applied with , and because is closed; so and is sequentially closed.
Claim 1 holds: step 1.1 gives the implication from a convergent sequence in to adherence, and steps 1.2 and 2.1 give the converse by producing such a sequence.
If is sequentially closed, let ; by claim 1 there is a sequence in converging to , so , whence ; the reverse inclusion always holds, so and is closed.
Claim 2 holds by steps 2.2 and 4.1, and claim 1 by step 3.1.
Remarks
- Where first countability enters. Step 2.1 is the only place, and it uses The balls , , form a countable neighbourhood base at , so every metric space is first countable to convert an arbitrary ball around into one of the countably many balls . Nothing here should be read as saying that sequences describe the closure in a general topological space; the tool that always works there is the net, and that is a later page.
- The indexing is from . The radii used are for , not , precisely because contains here (The natural numbers (von Neumann), Sequences of reals: bounded, eventually, frequently, tails, subsequences) and does not exist. A version of this proof copied from a text that indexes sequences from has to be reindexed, and this is the reindexing.
- The use of choice is not concealed. It enters at exactly one place, namely step 1.2, which makes one selection per natural number, and that is what licenses (The Axiom of Countable Choice ()). Whether some proof in ZF alone reaches the same conclusion for arbitrary metric spaces is a question this library does not settle; what it does is record the assumption at the step that spends it.
Depends on
- The closure of a nonempty $A$ is $\{x : d(x,A) = 0\}$, equals $A$ together with its limit points, and is the smallest closed superset
- Convergence of a sequence in a metric space: $x_k \to x$ iff $d(x_k, x) \to 0$ in $\mathbb{R}$
- The balls $B(x, 1/n)$, $n \ge 1$, form a countable neighbourhood base at $x$, so every metric space is first countable
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- 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
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed
- Open ball, closed ball and sphere in a metric space
- Inverses of positives are positive, and reciprocation reverses order
- Canonical naturals are positive and strictly increasing
- Nonnegativity of a metric is a consequence of the other axioms, not an axiom
- The natural numbers $\mathbb{N}$ (von Neumann)
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- The rationals embed densely in the reals
- Limits and Cauchy sequences of reals
Used by
- x ↦ x + 1/x on [1,∞) strictly decreases every distance and has no fixed point Counterexample
- A Lipschitz function on ℚ extends uniquely to a Lipschitz function on ℝ with the same constant 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
- FALSE: d(fx, fy) < d(x,y) for all x ≠ y on a complete metric space forces a fixed point False statement
- Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and (0,∞) has it without being complete Lemma
- Which results on this page use the order of ℝ and therefore have no general-topological analogue Remark
- 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 subspace of a complete metric space is complete iff it is closed, and a complete subspace of any metric space is closed Theorem
- A uniform limit of continuous functions is continuous, so C(X,Y) is closed in Y^X under the uniform metric 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
- For a map of metric spaces the following agree: ε-δ continuity everywhere, preimages of open sets are open, preimages of closed sets are closed, sequential continuity, and f(overlineA) ⊆ overlinef(A) 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
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 98 results over 28 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
- Closure (topology) (Wikipedia) (standard reference, not scraped)
- Sequentially closed set (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (standard reference, not scraped)
- Axiom of countable choice (Wikipedia) (standard reference, not scraped)
- Sequential space (Wikipedia) (standard reference, not scraped)