Skip to content

Mathematics · Ch 1 — Sets

Subsets

1.6

Subsets

The Idea of a Subset

When you have two sets, it is natural to ask whether one fits entirely inside the other. Consider the set of all students in your school — call it XX — and the set of all students in your class — call it YY. Every student in your class is also a student in your school. In other words, every element of YY is also an element of XX. When this happens, we say that YY is a subset of XX.

The symbol for "is a subset of" is ⊂\subset. So we write Y⊂XY \subset X, which reads as "YY is a subset of XX" or "YY is contained in XX".

Note

The symbol ⊂\subset is not the same as ∈\in. The symbol ∈\in relates an element to a set; ⊂\subset relates one set to another set.

Formal Definition of a Subset

Definition. A set AA is said to be a subset of a set BB if every element of AA is also an element of BB.

In symbols, we write A⊂BA \subset B if, whenever a∈Aa \in A, then a∈Ba \in B. The symbol ⇒\Rightarrow means "implies". Using it, the definition becomes:

A⊂Bifa∈A⇒a∈BA \subset B \quad \text{if} \quad a \in A \Rightarrow a \in B

We read this as: "AA is a subset of BB if aa being an element of AA implies that aa is also an element of BB."

If AA is not a subset of BB, we write A⊄BA \not\subset B.

Watch out

For A⊂BA \subset B, it is enough that every element of AA is in BB. It does not require that every element of BB be in AA. The condition is one-way.

When Two Sets Are Equal

If it happens that every element of BB is also in AA, then we have B⊂AB \subset A as well. When both A⊂BA \subset B and B⊂AB \subset A hold, the two sets are exactly the same. This gives us a powerful way to define set equality:

A⊂B and B⊂A   ⟺   A=BA \subset B \ \text{and} \ B \subset A \ \iff \ A = B

The symbol   ⟺  \iff stands for "if and only if" (often written as "iff"). It means the implication works in both directions: if A=BA = B, then certainly A⊂BA \subset B and B⊂AB \subset A; conversely, if both subset relations hold, the sets must be equal.

Every Set Is a Subset of Itself

From the definition, it follows immediately that every set AA is a subset of itself. Why? Because every element of AA is obviously an element of AA. So A⊂AA \subset A is always true.

The Empty Set Is a Subset of Every Set

The empty set ϕ\phi has no elements. The condition "a∈ϕ⇒a∈Ba \in \phi \Rightarrow a \in B" is vacuously true — there is no aa to violate it. By convention and logical necessity, we agree that:

ϕ⊂Bfor every set B\phi \subset B \quad \text{for every set } B

Important

The empty set is a subset of every set, including itself. This is a foundational rule in set theory.

Examples to Illustrate Subsets

(i) The set Q\mathbb{Q} of rational numbers is a subset of the set R\mathbb{R} of real numbers. We write Q⊂R\mathbb{Q} \subset \mathbb{R}.

(ii) Let AA be the set of all divisors of 56, and BB the set of all prime divisors of 56. Every prime divisor is a divisor, so B⊂AB \subset A.

(iii) Let A={1,3,5}A = \{1, 3, 5\} and B={x:x is an odd natural number less than 6}B = \{x : x \text{ is an odd natural number less than } 6\}. The odd natural numbers less than 6 are 1, 3, and 5. So B={1,3,5}B = \{1, 3, 5\}. Here A⊂BA \subset B and B⊂AB \subset A, hence A=BA = B. …

Definition 4Subsets

A set AA is a subset of a set BB (written A⊂BA \subset B) precisely when every element that belongs to AA also belongs to BB.

Intuitively, AA is a smaller (or equal) collection "inside" BB — nothing in AA lies outside BB. …