Mth 101-General Math
Dr. Tim's Tutorial
SETS
A set is a collection of well-defined [Link] is denoted by a capital letter while its elements
are denoted with small [Link] members of a set are what are referred to as elements of a
set. Sets are represented using the curly brackets called BRACES.
REPRESENTATION OF SETS
There are two methods of representing sets:
● Roster method
● Set builder form
Roster form/method: In this method of set notation or representation, all the elements of the
set are listed. E.G {1,2,3,4}, {2,4,6,8} etc.
Set builder form/method: Here, the elements are written in a notation or described in terms of
x or any variable. This method is used mostly when the set has numerable elements. E.G { x: 1
< x < 5}
TYPES OF SETS
● Single set
● Null set
● Finite set
● Infinite set
Single set: This set is also known as a unit set or singleton set. It contains just one
element/member. E.G {1}, {a} etc.
1
Null set: A null set is a set without an element or member. It is also called an empty set. It is
represented by { } or Ø.
Finite set: A finite set is a set that has an end. This simply means if you can list all the
elements of a given set, that set is a finite set.
Non-finite or infinite set: This is a set whose entire members cannot be listed. It has no end.
E.G set of all real numbers - {1,2,3,4…}. The ellipses, ‘…’ show that the members continue.
N/B: A set can only and will only be a subset of another if all of its elements are members of
the other set
CARDINALITY OF A SET
The cardinality of a set is simply the size of the set. By this, I mean the number of elements or
members the set has. It is represented by an n and the set in bracket e.g n(A). The cardinality of
a null set is always zero because it has no element.
POWER OF A SET
The power of a set is the set of all subsets of a set. The power set includes an empty set and
the set itself. It is denoted by P(A) with A being the set. The number of sets in a power set is
equal to 2^n
E.G. If A = {1,2,3} the number of sets in in the power set will be equal to 2³ = 8
P(A) = { ø, {1}, {2}, {3}, {12}, {23}, {13}, {123} }
PARTITIONING OF SETS
Partitioning a set means dividing it into non-overlapping, non-empty subsets such that each
element of the Universal set does not occur in more than one subset
A partition of a set therefore, is a non-empty subset of that set which contains elements or
members that are peculiar to that subset(members that exist in that subset only and do not
repeat in other subsets)
2
UNIVERSAL SET
This set is the set of reference used in the discussion. It is the general set that contains all the
elements or sets discussed
OPERATIONS OF SETS
● Union of sets
● Intersection of sets
● Complement of sets
● Difference of sets
● Symmetric difference of sets
Union of sets: Union of sets is the set that forms the list of elements that are present in each
set and in both set without repeating any one. It is denoted by U
E.G
A = {1,2,3,4}
B = {1,4,6,7}
A U B = {1,2,3,4,6,7}
Intersection of Sets: The Intersection of some given sets is the set formed by the elements that
are common in all the given sets. It is denoted by n
E.G
A = {1,2,3,4}
B = {1,4,6,7}
A n B = {1,4}
COMPLEMENT OF SETS: Given a universal set and a subset, the complement of the
subset(smaller set) is the set of elements that are not inside that subset. It is denoted by
exponent ‘c’ or ’
3
E.G
U = {1,2,3,4,5,6,7}
A = {1,2,3,4}
A^c or A' = {5,6,7}
DIFFERENCE OF SETS: Given sets A and B, their difference is simply the set of members
present in one and absent in the other. It is denoted by \
E.G
A = {1,2,3,4}
B = {1,4,6,7}
A\B = {2,3}
B\A = {6,7}
SYMMETRIC DIFFERENCE: The symmetric difference of two sets, A and B is the union of the
🔺️’
differences of set A and B. It is denoted by ‘
EG
A = {1,2,3,4}
B = {1,4,6,7}
A 🔺B = A\B *U* B\A
A\B = {2,3}
B\A = {6,7}
A🔺B = A\B *U* B\A
= {2,3} *U* {6,7}
= *{2,3,6,7}*
4
We can also put SYMMETRIC DIFFERENCE as difference between union of two sets and
intersection of two sets
(A U B) \ (B n A)