Chapter 2

Sets and Operation of

Sets Algasher
Ato
“Sir Ash”
  A set is a collection of well-defined
objects.
 The things in the collection are called
Sets elements of the set.
A= {1, 2, 3, 4, 5,}
  Roster method - listing of all elements
  Set-builder notation- used to describe sets that
Two are too big or complex to list between braces.
methods of Example: Even numbers from 1 to 25
describing Roster Method: { 2, 4, 6, 8, 10, 12, 14, 16,18,
sets 20,22,24}
Set builder: {x|x ∈ N where x are even numbers
<25}
 Standard notations used to define some sets:
N- set of all natural numbers
N={1,2,3,...}
Z- set of all integers
Z= {…,-3, -2, -1, 0, 1, 2, 3,… }
Special Q- set of all rational numbers
types of Q= {p/q | p ∈ Z, q∈ Z, q ≠ 0}
sets
R- set of all real numbers
C- set of all complex numbers are combined Real
Number and an Imaginary Number
{2+3i, 1+ i, −2 + πi, √2 + i/2}
 Empty Set or Null Set
 The set, which has no elements, is also called a null set Ø
or empty set denoted by {}.
Below are the two examples of the empty set.
 Example of empty set: Let set A = {a| a is the number of
TYPES OF students studying in Grade 6 and Grade 7}. As we all
know, a student cannot learn in two grades, therefore
SETS set A is an empty set.

 Another example of an empty set is  set B = {a: 1 < a < 2,

a is a natural number}, we know a natural number cannot
be a decimal, therefore set B is a null set or empty set.
 Singleton Sets
 The set which has just one element is named a
singleton set.
TYPES OF
SETS
 For example, Set A = { 8 } is a singleton set.
 Finite and Infinite Sets
 A set that has a finite number of elements is
known as a finite set, whereas the set whose
elements can't be estimated, but has some
TYPES OF figure or number, which is large to precise in a
SETS set, is known as infinite set.
 For example, set A = {3,4,5,6,7} is a finite set, as it
has a finite number of elements.
 Equal Sets
 If every element of set A is also the elements of
set B and if every element of set B is also the
elements of set A, then sets A and B are called
equal sets. It means set A and set B have
TYPES OF equivalent elements and that we can denote it
SETS as: A = B

For example, let A = {3,4,5,6,} and B = {6,5,4,3},

then A = B
 Power Sets
 The set of all subsets is known as power sets. We
know the empty set is a subset of all sets, and each
set is a subset of itself. Taking an example of set X =
{2,3}. From the above-given statements, we can
write,
TYPES OF  {} is a subset of {2,3}
SETS  {2} is a subset of {2,3}
 {3} is a subset of {2,3}
 {2,3} is also a subset of {2,3}
 Therefore, power set of X = {2,3},
 P(X) = {{},{2},{3},{2,3}}
 Disjoint sets
A pair of sets which does not have any common
element.
TYPES OF For example, set A={2,3} and set B={4,5} are disjoint
SETS sets.
But set C={3,4,5} and D={3,6,7} are not disjoint as
both the sets C and D are having 3 as a common
element.
 Cardinal of a set
 The number of elements or members in a set is the
cardinal number of that set. If A is a finite set and it
has elements equal to N. Then the cardinal number
of set A is N. 
 Note: The cardinal number of an empty set is
TYPES OF always zero.
SETS  For example, set A = {1, 3, 6, 9, 10, 12, 18}, the
cardinal number of set A is 7. Hence, N(A) = 7
 Thus, the only formula for counting numbers is to
find the number of elements of any set.
 A= {M, I, S, S, I, S,S,I,P,P,I}= 4
 Universal Sets
 A set that contains all the elements of other sets is
called a universal set. Generally, it is represented as
‘U.’
 For example, set A = {1,2,3}, set B = {3,4,5,6}, and C
TYPES OF = {5,6,7,8,9}.
SETS  Then, we will write the universal set as, U =
{1,2,3,4,5,6,7,8,9,}.

Note: According to the definition of the universal

set, we can say that all the sets are subsets of the
universal set. 
 The four basic operations are:
1. Union of Sets
OPERATIONS
ON SET 2. Intersection of sets
3. Complement of the Set
4. Cartesian Product of sets
 Union of Sets
The union of two sets consists of all
their elements. It is denoted by (⋃).
OPERATIONS For example, set A = {2,3,7} and set
ON SET
B = { 4,5,8}.

 A ⋃ B = {2,3,7,4,5,8}
 Intersection of Sets
The set of all elements, which are
common to all the given sets, gives
OPERATIONS
an intersection of sets. It is denoted
ON SET by ⋂.
For example, set A = {2,3,7} and set
B = {2,4,9}.
So, A ⋂ B = {2}
 Complement of Sets
Let U be the universal set and let A
⊆ U. Then, the complement of A,
OPERATIONS denoted by A’ or (U - A)
ON SET

Example: U={1,2,3,4,5,6,7,8,9,10}
and A={ 2,4,7}
A’={1, 3, 5, 6, 8, 9, 10}
 Complement of Sets
OPERATIONS
ON SET Every set has a complement of sets.
Also, for a universal set, the empty
set is known as the complement of
the universal set
 Cartesian Product of Sets
sets A and B is defined as the set of
all ordered pairs (x, y) such
that x belongs to A and y belongs
to B. 
OPERATIONS We write this product as A × B (read
ON SET “A cross B”). 
For example, if A = {1, 2} and B =
{3, 4, 5}, then the Cartesian Product
of A and B is {(1, 3), (1, 4), (1, 5), (2,
3), (2, 4), (2, 5)}.
AXB={(1, 3), (1, 4), (1, 5), (2, 3), (2,
 1.  Express the set A = {x | x = 2n2 - 1, where n ∈
Practice N and n < 5} in roster form.
Test
 1.  Express the set A = {x | x = 2n2 - 1, where n ∈ N and n
< 5} in roster form.
Solution: The elements of set A are:
For n = 1, 2n2 − 1 = 2(1)2 −1 = 1
Practice For n = 2, 2n2 − 1 = 2(2)2 − 1 = 7

Test For n = 3, 2n2 − 1 = 2(3)2 − 1 = 17

For n = 4, 2n2 − 1 = 2(4)2 − 1 = 31

Answer: A = {1, 7, 17, 31, }

 2. Which of these sets represent vowels of the
English alphabet in roster form.

A= {a, e, I, o, b}
B= {A = {x  | x is a consonant in English
Practice alphabet}
Test C = {a, e, i, o, u}
D= {x  | x is a vowel in English alphabet}

Ans:
 3. Express the below two sets X and Y in the
roster form.

Practice
Test
 3. Express the below two sets X and Y in the
roster form.

Practice
Test

Solution: The set X in roster form can be expressed like: X = {1, 2, 3, 4}. The
set Y in roster form can be expressed like: Y = {D, B, C, A}