Abstract
Abstract
Dr Chandan Kr Thakur
Department of Mathematics
School of Advanced Sciences (SAS)
Text Book
Referred Book
Introduction
Mathematics
The study of any and all absolutely certain truths about any and all
perfectly well-defined concepts.
n Computers (in the present time) can only handle discrete structures.
Non-Discrete Objects
n Finding the Shortest Path from your home to your friend’s home.
n Drawing a graph with two conditions:
n You are not allowed to lift your pen.
n You are not allowed to repeat edges.
n How many different Combinations of password are possible with just 8
alphanumeric characters.
n Encrypt a message and delivery it to your friends and you don’t want
anybody to read message except your friends.
o Computers run software and store files. The software and files are
both stored as huge strings of 1s and 0s. Binary math is discrete mathe-
matics.
o Networks are, at base, discrete structures. The routers that run the
internet are connected by long cables. People are connected to each other
by social media (Twitter, Facebook, Instagram, etc.). The US highway
system connects cities with roads.
o Railway Planning uses discrete math: deciding how to expand train rail
lines, train timetable scheduling, and scheduling crews and equipment for
train trips use both graph theory and linear algebra.
o Electronic Health care records are kept as parts of databases, and there
is a lot of discrete mathematics involved in the efficient and effective design
of databases.
o Power grids: Graph theory is used in finding the most vulnerable aspects
of an electric grid. Graph theory and linear algebra are used in power grid
simulations.
o Design of radar and sonar systems uses graph theory via Golomb
rulers.
o Observe that the sets {1, 2, 3}, {3, 1, 2} and {digits in the number 12321}
are the same as the order in which the elements appear doesn’t matter.
o The collection of vowels in English alphabets. This set contains five ele-
ments i.e.{a, e, i, o, u}.
Roster Form
Is 2 ∈ {0, 2, 4, 6} ?
Is 2 ∈ {1, 3, 5, 7, 9}?
o Q - Rational numbers:
p
{ p, q ∈ I, q 6= 0}.
q
o R - {x | x is a number that can be written as a decimal}.
The set {φ} is not empty, but is a set which contains the empty set.
o Is φ ∈ {φ, {φ}} ?
o Is φ ∈ {{φ}} ?
o Is 3
2 / {x | x = p1 , p ∈ N } ?
∈
Note:
Sets do not care about the order or how many times an object is included. Thus,
{1, 2, 3, 4}, {2, 3, 1, 4}, and {1, 2, 2, 3, 3, 3, 4, 4} all describe the same
set.
Set Equality:
The sets A and B are equal (written A = B) provided:
o Every element of A is an element of B, and every element of B is an element
of A
In other words, if and only if they contain exactly the same elements
Universe of Discourse
The set containing all elements under discussion for a particular problem.
In mathematics, this is called the universal set and is denoted by U.
Venn diagrams can be used to represent sets and their relationships to each
other
0
The set A , the shaded region, is the complement of A
0
A is the set of all objects in the universe of discourse that are not elements of
A. 0
A = {x | x ∈ U and x ∈ / A}
Power Sets
A tree diagram can be used to generate P(A). Each element of the set is
either in a particular subset, or its not.
Intersection
The intersection of two sets, A ∩ B, is the set of elements common to both:
A ∩ B = {x | x ∈ A and x ∈ B}
A∩B =φ
The union of two sets, A ∪ B, is the set of elements belonging to either set A
and set B:
A ∪ B = {x | x ∈ A or x ∈ B}
In other word for an object to be in A ∪ B it must be a member of either A or
B.
A − B = {x | x ∈ A and x ∈
/ B}
0
Note: x ∈
/ B means x ∈ B
0 0
A − B = {x | x ∈ A and x ∈ B } = A ∩ B
What is Logic?
é He is very talented.
é x + 10 = 20.
Proposition is a declarative sentence which is either true or false but not both.
The area of logic that deals with propositions is called as propositional logic.
Computers run software and store files. The software and files are both stored
as huge strings of 1s and 0s. Binary math is discrete mathematics.
Networks are, at base, discrete structures. The routers that run the internet
are connected by long cables. People are connected to each other by social
media (Twitter, Facebook, Instagram, etc.). The US highway system connects
cities with roads.
Doing web searches in multiple languages at once, and returning a summary,
uses linear algebra.
Google Maps uses discrete mathematics to determine fastest driving routes
and times. There is a simpler version that works with small maps and techni-
calities involved in adapting to large maps.
Railway planning uses discrete math: deciding how to expand train rail lines,
train timetable scheduling, and scheduling crews and equipment for train trips
use both graph theory and linear algebra.
Georg Cantor
(1845 - 1918)
The Theory of set was developed by German mathematician Georg Cantor (1845
- 1918). He first encountered set while working on problems on Trigonometrical
series. We study the fundamental discrete structure on which all other discrete
structures are built, namely, the set. Sets are used to group objects together.
They are generally denoted by a capital letters such as A, B, C, ... etc.
2 B = As we all know that there are millions of galaxies present in our world which
are separated from each other by some distance. Here, the universe act as a set.
3 C = Kitchen is the most relevant example of sets. Our mother always keeps the
kitchen well arranged. The plates are kept separate from bowls and cups. Sets
of similar utensils are kept separately.
Definition
A set is an unordered collection of objects, called elements or members of the
set. A set is said to contain its elements. We write a ∈ P to denote that a is
an element of the set P. The notation a ∈ P denotes that a is not an element
of the set P.
Sets can be represented in three forms:
Roster Form: P = Set of even numbers less than 8 = {2, 4, 6}
Statement Form: Q = { Set of Odd numbers less than 9}
Set Builder Form: R = {x : x = 2n, n ∈ N and 1 ≤ n ≤ 4}
The concept of a datatype, or type, in computer science is built upon the concept
of a set. In particular, a datatype or type is the name of a set, together with a
set of operations that can be performed on objects from that set.
For example, boolean is the name of the set {0, 1} together with operators on
one or more elements of this set, such as AND, OR, and NOT.
Two sets are equal if and only if they have the same elements. Therefore, if A
and B are sets, then A and B are equal if and only if ∀x (x ∈ A ⇔ x ∈ B).We
write A = B if A and B are equal sets.
Empty Set: There is a special set that has no elements. This set is called the
empty set, or null set, and is denoted by ∅. The empty set can also be denoted by {}
Recall the notation for intervals of real numbers. When a and b are real numbers
with a ≤ b, we write
[a, b] = {x|a ≤ x ≤ b}
[a, b) = {x|a ≤ x < b}
(a, b] = {x|a < x ≤ b}
(a, b) = {x|a < x < b}
Note that [a, b] is called the closed interval from a to b and (a, b) is called the
open interval from a to b.
1 Set, they usually mean a collection of objects where ordering does not
matter and no element is repeated.
Example: A = {1, 1, 2, 3, 4, 4} is actually thought as B = {1, 2, 3, 4}.
2 But in certain context, we might have to use these repetitions. These are
called multi-sets. So multi-set is a set where order and repetitions matter.
Thus multi-set of A = {1, 1, 2} is different from the set of B = {1, 2}.
3 The third kind of set is what we call as ordered sets. So these are the sets
where the ordering matters. We sometimes call it as strings or vectors.
Example: Set P = {1, 2, 3} this is different from the set Q = {3, 2, 1}.
4 We can also have ordered multi-sets meaning sets where both repetitions
as well as ordering matters.
1 Union (∪). A ∪ B where A and B are two sets is the set of all elements that is
contained in either A OR B.
2 Intersection (∩). A∩B where A and B are the set of all elements that are contained
in A AND B.
A Venn diagram is a widely used diagram style that shows the logical relation
between sets.
Problem (1)
Which of the following are are null (empty) sets ?
(i) Set of odd natural number divisible by 2.
(ii) {x : 3 < x < 4, x ∈ N }
(iii) {x : x 2 = 25 and x is an odd integer}
(iv) {x : x 2 − 2 = 0 and x is rational number}
(v) {x : x is common point of any two parallel line}
Problem (2)
Are the following pairs of sets equal ? Give reasons.
(i) A = {2, 1}, B = {x : x is solution of x 2 + 3x + 2 = 0}.
(ii) A = {x : x is a letter in the word FOLLOW},
B = {y : y is a letter in the word WOLF}.