Set Theory Chapter NotesIntroduction
Imagine organizing your favorite toys, books, or even snacks into groups based on specific rules, like "all red toys" or "all chocolate snacks." This is what set theory is all about! It’s a fun and logical way to group things that share something in common. In mathematics, set theory helps us understand collections of objects clearly and systematically. Whether it’s numbers, letters, or even months of a year, sets make it easier to study and work with groups. Let’s dive into this exciting world of sets and discover how they help us organize and understand collections!

Set
- A set is a collection of well-defined objects, where it’s clear whether something belongs to the set or not.
- Each object in a set is called a member or element.
- Well-defined means there’s no confusion about what’s included in the set.
- If an object appears more than once in a collection, it’s counted only once in a set.
- Sets are denoted by capital letters like A, B, or C, and elements by small letters like x, y, or z.
- The symbol ∈ means "belongs to," and ∉ means "does not belong to."
Example: Is the collection of all the letters in the word MATHEMATICS a set? The letters are M, A, T, H, E, M, A, T, I, C, S. Since M, A, and T appear twice, we take each only once. Thus, the set is {M, A, T, H, E, I, C, S}.
Representation of Sets
- Sets can be represented in two ways: roster form and set-builder form.
Roster or Tabular Form Method
- In this method, all elements of the set are listed inside curly braces {}, separated by commas.
- It’s a straightforward way to show all members of a set.
Example: The set X of the first five months of a year is written as X = {January, February, March, April, May}.
Rule or Set-Builder Form Method
- In this method, a rule or property describes all elements of the set, written inside curly braces.
- The format is {x | condition on x} or {x : condition on x}, where | or : means "such that."
- It describes the common property that all elements must satisfy.
Example: The set Y of whole numbers less than 10 is written as Y = {x | x is a whole number less than 10}.
Important sets in both forms:
- Natural numbers (N):
- Roster form: N = {1, 2, 3, 4, …}
- Set-builder form: N = {x | x is a natural number}
- Whole numbers (W):
- Roster form: W = {0, 1, 2, 3, …}
- Set-builder form: W = {x | x is a whole number}
- Integers (Z or I):
- Roster form: Z = {…, -3, -2, -1, 0, 1, 2, 3, …}
- Set-builder form: Z = {x | x is an integer}
Types of Sets
Finite Sets
- A set with a limited number of elements that can be counted is called a finite set.
Example: The set {5, 10, 15, 20, 25} is a finite set because it has 5 elements.
Infinite Sets
- A set with an unlimited number of elements that cannot be counted is called an infinite set.
Example: The set of natural numbers N = {1, 2, 3, …} is an infinite set.
Empty Sets
- A set with no elements is called an empty set or null set, denoted by {} or φ.
Example: The set {x | x < 0, x ∈ W} is an empty set because no whole number is less than zero.
Cardinality
- Cardinality is the number of elements in a finite set, denoted by n(X) for a set X.
- Cardinality is not defined for infinite sets.
- The cardinality of an empty set is zero, i.e., n(φ) = 0.
Example: For the set A = {-5, -9, 0, 2, 3}, the cardinality is n(A) = 5.
Solved Examples
Example 1: Which of the following collections are sets? Give reasons.
(a) A collection of beautiful flowers: Not a set because "beautiful" is not well-defined.
(b) All the boys of your class whose height is more than your height: A set because height can be measured clearly.
(c) All difficult problems of your textbook: Not a set because "difficult" is not well-defined.
(d) The collection of distinct letters of the word MUMBAI: A set, as the distinct letters are M, U, B, A, I.
Example 2: Let X be the set of letters of the word AUGUST and Y be the set of letters of the word ENGLISH. Fill in the blanks with ∈ or ∉.
(a) E ∉ X (E is not in AUGUST).
(b) U ∉ Y (U is not in ENGLISH).
(c) G ∈ X (G is in AUGUST).
(d) I ∈ Y (I is in ENGLISH).
Example 3: Write the following sets in roster form.
(a) The set X of all odd natural numbers less than 9: X = {1, 3, 5, 7}.
(b) The set A of all consonants in the word ROSTER: A = {R, S, T}.
(c) The set Y of all integers between -3 and 3: Y = {-2, -1, 0, 1, 2}.
Example 4: Represent the following sets in set-builder form.
(a) A = {2, 4, 6, 8, 10}: A = {x | x is an even natural number less than 12} or A = {x | x is one of the first five multiples of 2}.
(b) X = {a, e, i, o, u}: X = {x | x is a vowel in the English alphabet}.
(c) B = {January, March, May, July, August, October, December}: B = {x | x is a month with 31 days}.
Example 5: Write the following sets in tabular form.
(a) A = {x | 2x + 2 = 0}:
- Solve: 2x + 2 = 0
- 2x = -2
- x = -1
- So, A = {-1}
(b) X = {x | 5x - 15 ≤ 0, x ∈ N}:
- Solve: 5x - 15 ≤ 0
- 5x ≤ 15
- x ≤ 3
- Since x is a natural number, X = {1, 2, 3}
Example 6: If X = {3, 5, 7, 9, 11}, write the roster form of set Y whose members are obtained by adding 2 to the members of set X. Also, complete the set-builder form of set Y given by Y = {y | y = x + …, x ∈ …}.
- Roster form: Y = {5, 7, 9, 11, 13}
- Set-builder form: Y = {y | y = x + 2, x ∈ X}