- Practice
- About 20 min
- 5 practice questions
Sets revisited: subsets, power sets and the laws of set operations
Use ∈ and ⊆ correctly, find power sets, complements, differences and symmetric differences, apply the laws of set operations and count elements with the cardinality formulas.
If something looks wrong, please tell us.
By the end of this lesson you can
- Decide whether a description gives a well-defined set, and tell when ∈ can sit between two sets.
- Name trivial, proper and improper subsets and use n(P(A)) = 2ⁿ.
- Find A′, A − B and A∆B, and simplify expressions with the laws of set operations, including De Morgan's laws.
- Solve counting problems with n(A ∪ B) and n(A ∪ B ∪ C).
Chapter 1 of the Tamil Nadu textbook opens with sets because relations and functions, the real subject of the chapter, are built out of them: a relation is a set of ordered pairs and a function is a special relation. You met sets, Venn diagrams and the basic operations in earlier classes. This lesson sharpens those ideas and adds a few new tools that the rest of the chapter needs.
Well-defined collections
A set is a collection of objects that is well-defined: given any object, we can say for certain whether it belongs to the collection. "The tall students of Class 11" is not a set, because tall means different things to different people. "The students of Class 11 whose height is more than 170 cm" is a set, because a measuring tape settles every case. When a description uses words of opinion such as good, beautiful, old or famous, replace them with a measurable condition before treating the collection as a set.
The symbol ∈ links an element to a set. It can sit between two sets, provided the first set is itself one of the elements of the second. If A = {2, 3} and B = {1, {2, 3}, 5}, then A ∈ B, because the set {2, 3} is listed as one element of B. But A ⊆ B is false, since the number 2 is not an element of B. Always ask: is this object listed as a member? (use ∈) or is every member of this set also a member of that one? (use ⊆).
Subsets and the number systems
A ⊆ B means every element of A is an element of B; then A is a subset of B and B is a superset of A. If A ⊆ B and B ⊆ A, the two sets are equal. For any set A, the empty set ∅ and A itself are always subsets of A; these two are called the trivial subsets. A is a proper subset of B when A ⊆ B and A ≠ B, so B has at least one extra element. Since every set is a subset of itself, A is called the improper subset of A.
The number systems nest inside one another: N ⊂ W ⊂ Z ⊂ Q ⊂ R, where N is the set of natural numbers (positive integers), W the non-negative integers {0, 1, 2, ...}, Z the integers, Q the rationals and R the reals. The irrational numbers form a subset of R that is not a subset of N, W, Z or Q.
The real numbers R
-
Rational numbers Q
p/q with p, q integers and q ≠ 0
- Integers Z
- inside Z: whole numbers W = {0, 1, 2, ...}
- inside W: natural numbers N = {1, 2, 3, ...}
- Fractions such as −7/3
-
Irrational numbers
real but not rational
- √2, √5
- π, e
Operations on sets
Union and intersection. A ∪ B = {x : x ∈ A or x ∈ B} and A ∩ B = {x : x ∈ A and x ∈ B}. A and B are disjoint when A ∩ B = ∅. For many sets A₁, A₂, ..., Aₙ we write ⋃ Aᵢ (i from 1 to n) for A₁ ∪ A₂ ∪ ... ∪ Aₙ, the set of objects lying in at least one Aᵢ, and ⋂ Aᵢ for A₁ ∩ A₂ ∩ ... ∩ Aₙ, the set of objects lying in every Aᵢ. For example, if Aᵢ = {i, i + 1, i + 2} for i = 1, 2, 3, then A₁ = {1, 2, 3}, A₂ = {2, 3, 4}, A₃ = {3, 4, 5}; the union is {1, 2, 3, 4, 5} and the intersection is {3}.
Power set. The set of all subsets of A is the power set P(A) = {B : B ⊆ A}. If n(A) = n, then n(P(A)) = 2ⁿ, because each element is either in or out of a subset: two choices per element.
Universal set and complement. All the sets in a problem are taken as subsets of one fixed set U, the universal set. For the set of prime numbers, U could be N, W, Z, Q or R, whichever suits the problem. The complement of A is A′ (also written Aᶜ) = {x : x ∈ U and x ∉ A}.
Difference and symmetric difference. A − B (also written A \ B) = {x : x ∈ A and x ∉ B}. Useful facts: U − A = A′, A − A = ∅, ∅ − A = ∅, A − ∅ = A and A − U = ∅. The symmetric difference is A∆B = (A − B) ∪ (B − A): the elements in exactly one of the two sets. Equivalently A∆B = (A ∪ B) − (A ∩ B).
Cardinality. A set X is finite if it has k elements for some k ∈ W; then n(X) = k is its cardinality. A set that is not finite is infinite. A set with n(A) = 1 is a singleton. Note n(∅) = 0 but n({∅}) = 1, since {∅} has one element, namely ∅.
Laws of set operations
| Law | Union form | Intersection form |
|---|---|---|
| Commutative | A ∪ B = B ∪ A | A ∩ B = B ∩ A |
| Associative | (A ∪ B) ∪ C = A ∪ (B ∪ C) | (A ∩ B) ∩ C = A ∩ (B ∩ C) |
| Distributive | A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) | A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) |
| Identity | A ∪ ∅ = A | A ∩ U = A |
| Idempotent | A ∪ A = A | A ∩ A = A |
| Absorption | A ∪ (A ∩ B) = A | A ∩ (A ∪ B) = A |
| Complement | A ∪ A′ = U, ∅′ = U | A ∩ A′ = ∅, U′ = ∅ |
| De Morgan | (A ∪ B)′ = A′ ∩ B′ | (A ∩ B)′ = A′ ∪ B′ |
De Morgan's laws also hold for differences: A − (B ∪ C) = (A − B) ∩ (A − C) and A − (B ∩ C) = (A − B) ∪ (A − C). For symmetric difference: A∆B = B∆A, (A∆B)∆C = A∆(B∆C) and A ∩ (B∆C) = (A ∩ B)∆(A ∩ C). Also A ∪ U = U.
n(A ∪ B) = n(A) + n(B) − n(A ∩ B); for disjoint sets n(A ∪ B) = n(A) + n(B). n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C) − n(A ∩ C) + n(A ∩ B ∩ C).
Worked example 1: a power set count
Find the number of subsets of A = {x : x = 3n − 1, n ∈ N, 1 ≤ n ≤ 4}. Working: n = 1, 2, 3, 4 give x = 2, 5, 8, 11, so A = {2, 5, 8, 11} and n(A) = 4. Hence n(P(A)) = 2⁴ = 16.
Worked example 2: a three-set survey (made-up data)
In a made-up survey of 600 students, 300 read a Tamil newspaper (T), 250 an English one (E) and 120 a Hindi one (H); 100 read T and E, 50 read E and H, 40 read T and H, and 20 read all three. How many read only the Tamil paper, and how many read none?
Working: only T = n(T ∩ E′ ∩ H′) = n(T) − n(T ∩ E) − n(T ∩ H) + n(T ∩ E ∩ H) = 300 − 100 − 40 + 20 = 180. (The 20 who read all three were subtracted twice, so they are added back once.) At least one paper: n(T ∪ E ∪ H) = 300 + 250 + 120 − 100 − 50 − 40 + 20 = 500, so 100 read none. Check with a Venn diagram: only E = 250 − 100 − 50 + 20 = 120, only H = 120 − 50 − 40 + 20 = 50, T and E only = 80, E and H only = 30, T and H only = 20, all three = 20; 180 + 120 + 50 + 80 + 30 + 20 + 20 = 500.
Counting 'only A' in a three-set problem
- Start with n(A) everyone in A
- Subtract n(A ∩ B) and n(A ∩ C) removes those who are also in B or C
- Add back n(A ∩ B ∩ C) it was removed twice
- Result: n(A ∩ B′ ∩ C′) those in A only
Worked example 3: from ratios to a power set
Suppose n(A − B) = 3 n(A ∩ B), n(B − A) = 2 n(A ∩ B) and n(A ∪ B) = 18. Find n(P(A)). Working: let n(A ∩ B) = k. The three regions A − B, A ∩ B and B − A are disjoint and together make A ∪ B, so 3k + k + 2k = 6k = 18, giving k = 3. Then n(A) = n(A − B) + n(A ∩ B) = 9 + 3 = 12 and n(P(A)) = 2¹² = 4096.
Worked example 4: symmetric difference two ways
Let A = {1, 2, 3, 5, 8} and B = {2, 4, 6, 8}. First way: A − B = {1, 3, 5} and B − A = {4, 6}, so A∆B = {1, 3, 4, 5, 6}. Second way: A ∪ B = {1, 2, 3, 4, 5, 6, 8} and A ∩ B = {2, 8}, so (A ∪ B) − (A ∩ B) = {1, 3, 4, 5, 6}. Both agree.
Worked example 5: simplifying with the laws
Simplify A ∪ (A′ ∩ B). Working: by the distributive law, A ∪ (A′ ∩ B) = (A ∪ A′) ∩ (A ∪ B) = U ∩ (A ∪ B) = A ∪ B. Similarly, (A ∩ B)′ ∩ A = (A′ ∪ B′) ∩ A = (A′ ∩ A) ∪ (B′ ∩ A) = ∅ ∪ (A ∩ B′) = A − B.
Worked example 6: counting sets with a condition
Let X = {1, 2, ..., 8} and A = {1, 2, 3, 4}. How many sets B ⊆ X satisfy A − B = {1, 2}? Working: for A − B to be exactly {1, 2}, the elements 1 and 2 must be outside B, while 3 and 4 must be inside B. The elements 5, 6, 7, 8 are not in A, so they do not affect A − B; each may be in or out of B. So the number of such B is 2⁴ = 16.
Key takeaways: ∈ links a member to a set, ⊆ links two sets; ∅ and A are the trivial subsets of A; n(P(A)) = 2ⁿ; A∆B = (A ∪ B) − (A ∩ B); De Morgan's laws turn a complement of a union into an intersection of complements; and in three-set counting problems, add back what was subtracted twice.
Check your understanding
-
1. If A = {1, {2}, 3}, which statement is true?
- {2} ⊆ A
- 2 ∈ A
- {2} ∈ A
- {1, 2} ⊆ A
Show answer
Answer: C. The elements of A are 1, the set {2}, and 3. So {2} ∈ A is true. {2} ⊆ A would need the number 2 to be an element of A, which it is not; for the same reason 2 ∈ A and {1, 2} ⊆ A are false.
-
2. A set has 6 elements. How many proper subsets does it have?
- 64
- 63
- 62
- 32
Show answer
Answer: B. The number of subsets is 2⁶ = 64. Every subset except the set itself is proper, so there are 64 − 1 = 63 proper subsets.
-
3. If A = {a, b, c, d} and B = {c, d, e}, what is A∆B?
- {c, d}
- {a, b}
- {a, b, c, d, e}
- {a, b, e}
Show answer
Answer: D. A − B = {a, b} and B − A = {e}. Their union is A∆B = {a, b, e}: the elements in exactly one of the two sets.
-
4. Which expression is equal to (A ∪ B)′?
- A′ ∩ B′
- A′ ∪ B′
- A ∩ B
- A′ − B
Show answer
Answer: A. By De Morgan's law, the complement of a union is the intersection of the complements: (A ∪ B)′ = A′ ∩ B′.
-
5. If n(A) = 25, n(B) = 18 and n(A ∪ B) = 35, what is n(A ∩ B)?
- 7
- 10
- 8
- 17
Show answer
Answer: C. n(A ∩ B) = n(A) + n(B) − n(A ∪ B) = 25 + 18 − 35 = 8.
Sign in to keep track of the lessons you finish.