Kuratowski closure-complement theorem
Problem. Let be a topological space![]()
and a subset of . How many (distinct) sets can be obtained by iteratively applying the closure
![]()
and complement
![]()
operations
![]()
to ?
Kuratowski studied this problem, and showed that at most sets that can be generated from a given set in an arbitrary topological space. This is known as the Kuratowski closure-complement theorem.
Let us examine this problem more closely. For convenience, let us denote be the closure operator:
and the complementation operator:
A set that can be obtained from by iteratively applying and has the form , where is an operator on that is the composition![]()
of finitely many and . In other words, is a word on the alphabet .
First, notice that and . This means that can be reduced (or simplified) to a form such that and occurs alternately.
In addition, we have the following:
Proposition 1.
.
Proof.
For any set in a topological space , is closed, so that is regular closed. This means that . ∎
This means that can be reduced to one of the following cases:
where is the identity operator. As there are a total of 14 combinations![]()
, proving the closure-complement theorem is to exhibit an example. To do this, pick , the real line. Let . In other words, is the union of a real interval
![]()
, a point, a rational interval, and a real interval with a point deleted. Then
-
1.
,
-
2.
,
-
3.
,
-
4.
,
-
5.
,
-
6.
,
-
7.
,
-
8.
,
-
9.
,
-
10.
,
-
11.
,
-
12.
,
-
13.
,
together with , are pairwise distinct sets that can be generated by and .
| Title | Kuratowski closure-complement theorem |
|---|---|
| Canonical name | KuratowskiClosurecomplementTheorem |
| Date of creation | 2013-03-22 17:59:28 |
| Last modified on | 2013-03-22 17:59:28 |
| Owner | CWoo (3771) |
| Last modified by | CWoo (3771) |
| Numerical id | 9 |
| Author | CWoo (3771) |
| Entry type | Theorem |
| Classification | msc 54A99 |
| Classification | msc 54A05 |