Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Subsets






Containment and the Power Set


A subset relationship describes when one set is entirely contained within another. This concept provides the fundamental way to compare sets and establish hierarchies among collections. From subsets emerges the power set — the collection of all possible subsets a given set can produce — which connects directly to combinatorics and counting principles.

Key Terms

Subseta set whose elements all belong to another set
Proper Subseta subset strictly smaller than its containing set
Supersetthe inverse of the subset relation
Power Setthe collection of all subsets of a given set
Empty Setsubset of every set by vacuous truth
Cardinalitydetermines the number of subsets via 2A2^{|A|}

See All Set Theory Definitions



Subsets


    A set AA is a subset of a set BB if every element of AA is also an element of BB. This relationship is written:

    ABA \subseteq B


    The formal definition uses a universal quantifier:

    AB    x(xAxB)A \subseteq B \iff \forall x\,(x \in A \Rightarrow x \in B)


    Consider A={2,4}A = \{2, 4\} and B={1,2,3,4,5}B = \{1, 2, 3, 4, 5\}. Since both 22 and 44 appear in BB, we have ABA \subseteq B. However, {2,6}⊈B\{2, 6\} \not\subseteq B because 6B6 \notin B — a single missing element breaks the subset relationship.

    Two facts hold universally:

  • AAA \subseteq A for any set AA

  • A\emptyset \subseteq A for any set AA

  • The first fact is immediate since every element of AA trivially belongs to AA. The second follows because the empty set contains no elements, so there is no element that could fail to belong to AA.
UAB
A ⊆ B, frozen

The whole of circle A sits inside circle B — shaded, because every element of A is already an element of B. Nudge the sets between nested, overlapping, and disjoint configurations on the two-set Venn explorer.

Containment is the relation the rest of this page builds on — proper subsets sharpen it, supersets reverse it, and the power set collects every way it can happen.

Proper Subsets


A set AA is a proper subset of BB if AA is a subset of BB but AA is not equal to BB. This is written:

ABA \subset B


Equivalently:

AB    (AB)(AB)A \subset B \iff (A \subseteq B) \land (A \neq B)


The distinction matters: {1,2}{1,2}\{1, 2\} \subseteq \{1, 2\} is true, but {1,2}{1,2}\{1, 2\} \subset \{1, 2\} is false because the two sets are equal. For a proper subset, there must exist at least one element in BB that does not belong to AA.

If A={a,b}A = \{a, b\} and B={a,b,c}B = \{a, b, c\}, then ABA \subset B because cBc \in B but cAc \notin A.

The empty set satisfies A\emptyset \subset A for every non-empty set AA, since A\emptyset \subseteq A and A\emptyset \neq A. However, \emptyset \subset \emptyset is false because =\emptyset = \emptyset.

Superset


The superset relation is the inverse of the subset relation. If ABA \subseteq B, then BB is a superset of AA, written:

BAB \supseteq A


This is read as "BB contains AA" or "BB is a superset of AA." Similarly, if ABA \subset B, then BB is a proper superset of AA:

BAB \supset A


The superset notation simply reverses perspective. Whether to write ABA \subseteq B or BAB \supseteq A depends on which set you want to emphasize. Both statements convey the same relationship.

The standard number sets provide a natural example of superset chains:

CRQZN\mathbb{C} \supset \mathbb{R} \supset \mathbb{Q} \supset \mathbb{Z} \supset \mathbb{N}


Each set properly contains the one to its right: the complex numbers contain the reals, which contain the rationals, and so on.

Number of Subsets


    A set with nn elements has exactly 2n2^n subsets. This count includes both the empty set and the set itself.

    The reasoning is straightforward: for each element, there are two choices — include it in the subset or exclude it. With nn elements, this gives:

    2×2××2=2n2 \times 2 \times \cdots \times 2 = 2^n


    independent choices, yielding 2n2^n distinct subsets.

    For proper subsets, we exclude the set itself from the count:

    Number of Proper Subsets
    number of proper subsets of A=2A1\text{number of proper subsets of } A = 2^{|A|} - 1
    Learn more about this formula: Number of Proper Subsets →


    Examples:

  • 00 elements (the empty set) has 20=12^0 = 1 subset: itself

  • 33 elements has 23=82^3 = 8 subsets and 77 proper subsets

  • 1010 elements has 210=10242^{10} = 1024 subsets

  • This counting principle connects directly to the binomial coefficients: the number of subsets of size kk from a set of nn elements is (nk)\binom{n}{k}, and summing over all possible sizes gives:

    k=0n(nk)=2n\sum_{k=0}^{n} \binom{n}{k} = 2^n

n = |A| Total subsets  (2n) Proper subsets  (2n − 1)
0 1 0
1 2 1
2 4 3
3 8 7
4 16 15
5 32 31
10 1,024 1,023

Power Set


The power set of a set AA, denoted P(A)\mathcal{P}(A) or 2A2^A, is the set of all subsets of AA:

P(A)={S:SA}\mathcal{P}(A) = \{S : S \subseteq A\}


For A={1,2}A = \{1, 2\}, the power set is:

P({1,2})={,{1},{2},{1,2}}\mathcal{P}(\{1, 2\}) = \{\emptyset, \{1\}, \{2\}, \{1, 2\}\}


The empty set and AA itself are always elements of P(A)\mathcal{P}(A).

The cardinality of the power set follows directly from subset counting:

Cardinality of Power Set
P(A)=2A|\mathcal{P}(A)| = 2^{|A|}
Learn more about this formula: Cardinality of Power Set →


The power set of the empty set deserves attention:

P()={}\mathcal{P}(\emptyset) = \{\emptyset\}


This is not the empty set — it is a set containing one element (the empty set). The distinction matters: P()=1|\mathcal{P}(\emptyset)| = 1, not 00.

The power set transforms subset relationships into membership relationships: BAB \subseteq A if and only if BP(A)B \in \mathcal{P}(A).

Subset and Superset Notation

Notation

Subset and Superset Notation

Four containment marks, a calligraphic P with an exponent twin, and the double-struck number chain — all met above, gathered here with their reading rules and their one genuine convention war. The reference card below lists the four containment symbols at a glance.
\in, \varnothing, the braces and set-builder come from set theory basics; the counting behind 2A2^{|A|} is cardinality's business.
\subseteq · \subset
is a subset of; is a proper subset of
Containment with and without the escape clause: ABA \subseteq B allows A=BA = B, ABA \subset B forbids it — the underbar means "or equal", the same bar-job it performs on the inequality signs. Subsets and Proper Subsets above define both.
CasesThe convention war: many texts — especially older and European ones — write \subset for any subset and reserve \subsetneq for proper containment; when it matters, an author's first \subset deserves a suspicious read.
Do not confuseMembership. 1A1 \in A but {1}A\{1\} \subseteq A — the basics page calls this the subject's most reliable exam error, and it runs both directions.
\supseteq · \supset
is a superset of; contains
The same relationships read from the other end: BAB \supseteq A says BB contains AA — one fact, two spellings, mirror-image marks. Superset above works the reversal.
CasesThe open side faces the bigger set — the same visual rule inequality signs follow; ABA \subseteq B and BAB \supseteq A are interchangeable, and writers pick whichever keeps the emphasized set first.
Do not confuseA different claim. Reversing the glyph does not negate it — the denial of ABA \subseteq B is A⊈BA \not\subseteq B with the slash, not ABA \supseteq B, which asserts containment the other way.
P(A)\mathcal{P}(A) · 2A2^A
the power set of A; two to the A
The set of all subsets, in calligraphic dress — P(A)={S:SA}\mathcal{P}(A) = \{S : S \subseteq A\}, per Power Set above. The exponent spelling 2A2^A earns its name from the count: P(A)=2A|\mathcal{P}(A)| = 2^{|A|}.
CasesThe bridge identity converts relations: BAB \subseteq A exactly when BP(A)B \in \mathcal{P}(A) — containment outside becomes membership inside; P()={}\mathcal{P}(\varnothing) = \{\varnothing\}, one element, not zero.
Do not confuseA plain capital P. The calligraphic font is load-bearing — P(A)P(A) in roman type reads as probability of an event or a polynomial value; the script P\mathcal{P} keeps the power set visually distinct.
NZQR\mathbb{N} \subset \mathbb{Z} \subset \mathbb{Q} \subset \mathbb{R}
the number systems, each inside the next
The double-struck (blackboard-bold) family: naturals, integers, rationals, reals — reserved letters for the standard number sets, and the containment chain is the family portrait. Chalk invented the double stroke to fake print bold; print then adopted it back.
CasesThe chain extends to C\mathbb{C} at the top — the complex numbers own that link — and each letter serves as a standing domain, nZn \in \mathbb{Z}, xRx \in \mathbb{R}, wherever a variable's habitat needs declaring.
Do not confuseOrdinary italic letters. NN, ZZ, QQ, RR are free variables; only the double stroke reserves the letter — handwriting that skips the second stroke silently releases the reservation.
Symbol Read as Meaning Example
A ⊆ B "A is a subset of B" every element of A is in B  (A may equal B) {1, 2} ⊆ {1, 2};  ∅ ⊆ A for any A
A ⊂ B "A is a proper subset of B" A ⊆ B  and  A ≠ B {1, 2} ⊂ {1, 2, 3}
B ⊇ A "B is a superset of A" inverse of ⊆;  B contains every element of A ℝ ⊇ ℚ
B ⊃ A "B is a proper superset of A" inverse of ⊂;  B properly contains A ℝ ⊃ ℚ;  ℂ ⊃ ℝ ⊃ ℚ ⊃ ℤ ⊃ ℕ

Subsets FAQ

What is the difference between a subset and a proper subset?

+
A subset allows equality, a proper subset does not. A ⊆ B holds when every element of A is in B, including the case A = B. A ⊂ B additionally requires at least one element of B to be missing from A. So {1, 2} ⊆ {1, 2} is true, but {1, 2} ⊂ {1, 2} is false.Read more →

Is the empty set a subset of every set?

+
Yes. The subset rule asks whether every element of the empty set also belongs to the other set. Since the empty set has no elements, there is nothing that could fail the test, so the condition holds automatically. This is called vacuous truth. It follows that ∅ ⊆ A for every set A, including ∅ itself.Read more →

How many proper subsets does a set have?

+
A set with n elements has 2ⁿ − 1 proper subsets. The full count of subsets is 2ⁿ, since each element is either included or excluded, and proper subsets exclude only one case: the set itself. A set of 3 elements therefore has 8 subsets and 7 proper subsets. The subset counting table lists more values.Read more →

What is the power set of the empty set?

+
It is {∅}, a set containing one element. The power set collects every subset, and the empty set has exactly one subset — itself. So 𝒫(∅) is not empty: its cardinality is 1, not 0. Confusing {∅} with ∅ is the standard error here; one is a box holding an empty box, the other is no box at all.Read more →

What is the difference between ∈ and ⊆?

+
The first is membership, the second is containment. Write 1 ∈ A when 1 is an element of A, and {1} ⊆ A when the whole set {1} sits inside A. The left side of ∈ is an element; the left side of ⊆ is a set. Mixing them is the most common error in set theory, and it runs in both directions.Read more →

Does ⊂ always mean proper subset?

+
No. This site and most modern texts use ⊂ for proper containment and ⊆ when equality is allowed. But many older and European authors write ⊂ for any subset and reserve ⊊ for the proper case. The symbol alone is not enough — check how a given text defines it before trusting the distinction. See all set theory symbols.Read more →