Subsets and Supersets

Core Idea

Set A is a subset of set B (written A ⊆ B) if every element of A is also an element of B. Equivalently, B is a superset of A (B ⊇ A). If A is a subset of B but A ≠ B (meaning B has at least one element not in A), then A is a proper subset of B (written A ⊂ B). Every set is a subset of itself, and the empty set is a subset of every set. Subset relationships formalize the idea of one category being entirely contained within another — like how all squares are rectangles, but not all rectangles are squares.

How It's Best Learned

Use Venn diagrams to visualize containment: draw A inside B. Start with concrete numerical sets: {1, 2} ⊆ {1, 2, 3, 4} because both elements of A appear in B. Then use categorical examples: the set of squares is a subset of the set of rectangles, which is a subset of the set of quadrilaterals. Practice checking subset claims by testing each element. Introduce the empty set as a subset of everything — it has no elements, so the condition "every element of ∅ is in B" is vacuously true.

Common Misconceptions

• Confusing "element of" (∈) with "subset of" (⊆). 3 ∈ {1, 2, 3} but 3 ⊄ {1, 2, 3} — an element is not the same as a set. However, {3} ⊆ {1, 2, 3}.
• Not understanding why ∅ ⊆ A for every set A. The condition "every element of ∅ is in A" is vacuously true because ∅ has no elements to check.
• Thinking A ⊆ B means A is "smaller" than B. Size is not the criterion — containment is. If A = B, then A ⊆ B even though they are the same size.

Explainer

The subset relationship captures the idea of one collection being entirely contained within another. When you say "all squares are rectangles," you are saying that the set of squares is a subset of the set of rectangles — every square is a rectangle, so every element of the first set is an element of the second.

The notation A ⊆ B means "A is a subset of B," which formally means: for every element x, if x ∈ A, then x ∈ B. To verify a subset claim, you check each element of A and confirm it appears in B. If even one element of A is missing from B, then A is not a subset of B. For example, {2, 4, 6} ⊆ {1, 2, 3, 4, 5, 6} because 2, 4, and 6 all appear in the larger set. But {2, 4, 7} ⊄ {1, 2, 3, 4, 5, 6} because 7 is missing.

A proper subset (A ⊂ B) adds one condition: A must be a subset of B, and A must not equal B. This means B contains everything A contains, plus at least one additional element. {1, 2} ⊂ {1, 2, 3} because {1, 2} is a subset and 3 is in B but not in A. This parallels the < vs ≤ distinction for numbers: ⊂ is strict containment (like <), while ⊆ allows equality (like ≤).

Two special cases are important. First, every set is a subset of itself: A ⊆ A is always true because every element of A is trivially in A. This is the "≤" case — a number is always less than or equal to itself. Second, the empty set is a subset of every set: ∅ ⊆ A for any A. This follows from vacuous truth — the statement "every element of ∅ is in A" is true because there are no elements in ∅ to check. If this feels strange, think of it as passing a test with zero questions: you cannot get any wrong.

The superset relationship is just the reverse perspective: if A ⊆ B, then B ⊇ A (B is a superset of A). It is the same relationship viewed from the other direction. When building set-theoretic arguments, you will often prove A = B by showing A ⊆ B and B ⊆ A — the two-way containment proves the sets are identical. This strategy connects directly to the biconditional logic you learned earlier: proving A = B requires both directions, just as proving "P if and only if Q" requires both the forward and reverse conditionals.