Subsets and Proper Subsets
What you'll learn: You'll learn how to determine when one set is completely contained within another and understand the subtle but important difference between subsets and proper subsets.
The Core Idea
When every element of set A also belongs to set B, we say that A is a subset of B, written A ⊆ B. Think of it like nested boxes: if everything in the smaller box can also be found in the larger box, the smaller box's contents form a subset of the larger box's contents.
For example:
- If A = {1, 2} and B = {1, 2, 3, 4}, then A ⊆ B because every element of A (namely 1 and 2) is also in B.
- Importantly, every set is a subset of itself: A ⊆ A always holds.
- The empty set ∅ is a subset of every set (even itself).
Proper Subsets
A proper subset is a subset that is not equal to the original set — it's strictly smaller. We write A ⊂ B (or sometimes A ⊊ B) to mean A ⊆ B and A ≠ B.
Using our example above: A = {1, 2} is a proper subset of B = {1, 2, 3, 4} because A ⊆ B and A ≠ B.
However, A is not a proper subset of itself, because A = A.
The Formal Definitions
- Subset: A ⊆ B means (∀x)(x ∈ A → x ∈ B)
- Proper Subset: A ⊂ B means A ⊆ B and A ≠ B (equivalently, A ⊆ B and there exists at least one element in B that's not in A)
Analogy
Think of "subset" like "less than or equal to" (≤) for numbers, while "proper subset" is like "strictly less than" (<).
Key Takeaway: Every set is a subset of itself and ∅ is a subset of all sets, but proper subsets are strictly smaller—they're missing at least one element from the containing set.