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.
Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
Definition
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric), let and let . Balls are as in Open ball, closed ball and sphere in a metric space and open sets as 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; recall that a real written as a radius is always .
- is an interior point of if for some . The set of interior points is the interior .
- is an adherent point of if for every . The set of adherent points is the closure .
- is a limit point (accumulation point) of if for every . The set of limit points is the derived set .
- is an isolated point of if and for some .
- The boundary of is .
- is dense in if .
The interior is open, and it is the largest open subset of . If , fix with ; the ball is itself open (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed), so every has some with , which puts in . Hence and is open. It is contained in , since for an interior point ; and if is open then every has a ball inside , so .
Two descriptions of the boundary agree. says that every ball around meets and that no ball around is contained in ; the second half says exactly that every ball around meets . So
from which is immediate.
Elementary containments, straight from the definitions. , because lies in every ; , because a ball meeting meets ; and . A point of is either isolated in or a limit point of , and not both, according to whether some ball meets only in .
Remarks
- The closure is defined here by adherent points and by nothing else. That it is closed, that it is the smallest closed set containing , that for nonempty it is , and that it consists of the limits of sequences from , are theorems (The closure of a nonempty is , equals together with its limit points, and is the smallest closed superset, A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed) and are proved from this definition.
- Limit point of a set is not the same notion as subsequential limit of a sequence (Subsequential limit of a real sequence, and the subsequential limit set), which this library deliberately keeps under a different name: the constant sequence has as a subsequential limit, while its set of values has no limit point at all.
- Dense is relative to the ambient space, and the ambient space is part of the data: is dense in when , with computed in . The same inside a larger space is a different question.
Depends on
- 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
- Open ball, closed ball and sphere in a metric space
- Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
Used by
- A uniformly continuous real function on a subset D ⊆ ℝ extends uniquely to a uniformly continuous function on the closure of D Corollary
- ((0,1)∖ S)×(0,1) is bounded and open, but its boundary has positive Jordan outer content Counterexample
- In {0} ∪ [1,2] with the metric of ℝ, the closure of B(0,1) = {0} is {0} while the closed ball is {0,1} Counterexample
- In the discrete metric the boundary of B(p,1) is empty while the sphere of radius 1 is everything but p Counterexample
- The rational points of [0,1]² form a bounded null set that is not Jordan measurable Counterexample
- The Smith–Volterra–Cantor slab S×[0,1] is compact and not Jordan measurable Counterexample
- A completion of a metric space: a complete metric space together with an isometric embedding onto a dense subspace Definition
- Countably compact, sequentially compact and limit point compact metric spaces Definition
- Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not Definition
- The support of a function on ℝⁿ and its compactly supported Riemann integral Definition
- A Lipschitz function on ℚ extends uniquely to a Lipschitz function on ℝ with the same constant Example
- A nonzero smooth compactly supported bump Example
- An additive f : ℝ → ℝ that is not x ↦ cx: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in ℝ², and every nonempty level set is dense in ℝ Example
- The completion of ℚ under the usual metric is ℝ Example
- The distance from a point to a nonempty compact set is attained at a point of that set, and two disjoint compact sets are at positive distance Example
- The post-office metric d(x,y) = ‖x‖ + ‖y‖ for x ≠ y on ℝⁿ, and its isolated points Example
- FALSE: in every metric space the closure of B(x,r) is the closed ball of radius r False statement
- A compact metric space has a countable dense subset, by countable choice Lemma
- A totally bounded metric space is bounded, every subspace of a totally bounded space is totally bounded, and the closure of a totally bounded subset is totally bounded Lemma
- Which results on this page use the order of ℝ and therefore have no general-topological analogue Remark
- A bounded set in ℝᵐ is Jordan measurable iff its boundary is null, equivalently of content zero Theorem
- A compact metric space is complete and totally bounded, and neither implication uses any choice principle 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 continuous real function on a compact Jordan measurable set is Riemann integrable over that set Theorem
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value Theorem
- 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 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
- Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences 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
- In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle Theorem
- Six regularity conditions each force an additive f : ℝ → ℝ to be x ↦ f(1)x: continuity at a single point, monotonicity on a nondegenerate interval, boundedness above on one, boundedness below on one, constancy of sign on one, and a graph that is not dense in ℝ² Theorem
- 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 Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 21 results over 10 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)
- Interior (topology) (Wikipedia) (standard reference, not scraped)
- Limit point (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (standard reference, not scraped)
- Boundary (topology) (Wikipedia) (standard reference, not scraped)
- Isolated point (Wikipedia) (standard reference, not scraped)