Set operations
I've already told you what the union of two sets is. To remind you, if and are sets, then is the set whose elements are exactly all the elements of together with all the elements of . We established existence of this union set by appealing to the Axiom of Union. Two other basic set operations that you've probably heard about are intersection and set difference/minus . However, these two are a bit different from the union and their existence follows from the Axiom of Comprehension.
means that "every element of is also an element of ", while means "every element of is also an element of and every element of is also an element of " (which is just a reformulation of the Axiom of Extensionality). The empty set is a subset of every set because it has no elements, while we've already explained why .

Let and be two sets. Their intersection should consist exactly of those sets which belong to both and . We can say this also in another way: the elements of the intersection of and are exactly those elements of which are also elements of . Maybe you've caught onto what I'm trying to suggest: the intersection of and is the set
where is the property asserting " belongs to ". We said last time that we can form new sets in this way, so we get basically for free that the intersection exists and is unique, or in other words, it is correctly defined. (Just in case the symbol := confuses you, it means "equal by definition" or "the left side is defined to be the right side".)
The set difference is defined similarly, as it is simply the set of all elements of which are NOT elements of . In mathematical notation,
In both the cases of intersection and difference, we get these sets by shrinking one of the two sets. However, in the case of the union, we needed to increase both sets which appear in the union. This is the reason why we can't use Comprehension to get unions and we need a whole new axiom. That being said, the union is still closely related to intersection and difference, which I'll try to briefly sketch to you.
Before I continue, I need to tell you what is a subset. This should be self-explanatory, but let me say it anyway: " is a subset of " means that every element of is also an element of . Intuitively, is "bigger" in so much that it might contain additional elements to those of . However, note that if , then is also a subset of . The fact that is a subset of is denoted by . Let me list some facts about this relation.
- If
, then . - If
and , then . , but .- In fact, the empty set is a subset of EVERY set.
Now, let's say that is some set that contains everything that we consider relevant for the moment. We'll be interested in subsets of . If and are two such subsets, then there are three operations that we might do with those subsets: we can take , we can take , and we can take . There is also a way to compere these two subsets, since it might be the case that or that or that neither is true. In addition to all this, there are two special subsets of distinguished among the others, namely and . They are special for example in the sense that for all that we are considering, it is true that . In other words, is the smallest set and is the largest set with respect to . There is also a notion of the complement of , which we denote by and define to be the set of all elements of which do not belong to , that is . Here are some pictures that I drew in Paint.

There is a very particular structure corresponding to the situation described above. This structure is called Boolean algebra and its rules say a lot about algebraic connections between the operations . I leave this for the next post.
Comments
Post a Comment