Read topologies, bases and subspaces first. Basic operator statements require no separation axiom. and countable-neighborhood hypotheses are stated only where needed. Sequence selections use the usual ZFC background; no choice-free sequential characterization is asserted.
Motivation
A point may belong to a set without having a neighborhood inside it, or lie outside while every neighborhood meets it. Interior and closure record these different local facts. Boundary detects where both a set and its complement remain visible. Accumulation asks a further question: can the set still be seen after the point itself is removed?
These distinctions matter when changing the surrounding space. The rationals have no interior in the real line but are open in themselves. Their ambient boundary is the whole line, whereas their boundary as the entire rational space is empty. We will derive the formulas rather than transfer ambient pictures without checking the topology.
Definitions
Definition 1.3.1
(Interior, closure and neighborhoods)
For contained in , its interior is the union of all open subsets contained in , and its closure is the intersection of all closed supersets. Thus interior is open and closure is closed. A neighborhood of contains an open set containing .
Definition 1.3.2
(Boundary, density and nowhere dense sets)
The boundary is . is dense when and nowhere dense when is empty. These words concern a specified ambient space.
Definition 1.3.3
(Accumulation points and derived sets)
A point is an accumulation point of if every neighborhood of meets . The set of such points is , its derived set. A point of that is not in is isolated in . A perfect set here means a closed set with no isolated points. means every singleton is closed. First countability means every point has a countable local neighborhood basis, which may be replaced by a nested open basis by finite intersections.
Theorem/proposition
Theorem 1.3.4
(Neighborhood tests and complement duality)
A point lies in exactly when every neighborhood meets . Moreover,
The boundary is closed. is open exactly when it misses its boundary, closed exactly when it contains its boundary, and clopen exactly when its boundary is empty.
Concept lensStructural
Closure as the primary datum
Complement duality lets closure replace the open sets entirely. The operator satisfies , , and . Conversely, every operator on the subsets of obeying these four rules is the closure operator of exactly one topology, whose closed sets are the with . Interior, boundary and density are then computed from the operator alone, which is how the formulas above should be read.
Theorem 1.3.5
(Subspaces and density)
For ,
A set is dense exactly when it meets every nonempty open set. Finite intersections of dense open sets are dense open; neither openness nor finiteness can simply be omitted.
Theorem 1.3.6
(Accumulation, separation and sequences)
In a space is closed. At a first-countable point, closure membership is equivalent to being a limit of a sequence from . If the space is also , belongs to exactly when a sequence of distinct points of , all different from , converges to . Without these hypotheses the corresponding conclusions may fail.
Proof sketch or proof idea
Proof
(Neighborhood tests and complement duality)
If is outside , its complement is an open neighborhood disjoint from . Conversely a neighborhood missing contains an open missing , so the closed set contains and excludes ; is outside . Taking complements gives the interior formula: having a neighborhood inside is exactly failing to be in the closure of its complement. Intersecting the two closures gives the boundary formula. Finally, outside the neighborhood test for closure is identical to the accumulation test, while points already in belong to its closure. Hence .
The two closure sets in the boundary formula make it closed. If is open, misses the boundary; conversely if misses its boundary, lies in and is open. If is closed, contains the boundary; conversely is the union of and the boundary, so containing its boundary makes closed. Combining these gives the clopen assertion. More explicitly, partitions into , its boundary and , three disjoint sets. Boundary membership therefore means both sides are locally unavoidable, rather than belonging to a drawn edge.
Proof
(Subspace formulas and dense open intersections)
An open neighborhood in is intersected with an ambient open set. It meets exactly when that ambient neighborhood meets , proving the closure formula for points of . For interior, is equivalent to ; taking the union of such open gives the stated formula. Apply relative complement duality in to get the boundary formula. In particular relative boundary is contained in , but equality can fail because the relative complement is , not the whole ambient complement.
The dense-set test follows at once from closure: a point outside the closure gives a nonempty open set missing , and any nonempty open set missing excludes each of its points from the closure. If are dense open and is nonempty open, meets ; its intersection with is still nonempty open, so it meets . This proves density of . Induction handles finite intersections; openness is automatic. A merely dense set need not leave an open intersection available for the next step.
Proof
(Derived sets in spaces and sequence selection)
For derived-set closedness suppose is outside . Choose open containing with . For in different from , makes an open neighborhood of disjoint from . Thus is also outside ; already was, so avoids entirely. The complement of is open. The exact use of is removing without losing an open neighborhood.
For first-countable closure choose a nested open basis at . If belongs to , select , possible by the neighborhood test and ordinary countable choice. For every neighborhood , some lies in it and all later lie in , proving convergence. Conversely any convergent sequence from eventually meets every neighborhood, so is in , with no countability assumption needed for this direction.
If is an accumulation point in a first-countable space, at each stage delete the finitely many previously selected points from . This leaves an open neighborhood of because none of those points equals . The accumulation property then supplies a new in that neighborhood and in , different from all earlier points. The nested-basis argument gives convergence. Conversely a sequence of distinct -points converging to eventually meets every neighborhood at a point different from , so belongs to . Repeated copies of a single isolated point would not prove accumulation.
Proof X-ray
Deleting the point is not the same as excluding a neighborhood
Closure asks whether every neighborhood sees . Accumulation asks whether it sees after itself is removed. permits deleting other finitely many points while retaining a neighborhood of , which is what constructs distinct approximants and proves closed. The separation condition enters through that precise local operation.
Worked examples
Worked example 1.3.7
(A boundary can fill the entire ambient space)
For in the real line, both and its complement are dense, so is empty and its boundary is . Thus an arbitrary boundary need not be nowhere dense; it may have full interior. For open or closed sets the situation is different, as an exercise proves. Density also does not survive arbitrary intersections: and its irrational complement are both dense but disjoint.
Worked example 1.3.8
(Relative boundary removes ambient points of approach)
Take , and . Relative interior and closure are both , so relative boundary is empty. Ambient closure and boundary are , whose intersection with is all of . The exact formula instead uses , whose ambient closure is empty. This explains why simply intersecting an ambient boundary with the subspace can be wrong, even when is the whole subspace.
Worked example 1.3.9
(Derived sets distinguish an endpoint from its approximants)
For in , every nonzero member is isolated, while zero is approached by the distinct reciprocals. A point outside has a neighborhood missing because is closed; hence . The singleton's derived set is empty, so is empty. By contrast the full real line is perfect, and has ambient derived set despite not being closed. No isolated points alone does not meet the definition of perfect.
Counterexample mode
Accumulation without a convergent sequence
Claim: in a space every accumulation point of is the limit of a sequence of distinct points of . Let be uncountable with the cocountable topology, whose open sets are the empty set and the complements of countable sets, and fix . Singletons are closed, so is . The set meets every nonempty open set, because such a set has countable complement; hence every neighborhood of meets , and is an accumulation point.
For any sequence in , its range is countable, and the open neighborhood contains and misses every term. No sequence from converges to , distinct or not. What fails is first countability at : given countably many open neighborhoods of , choose outside . Then is an open neighborhood of containing none of them, since each contains . With a countable nested basis at the point, the selection in the proof does produce distinct approximants, which is the corrected statement.
Common mistakes
Common mistake
(A boundary need not be thin)
Boundary is a topological local test, not necessarily a thin curve. For dense sets with dense complement it can be all of . “Nowhere dense” is stronger than having empty interior, because closure is taken first; illustrates the difference.
Common mistake
(Subspace formulas use the relative complement)
Subspace interior need not be ambient interior intersected with . Relative complement must be used in the boundary formula. A set's status changes with the ambient space.
A derived set need not include its source set. Conversely closure may contain isolated source points absent from the derived set. Distinctness matters when using sequences as accumulation witnesses.
Common mistake
(Delete earlier approximants, not the point)
A neighborhood need not be open, but every neighborhood test here can use open neighborhoods because each contains one. In the distinct-sequence construction, delete the previous approximants while retaining ; only then use the accumulation condition to obtain a new point different from . Deleting first would no longer leave a neighborhood of .
Summary
Neighborhood tests give complement duality, boundary formulas and closure as . Subspaces require their own complements. Dense open intersections use an open set at each finite step. and first countability supply the separate deletion and sequence-selection properties needed for the stated accumulation results.
Exercises
Quick check
(Prove closure preserves a finite union and interior preserves a finite intersection. Give a countable-union example where closure does not commute with the union.)
Solution · Answer
A finite union of closed sets is closed, so is a closed superset of ; minimality gives one inclusion, and monotonicity gives the other. Finite intersections of open subsets are open and the same maximality argument gives . For the singleton sets , each is closed, but their union omits the closure point zero. Thus closure of their countable union strictly contains the union of their closures.
Quick check
(Verify the relative interior formula directly and compute it for inside .)
Solution · Answer
For in , a relative open neighborhood inside has the form with ambient open about . This inclusion is equivalent to , precisely the ambient interior test in the formula. When , that union is , so the result is , while the ambient interior of is empty.
Quick check
(Prove the boundary of an open or closed set is nowhere dense. Why does this not apply to every subset?)
Solution · Answer
The boundary of a closed is the closed set . If a nonempty open lay in , it would be an open subset of and hence contained in , contradiction. Thus has empty interior, and as a closed set is nowhere dense. For open , use the closed complement, which has the same boundary. An arbitrary need not be open or closed; has boundary all of and disproves the unrestricted assertion.
Quick check
(Give countably many dense open subsets of whose intersection is empty. Explain why this does not contradict the finite-intersection theorem or the proved Baire theorem.)
Solution · Answer
Enumerate as and take . Each is open because singleton sets are closed, and dense because the rational line has no isolated points. The intersection is empty. Finite intersections still omit only finitely many rationals and are dense. The Baire theorem requires the relevant complete-space or open-complete-subspace hypotheses, which the rational line with its usual metric lacks.
Quick check
(In the indiscrete two-point space , compute the derived set of . Then prove is equivalent to every singleton having empty derived set.)
Solution · Answer
At , deleting leaves no point of , so is not an accumulation point. At its only neighborhood is , which meets , so the derived set is , not closed in this indiscrete topology. In general . If all singleton derived sets are empty, every singleton is closed, giving . Conversely, in a point distinct from has the open neighborhood , while is excluded by the derived-set definition itself. Thus the singleton derived set is empty.