This deck treats sets as the ambient language of mathematics. It separates membership from the subset relation and covers set-builder notation, the empty set, power sets, the Boolean-algebra laws for union, intersection, and complement - which are identical to those of propositional logic - and Cartesian products, then shows why naive comprehension collapses into Russell's paradox. It targets the classic confusion between element-of and subset-of, the belief that a universal set exists, and the slip between the empty set and the set containing the empty set.
Subject: Foundations of Higher Mathematics · 103 slides · symbolic lesson
Open the interactive version of this deck · Homework for this lesson
Objectives
This deck makes sets precise enough to build the rest of mathematics on. By the end you can:
1. Distinguish membership from the subset relation, and read set-builder notation fluently.
2. Compute power sets and count their size, and work with union, intersection, difference, and complement.
3. Prove set identities by element-chasing and recognize the Boolean-algebra laws as the twin of propositional logic.
4. Form Cartesian products, and explain why naive comprehension is inconsistent (Russell) and must be replaced by axioms.
Warm-up
Discussion prompt
Before we open Sets, Operations & the Boolean Algebra of Sets: without looking back, what was the main idea of Proof Techniques II: Induction, Strong Induction & Well-Ordering, and what could you do by the end of it that you could not do before?
Hint: One sentence for the idea, one for the skill. If the second one is blank, that is the part to revisit.
Answer:
That deck covers weak, strong, structural, and well-founded induction, and shows that they are equivalent to the well-ordering principle. It targets the misconceptions that induction is circular, that the base case is optional, and that weak induction always suffices, along with the all-horses-are-the-same-color fallacy.
Concept
A set is a collection of distinct objects, considered as a single object in its own right. The objects are its elements (or members).
A set is fixed entirely by which things are in it. It has no order and no repetition: listing something twice, or in a different order, changes nothing.
\[ \{1,2,3\} = \{3,1,2\} = \{1,1,2,3\} \]
Counterexample
Discussion prompt
A set is a collection of distinct objects, considered as a single object in its own right. The objects are its elements (or members).
That is stated as though it always holds. Do one of two things: produce a case where it fails, or say precisely what rules such a case out. "It just does" is not on the menu.
Hint: Hunt at the extremes first — zero, one, negative, empty, equal. If every extreme survives, the reason they survive is the proof.
Answer:
A set is fixed entirely by which things are in it. It has no order and no repetition: listing something twice, or in a different order, changes nothing.
Intuition
Picture a bag. The only question the bag can answer is: is this thing inside you, yes or no? It cannot tell you which thing came first or how many copies you dropped in.
So a set is not a list and not a sequence. It is pure membership. Two sets are the same exactly when the same things answer yes.
Analogy
Discussion prompt
Explain A set is a bag that only remembers membership by analogy to something with no Foundations of Higher Mathematics in it at all — a queue, a recipe, a map, a bank balance, whatever fits. Then say where your analogy breaks.
Hint: An analogy that never breaks is not an analogy, it is the same idea wearing a hat. Find the seam — that is the part that is actually new.
Answer:
Picture a bag. The only question the bag can answer is: is this thing inside you, yes or no? It cannot tell you which thing came first or how many copies you dropped in.
Concept
Everything about sets is built from one primitive relation: an object either is or is not an element of a set.
\[ x \in A \qquad\text{versus}\qquad x \notin A \]
membership — The relation between an element and a set that contains it. It is the single undefined notion of set theory; every other idea is defined from it.
Explain it
Discussion prompt
Explain Membership: the primitive relation to a student a year behind you. No notation, no jargon they have not met — and it still has to be true.
Hint: If your explanation needs a symbol they have never seen, you are describing the notation rather than the idea.
Answer:
Everything about sets is built from one primitive relation: an object either is or is not an element of a set.
Concept
One set is a subset of another when every element of the first is also an element of the second.
\[ A \subseteq B \;\iff\; \forall x\,(x \in A \implies x \in B) \]
Membership relates an element to a set. Subset relates a set to a set. These are different levels, and confusing them is the number-one error in this whole subject.
Concept
A subset is proper when it is contained in the larger set but not equal to it.
\[ A \subsetneq B \;\iff\; A \subseteq B \;\text{and}\; A \neq B \]
Two sets are equal exactly when each is a subset of the other. This double-inclusion idea is the engine of almost every set proof.
\[ A = B \;\iff\; A \subseteq B \;\text{and}\; B \subseteq A \]
Intuition
Ask element-of when you are pointing at a single item and asking whether the bag contains that exact item.
Ask subset when you are holding a whole smaller bag and asking whether everything in it also sits in the bigger bag.
\[ 1 \in \{1,2\}, \qquad \{1\} \subseteq \{1,2\}, \qquad \{1\} \notin \{1,2\} \]
Ranking
Put in order
Put the moves of Worked example: membership versus subset drills into the order they have to happen.
Why: These are the moves of the worked example in the order it makes them, and each one is set up by the one before it. The elements are exactly 1 and 2, so 1 is one of them.
Worked example
Decide each claim by listing the actual elements of the set on the right, then checking the rule.
Is 1 an element of the set below?
Why: The elements are exactly 1 and 2, so 1 is one of them. True.
\[ 1 \in \{1,2\} \]
Is the singleton a subset of the pair below?
Why: The only element of the left set is 1, and 1 is in the right set, so every element is covered. True.
\[ \{1\} \subseteq \{1,2\} \]
Is the singleton an element of the pair below?
Why: The elements of the right set are 1 and 2, neither of which is the set-object {1}. False.
\[ \{1\} \notin \{1,2\} \]
Now the tricky one: is the singleton an element of the set-of-a-singleton?
Why: The single element of the right set is the object {1} itself, so yes it is a member. True.
\[ \{1\} \in \{\{1\}\} \]
Is the singleton a subset of the set-of-a-singleton?
Why: A subset needs 1 (the element of the left set) to be in the right set. But the right set's only element is {1}, not 1. False.
\[ \{1\} \not\subseteq \{\{1\}\} \]
Verify by re-listing elements once more
Why: Left set {1} has element 1. Right set {{1}} has element {1}. Since 1 is not equal to {1}, the subset claim fails while the membership claim holds. Both answers confirmed.
Picture it
Animation
Shows: Each line of the worked example "membership versus subset drills", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Left set {1} has element 1. Right set {{1}} has element {1}. Since 1 is not equal to {1}, the subset claim fails while the membership claim holds. Both answers confirmed.
Trap
A strong student, seeing braces on both sides, guesses that both statements below must be true because {1} 'looks like it lives inside' both.
\[ \{1\} \in \{1,2\} \;?\qquad \{1\} \subseteq \{\{1\}\} \;? \]
Both are read as FALSE only after checking, but the tempting instinct calls them true. The left confuses subset-thinking with membership; the right confuses membership-thinking with subset.
Always list the actual elements of the right-hand set, then apply the exact rule for the symbol.
\[ \{1\} \notin \{1,2\}, \qquad \{1\} \not\subseteq \{\{1\}\} \]
The elements of the pair are 1 and 2, so the set-object {1} is not among them. The only element of the outer set on the right is {1}, so a subset would need 1 itself to be a member, which it is not.
Explain it to yourself
Discussion prompt
In Pattern: deciding element-of versus subset this move is made:
3. For subset, ask: is every element of the left set among those listed items?
Why is that legal? Name the rule or definition it rests on before you read on.
Hint: If you can only say "because that is what you do", the rule is the thing to go and find.
Answer:
Subset drops a level on the LEFT too. You compare the members of the left set against the members of the right set.
Pattern
1. Write out the elements of the right-hand set literally
Why: Peel exactly one layer of braces. The elements are whatever sits at that top level, sets or not.
2. For element-of, ask: is the left object one of those listed items?
Why: Membership is a single yes/no lookup at the top level. Nesting matters: {1} and 1 are different objects.
3. For subset, ask: is every element of the left set among those listed items?
Why: Subset drops a level on the LEFT too. You compare the members of the left set against the members of the right set.
Check
Peel one layer of braces on each side, then apply the rule for the symbol.
Check your understanding
Exactly one of these is true. Which?
Answer: B
Why: The only element of {1} is 1, and 1 is in {1,2}, so every element of the left set is covered and {1} is a subset of {1,2}. The other three fail on a level mismatch.
Concept
Beyond listing elements, we describe a set by a property its elements must satisfy. Read the bar or colon as 'such that'.
\[ \{\,x \in U : P(x)\,\} \]
This reads: the set of all x drawn from a known domain U for which the condition holds. Naming the domain keeps the description honest; dropping it is what leads to paradox later.
Step zero
Discussion prompt
Worked example: builder notation to a roster — before any calculation: what is the plan? Name the moves in order, in plain English, without doing the arithmetic.
Hint: It starts with: Translate the condition into a range on x
Answer:
Worked example
List every element of the following set explicitly.
\[ S = \{\, x \in \mathbb{Z} : x^2 \le 9 \,\} \]
Translate the condition into a range on x
Why: The square is at most nine exactly when the absolute value is at most three.
\[ x^2 \le 9 \iff |x| \le 3 \]
List the integers with absolute value at most three
Why: Only integers count because the domain is the integers, so we sweep from negative three to three.
\[ S = \{-3,-2,-1,0,1,2,3\} \]
Verify the boundary and the first excluded value
Why: Three squared is nine, which satisfies at-most-nine, so three is in. Four squared is sixteen, which exceeds nine, so four is correctly out. The roster is exact.
\[ 3^2 = 9 \le 9, \qquad 4^2 = 16 > 9 \]
Picture it
Animation
Shows: Each line of the worked example "builder notation to a roster", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Three squared is nine, which satisfies at-most-nine, so three is in. Four squared is sixteen, which exceeds nine, so four is correctly out. The roster is exact.
Concept
The principle of extensionality says a set is nothing more than its members. Same members means the same set, no matter how differently the two sets were described.
\[ A = B \;\iff\; \forall x\,(x \in A \iff x \in B) \]
So the even prime numbers and the solutions of a certain equation can be the very same set, even though the descriptions look nothing alike.
Concept
There is a set with no elements at all, the empty set.
\[ \emptyset = \{\,\} = \{\, x : x \neq x \,\} \]
By extensionality it is unique: any two sets with no members have the same members (namely none), so they are equal. There is only one empty set.
Intuition
Here is the move that feels wrong at first: the empty set is a subset of absolutely every set.
\[ \emptyset \subseteq A \quad\text{for every set } A \]
The definition asks: is every element of the empty set also in A? There are no elements to check, so the condition cannot fail. A statement about nothing is true by default. This is called vacuous truth.
Trap
It is tempting to treat the two objects below as the same, since both are 'about emptiness'.
\[ \{\emptyset\} \overset{?}{=} \emptyset \]
Reading them as equal makes the left object empty, so its size would be zero.
The right object has no elements. The left object has exactly one element, and that element happens to be the empty set.
\[ |\emptyset| = 0, \qquad |\{\emptyset\}| = 1 \]
A box with an empty box inside it is not an empty box. The braces are the container; putting one thing inside makes the count one, whatever that thing is.
Elimination
Eliminate the wrong options
How many elements does the set with one empty set inside it have?
3 of these 4 are wrong. Strike them one at a time, and say what rules each one out before you strike the next. The survivor is the answer.
Survives elimination: B
Why: The outer braces hold a single object, and that object is the empty set. Having one member that happens to be empty still means a total of one member, so the cardinality is 1.
Check
Count the elements sitting at the top level inside the outer braces.
Check your understanding
How many elements does the set with one empty set inside it have?
Answer: B
Why: The outer braces hold a single object, and that object is the empty set. Having one member that happens to be empty still means a total of one member, so the cardinality is 1.
Concept
The power set of a set X is the set of all subsets of X. Its elements are themselves sets.
\[ \mathcal{P}(X) = \{\, A : A \subseteq X \,\} \]
Two subsets are always present no matter what: the empty set and X itself. Everything in between is some partial selection of the elements of X.
Intuition
To build a subset, walk through the elements of X one at a time and decide, independently, keep it or drop it.
Each element gives a two-way choice, and the choices do not interfere. So the number of subsets multiplies: two choices for the first, times two for the second, and so on.
\[ \text{subset} \;\longleftrightarrow\; \text{binary string of length } |X| \]
Estimation
Predict first
Build this from the inside out, one layer at a time.
Commit before you compute: what does Worked example: compute the power set of the power set of… come out to? A rough magnitude and the right form is enough — the point is to have something concrete to be wrong about.
Correct: Verify the sizes against the doubling rule
Why: A prediction you can defend turns the computation into a check rather than a leap of faith — and an answer that contradicts it is caught on the spot. The empty set has size zero, so its power set has size two to the zero, which is one.
Worked example
Build this from the inside out, one layer at a time.
\[ \mathcal{P}(\mathcal{P}(\emptyset)) \]
Find the subsets of the empty set
Why: The only subset of the empty set is the empty set itself, so the power set has exactly one element.
\[ \mathcal{P}(\emptyset) = \{\emptyset\} \]
Now take the power set of that one-element set
Why: A one-element set has two subsets: the empty set, and the whole set. List both.
\[ \mathcal{P}(\{\emptyset\}) = \{\, \emptyset,\ \{\emptyset\} \,\} \]
Verify the sizes against the doubling rule
Why: The empty set has size zero, so its power set has size two to the zero, which is one. That one-element set has power set of size two to the one, which is two. Both counts match the two objects we listed.
\[ 2^{0} = 1, \qquad 2^{1} = 2 \]
Picture it
Animation
Shows: Each line of the worked example "compute the power set of the power set of the empty set", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: The empty set has size zero, so its power set has size two to the zero, which is one. That one-element set has power set of size two to the one, which is two. Both counts match the two objects we listed.
Concept
The per-element yes/no picture gives the size of the power set immediately for a finite set.
\[ |\mathcal{P}(X)| = 2^{|X|} \]
This is why the power set is called 'power': it is where exponential growth first appears, and it is the reason a set is always strictly smaller than its power set, a fact that later explodes into a whole hierarchy of infinities.
Step zero
Discussion prompt
Worked example: list every subset of a three-element set — before any calculation: what is the plan? Name the moves in order, in plain English, without doing the arithmetic.
Hint: It starts with: Size zero and size three
Answer:
Worked example
Take the set below and organize its subsets by how many elements they contain.
\[ X = \{a,b,c\} \]
Size zero and size three
Why: Exactly one subset picks nothing and exactly one picks everything.
\[ \emptyset, \qquad \{a,b,c\} \]
Size one and size two
Why: Three ways to keep a single element, and three ways to drop a single element.
\[ \{a\},\{b\},\{c\}, \qquad \{a,b\},\{a,c\},\{b,c\} \]
Collect the whole power set
Why: Assemble all eight subsets into one set whose members are sets.
\[ \mathcal{P}(X) = \{\, \emptyset,\{a\},\{b\},\{c\},\{a,b\},\{a,c\},\{b,c\},\{a,b,c\} \,\} \]
Verify the count against the formula
Why: There are eight subsets, and the formula predicts two to the third power, which is eight. The counts by size, one plus three plus three plus one, also total eight. Confirmed.
\[ 1 + 3 + 3 + 1 = 8 = 2^{3} \]
Picture it
Animation
Shows: Each line of the worked example "list every subset of a three-element set", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: There are eight subsets, and the formula predicts two to the third power, which is eight. The counts by size, one plus three plus three plus one, also total eight. Confirmed.
Check
Use the per-element choice picture, not the number of elements itself.
Check your understanding
A set X has four elements. How many subsets does X have?
Answer: C
Why: Each of the four elements is independently kept or dropped, giving two to the fourth power subsets. Two to the fourth is sixteen, which counts everything from the empty set up to X itself.
Concept
The union of two sets collects everything that is in at least one of them.
\[ A \cup B = \{\, x : x \in A \ \text{or}\ x \in B \,\} \]
The 'or' here is inclusive: an element in both sets is still in the union, counted once, because sets do not repeat.
Concept
The intersection keeps only the elements the two sets share.
\[ A \cap B = \{\, x : x \in A \ \text{and}\ x \in B \,\} \]
When the two sets share nothing, the intersection is the empty set, and the sets are called disjoint.
Concept
The difference of A and B keeps the elements of A that are not in B.
\[ A \setminus B = \{\, x : x \in A \ \text{and}\ x \notin B \,\} \]
Difference is not symmetric: removing B from A generally gives something different from removing A from B.
Concept
Fix a background set U, the universe of discourse. The complement of A is everything in U that is not in A.
\[ A^{c} = U \setminus A = \{\, x \in U : x \notin A \,\} \]
Complement only makes sense against a chosen universe. There is no absolute 'everything not in A', a point that will return with full force in Russell's paradox.
Socratic
Discussion prompt
Fix a background set U, the universe of discourse. The complement of A is everything in U that is not in A.
Suppose that were not true. What is the first thing in Sets, Operations & the Boolean Algebra of Sets that would stop working?
Hint: Follow it one step downstream. The answer is whatever was quietly relying on it.
Answer:
Complement only makes sense against a chosen universe. There is no absolute 'everything not in A', a point that will return with full force in Russell's paradox.
Picture it
Figure (svg): A rectangle labeled U as the universe contains two overlapping circles, the left labeled A and the right labeled B. The lens where they overlap is the intersection; the whole shaded pair of circles is the union; the part of A outside B is A minus B; the region of the rectangle outside both circles is the complement of the union.
Discussion prompt
Read the picture before the words. What is this showing, and what is the one thing it is built to make obvious? Commit to an answer, then read on.
Hint: Name the parts, then say what changes between them — and if nothing changes, say what is being held still.
Answer:
The overlapping lens is the intersection. The two circles together are the union. The part of the left circle outside the right is the left set minus the right. The region of the rectangle outside both circles is the complement of the union.
Intuition
Figure (svg): A rectangle labeled U as the universe contains two overlapping circles, the left labeled A and the right labeled B. The lens where they overlap is the intersection; the whole shaded pair of circles is the union; the part of A outside B is A minus B; the region of the rectangle outside both circles is the complement of the union.
The overlapping lens is the intersection. The two circles together are the union. The part of the left circle outside the right is the left set minus the right. The region of the rectangle outside both circles is the complement of the union.
Hypothesis
Predict first
Worked example: compute concrete set operations is about to be worked. State your hypothesis first: which rule or definition decides this one, and what is the first move it forces? Then watch whether the example agrees with you.
Correct: Union: pool both lists, no repeats
Why: Every element in A or in B appears once; the shared 3 and 4 are not doubled.
A hypothesis you wrote down is falsifiable; a vague sense of how it will go is not. If the example opens somewhere else, that gap is the thing worth chasing.
Worked example
Work inside a fixed universe and compute each combination.
\[ U=\{1,2,3,4,5,6,7\},\ A=\{1,2,3,4\},\ B=\{3,4,5,6\} \]
Union: pool both lists, no repeats
Why: Every element in A or in B appears once; the shared 3 and 4 are not doubled.
\[ A \cup B = \{1,2,3,4,5,6\} \]
Intersection: keep only the shared elements
Why: Only 3 and 4 sit in both sets.
\[ A \cap B = \{3,4\} \]
Difference: take A and drop anything in B
Why: From A remove the shared 3 and 4, leaving 1 and 2.
\[ A \setminus B = \{1,2\} \]
Complement of A inside U
Why: Everything in the universe not already in A: that is 5, 6, and 7.
\[ A^{c} = \{5,6,7\} \]
Verify by a cross-count
Why: The union has six elements; A and B have four each with two shared, and four plus four minus two is six. The complement has three elements, and A has four, together making all seven of U. Both totals check out.
\[ 4 + 4 - 2 = 6, \qquad 4 + 3 = 7 \]
Picture it
Animation
Shows: Each line of the worked example "compute concrete set operations", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: The union has six elements; A and B have four each with two shared, and four plus four minus two is six. The complement has three elements, and A has four, together making all seven of U. Both totals check out.
Check
Take one set and strip out everything the other set contains.
\[ A = \{1,2,3\}, \qquad B = \{2,3,4\} \]
Check your understanding
What is A minus B?
Answer: A
Why: A minus B keeps the elements of A that are not in B. From A the shared elements 2 and 3 are removed, leaving only 1, so the answer is the singleton with 1.
Concept
Union and intersection obey the same structural laws as addition and multiplication, but symmetrically. Order and grouping never matter.
\[ A \cup B = B \cup A, \qquad A \cap B = B \cap A \]
\[ (A \cup B)\cup C = A \cup(B\cup C), \qquad (A\cap B)\cap C = A\cap(B\cap C) \]
Concept
Unlike ordinary arithmetic, where only multiplication distributes over addition, here each operation distributes over the other. This double symmetry is the signature of a Boolean algebra.
\[ A \cap (B \cup C) = (A\cap B)\cup(A\cap C) \]
\[ A \cup (B \cap C) = (A\cup B)\cap(A\cup C) \]
Concept
Complement turns union into intersection and intersection into union, flipping each operation into its partner.
\[ (A \cup B)^{c} = A^{c} \cap B^{c} \]
\[ (A \cap B)^{c} = A^{c} \cup B^{c} \]
Intuition
Every one of these laws is a logic law in disguise. Membership in a union is an 'or', membership in an intersection is an 'and', and complement is 'not'.
\[ x \in A\cup B \iff (x\in A)\lor(x\in B), \quad x\in A^{c} \iff \lnot(x\in A) \]
So the algebra of sets and the algebra of propositions are the same abstract structure, a Boolean algebra. This is the Lindenbaum tie-back: proofs about sets and proofs about truth values run on identical rails.
Concept
The empty set and the universe act as the neutral elements, complements collapse to them, and absorption swallows redundant terms.
\[ A \cup \emptyset = A, \qquad A \cap U = A \]
\[ A \cup A^{c} = U, \qquad A \cap A^{c} = \emptyset \]
\[ A \cup (A \cap B) = A, \qquad A \cap (A \cup B) = A \]
Explain it to yourself
Discussion prompt
In Pattern: proving a set identity by element-chasing this move is made:
3. Unfold every definition into a logical statement about x, manipulate, refold
Why is that legal? Name the rule or definition it rests on before you read on.
Hint: If you can only say "because that is what you do", the rule is the thing to go and find.
Answer:
Membership in union, intersection, and complement becomes or, and, not. Now it is pure logic, and the logic laws finish the job.
Pattern
1. To prove two sets equal, prove each is a subset of the other
Why: Equality is double inclusion. Split the goal into a left-to-right inclusion and a right-to-left inclusion.
2. For each inclusion, take an arbitrary element of the left side
Why: Say 'let x be in the left set'. Proving it lands in the right set for a generic x proves it for all of them.
3. Unfold every definition into a logical statement about x, manipulate, refold
Why: Membership in union, intersection, and complement becomes or, and, not. Now it is pure logic, and the logic laws finish the job.
4. When the two sides are logically equivalent, both inclusions collapse into one biconditional chain
Why: If every step is an if-and-only-if, you get both directions at once and the identity is proved.
Ranking
Put in order
Put the moves of Worked example: prove De Morgan for the complement of a union into the order they have to happen.
Why: These are the moves of the worked example in the order it makes them, and each one is set up by the one before it. Membership in a complement means being in the universe but not in the set.
Worked example
Prove the following by chasing an arbitrary element through the definitions.
\[ (A \cup B)^{c} = A^{c} \cap B^{c} \]
Let x be an arbitrary element of the left side
Why: Membership in a complement means being in the universe but not in the set.
\[ x \in (A\cup B)^{c} \iff x \notin A \cup B \]
Unfold not-in-a-union
Why: Not being in the union means not being in A and not being in B; negating an 'or' produces an 'and'.
\[ \iff \lnot(x\in A \lor x\in B) \iff (x\notin A) \land (x\notin B) \]
Refold each half into a complement
Why: Not in A is membership in the complement of A, and likewise for B; the 'and' is exactly intersection.
\[ \iff (x\in A^{c}) \land (x\in B^{c}) \iff x \in A^{c}\cap B^{c} \]
Verify on a small concrete case
Why: Take the universe as one through three, A as the singleton one, B as the singleton two. The union is one and two, whose complement is the singleton three. Separately the complement of A is two and three, the complement of B is one and three, and their intersection is the singleton three. The two results agree, confirming the identity.
\[ U=\{1,2,3\},\ A=\{1\},\ B=\{2\}:\ (A\cup B)^{c}=\{3\}=A^{c}\cap B^{c} \]
Picture it
Animation
Shows: Each line of the worked example "prove De Morgan for the complement of a union", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Take the universe as one through three, A as the singleton one, B as the singleton two. The union is one and two, whose complement is the singleton three. Separately the complement of A is two and three, the complement of B is one and three, and their intersection is the singleton three. The two results agree, confirming the identity.
Estimation
Predict first
Prove the intersection distributes over the union.
Commit before you compute: what does Worked example: prove the distributive law come out to? A rough magnitude and the right form is enough — the point is to have something concrete to be wrong about.
Correct: Verify with concrete sets
Why: A prediction you can defend turns the computation into a check rather than a leap of faith — and an answer that contradicts it is caught on the spot. Let A be one and two, B be two and three, C be one and four.
Worked example
Prove the intersection distributes over the union.
\[ A \cap (B \cup C) = (A\cap B)\cup(A\cap C) \]
Take x in the left side and unfold
Why: Being in the left side means being in A and being in the union of B and C.
\[ x \in A \cap(B\cup C) \iff (x\in A) \land (x\in B \lor x\in C) \]
Distribute the 'and' over the 'or' in logic
Why: This is the propositional distributive law, the exact mirror of the set law we are proving.
\[ \iff (x\in A \land x\in B) \lor (x\in A \land x\in C) \]
Refold each conjunction into an intersection
Why: Each 'and' is an intersection, and the connecting 'or' is a union.
\[ \iff (x\in A\cap B) \lor (x\in A\cap C) \iff x \in (A\cap B)\cup(A\cap C) \]
Verify with concrete sets
Why: Let A be one and two, B be two and three, C be one and four. Then B union C is one, two, three, four, and A intersect that is one and two. Separately A intersect B is two, A intersect C is one, and their union is one and two. The sides match.
\[ A=\{1,2\},B=\{2,3\},C=\{1,4\}:\ \text{both sides} = \{1,2\} \]
Picture it
Animation
Shows: Each line of the worked example "prove the distributive law", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Let A be one and two, B be two and three, C be one and four. Then B union C is one, two, three, four, and A intersect that is one and two. Separately A intersect B is two, A intersect C is one, and their union is one and two. The sides match.
Step zero
Discussion prompt
Worked example: subset is the same as an absorbing union — before any calculation: what is the plan? Name the moves in order, in plain English, without doing the arithmetic.
Hint: It starts with: Forward direction: assume the subset relation holds
Answer:
Worked example
Prove the following characterization of the subset relation in both directions.
\[ A \subseteq B \;\iff\; A \cup B = B \]
Forward direction: assume the subset relation holds
Why: We must show the union equals B. One inclusion is automatic: B is always inside the union.
\[ B \subseteq A \cup B \text{ always} \]
Show the union is contained in B
Why: Take x in the union: it is in A or in B. If it is in A then it is in B by the assumption; if it is in B it is already in B. Either way x is in B.
\[ x \in A\cup B \implies x \in B \]
Backward direction: assume the union equals B
Why: Take x in A. Then x is in the union of A and B, and the union is B by assumption, so x is in B. Hence A is a subset of B.
\[ x \in A \implies x \in A\cup B = B \]
Verify on a concrete instance
Why: Let A be the singleton one and B be one and two. Then A is a subset of B, and the union of A and B is one and two, which equals B. Both sides of the equivalence hold together, as the theorem requires.
\[ A=\{1\},\ B=\{1,2\}:\ A\subseteq B \text{ and } A\cup B = \{1,2\} = B \]
Picture it
Animation
Shows: Each line of the worked example "subset is the same as an absorbing union", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Let A be the singleton one and B be one and two. Then A is a subset of B, and the union of A and B is one and two, which equals B. Both sides of the equivalence hold together, as the theorem requires.
Estimation
Predict first
Prove that unioning A with anything it already contains changes nothing.
Commit before you compute: what does Worked example: prove an absorption law come out to? A rough magnitude and the right form is enough — the point is to have something concrete to be wrong about.
Correct: Verify on a concrete instance
Why: A prediction you can defend turns the computation into a check rather than a leap of faith — and an answer that contradicts it is caught on the spot. Let A be one and two, B be two and three.
Worked example
Prove that unioning A with anything it already contains changes nothing.
\[ A \cup (A \cap B) = A \]
Left-to-right inclusion
Why: Take x in the left side: it is in A, or in the intersection of A and B. In the second case it is still in A. So in every case x is in A.
\[ x \in A\cup(A\cap B) \implies x \in A \]
Right-to-left inclusion
Why: If x is in A, then x is in the union of A with anything, since the first branch already holds.
\[ x \in A \implies x \in A\cup(A\cap B) \]
Verify on a concrete instance
Why: Let A be one and two, B be two and three. The intersection is the singleton two, and unioning that into A gives one and two, which is A unchanged. The absorption holds.
\[ A=\{1,2\},B=\{2,3\}:\ A\cup(A\cap B) = \{1,2\} = A \]
Picture it
Animation
Shows: Each line of the worked example "prove an absorption law", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Let A be one and two, B be two and three. The intersection is the singleton two, and unioning that into A gives one and two, which is A unchanged. The absorption holds.
Trap
It is tempting to think complement is absolute: the complement of A is 'all the things not in A', drawn from the set of all sets.
\[ A^{c} \overset{?}{=} \{\, x : x \notin A \,\} \]
This quietly assumes a universal set containing everything exists. It does not, and pretending it does leads straight to contradiction.
Complement is always relative to an explicitly chosen universe U. Change U and you change the complement.
\[ A^{c} = U \setminus A = \{\, x \in U : x \notin A \,\} \]
There is no set of all sets. The next slides show exactly why an unrestricted 'set of everything satisfying a property' collapses under Russell's paradox.
Break the constraint
Discussion prompt
The rule this trap just fixed:
Complement is always relative to an explicitly chosen universe U. Change U and you change the complement.
Now break it on purpose. Build a case that violates it and follow the consequences until something visibly fails. Where does the failure first show up — and would you have noticed it if you had not been looking?
Hint: The dangerous rules are the ones whose violation still produces an answer. If yours fails loudly, try to find one that fails quietly.
Prediction
Predict first
Which set equals the complement of the intersection of A and B?
Answer it in your own words, now, with nothing to choose from. The options are on the next slide — and picking the right one off a list is an easier skill than producing it.
Correct: (complement of A) union (complement of B)
Why: De Morgan turns the complement of an intersection into the union of the complements. Not being in both means failing at least one, which is the union of the two complements.
Check
Push the complement inward and watch each operation flip to its partner.
Check your understanding
Which set equals the complement of the intersection of A and B?
Answer: B
Why: De Morgan turns the complement of an intersection into the union of the complements. Not being in both means failing at least one, which is the union of the two complements.
Concept
Often we have not two sets but a whole family, one for each index drawn from an index set. A family is a function from indices to sets.
\[ \{A_i\}_{i \in I}, \qquad A_i \subseteq U \text{ for each } i \]
The index set can be finite, or the natural numbers, or anything at all. This lets us take unions and intersections of infinitely many sets at once.
Concept
The big union collects anything in at least one member of the family; the big intersection keeps only what is in every member.
\[ \bigcup_{i \in I} A_i = \{\, x : \exists i\,(x \in A_i) \,\} \]
\[ \bigcap_{i \in I} A_i = \{\, x : \forall i\,(x \in A_i) \,\} \]
Union is an existential quantifier over the index, intersection is a universal one. The logic-set dictionary keeps paying off.
Step zero
Discussion prompt
Worked example: an intersection of shrinking intervals — before any calculation: what is the plan? Name the moves in order, in plain English, without doing the arithmetic.
Hint: It starts with: Check that zero survives
Answer:
Worked example
Compute the intersection of these open intervals over all positive integers n.
\[ \bigcap_{n=1}^{\infty} \left(-\tfrac{1}{n}, \tfrac{1}{n}\right) \]
Check that zero survives
Why: Zero lies strictly between negative one over n and one over n for every n, so it belongs to every interval and therefore to the intersection.
\[ 0 \in \left(-\tfrac{1}{n}, \tfrac{1}{n}\right) \text{ for all } n \]
Show no nonzero point survives
Why: Take any x other than zero. By the Archimedean property there is an n with one over n smaller than the absolute value of x, and then x falls outside that interval, so x is not in the intersection.
\[ x \neq 0 \implies \exists n:\ \tfrac{1}{n} < |x| \]
Conclude the intersection is a single point
Why: Zero is in all of them, nothing else is, so the intersection is the singleton zero.
\[ \bigcap_{n=1}^{\infty}\left(-\tfrac1n,\tfrac1n\right) = \{0\} \]
Verify against a specific nonzero candidate
Why: Try one tenth. Choosing n as eleven gives an interval of radius one over eleven, which is less than one tenth, so one tenth is excluded, exactly as claimed. Zero remains the only survivor.
\[ x=\tfrac{1}{10},\ n=11:\ \tfrac{1}{11} < \tfrac{1}{10} \Rightarrow x \notin \left(-\tfrac1{11},\tfrac1{11}\right) \]
Picture it
Animation
Shows: Each line of the worked example "an intersection of shrinking intervals", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Zero lies strictly between negative one over n and one over n for every n, so it belongs to every interval and therefore to the intersection.
Prediction
Predict first
What is the intersection over all positive integers n of the open intervals from minus one over n to one over n?
Answer it in your own words, now, with nothing to choose from. The options are on the next slide — and picking the right one off a list is an easier skill than producing it.
Correct: the single point zero
Why: Zero lies in every one of the intervals, so it survives the intersection. Any nonzero point is excluded once one over n drops below its absolute value, so nothing else survives, leaving just zero.
Check
Ask which points survive being inside every interval as the radius shrinks toward zero.
Check your understanding
What is the intersection over all positive integers n of the open intervals from minus one over n to one over n?
Answer: B
Why: Zero lies in every one of the intervals, so it survives the intersection. Any nonzero point is excluded once one over n drops below its absolute value, so nothing else survives, leaving just zero.
Concept
Sets forget order, yet we constantly need order: a coordinate, an input paired with an output. Kuratowski showed order can be encoded using only sets.
\[ (a,b) := \{\, \{a\},\ \{a,b\} \,\} \]
The trick is that one component is singled out by appearing in the inner singleton. This recovers the defining property that makes a pair a pair.
\[ (a,b) = (c,d) \iff a = c \ \text{and}\ b = d \]
Intuition
A raw two-element set treats its members symmetrically; there is no first or second. To break the symmetry we mark one member as special.
Kuratowski's marking is: wrap the first component alone in its own singleton. Now the two components are distinguishable, so the whole structure remembers who came first, using nothing but braces.
Concept
The Cartesian product of A and B is the set of all ordered pairs whose first entry comes from A and whose second comes from B.
\[ A \times B = \{\, (a,b) : a \in A,\ b \in B \,\} \]
For finite sets its size is the product of the sizes. This is the set-theoretic home of grids, tables, coordinate planes, and the graph of any relation or function.
\[ |A \times B| = |A|\cdot|B| \]
Ranking
Put in order
Put the moves of Worked example: build a Cartesian product into the order they have to happen.
Why: These are the moves of the worked example in the order it makes them, and each one is set up by the one before it. Hold the first entry at one and sweep the second entry through all of B.
Worked example
List every ordered pair in the product below.
\[ A=\{1,2\}, \qquad B=\{x,y\} \]
Pair the first element of A with each element of B
Why: Hold the first entry at one and sweep the second entry through all of B.
\[ (1,x),\ (1,y) \]
Pair the second element of A with each element of B
Why: Now hold the first entry at two and sweep again.
\[ (2,x),\ (2,y) \]
Collect the product
Why: Every pair with first entry from A and second from B is now listed.
\[ A\times B = \{(1,x),(1,y),(2,x),(2,y)\} \]
Verify the count with the product rule
Why: A has two elements and B has two elements, so the product should have two times two, which is four pairs. We listed exactly four, so the enumeration is complete.
\[ |A\times B| = 2 \cdot 2 = 4 \]
Picture it
Animation
Shows: Each line of the worked example "build a Cartesian product", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: A has two elements and B has two elements, so the product should have two times two, which is four pairs. We listed exactly four, so the enumeration is complete.
Trap
Two seductive slips: treating an ordered pair as the same object as the unordered pair, and assuming the product does not care about order.
\[ (a,b) \overset{?}{=} \{a,b\}, \qquad A\times B \overset{?}{=} B\times A \]
Under these, swapping entries would be harmless and the two products would be identical sets.
The ordered pair is a nested set that records position, and swapping generally changes it. The product is likewise order-sensitive.
\[ (1,2) \neq (2,1), \qquad A\times B \neq B\times A \text{ in general} \]
With A the singleton one and B the singleton two, the product one-then-two contains the pair one-two, while the reversed product contains the pair two-one. Different pairs, different sets.
Check
Count pairs, not elements: multiply the sizes.
\[ A=\{1,2\}, \qquad B=\{a,b,c\} \]
Check your understanding
How many ordered pairs are in A times B?
Answer: B
Why: The product has size equal to the product of the sizes. A has two elements and B has three, so there are two times three, which is six ordered pairs.
Concept
Naive set theory allowed any property to carve out a set: for any condition, form the set of all things satisfying it. Russell asked what happens with a self-referential condition.
\[ R = \{\, x : x \notin x \,\} \]
R is the set of all sets that are not members of themselves. Now ask the fatal question: is R a member of itself?
Intuition
A village barber shaves every person who does not shave themselves, and no one else. Does the barber shave himself?
If he does, then he is someone who shaves himself, so by the rule he must not be shaved by the barber, contradiction. If he does not, then he is exactly the kind of person the barber shaves, contradiction. No such barber can exist.
Russell's set is the barber. The self-membership question has no consistent answer, so the set cannot exist, and any theory that builds it is broken.
Explain it
Discussion prompt
Explain The barber who shaves exactly those who do not shave themselves to a student a year behind you. No notation, no jargon they have not met — and it still has to be true.
Hint: If your explanation needs a symbol they have never seen, you are describing the notation rather than the idea.
Answer:
A village barber shaves every person who does not shave themselves, and no one else. Does the barber shave himself?
Trap
The naive rule feels obviously safe: whatever condition you write down, there is a set of exactly the things that satisfy it.
\[ \{\, x : x \notin x \,\} \text{ is a set } ? \]
Testing membership of this set in itself gives a statement that is true exactly when it is false.
\[ R \in R \iff R \notin R \]
Unrestricted comprehension is inconsistent and must be dropped. The repair is the separation axiom: you may only carve a subset out of a set you already have.
\[ \{\, x \in A : P(x) \,\} \text{ is a set, given a set } A \]
Because you must start from an existing set A, the self-swallowing construction never gets off the ground, and the paradox is blocked.
Two truths and a lie
Sort into buckets
Some of these hold up and some are the exact mistakes this lesson is built to prevent. Sort them.
Concept
The modern fix replaces the naive rule with a short list of axioms, Zermelo-Fraenkel with Choice. Each says a specific way of building sets is allowed.
Extensionality: a set is determined by its members. Pairing, Union, Power set: you may form a pair, a union, and the set of all subsets. Infinity: an infinite set exists.
Separation and Replacement: you may carve out subsets by a property, and map a set onto a new set, always starting from a set you already have. Foundation: no infinite membership descent. Choice: you may select one element from each set in a family.
\[ \{\, x \in A : P(x)\,\} \ \checkmark \qquad \{\, x : P(x)\,\} \ \times \]
Analogy
Discussion prompt
Explain The ZFC axioms, in one breath by analogy to something with no Foundations of Higher Mathematics in it at all — a queue, a recipe, a map, a bank balance, whatever fits. Then say where your analogy breaks.
Hint: An analogy that never breaks is not an analogy, it is the same idea wearing a hat. Find the seam — that is the part that is actually new.
Answer:
The modern fix replaces the naive rule with a short list of axioms, Zermelo-Fraenkel with Choice. Each says a specific way of building sets is allowed.
Concept
From this single primitive, membership, everything downstream is built. Ordered pairs give relations; special relations give functions; functions give the whole apparatus of modern mathematics.
Numbers, spaces, groups, and limits are all ultimately sets with structure. Getting the language of sets exactly right is what lets the rest of the course stand on solid ground.
Counterexample
Discussion prompt
From this single primitive, membership, everything downstream is built. Ordered pairs give relations; special relations give functions; functions give the whole apparatus of modern mathematics.
That is stated as though it always holds. Do one of two things: produce a case where it fails, or say precisely what rules such a case out. "It just does" is not on the menu.
Hint: Hunt at the extremes first — zero, one, negative, empty, equal. If every extreme survives, the reason they survive is the proof.
Answer:
Numbers, spaces, groups, and limits are all ultimately sets with structure. Getting the language of sets exactly right is what lets the rest of the course stand on solid ground.
Explain it to yourself
Discussion prompt
In Pattern: your toolbox for set identities this move is made:
Route two: quote a Boolean-algebra law
Why is that legal? Name the rule or definition it rests on before you read on.
Hint: If you can only say "because that is what you do", the rule is the thing to go and find.
Answer:
Commutativity, associativity, distributivity, De Morgan, identity, complement, and absorption are all available; a chain of them proves many identities with no element in sight.
Pattern
Route one: element-chase
Why: To prove two sets equal, take an arbitrary element, unfold membership into and, or, not, then run the logic laws. Refold at the end.
Route two: quote a Boolean-algebra law
Why: Commutativity, associativity, distributivity, De Morgan, identity, complement, and absorption are all available; a chain of them proves many identities with no element in sight.
Route three: sanity-check on a small concrete example or a Venn diagram
Why: A tiny universe or a two-circle picture will not prove an identity, but it instantly exposes a false one and guides the real proof.
Real world
Discussion prompt
Outside this lesson: where does Sets, Operations & the Boolean Algebra of Sets actually turn up? Name one concrete situation — a job, a piece of software someone ships, a decision somebody has to make — and say which part of Pattern: your toolbox for set identities is doing the work in it.
Hint: Vague is the failure mode here. "Engineering" is not a situation; "deciding whether this build is fast enough to ship" is.
Answer:
That deck treats sets as the ambient language of mathematics. It separates membership from the subset relation and covers set-builder notation, the empty set, power sets, the Boolean-algebra laws for union, intersection, and complement - which are identical to those of propositional logic - and Cartesian products, then shows why naive comprehension collapses into Russell's paradox. It targets the classic confusion between element-of and subset-of, the belief that a universal set exists, and the slip between the empty set and the set containing the empty set.
Elimination
Eliminate the wrong options
Why is there no set R of all sets that are not members of themselves?
3 of these 4 are wrong. Strike them one at a time, and say what rules each one out before you strike the next. The survivor is the answer.
Survives elimination: B
Why: Asking whether R belongs to itself yields the statement that R is in R if and only if R is not in R, which cannot hold. So no such set exists, and unrestricted comprehension must be rejected.
Check
Test the self-membership question and see what it forces.
Check your understanding
Why is there no set R of all sets that are not members of themselves?
Answer: B
Why: Asking whether R belongs to itself yields the statement that R is in R if and only if R is not in R, which cannot hold. So no such set exists, and unrestricted comprehension must be rejected.
Connect it up
Draw it
One page, no notation unless you need it: draw how these connect — Pattern: deciding element-of versus subset · Pattern: proving a set identity by element-chasing · Pattern: your toolbox for set identities · A set is a collection, taken as one object · A set is a bag that only remembers membership. Put an arrow wherever one of them is what makes another possible, and label the arrow with why.
Recap
You can now speak the base language of mathematics precisely.
Membership relates an element to a set; the subset relation relates a set to a set. Peel one layer of braces and apply the exact rule, and the classic element-of versus subset confusion disappears.
The empty set is unique and vacuously a subset of everything, and the set containing it has one element, not zero. Power sets grow as two to the number of elements.
Union, intersection, and complement obey the Boolean-algebra laws, which are propositional logic in disguise, and you can prove any set identity by element-chasing or by a chain of those laws.
Ordered pairs and Cartesian products are themselves sets, and complement is only meaningful against a chosen universe, because a universal set of everything leads to Russell's paradox, which is why we adopt the ZFC axioms.
Want this taught 1-on-1? Alexander tutors Foundations of Higher Mathematics — $55/session, free consultation.