Subsets and Supersets: Definitions, Symbols, Power Sets

A subset is a set whose every element also belongs to another set: A ⊆ B means each element of A is in B. B is then called a superset of A, written B ⊇ A. A proper subset A ⊂ B is stricter — A ⊆ B but A ≠ B, so B has at least one extra element. Every set also has a power set P(A), the collection of all its subsets.

This matters because subset relationships organise all of mathematics: natural numbers are a subset of integers, even numbers are a proper subset of integers, and the power set counts every possible sub-collection — a question that appears in probability, logic, and computer science.

Key Concepts

• Subset A ⊆ B: every element of A is an element of B.
• Proper subset A ⊂ B: A ⊆ B and A ≠ B; at least one element of B is outside A.
• Superset B ⊇ A: the mirror statement — B contains everything in A.
• Power set P(A): the set of all subsets of A, including ∅ and A itself.
• Empty set rule: ∅ is a subset of every set.

Formulas

• Number of subsets: a set with n elements has exactly 2^n subsets.
• Number of proper subsets: 2^n − 1 (exclude the set itself).
• Power set size: n(P(A)) = 2^n when n(A) = n.
• Each element independently has two choices — in or out of a subset — which is why the count is 2^n.

Worked Example

List all subsets of A = {a, b, c}. Here n = 3, so there are 2³ = 8 subsets. Grouping by size: 0 elements: ∅; 1 element: {a}, {b}, {c}; 2 elements: {a, b}, {a, c}, {b, c}; 3 elements: {a, b, c}. That is 1 + 3 + 3 + 1 = 8 subsets, matching the formula. The proper subsets are all except {a, b, c} itself: 8 − 1 = 7.

Common Misconceptions

• "∅ is a subset of nothing." Wrong — the empty set is a subset of every set, since the condition "every element of ∅ is in A" holds vacuously.
• "a ⊆ A means the same as a ∈ A." Wrong — a ∈ A says a is an element; {a} ⊆ A says the set {a} is a subset. Elements and subsets are different things.
• "A ⊆ B means A is smaller." Not always — ⊆ allows equality; only the proper subset symbol ⊂ guarantees B is strictly bigger.

Real-World Applications

• Probability: events are subsets of the sample space; counting them uses 2^n.
• Logic: "if P then Q" mirrors the subset relation between truth sets.
• Programming: bitmask techniques enumerate all 2^n subsets of a collection.
• Databases: filtered queries return subsets of the full table.

Subsets capture the "contained in" idea: ⊆ for containment, ⊂ for strict containment, and the power set collecting all 2^n possibilities. Keep elements distinct from subsets, remember ∅ ⊆ A always, and subset problems become mechanical.