SET 02 · Subsets & Equality
Subset (inclusion) ⊆
— every element of A is also in B. Equivalently (B is a superset of A).
Example
- A = {1, 2, 3}, B = {1, 2, 3, 4, 5}: , but .
- A = {1, 2}, B = {1, 3, 5}: 2 ∈ A but 2 ∉ B ⇒ . One element of A missing from B is enough to break ⊆.
Properties of ⊆
| Property | Statement |
|---|---|
| Reflexive | |
| Transitive | |
| Antisymmetric |
Equality =
Example
- {1, 2, 4} = {1, 2, 2, 4} ✅ (duplicates ignored)
- {{1, 2}, 3} ≠ {1, 2, 3} ❌ — {1, 2} ∈ the first, but not the second. A set inside a set is ONE element.
Equality is reflexive, symmetric, transitive (an equivalence relation).
Standard proof technique
To prove : show and (“double inclusion”).
Proper subset ⊂
B has at least one element A doesn’t. E.g. {1, 2, 4} ⊂ {1, 2, 4, 5}.
| ⊆ | ⊂ | |
|---|---|---|
| Reflexive ()? | ✅ | ❌ not reflexive |
| Transitive? | ✅ | ✅ |
Notation trap
Some books use ⊂ to mean ⊆. In GATE questions, ⊂ almost always means proper subset — but read carefully. ⊊ is unambiguous “proper”.
Prev ← SET 01 Basics and Representation · Next → SET 03 Membership vs Inclusion