The power set (also written ) is the set of all subsets of . This single fact collapses two relations that look different on the page into one:
The symbol on the left (membership in ) is the same test as on the right (inclusion in ). So a question that asks "is an element of ?" is really asking "is every element of also an element of ?"
Two relations, kept straight
| Statement | True when | Read as |
|---|---|---|
| is literally one of the listed elements of | " is a member of " | |
| every element of is a member of | " is a subset of " | |
| same as | " is a subset of " | |
| every element of is itself a subset of | " is a set of subsets of " |
Two facts always hold, because and :
And if is finite with , then .
Counting elements is the first move
Membership checks go wrong when you miscount the elements of the outer set, especially with nested empty sets. These three are distinct:
- — the empty set, elements;
- — a set whose one element is , so element;
- — a set whose one element is , so element.
Braces matter: peel one layer at a time.
Worked mini-example
Let — a set with exactly three elements. Test two candidates for membership in .
Candidate . This is the singleton whose only element is . Is ? Yes — it is the second listed element. Every element of the candidate lies in , so , hence . ✓
Candidate . Both and , so this is a subset of and therefore an element of . ✓
Notice the trap: is a member of even though, as a set, it is not one of the three listed elements of — what matters is that its contents sit inside .
Pitfall: "" never means " is one of the listed elements of ." It means "," i.e. every element of belongs to . Before testing anything, count the distinct elements of by peeling braces one layer at a time — nested empty sets like , , are three different objects.