Lesson 16: Unions and Intersections (New from Old)

Let us recall what we’ve done before our detour in lesson 11 into the whacky world of the infinite. We had defined sets in lesson 2 and then realized that a natural idea to consider is a way to “relate” one set to another. I.e., once we define what a set is, we want to know about what kinds of things happened when we have two sets lying around. This motivated our definition of a function in lesson 6, which gives us a precise way of speaking about “associations” between sets. Another natural question to ask about sets is what sort of “sub-structure” they have. In other words, if you hand me a set, are there meaningful ways for me to “deconstruct” it into “smaller” things? This motivated, in a natural way, the definition of a subset that we gave in lesson 3.

These two natural questions to ask about sets carry over to all mathematical structures that one can define. This gives us a very well-defined method of moving forward in mathematics. Once one structure is defined, we can ask about what happens when two (or more) of such structures are around. This will give rise to whatever the analogy of a function is with regard to this new mathematical structure. Moreover, we can also ask what kind of “sub-structures” exist within any such structure. This would be the analog of a subset. Remember that an important quality of a subset is that it is itself a set in its own right. Thus, for any mathematical structure that we define, it is important to know if it allows some kind of sub-structure that mirrors the larger structure (we’ll see more examples of this when we see groups, topological spaces, categories, and almost everything else (although these won’t be for a while)).

Another kind of “natural” question to ask about a given mathematical structure is whether or not we can “build” new structures out of given ones. In other words, if we’re handed two of these structures, can we define a new such structure from what we were given? The answer is almost always yes, and in this lesson we’ll study this question as it pertains to sets. Note that this will in some sense complete the picture of “natural” questions to ask about a given structure. (I keep “natural” in scare quotes because by “natural” I really mean “obvious” and “necessary” in the sense that we need to ask these questions if we’re to ever make progress in studying these structures.) The reason this completes the picture is that once we have defined the structure and asked all of these “natural” questions, we’ll then know how to relate two structures to each other (the analogue of the function), find smaller structures within a structure (the analogue of a subset), and find larger structures from two smaller structures (the analogue of what we’re going to do here). We’ll then know how to relate structures, decompose structures, and build up structures. Given this framework, making progress in studying these structures becomes, well, possible.

Now that we have all of this philosophizing behind us, we can get on with mathematics. We now ask, given two sets A and B, what kind of sets can we derive from A and B? I.e., how can we build a new set from the two old sets A and B? It is this idea that gives this lesson its subtitle.

There are a few definitions that we can make, but the two that we’ll study here are unions and intersections. In short, the union of two sets A and B is the set that is formed by “bringing these sets together”, and the intersection of two sets is formed by considering the parts of the sets that are “the same”. Let us make this a bit more rigorous.

Definition 16.1 Given two sets A and B, the union of A and B is the set that consists of the elements which are either in A or in B. The union of A and B is denoted by {A \cup B}. //

Note that we should really view { A \cup B} as a single symbol representing the set “the union of A and B”, in the exact same way that “A” is a single symbol representing whatever A is. Thus, any element in { A \cup B} is either an element of A or B (or possibly both), and conversely any element in A or B is also an element of {A\cup B}.

Since this is a pretty straightforward and intuitive concept, let me take this opportunity to introduce some more notation that we’ll end up using quite a bit. To denote the fact that some element, call it “a”, is in a set A, we use the symbol “{\in}”. Thus, when I write { a\in A}, we should read it as “a is an element of A”. That’s not so bad.

Another bit of extremely useful notation is that which we use for defining sets. Namely, let’s say I wanted to define a set A by saying that all of the elements in A satisfy some condition. For example, I could define the set of prime numbers greater than 50 and less than 50,000. Well, constantly referring to “the set of prime numbers greater than 50 and less than 50,000” is tiring, and extremely annoying to write down. Thus, we can streamline this phrase as follows: We first let {\mathbb{N}} be the set of positive whole numbers (this is standard notation). Then if A is the set of prime numbers greater than 50 and less than 50,000, we write

{A=\{p\in \mathbb{N} | p \mathrm{\ is\ prime}, 50<p<50,000\}}.

As usual, we’re using the bracket notation {\{\}} to surround the elements of the set, but now we’re actually describing the elements in the set within these brackets. On the left of the vertical line {|} we write which type of objects we’re dealing with–namely, elements in {\mathbb{N}}. Then on the right side of the vertical line we place the desired conditions on the elements in {\mathbb{N}}. The vertical line should be read as “such as”, so that the whole equation reads “A is the set of elements “p” in {\mathbb{N}} such that “p” is prime, and is greater than 50 and less than 50,000”. We’ll get more used to this notation by seeing some more examples. Let us therefore take the example that is appropriate for this lesson.

Using this notation, we can write the union {A \cup B} of two sets {A} and {B} as follows:

{A\cup B = \{a| a\in A \mathrm{\ or \ } a\in B\}}.

This reads “the union of A and B is the set of elements “a” such that “a” is in A, or “a” is in B”. With this notation in hand, I can now define the intersection of two sets very easily.

Definition 16.2 Given two sets {A} and {B}, the intersection (denoted {A \cap B}) of {A} and {B} is the set of elements that are in both {A} and {B}. Namely, {A \cap B = \{a| a\in A \mathrm{\ and \ } a\in B\}}.

Let me end with a couple of remarks, and save some easy examples for the exercises. My first remark is that in order to be completely precise, I really should be using either “{:=}” or “{\equiv}” instead of “{=}” in the above definitions. The reason for this is that the former two symbols (which have the exact same meaning as each other–which to use is simply a matter of taste) are read “is defined to be”, so that whatever appears on the left “is defined to be” whatever appears on the right. This differs from “{=}” because two things can be equal to each other without being “defined to be” equal to each other. For example, if {A\equiv \{p\in \mathbb{N}|5<p<7\}} and {B\equiv \{p\in \mathbb{N}|p=3\times 2\}}, then clearly {A=B} (they’re both the one-element set {\{6\}}), even though they’re defined differently. This might seem a bit pedantic, but it is actually a very nice way to keep the logic within any given argument organized. We’ll see this pop up more and more as we go.

The second and last remark I’ll make is on the importance of the empty set here. Note that if A and B are sets such that at least one of them is not empty, then their union will not be empty. However, it might be the case that the intersection of two non-empty sets is itself empty. For example, the intersection of the sets

\{\mathrm{people\ who\ say\ Lebron\ is \ better\ than\ Kobe}\}

and

\{\mathrm{people\ who\ have\ never\ been\ wrong}\}

is empty, because there is no element that is in both of these sets. Thus, the fact that the empty set is itself a set is essential if we want to speak of intersections of sets in a meaningful way.

Exploring a couple of simple examples of unions and intersections will solidify these ideas pretty quickly.

Exercises

1) How many elements are in the union of the sets {\{1, 2, 3, 4, 7\}} and {\{3, 4, 5\}}? How many are in their intersection?

2) What is the union of the sets {\{p\in \mathbb{N} | p \mathrm{\ is\ even}\}} and {\{p\in \mathbb{N}| p \mathrm{\ is\ a\ multiple\ of\ 4}\}}? What is their intersection?

3) What is the union of any set A with the empty set? What is their intersection?

Solutions to Exercises

Next Lesson

Previous Lesson

Back to Lesson 10

Advertisements

10 Responses to Lesson 16: Unions and Intersections (New from Old)

  1. ahmed says:

    In lesson 2, you said that a set has no structure, while in lesson 16 you described the set as a type of mathematical structures. I am confused about this.

    • That’s a very good point, and perhaps I should have been clearer. What I mean is the following. A set is indeed a mathematical structure, but only in the broadest of sense. Of all mathematical structures, it has in some way the “least” amount of structure. One possible word to use is that a set is a very “flabby” mathematical structure, in the sense that it doesn’t have any internal structure. Almost all other mathematical structures are nothing but sets with a lot of additional structure added to it (so that, for example, a group (which is another kind of mathematical structure which we’ll learn about in lesson 22) is a set with the added structure of being able to combine elements to get other elements. A set has none of this additional structure: it’s just a collection of objects, with no additional information. One possible analogy is to think of painting on a canvas. Most mathematical structures involve the “additional structure” of colors and/or lines and/or shapes on the canvas, whereas a set is nothing but a blank canvas. Thus, it does indeed have some structure, but only very little…

      Does that help at all?

  2. Ahmed says:

    I have another question:
    what is the relation between (unions and intersections) and the logical operators (and , or)?

    • Very good question, as there’s a deep relationship between the two. Let A and B be sets. Then an element is in the union of A and B if it is in the set A or the set B, and an element is the intersection of A and B if it is in the set A and in the set B. Does that make sense?

      • Ahmed says:

        Thanks a lot, That makes sense, of course. Your answer leads to another questions :
        What is the relation between sets and logic?
        Is the usage of logic in math in proofs only?
        What is the logical structure? and what is the difference between logical and mathematical structures?
        I’m asking a lot. ?@_@?

        • Ah, all good questions! These are the types of things that you should continually ponder as you continue to study math, and start to come up with your own conclusions and contribute your own ideas 😉 All I can say is that one needs to try to understand what is even meant by “logic” and “math” in the first place, and I encourage you to form your own ideas on the matter

          • Ahmed says:

            I understand from your reply that the answers of my questions are not found yet. aren’t they? 😉

          • Well I don’t think they are questions that can be answered unambiguously, i.e., I don’t think they have clear cut “once and for all” answers. Rather, it’s more of a philosophical discussion. Best of luck in contributing to it!

  3. Ahmed says:

    thanks to you.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s