Kuratowski's closure-complement problem
In point-set topology, Kuratowski's closure-complement problem asks for the largest number of distinct sets obtainable by repeatedly applying the set operations of closure and complement to a given starting subset of a topological space. The answer is 14. This result was first published by Kazimierz Kuratowski in 1922. It gained additional exposure in Kuratowski's fundamental monograph Topologie before achieving fame as a textbook exercise in John L. Kelley's 1955 classic, General Topology.
Proof
Letting denote an arbitrary subset of a topological space, write for the closure of, and for the complement of. The following three identities imply that no more than 14 distinct sets are obtainable:- .
- .
- ..
A subset realizing the maximum of 14 is called a 14-set. The space of real numbers under the usual topology contains 14-sets. Here is one example:
where denotes an open interval and denotes a closed interval. Let denote this set. Then the following 14 sets are accessible:
- , the set shown above.
Further results
Regarded as set-valued set functions, the 14 closure-complement operations comprise an operator monoid called the Kuratowski monoid where the monoid product is function composition.
This monoid, which can be used to classify topological spaces based on the quotient they satisfy, has inspired similar classifications in other settings as well.