PrepShorts · Study sheet · Class 11 Mathematics · Chapter 1, Sets
Chapter 1 · Sets
Union and intersection, and what it means for two sets to miss each other entirely
This video could not be loaded. Reload the page to try again.
Sign in with Google15 min.
Keep your place in this chapter — sign in, it’s free.Sign in
Union and intersection are usually taught as two new things a set can do. They are not new and they are not two things: they are the words 'or' and 'and' pointed at a pair of sets, and once you see that, the ten laws you were told to memorise turn into two four-row tables you can rebuild from scratch in your head.
The idea
Union and intersection are the words or and and turned into sets: an object joins the union exactly when the or-question about it is true, and joins the intersection exactly when the and-question is. That is the whole content, and everything else follows from it — a shared element is written once because membership is a verdict with no count attached; both operations are commutative and associative because the connectives are; each is unchanged by repetition; the empty set leaves a union alone and the universe leaves an intersection alone; and two sets are called disjoint precisely when the and-question can never be satisfied.
What you should be able to do
- Form the union and the intersection of two given sets, in roster form
- State each operation in set-builder form and name the connective it encodes
- Explain why an element common to both sets is listed once in the union
- Predict the union and the intersection when one set is contained in the other, and prove the prediction
- State the listed properties of each operation and give the reason for each in terms of its connective
- Decide whether two given sets are disjoint, and justify the verdict
- Apply the distributive law and verify it on given sets
- Interpret a union or intersection in a real context and say what the resulting set means
Words to know
| Term | Definition in one line | First introduced |
|---|---|---|
| union | the set of objects lying in one set or the other or both | printed in this chapter (§1.9.1, p. 14) |
| intersection | the set of objects lying in both sets | printed in this chapter (§1.9.2, p. 15) |
| disjoint sets | two sets whose intersection is empty | printed in this chapter (§1.9.2, p. 15) |
| commutative law | the property that the order of the two sets does not matter | printed in this chapter (§1.9.1, p. 14) |
| associative law | the property that the grouping of three sets does not matter | printed in this chapter (§1.9.1, p. 14) |
| idempotent law | the property that combining a set with itself returns it | printed in this chapter (§1.9.1, p. 15) |
| law of identity element | the property naming the set that leaves the operation's input unchanged | printed in this chapter (§1.9.1, p. 14) |
| distributive law | the property by which intersection spreads across a union | printed in this chapter (§1.9.2, p. 16) |
Where people slip up
- "The union of a four-member set and a four-member set has eight members." Example 12 gives six. Membership is a verdict, not a tally; a shared object is one object.
- "Union means adding the sets." Addition on numbers has no idempotent law; union does, precisely because or repeated is still or.
- "Intersection is the smaller set." It is the set of shared members, which may be smaller than both, or equal to one of them, or empty. Example 17 gives the case where it equals one of them.
- "Disjoint means unequal." It means no shared member. Two unequal sets can overlap heavily.
- "An empty intersection means one of the sets is empty." {2, 4, 6, 8} and {1, 3, 5, 7} are both non-empty and share nothing.
- "The identity element is the same for both operations." The empty set leaves a union alone; the universe leaves an intersection alone. The two swap, and the reason is that or false and and true are the harmless cases.
- "The distributive law works the way it does in arithmetic, so only one version is worth learning." The chapter prints the version where intersection spreads across union and checks it in five panels.
- "Union and intersection can be read off two sets without fixing a universe." For the operations themselves, yes; but the chapter states at the head of §1.9 that every set from there on is taken inside a universe, and the property involving the universe depends on it.
Ask your teacher a person
Your teacher reads this and writes back, usually within a day. For an instant answer, use Ask the video in the sidebar.
Your class sees the question and the answer. Only your teacher sees that it was you.
No questions on this topic yet.
Worked answers: Exercise 1.1 · Exercise 1.2 · Exercise 1.3 · Exercise 1.4 · Exercise 1.5 · Miscellaneous Exercise · this video explains Exercise 1.4 Q1, Exercise 1.4 Q2, Exercise 1.4 Q3, Exercise 1.4 Q4, Exercise 1.4 Q5, Exercise 1.4 Q6, Exercise 1.4 Q7, Exercise 1.4 Q8, Exercise 1.4 Q12, Miscellaneous Exercise Q7, Miscellaneous Exercise Q9
Transcript2,145 words
Add five and thirteen and you get eighteen. Multiply the same two and you get sixty five. Two numbers go in, one number comes out, and that is what an operation is. So here is the question. What does an operation on sets look like? Two sets go in, and one set comes out. There are two such operations, and between them they are most of what you can do to a pair of sets.
The surprising part is not what they are. It is that neither of them has an idea of its own. Each one is a word from ordinary English, turned into a set. And once you see which word, every property either of them has stops being something to memorise. Here is the first one. Take two sets, and ask about each object in turn. Are you in the first one, or are you in the second one?
Everything that answers yes goes into a new set, and that set is called the union. Now notice what the question does not ask. It does not ask how many of the two sets you are in. An object in both of them answers yes, and it is the same yes as an object in only one of them. So it goes in once. This is where people trip, and it is worth being exact about why.
Membership is a verdict, not a tally. There is nowhere in the question, is this object in the set, for a count to live. Write a shared object twice and you have not got two members, you have written the same member down twice. Take the set holding two, four, six and eight. And the set holding six, eight, ten and twelve. Walk the objects and ask the or question of each one.
Two, yes. Four, yes. Six answers yes from both sides at once, and eight does the same. Ten, yes. Twelve, yes. So the union holds two, four, six, eight, ten and twelve. That is six members. Four and four would have been eight. The two that are missing are exactly the two that were shared. And that is not a coincidence about this pair. Count the union, count the shared part, add those two numbers, and you always get the sizes of the original two sets added together.
Every object in either set is counted once in the union, and counted a second time in the shared part only if it was in both. Now a case worth predicting before you compute it. The five vowels, a, e, i, o and u. And the set holding just a, i and u. Every member of the second one is already a member of the first. Ask the or question of each vowel in turn.
a is in the first set, so yes. e is in the first set, so yes, and so on down the list. Nothing new ever arrives, because there was nothing in the second set that was not already in the first. The union is the five vowels, the larger set, unchanged. That is the general rule. When one set sits inside another, their union is the larger one, and you do not have to compute it - you can read it off the containment.
Here is a union that means something. A hockey team of three, Ana, Ben and Chidi. A football team of three, Dana, Ana and Elias. Ana plays both. The union holds Ana, Ben, Chidi, Dana and Elias. Five students, not six. And now say aloud what that set actually is. It is the students who play at least one of the two sports. That is what or means here - at least one, and not exactly one.
The shared part is coming back later, and it will mean something too. Union arrives with a list of properties, and a list like that invites memorising. Do not memorise it. Every one of them is a fact about the word or. Order does not matter, because p or q has the same answer as q or p, and there are only four cases to check. Grouping does not matter, for the same kind of reason.
A set unioned with itself is itself, because asking p or p is just asking p. The empty set changes nothing, because p or false is p - a second chance that always fails is not a chance. And the surrounding set swallows everything, because p or true is true, whatever p was. Five properties, one word. If you ever forget one of them, ask the question about two answers instead of about two sets, and it falls out.
Which brings up the word people reach for, and it is the wrong word. A union is not an addition. Add four to four and you get eight. Union a four member set with itself and you get the same four members back. Arithmetic has no law saying that a plus a is a. Union has exactly that law, and it has it because or, repeated, is still or. Adding counts things.
Union asks a question about them. Those are different operations, they behave differently, and the six against eight we just did is where the difference shows. Now the second operation, and it is the same idea with one word changed. Ask each object, are you in the first set and in the second? Everything that answers yes goes into a new set, called the intersection. Drawn, it is the part where the two curves overlap, and nothing else.
Take the same pair as before. Two is in the first and not in the second, so no. Six is in both, so yes, and eight is in both, so yes. Ten and twelve are in the second only, so they fail the second half of the question. The intersection holds six and eight. Two members, out of a four and a four. Here is the mirror of the containment case.
Take the whole numbers from one to ten. And the set holding two, three, five and seven. Those four are exactly the primes up to ten. Every one of them is already among the first ten numbers. So the and question, asked of each of them, comes back yes on both halves. And asked of any other number in the ten, it fails on the second half. The intersection is the smaller set itself.
So when one set sits inside another, the union is the larger one and the intersection is the smaller one. Two predictions, both read off the containment, and neither of them computed. Now the case that a whole word is reserved for. Take the set holding two, four, six and eight, and the set holding one, three, five and seven. Ask the and question of anything at all. Nothing passes.
Their intersection is empty, and two sets like that are called disjoint. Drawn, it is two curves that do not touch. But notice what the drawing tells you, and what it does not. It shows you that nothing overlaps in this picture. The reason is better than the picture. Every member of the first set is even, and every member of the second is odd. And no whole number is both, because halving it leaves a remainder of nought or of one, never both at once.
So it is not that nothing happens to be shared here. Nothing could be. Three things get believed about disjoint sets, and all three are wrong. The first is that disjoint means unequal. It does not. The two sets from the union example are unequal, and they share two members. Unequal is easy, and sharing nothing at all is a far stronger thing to say. The second is that an empty intersection means one of the sets was empty.
The evens and the odds we just used have four members each. Neither of them is empty, and their intersection is. The third is that the intersection is always the smaller of the two sets. It can be. It can also be empty, and it can be one of them exactly, as it was with the primes sitting inside the ten. The intersection is the set of shared members, and how big that is depends entirely on the two sets.
Intersection has its own list of properties, and they come from the word and, exactly as union's came from the word or. Order does not matter. Grouping does not matter. A set met with itself is itself. And then something worth stopping on. For union, the harmless set was the empty one. For intersection, the harmless set is the surrounding one. They swap, and the reason is sitting in the two words.
p or false leaves p alone, because a chance that never fires cannot help. p and true leaves p alone, because a demand that is always met cannot hurt. False is harmless to or, and true is harmless to and. Turn those two sentences into sets and you have both of the identity laws, and you will not mix them up again. The other two swap as well - the surrounding set swallows a union, and the empty set swallows an intersection.
One law uses both operations, and it is worth checking rather than believing. Take three sets. Meet the first with the union of the other two. Now do it the other way round. Meet the first with the second, meet the first with the third, and union those two results. The claim is that you land on the same set. You can watch it happen in five panels. Tint the second or the third.
Then tint the part of the first that meets it, and hold on to that shape. Start again. Tint the first with the second, then the first with the third, then both of those together. The last panel carries the same shading as the one we held on to. And the reason is the connective again - p and, q or r, has the same answer as p and q, or p and r, on all eight rows.
Once you have both operations you can write expressions, and reading one is a skill of its own. Take four sets. Three, five, seven, nine and eleven. Seven, nine, eleven and thirteen. Eleven, thirteen and fifteen. And fifteen and seventeen. Meet the first with the union of the second and the third, and you get seven, nine and eleven. Meet the first with the union of the second and the fourth, and you get seven, nine and eleven again.
The fourth set contributed nothing, because it shares nothing with the first. Now change one thing. Union the first with the fourth, and meet that result with the union of the second and the third. Now you get seven, nine, eleven, and fifteen. Fifteen could never reach the answer while the fourth set was on the inside of the expression, and it can now that it is on the outside.
Work from the inside out, ask the question the connective names, and expressions like that stop being a puzzle. The last case is the one where the sets never end. The natural numbers. The even ones, the odd ones, and the primes. Meet the naturals with any of the other three and you get that other one back, because all three sit inside it. Meet the evens with the odds and you get nothing, for the reason we already have.
Meet the evens with the primes and you get exactly one number, and the number is two. Every other even number has two as a divisor, and a number with a divisor like that is not prime. So a whole endless family contributes a single member. Meet the odds with the primes and you get every prime except two. One operation, on families nobody can finish listing, settled by asking the and question about the conditions instead of about the members.
So here is what these two operations are. Union is the word or, made into a set. Intersection is the word and, made into a set. Everything else followed from that. A shared object gets written once, because membership is a verdict with no count inside it. Order and grouping do not matter, because they do not matter to the connectives. Each operation is unchanged by repetition, for the same reason.
The empty set is harmless to one and the surrounding set is harmless to the other, because false is harmless to or and true is harmless to and. And disjoint is not a fact about size, it is a verdict - the and question can never pass. Neither operation had an idea of its own to teach you. They borrowed two, from a language you already speak.
Where this fits
Taken from the notes each video was made from, not from the reading order — these are the ideas this one rests on and the ones that later rest on it.
Builds on
- Turning a claim about sets into a picture you can read offClass 11 · Ch 1, Sets
- Why nothing can be complemented until the surrounding set is fixedClass 11 · Ch 1, Sets
- Why order and repetition cannot make two sets differentClass 11 · Ch 1, Sets
- Containment, proper containment, and why the empty set is inside everythingClass 11 · Ch 1, Sets
Comes up again in
- Difference and complement: the same idea with and without a universal setClass 11 · Ch 1, Sets
- Why complementing turns each of the two operations into the otherClass 11 · Ch 1, Sets
- Drawing the answer as a piece of the number line, hollow circle or solidClass 11 · Ch 5, Linear Inequalities