- Practice
- About 16 min
- 5 practice questions
Set equations: unknown sets, cancellation traps and sandwich counts
Handle questions where a set is unknown: why A ∪ B = A ∪ C does not give B = C, when two conditions together do, how to count sets X between two given sets, and which equalities mean A ⊆ B.
If something looks wrong, please tell us.
In algebra you can cancel a common term from both sides of an equation. Sets do not always allow this, and exam questions are built on that difference. This lesson covers the cancellation traps, the equalities that are all disguised forms of A ⊆ B, and a counting method for unknown sets that lie between two known sets.
Four ways of saying A ⊆ B
The following statements are equivalent: A ⊆ B; A ∩ B = A; A ∪ B = B; A − B = ∅. If a question gives one of the last three, translate it to A ⊆ B and continue. For example, if A ∩ B = A, then A has nothing outside B, so every element of A is in B.
The cancellation trap
From A ∪ B = A ∪ C you cannot conclude B = C. Take A = {1, 2}, B = {2, 3} and C = {3}. Then A ∪ B = {1, 2, 3} = A ∪ C, but B ≠ C. In the same way A ∩ B = A ∩ C does not give B = C: with A = {1, 2}, B = {2, 3} and C = {2, 4}, both intersections are {2}. The elements 'hidden' inside A are what stop the cancellation. However, both conditions together do give B = C.
A ∪ B = A ∪ C alone does not give B = C, and A ∩ B = A ∩ C alone does not either. If both hold, then B = C. Also A ⊆ B ⟺ A ∩ B = A ⟺ A ∪ B = B ⟺ A − B = ∅.
Worked example 1: why both conditions work
Suppose A ∪ B = A ∪ C and A ∩ B = A ∩ C. Take any x in B. If x is in A, then x is in A ∩ B = A ∩ C, so x is in C. If x is not in A, then x is in A ∪ B = A ∪ C, and since it is not in A it must be in C. In both cases x is in C, so B ⊆ C. By the same argument with B and C swapped, C ⊆ B. Hence B = C.
Counting sets between two sets
Suppose A ⊆ X ⊆ B for a finite set X. The elements of A must be in X and the elements outside B must not be. The remaining n(B) − n(A) elements are free, each with two choices (in or out). So the number of such sets X is 2^(n(B) − n(A)).
Worked example 2: a sandwich count
Let A = {1, 2} and B = {1, 2, 3, 4, 5, 6}. The sets X with A ⊆ X ⊆ B are found by choosing freely among the 6 − 2 = 4 elements 3, 4, 5, 6, giving 2⁴ = 16 sets. The smallest is A itself and the largest is B.
Worked example 3: a union condition
Let A = {1, 2} and B = {1, 2, 3, 4, 5}. How many sets X satisfy A ∪ X = B? The union must be exactly B, so X is a subset of B, and X must contain the elements of B that are not in A, namely 3, 4 and 5. For the elements 1 and 2, which are already covered by A, X is free to include them or not. That gives 2² = 4 sets: {3, 4, 5}, {1, 3, 4, 5}, {2, 3, 4, 5} and {1, 2, 3, 4, 5}.
Worked example 4: intersection condition
Let A = {1, 2, 3} and U = {1, 2, 3, 4, 5}. How many subsets X of U satisfy A ∩ X = {1, 2}? The element 1 and the element 2 must be in X, the element 3 must be left out, and the elements 4 and 5 are free (they are outside A so they do not affect the intersection). That gives 2² = 4 sets.
Traps
- Cancelling A from A ∪ B = A ∪ C: always test with a small counterexample.
- Treating A ∩ B = A as 'A = B': it only means A ⊆ B.
- Forgetting that 'free' elements double the count each: with k free elements the count is 2ᵏ.
- Counting the sets A and B themselves out of a sandwich count: both are included.
Key takeaways: translate every equality into a subset statement, remember that a single union or intersection equality cannot be cancelled, and count unknown sets by listing forced, forbidden and free elements.
Check your understanding
-
1. If A ∩ B = A, which statement is true?
- B ⊆ A
- A = B
- A ⊆ B
- A ∩ B = ∅
Show answer
Answer: C. A ∩ B = A means every element of A lies in B, which is the definition of A ⊆ B.
-
2. How many sets X satisfy {1, 2} ⊆ X ⊆ {1, 2, 3, 4, 5, 6}?
- 16
- 64
- 32
- 8
Show answer
Answer: A. The elements 3, 4, 5, 6 are free, each with 2 choices, so the number is 2⁴ = 16.
-
3. Let A = {1, 2} and B = {1, 2, 3, 4, 5}. How many sets X satisfy A ∪ X = B?
- 8
- 2
- 3
- 4
Show answer
Answer: D. X must contain 3, 4, 5 and be inside B. The elements 1 and 2 are free, giving 2² = 4 sets.
-
4. If A ∪ B = A ∪ C, can we conclude that B = C?
- Yes: cancel A from both sides of the equation
- No: A = {1, 2}, B = {2, 3}, C = {3} is a counterexample
- Yes, whenever A is a non-empty set
- Yes, whenever B and C are finite sets
Show answer
Answer: B. With A = {1, 2}, B = {2, 3} and C = {3}, both unions equal {1, 2, 3} but B ≠ C. So the conclusion cannot be drawn from the union equality alone.
-
5. If A ∪ B = A ∪ C and A ∩ B = A ∩ C, then
- B = C
- A = B
- B ∩ C = ∅
- A ⊆ B
Show answer
Answer: A. Both conditions together force B = C: an element of B is either in A (so in A ∩ C) or outside A (so in A ∪ C and not in A), and in both cases it is in C.
Sign in to keep track of the lessons you finish.