Chapter 3 - Sets

DISCRETE MATHEMATICS
Objectives
After completing this course, you will be able to:
• Definition of sets.
• Discuss the basic concept of set.
• Explained the set operation and algebra sets.
1
Set
A set is an unordered collection of different elements. A set can be written
explicitly by listing its elements using set bracket. If the order of the elements is
changed or any element of a set is repeated, it does not make any changes in the set.
Some Example of Sets

• A set of all positive integers
• A set of all the planets in the solar system
• A set of all the states in India
• A set of all the lowercase letters of the alphabet
Representation of a Set
Sets can be represented in two ways −
1. Roster or Tabular Form
2. Set Builder Notation
Roster or Tabular Form

The set is represented by listing all the elements comprising it. The elements are
enclosed within braces and separated by commas.
• Example 1 − Set of vowels in English alphabet, A={a,e,i,o,u}A={a,e,i,o,u}
• Example 2 − Set of odd numbers less than 10, B={1,3,5,7,9}B={1,3,5,7,9}
Set Builder Notation

The set is defined by specifying a property that elements of the set have in
common. The set is described as A={x:p(x)}A={x:p(x)}
• Example 1 − The set {a,e,i,o,u}{a,e,i,o,u} is written as −
A={x:x is a vowel in English alphabet}A={x:x is a vowel in English
alphabet}
• Example 2 − The set {1,3,5,7,9}{1,3,5,7,9} is written as −
B={x:1≤x<10 and (x%2)≠0}B={x:1≤x<10 and (x%2)≠0}
If an element x is a member of any set S, it is denoted by x∈Sx∈S and if an
element y is not a member of set S, it is denoted by y∉Sy∉S.
• Example − If S={1,1.2,1.7,2},1∈SS={1,1.2,1.7,2},1∈S but 1.5∉S1.5∉S
Some Important Sets

N − the set of all natural numbers = {1,2,3,4,.....}{1,2,3,4,.....}
Z − the set of all integers = {.....,−3,−2,−1,0,1,2,3,.....}{.....,−3,−2,−1,0,1,2,3,.....}
Z+ − the set of all positive integers
Q − the set of all rational numbers
R − the set of all real numbers
W − the set of all whole numbers
Cardinality of a Set
Cardinality of a set S, denoted by |S||S|, is the number of elements of the set.
The number is also referred as the cardinal number. If a set has an infinite number of
2
elements, its cardinality is ∞∞.
2
• Example − |{1,4,3,5}|=4,|{1,2,3,4,5,…}|=∞|{1,4,3,5}|=4,|{1,2,3,4,5,…}|=∞
If there are two sets X and Y,
1. |X|=|Y||X|=|Y| denotes two sets X and Y having same cardinality. It occurs
when the number of elements in X is exactly equal to the number of elements
in Y. In this case, there exists a bijective function ‘f’ from X to Y.
2. |X|≤|Y||X|≤|Y| denotes that set X’s cardinality is less than or equal to set Y’s
cardinality. It occurs when number of elements in X is less than or equal to
that of Y. Here, there exists an injective function ‘f’ from X to Y.
3. |X|<|Y||X|<|Y| denotes that set X’s cardinality is less than set Y’s cardinality. It
occurs when number of elements in X is less than that of Y. Here, the
function ‘f’ from X to Y is injective function but not bijective.
4. If |X|≤|Y|If |X|≤|Y| and |X|≥|Y||X|≥|Y| then |X|=|Y||X|=|Y|. The sets X and Y are
commonly referred as equivalent sets.
Types of Sets
Sets can be classified into many types. Some of which are finite, infinite, subset,
universal, proper, singleton set, etc.
1. Finite Set
A set which contains a definite number of elements is called a finite
set.
Example − S={x|x∈NS={x|x∈N and 70>x>50}70>x>50}
2. Infinite Set
A set which contains infinite number of elements is called an
infinite set.
Example − S={x|x∈NS={x|x∈N and x>10}x>10}
3. Subset
A set X is a subset of set Y (Written as X⊆YX⊆Y) if every element
of X is an element of set Y.
Example1 −Let, X={1,2,3,4,5,6}X={1,2,3,4,5,6} and Y={1,2}Y={1,2}
. Here set Y is a subset of set X as all the elements of set Y is in
set X. Hence, we can write Y⊆XY⊆X.
Example 2 − Let, X={1,2,3}X={1,2,3} and Y={1,2,3}Y={1,2,3}. Here
set Y is a subset (Not a proper subset) of set X as all the elements
of set Y is in set X. Hence, we can write Y⊆XY⊆X.
4. Proper Subset
The term “proper subset” can be defined as “subset of but not
equal to”. A Set X is a proper subset of set Y (Written as X⊂YX⊂Y) if
every element of X is an element of set Y and |X|<|Y||X|<|Y|.
Example − Let, X={1,2,3,4,5,6}X={1,2,3,4,5,6} and Y={1,2}Y={1,2}.
Here set Y⊂XY⊂X since all elements in YY are contained in XX too
and XX has at least one element is more than set YY.
5. Universal Set
It is a collection of all elements in a particular context or
application. All the sets in that context or application are essentially
subsets of this universal set. Universal sets are represented as UU.
3
3
Example − We may define UU as the set of all animals on earth. In

this case, set of all mammals is a subset of UU, set of all fishes is a
subset of UU, set of all insects is a subset of UU, and so on.
6. Empty Set or Null Set
An empty set contains no elements. It is denoted by ∅∅. As the
number of elements in an empty set is finite, empty set is a finite set. The
cardinality of empty set or null set is zero.
Example − S={x|x∈NS={x|x∈N and 7<x<8}=∅7<x<8}=∅
7. Singleton Set or Unit Set
Singleton set or unit set contains only one element. A singleton set
is denoted by {s}{s}.
Example − S={x|x∈N, 7<x<9}S={x|x∈N, 7<x<9} = {8}{8}
8. Equal Set
If two sets contain the same elements they are said to be equal.
Example − If A={1,2,6}A={1,2,6} and B={6,1,2}B={6,1,2}, they are
equal as every element of set A is an element of set B and every
element of set B is an element of set A.
9. Equivalent Set
If the cardinalities of two sets are same, they are called equivalent
sets.
Example − If A={1,2,6}A={1,2,6} and B={16,17,22}B={16,17,22},
they are equivalent as cardinality of A is equal to the cardinality of
B. i.e. |A|=|B|=3|A|=|B|=3
10. Overlapping Set
Two sets that have at least one common element are called
overlapping sets.In case of overlapping sets −
A. n(A∪B)=n(A)+n(B)−n(A∩B)n(A∪B)=n(A)+n(B)−n(A∩B)
B. n(A∪B)=n(A−B)+n(B−A)+n(A∩B)n(A∪B)=n(A−B)+n(B−A)+n(A∩B)
C. n(A)=n(A−B)+n(A∩B)n(A)=n(A−B)+n(A∩B)
D. n(B)=n(B−A)+n(A∩B)n(B)=n(B−A)+n(A∩B)
Example − Let, A={1,2,6}A={1,2,6} and B={6,12,42}B={6,12,42}.
There is a common element ‘6’, hence these sets are overlapping
sets.
11. Disjoint Set
Two sets A and B are called disjoint sets if they do not have even
one element in common. Therefore, disjoint sets have the following
properties −
A. n(A∩B)=∅n(A∩B)=∅
B. n(A∪B)=n(A)+n(B)n(A∪B)=n(A)+n(B)
Example − Let, A={1,2,6}A={1,2,6} and B={7,9,14}B={7,9,14},
there is not a single common element, hence these sets are
overlapping sets.
4
Video links:
Introduction of Set
• https://youtu.be/ZMhoRLGNR5Y
Set Operation
• https://youtu.be/4TlCToZZ5gA
Reference:
• https://www.tutorialspoint.com/discrete_mathematics/discret
e_mathematics_sets.htm
• https://en.m.wikipedia.org/wiki/Set_(mathematics)

Chapter 3 - Sets

Uploaded by

Copyright:

Available Formats

Chapter 3 - Sets

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 3 - Sets

Uploaded by

Copyright:

Available Formats

DISCRETE MATHEMATICS

After completing this course, you will be able to:

Some Example of Sets

Roster or Tabular Form

Set Builder Notation

Some Important Sets

Example − We may define UU as the set of all animals on earth. In

You might also like