In the set A = ( − ∞ , 0 ) ∪ { 1 } ∪ [ 2 , 3 ) ∪ ( 3 , 4 ] ⊂ R , how many distinct sets ( including A itself ) can be formed using only the closure and complement operations?
Clarification:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Your solution is more general than mine, as the 14-set theorem is what inspired this question!
Relevant wiki: Closed Sets
I will denote "The closure of A" as A and "The complement of A" as R − A
First note that the closure of the closure of a set is equal to the closure of a set (since the closure is itself closed), so applying a closure twice in a row does not produce a new set. Additionally note that the complement of the complement of a set is equal to the original set, so applying a complement twice in a row does not produce a new set either. All distinct sets that we can form can be created by applying the closure and the complement operations alternately.
So, starting with applying a closure and alternating between closure and complement, we have:
Note that applying the closure operation returns us to step 4 after which we will be in an infinite loop, alternating closure and complement.
But we can arrive at a few more sets by starting by taking the complement, and then continuing closure / complement / closure:
Following this, taking a closure will lead to the same set as #6, and we are done.
Note that in LaTeX, the symbol for infinity is ∞ (\infty).
First, if X is one of the sets then its complement X ′ = X is also one of the sets. Therefore we can divide the sets into complementary pairs. This implies that the answer is an even number/
Next, since ( X ′ ) − = ( X ∘ ) ′ , we are essentially allowed to make both closures and interiors of the pairs of sets.
Also, taking two closures successively or two interiors successively has no effect.
Therefore we study the two sequences X , X − , ( X − ) ∘ , ( ( X − ) ∘ ) − , … and X , X ∘ , ( X ∘ ) − , ( ( X ∘ ) − ) ∘ , …
Thus we have X = ⟨ − ∞ , 0 ⟩ ∪ { 1 } ∪ [ 2 , 3 ⟩ ∪ ⟨ 3 , 4 ] ; X − = ⟨ − ∞ , 0 ] ∪ { 1 } ∪ [ 2 , 4 ] ; ( X − ) ∘ = ⟨ − ∞ , 0 ⟩ ∪ ⟨ 2 , 4 ⟩ ; ( ( X − ) ∘ ) − = ⟨ − ∞ , 0 ] ∪ [ 2 , 4 ] ; continuing this does not generate any new sets. And X ∘ = ⟨ − ∞ , 0 ⟩ ∪ ⟨ 2 , 3 ⟩ ∪ ⟨ 3 , 4 ⟩ ; ( X ∘ ) − = ⟨ − ∞ , 0 ] ∪ [ 2 , 4 ] ; but we already generated this set in the first sequence. Therefore these are the five different sets that can be obtained by closure and interior; add their five complements, and everything is also closed under taking complements. Thus the answer is five pairs of two sets, or 1 0 sets.
Problem Loading...
Note Loading...
Set Loading...
Let X be the closure of a set X , and let X ∘ be the interior of the set X . Note that X = X and that ( X ∘ ) ∘ = X ∘ . If we consider the operations of taking the closure and the interior, we can only obtain new sets by applying them alternately.
In addition, if Y = ( X ) ∘ , then ( Y ) ∘ = Y . To see this note that Y is an open set contained in Y , and hence Y ⊆ ( Y ) ∘ . On the other hand Y ⊆ X , so Y ⊆ X , and hence ( Y ) ∘ ⊆ ( X ) ∘ = Y .
Similarly, if Y = X ∘ , then Y ∘ = Y .
Thus there are at most 7 sets that can be formed from any set A by the operations of taking the interior and the closure, namely ( A ∘ ) ∘ , A ∘ , A ∘ , A , A , ( A ) ∘ , ( A ) ∘ If we are allowed to take complements as well, we can also construct the complements of each of these 7 sets, making a total of 1 4 sets in all. Note that the interior of a set is the complement of the closure of the complement of that set, and so being able to take closures and complements allows us to take interiors as well.
However, in this case, while the sets ( A ∘ ) ∘ , A ∘ , A ∘ , A , A are distinct, we see that ( A ) ∘ = ( A ∘ ) ∘ = ( − ∞ , 0 ) ∪ ( 2 , 4 ) ( A ) ∘ = A ∘ = ( − ∞ , 0 ] ∪ [ 2 , 4 ] Thus we can form 5 different sets using the operations of interior and closure. These sets are all bounded above, while their complements are unbounded above. Including complements gives us another 5 sets. Thus we have a total of 1 0 different sets.
The largest number of sets that can be formed is 1 4 . This number can be achieved by starting, for example, with the set A = ( − ∞ , 0 ) ∪ { 1 } ∪ [ 2 , 3 ) ∪ ( 3 , 4 ] ∪ ( ( 5 , 6 ) ∩ Q )