The Language of Sets
What is a set, really? From well-defined collections to subsets and power sets — the grammar that the rest of mathematics is written in.
Why does mathematics need sets?
Here is a concrete question.
In a group of 30 students, 18 play cricket, 15 play football, and 10 play both. How many students play at least one sport?
You might say: 18 + 15 − 10 = 23. But why do you subtract 10? What exactly does "both" mean mathematically? Why doesn't "both" get counted twice?
You felt the answer. But to prove it — to extend this reasoning to three sports, or four, or to arbitrary overlaps — you need a precise language for talking about collections of objects.
It is not a topic. It is the foundation. Every area of mathematics — algebra, calculus, probability, combinatorics, topology — is written in this language. A function is a special kind of set. A sequence is a function. A relation is a set of ordered pairs. When you truly understand sets, you understand the grammar the rest of mathematics is written in.
What is a set?
Well-defined
For any object in the universe, you must be able to decide — unambiguously, without judgment — whether it belongs to the collection or not.
- "All prime numbers less than 10" → well-defined. Test any number: 7 passes, 9 fails.
- "All tall students in class" → not well-defined. "Tall" has no sharp boundary.
- "All interesting positive integers" → not well-defined. Interesting is subjective.
- "All integers x such that x² < 20" → well-defined. Test x = 4: 16 < 20 ✓. Test x = 5: 25 < 20 ✗.
This distinction matters because mathematics needs proofs, and proofs need statements that are unambiguously true or false.
Distinct
No element appears more than once. Repetition carries no information in a set.
{1, 2, 2, 3} is the same set as {1, 2, 3}.
Notation
If a is an element of set A: a ∈ A (read: "a belongs to A")
If a is not an element of set A: a ∉ A
Examples:
- 3 ∈ {1, 2, 3, 4} ✓
- 5 ∉ {1, 2, 3, 4} ✓
- π ∈ ℝ ✓
- π ∉ ℚ ✓ (π is irrational)
- ∅ ∈ {{∅}, {1, 2}} ✓ (the empty set is an element of this particular set)
Three ways to write a set
Method 1 — Roster (Tabular)
List all elements inside curly braces, separated by commas.
- Vowels in English: {a, e, i, o, u}
- Even natural numbers less than 12: {2, 4, 6, 8, 10}
- Factors of 12: {1, 2, 3, 4, 6, 12}
When the pattern is clear and the list is long, use "..." to show continuation:
- Natural numbers: {1, 2, 3, 4, 5, ...}
- Integers: {..., −3, −2, −1, 0, 1, 2, 3, ...}
- Squares: {1, 4, 9, 16, 25, ...}
Method 2 — Set-Builder (Rule Method)
- {x : x ∈ ℕ, x < 6} = {1, 2, 3, 4, 5}
- {x : x is a factor of 12} = {1, 2, 3, 4, 6, 12}
- {x² : x ∈ ℤ} = {0, 1, 4, 9, 16, ...} — the set of all perfect squares
- {x : x ∈ ℝ, x² = −1} = ∅ — no real number satisfies this
- {(x, y) : x² + y² = 1, x, y ∈ ℝ} — the unit circle
Method 3 — Interval Notation
| Set | Interval | Type |
|---|---|---|
| {x : a ≤ x ≤ b} | [a, b] | Closed (both endpoints in) |
| {x : a < x < b} | (a, b) | Open (both endpoints out) |
| {x : a ≤ x < b} | [a, b) | Half-open |
| {x : a < x ≤ b} | (a, b] | Half-open |
| {x : x ≥ a} | [a, ∞) | Unbounded right |
| {x : x < b} | (−∞, b) | Unbounded left |
| ℝ | (−∞, ∞) | All reals |
Intervals can be combined using ∪:
- {x : x < −2 or x > 5} = (−∞, −2) ∪ (5, ∞)
- {x : 1 ≤ x ≤ 3 or 7 < x ≤ 9} = [1, 3] ∪ (7, 9]
The standard number sets
These appear in every branch of mathematics and must be second nature.
| Symbol | Name | Elements |
|---|---|---|
| ℕ | Natural numbers | {1, 2, 3, 4, ...} |
| ℤ | Integers | {..., −2, −1, 0, 1, 2, ...} |
| ℚ | Rational numbers | All p/q, where p, q ∈ ℤ and q ≠ 0 |
| ℝ | Real numbers | All points on the number line |
| ℂ | Complex numbers | All a + bi where a, b ∈ ℝ |
The containment chain:
Every natural number is an integer. Every integer is rational (n = n/1). Every rational is real. Every real is complex (a = a + 0i).
Rational vs Irrational: A rational number can be written as p/q (p, q ∈ ℤ, q ≠ 0). Its decimal expansion either terminates (3/4 = 0.75) or repeats (1/3 = 0.333...).
An irrational number cannot be written as p/q. Examples: √2, √3, π, e, log₂3.
The irrationals are ℝ \ ℚ — they live on the real line but not in ℚ.
Types of sets
Empty Set
The set with no elements. Written ∅ or {}.
Examples:
- {x : x ∈ ℝ, x² = −1} — no real satisfies this
- {x : x is prime, 14 < x < 16} — no prime between 14 and 16
- {x : x ∈ ℕ, x < 1} — no natural number is less than 1
Singleton Set
Exactly one element. Examples: {5}, {π}, {∅}, {{1, 2}}
Finite Set
Counting terminates. The number of elements is a non-negative integer.
Examples: {a, e, i, o, u}, {1, 4, 9, 16}, the set of all chess pieces on a board.
- n(∅) = 0
- n({a, e, i, o, u}) = 5
Infinite Set
Counting never ends.
Examples: ℕ, ℤ, ℚ, ℝ, {x ∈ ℝ : 0 < x < 1}
Equal Sets
Both conditions must hold: every element of A is in B, and every element of B is in A.
- {1, 2, 3} = {3, 2, 1} = {1, 1, 2, 3, 3} ✓ (same elements, ignoring order and repetition)
- {1, 2, 3} ≠ {1, 2, 4} ✗ (4 is in second, not in first)
Equivalent Sets
{a, e, i, o, u} and {1, 2, 3, 4, 5} are equivalent (both have cardinality 5) but not equal.
Universal Set
In any given problem, we work within some fixed collection that contains all objects under consideration. This is the universal set, denoted U (or sometimes ξ in older texts).
For problems about integers: U = ℤ. For problems about students in a class: U = {all students}. For real analysis: U = ℝ.
The universal set is defined by context, not once for all time.
Subsets — the containment relationship
Set A is a subset of B, written A ⊆ B, if every element of A is also an element of B.
Formally: A ⊆ B ⟺ (x ∈ A ⟹ x ∈ B) for all x.
Examples:
- {2, 4} ⊆ {1, 2, 3, 4, 5} ✓
- ℕ ⊆ ℤ ✓
- {1, 7} ⊆ {1, 2, 3, 4, 5} ✗ (7 is not in {1, 2, 3, 4, 5})
Proper subset: A ⊂ B means A ⊆ B and A ≠ B. That is, B has at least one element not in A.
ℕ ⊂ ℤ (integers include 0 and negatives, which are not in ℕ)
Note on notation: Some books use ⊂ to mean "subset or equal" (same as ⊆), and use ⊊ for proper subset. JEE usually uses ⊂ for proper subset and ⊆ for subset-or-equal. Follow the problem's convention.
Two essential facts about subsets
Fact 1: ∅ ⊆ A for every set A.
This confuses almost everyone at first. Here is the argument.
"∅ ⊆ A" means "every element of ∅ belongs to A." But ∅ has no elements. So the statement "every element of ∅ does [anything]" is vacuously true — there are no elements to violate it.
Analogy: "Every student who scored above 200% in the test passed." True — but only because no student scored above 200%. There are no counterexamples.
So ∅ ⊆ A holds for every set A. ∅ is a subset of every set.
Fact 2: A ⊆ A for every set A.
Every element of A is in A. Trivially true. Every set is a subset of itself.
So for any A:
and
Subset vs element — the critical distinction
{1} ⊆ {1, 2, 3} ✓ — {1} is a subset
{1} ∈ {1, 2, 3}? — Ask: is the object {1} (a set) one of the elements of {1, 2, 3}? The elements of {1, 2, 3} are 1, 2, 3 (numbers, not sets). So ✗.
{1} ∈ {{1}, {2}, {3}}? — Here the elements are {1}, {2}, {3} (sets). So ✓.
How many subsets does a set have?
Why? Here is the argument to internalize — not just the formula.
Every subset of A is built by making a binary decision for each element: include it, or exclude it.
For a 3-element set {a, b, c}:
- Element a: in or out — 2 choices
- Element b: in or out — 2 choices
- Element c: in or out — 2 choices
Total combinations: 2 × 2 × 2 = 2³ = 8 subsets.
This is identical to asking: "how many 3-bit binary strings are there?" Each bit position corresponds to one element. 1 = include, 0 = exclude.
| Binary string | Subset |
|---|---|
| 000 | ∅ |
| 001 | {c} |
| 010 | {b} |
| 011 | {b, c} |
| 100 | {a} |
| 101 | {a, c} |
| 110 | {a, b} |
| 111 | {a, b, c} |
Eight subsets. Exactly 2³.
For a set of n elements: 2ⁿ subsets total.
Power Set
The power set of A, written P(A) or 2^A, is the set whose elements are all the subsets of A.
For A = {1, 2, 3}:
|P(A)| = 8 = ✓
So:
- {1} ∈ P(A) ✓
- {1} ⊆ P(A)? — only if {1} is a subset of P(A), meaning every element of {1} is in P(A). The single element of {1} is the number 1. Is 1 ∈ P(A)? No — P(A) contains sets, not numbers. So {1} ⊄ P(A).
- {{1}} ⊆ P(A)? — the single element of {{1}} is the set {1}. Is {1} ∈ P(A)? Yes ✓. So {{1}} ⊆ P(A) ✓.
Power set of the empty set
The empty set has exactly one subset — itself. So P(∅) contains exactly one element: ∅.
|P(∅)| = 1 = 2⁰ ✓
Iterated power sets
|P(P(∅))| = |P({∅})| = 2¹ = 2. So P({∅}) = {∅, {∅}}.
Each application of the power set operation squares the count (roughly) — these grow astronomically fast.
Problems — Language of Sets
Class 9–10 level
Problem 1: List the elements of A = {x : x ∈ ℤ, x² ≤ 9}.
Solution: x² ≤ 9 ⟺ −3 ≤ x ≤ 3. For integers in this range: x ∈ {−3, −2, −1, 0, 1, 2, 3}. So A = {−3, −2, −1, 0, 1, 2, 3}. n(A) = 7.
Problem 2: Write in set-builder form: B = {2, 5, 10, 17, 26, ...}
Solution: Look at each element: 2 = 1²+1, 5 = 2²+1, 10 = 3²+1, 17 = 4²+1, 26 = 5²+1. Pattern: n²+1 for n = 1, 2, 3, ... B = {x : x = n² + 1, n ∈ ℕ}
Problem 3: Which of the following are well-defined sets? (a) The collection of all difficult problems in this book. (b) The collection of all prime numbers between 50 and 100. (c) The collection of all good teachers in India. (d) The collection of all real solutions of x³ − x = 0.
Solution: (a) Not well-defined — "difficult" is subjective. (b) Well-defined — primality is unambiguous. (c) Not well-defined — "good" is subjective. (d) Well-defined — x³ − x = x(x−1)(x+1) = 0 gives x ∈ {−1, 0, 1}. Set = {−1, 0, 1}.
Class 11 level
Problem 4: A = {x : x² − 5x + 6 = 0} and B = {x : x² − 3x + 2 = 0}. Find: (a) A and B explicitly, (b) Is A = B? (c) Is A equivalent to B?
Solution: x² − 5x + 6 = (x−2)(x−3) = 0 → A = {2, 3} x² − 3x + 2 = (x−1)(x−2) = 0 → B = {1, 2}
(a) A = {2, 3}, B = {1, 2} (b) A ≠ B (3 ∈ A but 3 ∉ B; 1 ∈ B but 1 ∉ A) (c) n(A) = 2 = n(B), so A and B are equivalent.
Problem 5: If A = {1, 2, {3, 4}, 5}, determine which of the following are true: (a) 3 ∈ A (b) {3, 4} ⊆ A (c) {3, 4} ∈ A (d) {{3, 4}} ⊆ A (e) ∅ ⊆ A (f) ∅ ∈ A
Solution: The elements of A are: 1, 2, {3,4}, 5.
(a) 3 ∈ A? — 3 is not an element; {3,4} is. ✗ False (b) {3,4} ⊆ A? — Is 3 ∈ A? No. ✗ False (c) {3,4} ∈ A? — Is {3,4} one of the elements of A? Yes. ✓ True (d) {{3,4}} ⊆ A? — The sole element of {{3,4}} is {3,4}. Is {3,4} ∈ A? Yes. ✓ True (e) ∅ ⊆ A? — Vacuously true for any A. ✓ True (f) ∅ ∈ A? — Is ∅ one of the explicit elements {1, 2, {3,4}, 5}? No. ✗ False
Problem 6 (Power Set): Find P(A) where A = {a, {b}}.
Solution: A has 2 elements: the object 'a' and the set {b}. Subsets of A:
- ∅
- {a}
- {{b}}
- {a, {b}}
P(A) = {∅, {a}, {{b}}, {a, {b}}} |P(A)| = 4 = 2² ✓
JEE Mains level
Problem 7: How many subsets of {1, 2, 3, ..., 10} contain at least 2 elements?
Solution: Total subsets of a 10-element set = 2¹⁰ = 1024. Subsets with 0 elements: 1 (just ∅) Subsets with exactly 1 element: 10 (the singletons) Subsets with at least 2 elements = 1024 − 1 − 10 = 1013
Problem 8: If A ⊆ B, prove that P(A) ⊆ P(B).
Solution: Let X ∈ P(A). Then X ⊆ A (by definition of power set). Since A ⊆ B, and X ⊆ A, we get X ⊆ B (transitivity of ⊆). So X ∈ P(B). Since every element of P(A) is in P(B): P(A) ⊆ P(B). ✓
Problem 9 (JEE 2011 pattern): Let A and B be two sets with n(A) = 5, n(B) = 3. Find n(P(A × B)).
Solution: A × B is the Cartesian product (covered in detail in File 05). n(A × B) = n(A) × n(B) = 5 × 3 = 15. n(P(A × B)) = 2^15 = 32768
Problem 10: If P(A) = P(B), prove that A = B.
Solution: Since A ⊆ A, we have A ∈ P(A) = P(B). So A ∈ P(B), which means A ⊆ B. Since B ⊆ B, we have B ∈ P(B) = P(A). So B ∈ P(A), which means B ⊆ A. From A ⊆ B and B ⊆ A: A = B. ✓
This is a clean example of the standard technique for proving set equality: prove mutual inclusion.
The standard technique: proving A = B
To prove two sets are equal, show both:
- Every element of A is in B (A ⊆ B)
- Every element of B is in A (B ⊆ A)
Common mistakes — flag these
| Mistake | What's wrong |
|---|---|
| ∅ = {∅} | ∅ is empty; {∅} has one element |
| {1} ⊆ {{1}, {2}} | The element of {1} is 1 (a number); elements of {{1},{2}} are {1},{2} (sets). 1 ∉ {{1},{2}}. So {1} ⊄ {{1},{2}}. |
| 0 ∈ ∅ | ∅ has no elements at all |
| Every set has 2ⁿ proper subsets | Proper subsets = 2ⁿ − 1 (exclude the set itself) |
| ∅ ∉ A for any A | ∅ ⊆ A always, but ∅ ∈ A only if ∅ is explicitly listed as an element |
Summary
| Concept | Notation | Key fact |
|---|---|---|
| Element of | a ∈ A | Membership |
| Subset | A ⊆ B | Every element of A is in B |
| Proper subset | A ⊂ B | A ⊆ B and A ≠ B |
| Equal sets | A = B | Same elements |
| Equivalent sets | ~ (informal) | Same cardinality |
| Empty set | ∅ | Subset of every set; unique |
| Power set | P(A) | Set of all subsets; |P(A)| = |
Next: Set operations — union, intersection, complement, difference, and the algebra that governs them.