Combining Interior, Complement, and Closure Operators
From 0506Topology
| # | Week of... | Links (edit) |
|---|---|---|
| Fall | ||
| 1 | Sep 12 | About, Tue, Thu, Std2Disc |
| 2 | Sep 19 | Tue, Thu, HW1, 14 Sets |
| 3 | Sep 26 | Tue, Thu, Photo |
| 4 | Oct 3 | Tue, Thu |
| 5 | Oct 10 | HW2, Tue, Thu |
| 6 | Oct 17 | Tue, Thu, HW3 |
| 7 | Oct 24 | Mon, Tue, Thu |
| 8 | Oct 31 | Tue, Thu, HW4 |
| 9 | Nov 7 | TE1, Tue, Thu |
| 10 | Nov 14 | Tue, Thu, HW5 |
| 11 | Nov 21 | Tue, Thu |
| 12 | Nov 28 | Tue, Thu, HW6 |
| 13 | Dec 5 | Tue, Thu |
| E | Dec 12 | TE2 |
| Spring | ||
| 14 | Jan 9 | Tue, IT83, Thu, HW7 |
| 15 | Jan 16 | Tue, Thu |
| 16 | Jan 23 | Tue, HW8, Thu |
| 17 | Jan 30 | Tue, Thu |
| 18 | Feb 6 | TE3, Tue, Thu |
| 19 | Feb 13 | Tue, Thu |
| R | Feb 20 | |
| 20 | Feb 27 | Tue, Thu, HW9 |
| 21 | Mar 6 | Tue, Thu, HW10 |
| 22 | Mar 13 | Tue, Thu |
| 23 | Mar 20 | Tue, Thu, HW11 |
| 24 | Mar 27 | Tue, Thu |
| 25 | Apr 3 | Tue, Thu, HW12 |
| 26 | Apr 10 | Tue, Thu |
| Study | Apr 17 | Office Hours |
| Exams | Apr 24 | Final, PM |
We have three natural operations on a subset of a space with a topology: interior, closure, and complement. It is a surprising and interesting fact that the number of distinct sets one may produce using these operations on a subset of a topological space is limited. In fact:
Theorem:
- (Kuratowski, 1922) For any given subset A of a topological set, there are, at most, 14 distinct sets that may be constructed by applying any permutation of the interior, closure, and complement operations on A.
- There exists a subset of the real line, with the standard topology, which yields 14 distinct sets when operated on by every permutation of the interior, closure, and complement operations.
Proof of 1:
We will represent the interior, closure, complement operation as
respectively. A composition of operations will be written with the left-most operation to be performed first: i.e. '
' corresponds to the operation
.
We require the following relationships between the operators:
The proof of the first three relations are trivial. The last three are left as an exercise (hint: it may help to begin by proving that
). With these relationships, we may easily reach our result. Consider the below state transition diagram. Each grey box represents a set. If the box is labelled, say, XYZ, the box represents the set A with these operators applied to it: Z(Y(X(A))). Following an arrow labelled X from a state box A leads to another state box which represents the image of the set represented by A under the operator X. A set A upon which no operations have been applied (or alternatively, the complement has been applied twice) starts in state 'nil'. If for any of the three operators under consideration, a state box does not have an arrow leading out labelled as such, it is implied that the operator does not change that set.
A verification of the proof involves checking each arrow (and missing, implied arrow) to ensure that the diagrammatically indicated relationship between the sets at each end of the arrow holds. Only the above listed relationships are needed for this.
There are only 14 states in the diagram and an operator on any one of them again yields one of these 14. Therefore, there are at most 14 distinct sets that may be constructed through the application of the interior, closure, and complement operators to a subset of a topological set.
Proof of 2:
Consider the following set:
One may check explicitly that the images of A under the 14 operators in the above diagram are 14 distinct sets. The sets are graphically depicted below:



