The derived set A' of a subset A of a topological space X is the set of all limit (accumulation) points of A: points p such that every neighborhood of p meets A in some point other than p itself. The operation can be iterated transfinitely (Cantor–Bendixson derivative).

Principle

Isolates the purely limit-point part of a set by removing isolated points; successive derivation stratifies a set by Cantor–Bendixson rank and separates perfect from scattered parts.

Demonstration

In R with the standard topology, the derived set of {1/n : n ∈ N} ∪ {0} is {0}; the derived set of Z is empty; applying the derivative transfinitely to a closed set yields its perfect kernel.

Misapplication

Confusing the derived set with closure produces mistakes: a derived point need not belong to the original set, and cl(A) = A ∪ A', so equating A' with cl(A) is wrong.

Consequence

Used correctly it provides the Cantor–Bendixson decomposition of closed sets into a perfect set and a countable scattered remainder and gives ordinal-valued ranks classifying point accumulation complexity.

Reversal

The dual notion is the isolated-point set (A \, A'), the complement within A of its derived points; reversing repeatedly isolates discrete parts instead of limit structure.

Boundary

Valid in any topological space but its behavior depends on separation axioms and local compactness; in coarse topologies many sets may have empty derived set while in perfect spaces A' = A for nonempty closed A.

Semantic Tension

Competes with closure and boundary-related notions: closure adds limit points and original points, boundary compares intersection with complement; derived set strictly captures accumulation behavior, not membership or separation.

Synthesis

The derived set is the operator extracting accumulation points of A; iterating it reveals the stratified limit-point architecture of a set and underlies decompositions into perfect and scattered components.