SET 14 · Memory Tricks & Traps
🧠 Memory tricks
| To remember | Trick |
|---|---|
| ∪ vs ∩ | ∪ is a cup (holds more) = OR; ∩ is a cap = AND |
| Every set law | Translate to logic: ∪ → ∨, ∩ → ∧, ’ → ¬, U → T, ϕ → F |
| A − B | ”A and not B” = A ∩ B’ |
| ∈ vs ⊆ | Box analogy: ∈ = “is one of the items in the box”; ⊆ = “every item of my box is in your box” |
| ∈ ↔ ⊆ | Wrap it: X ∈ A ⟺ {X} ⊆ A |
| ∈ 2ᴬ | X ∈ 2ᴬ ⟺ X ⊆ A |
| ϕ | ϕ ⊆ everything; ϕ ∈ only what lists it |
| ϕ vs {ϕ} | Empty box vs a box with an empty box inside |
| |P(A)| = 2ⁿ | In or out: 2 choices per element |
| Proper subsets | 2ⁿ minus the set itself = 2ⁿ − 1 |
| De Morgan | ”Break the bar, flip the sign”: (A ∪ B)’ = A’ ∩ B’ |
| Absorption | ”The big eats the small”: A ∪ (A ∩ B) = A |
| ⊕ | “Odd ones survive”: in an odd number of sets |
| Inclusion–exclusion | Add singles, subtract pairs, add triples |
| Comparing 3-set expressions | Region method: list regions 1–8 for each side |
⚠️ Edge cases & traps
Definitions
- Subjective collections (“beautiful”, “best”, “tall”) are not sets.
- Duplicates and order don’t matter in sets — but do matter in tuples.
- “Odd numbers divisible by 2” is a set: the empty set.
∈ vs ⊆
- An element nested inside an inner set is not an element of the outer set: 1 ∉ {{1,2},3}.
- {1,2} ∈ {{1,2},3} but {1,2} ⊄ {{1,2},3}.
- “1 ⊆ B” is false — 1 isn’t a set.
- A set can be both an element and a subset: {ϕ} ∈ {ϕ,{ϕ}} and {ϕ} ⊆ {ϕ,{ϕ}}.
Empty set
- ϕ ⊆ X always; ϕ ∈ X only if listed.
- ϕ ≠ {ϕ}; |ϕ| = 0, |{ϕ}| = 1.
- P(ϕ) = {ϕ}, not ϕ — it has 1 element.
- ϕ has exactly one subset (itself); every non-empty set has at least two.
Proper subset
- A set is never a proper subset of itself — watch for sets that look different but are equal after removing duplicates ({{ϕ},{ϕ}} = {{ϕ}}).
- ⊂ is not reflexive; ⊆ is.
Counting
- Count top-level elements only: |{{ϕ}, 1, {2,3}}| = 3.
- {0, 1, …, 10} has 11 elements.
- |A×B| = mn, but |P(A×B)| = 2^{mn}, and |P(A)×P(B)| = 2^{m+n}.
- ϕ × A = ϕ, so |ϕ × A| = 0, not |A|.
Operations & identities
- A − B ≠ B − A; difference isn’t associative.
- A ∪ B = A ∪ C does not give B = C (A ⊕ B = A ⊕ C does).
- P(A ∪ B) ≠ P(A) ∪ P(B) in general.
- The complement depends on U.
- (A ∩ B) ∪ C = A ∩ (B ∪ C) only when C ⊆ A.
- A single numeric example agreeing doesn’t prove two expressions are equal — but a single disagreeing example does prove they differ.
Products
- (a, b) ≠ (b, a) unless a = b.
- A×B×C ≠ (A×B)×C (triples vs nested pairs).
Prev ← SET 13 Flashcards · Next → SET 15 Cheat Sheet