20 min read
Subsets
A subset is a set entirely contained within another set.
What Is a Subset?
⊆ means "is a subset of". If A ⊆ B, checking every single element of A against B must find a match every time.
A proper subset (written A ⊂ B) is a subset that is not equal to the whole set — B must contain at least one extra element that is not in A.
Example 1 — checking a subset
Let A = {, } and B = {, , , , }. Is A ⊆ B?
- Check each element of A against B.
- Is in B? Yes.
- Is in B? Yes.
- Every element of A is in B, so A ⊆ B.
Answer: Yes, A ⊆ B
Example 2 — not a subset
Let C = {, } and D = {, , , , }. Is C ⊆ D?
- Check each element of C against D.
- Is in D? Yes.
- Is in D? No — is missing from D.
- Since one element fails, C is not a subset of D.
Answer: No, C ⊄ D
Example 3 — sets of sets
Let and .
- Is ? Yes — is an element of G, so the set containing only is a subset of G.
- Is ? Yes — is one of the elements listed inside H.
- Is ? No — H's elements are sets like , not the bare number .
- Is ? Yes — the empty set is a subset of every set.
- Is ? No — has no elements; has one element (the empty set).
The Universal Set
Every set considered in a problem is automatically a subset of the universal set U, because U contains everything being discussed. The empty set ∅ is also a subset of every set, including itself — there are no elements in ∅ to fail the check.
Practice
Select every subset of U.
More lessons in Sets and Functions · Next: Venn Diagrams · Previous: Describing Sets
