Derived Set
BasisPrerequisites
You already know what an accumulation point of a set is: a point that every open neighbourhood of reaches back into the set. Collecting all accumulation points of into a single set gives you the derived set, a compact package of the “limit behavior” of that turns out to be exactly the right tool for characterising closedness and building the closure.
Definition
Let be a topological space and . The derived set of , written , is the set of all accumulation points of :
The derived set is a subset of , but it need not be a subset of , and need not be a subset of .
Examples
Standard topology on
- Let . Then : every point in is touched by in every open neighbourhood, including the endpoints and even though they are not in .
- Let . Then : the only accumulation point is , and .
- Let . Then : every real number is approachable by rationals.
- Let . Then : every integer is isolated (it has a neighbourhood containing no other integer).
Discrete topology
In the discrete topology, every singleton is open, so no point can be an accumulation point of any set. Thus for every .
Finite-complement topology on (Zariski-like)
In the finite-complement topology on — where a set is open iff its complement is finite — the open sets are large. For any infinite set and any , every open set has finite complement, so contains all but finitely many points of , and in particular is infinite. Thus for every infinite .
Properties
Let be a topological space and .
- Monotone: if then . (More points in can only help fill open neighbourhoods.)
- Union: . Every accumulation point of is an accumulation point of or (or both).
- Intersection: , but equality need not hold.
- Derived set of the derived set: , where is the derived set of the derived set. This inclusion says that accumulation points of accumulation points of are themselves either in or accumulation points of .
- is closed (proved below).
The derived set is closed
To see that is always a closed set, you need to show that its complement is open.
Take any point . Since is not an accumulation point of , there exists an open set with — that is, .
Now take any point with . You want to show , i.e., is not an accumulation point of . The open set is a neighbourhood of (since is open and ), and (since ). So .
This shows every has an open neighbourhood contained in , so is open and is closed.
Derived set and closedness
The derived set gives a clean characterisation of closed sets — arguably its most important application:
Theorem. A set is closed if and only if .
Proof sketch. () Suppose is closed, so is open. If then is an open set containing with , so is not an accumulation point of . Hence .
() Suppose . Take any ; then , so there exists open with . Since , this gives , i.e., . So every point of has an open neighbourhood inside , making open and closed.
In plain language: is closed exactly when it already “contains all its own limit behavior” — all the points that accumulates to are already in .
From derived set to closure
The derived set is the key ingredient in the formula for the closure of :
The closure is the smallest closed set containing . Formula says you get it by adjoining to exactly those points outside that accumulates to. You can verify that is closed using the theorem above: , confirming contains its own derived set.
Iterating the derived set (Cantor–Bendixson)
Cantor first introduced the derived set precisely because iterating it reveals structure. Starting from , form , then , and so on. For subsets of , this sequence eventually stabilises (possibly at ) after countably many steps. The Cantor–Bendixson theorem uses this to decompose any closed subset of into a perfect set and a countable set, a result with deep consequences in descriptive set theory.
Summary
- The derived set is the collection of all accumulation points of .
- need not be a subset of , and need not be a subset of .
- is always a closed set.
- is closed if and only if .
- The closure satisfies : you close up a set by adjoining its derived set.
- The derived set is monotone and distributes over unions; iterating it reveals deep structural information (Cantor–Bendixson).