PRESENTED BY

GROUP “C”
Faheem Saeed
Roll No.101
BS IT 2nd (eve)
Q1:What is a Relation?
A relation is a relationship between sets of values. The relation is between the x-
values and y-values of ordered pairs.
The set of all x-values is called the domain, and the set of all y-values is called the
range.
Q2:Example of relations on sets
For Example;
• The first elements in the ordered pairs (the x-values), form the domain & The
second elements in the ordered pairs (the y-values), form the range. Only the
elements "used" by the relation constitute the range.
• This mapping shows a relation from set A into set B. This relation consists of the
ordered pairs ;
• (1,2), (3,2), (5,7), and (9,8).
• The domain is the set {1, 3, 5, 9}.
• The range is the set {2, 7, 8}.
• (Notice that 3, 5 and 6 are not part of the range.)
• The range is the dependent variable.
Q3:PROPERTIES OF RELATION
We will now look at some useful ways to classify relations.

A: Reflexive Relation
•A relation R in a set A is called reflexive if and only if for each element if a  A,
(a, a)R .
Example :

Let R is a relation in A={1,2,3}

R = {(1, 1), (2, 2), (3, 3)}
Graphical representation of reflexive relation
A= {1,2,3}
R = {(1,1),(2,2),(3,3)}
 Q3:PROPERTIES OF RELATION
B:Symmetric Relation
•A relation R in a set A is called symmetric if and only if for each element if
( a, b )R ⇒ (b, a)R
Example:

Let R is a relation in A={1,2,3}

R = {(1, 1), (1, 2), (1, 3) (2, 3), (3, 1), (2, 1), (3, 2), }
Then R is symmetric relation as (a,b) є R and (b,a) є R.
Graphical representation Symmetric Relation
Example:
• friend(x,y), x,y î {ann, tim, paul, jane, jim}
Q3:PROPERTIES OF RELATION

C:Transitive Relation

•A relation R in a set A is called Transitive if and only if for each element if

( a, b )R & (b ,c)  R ⇒ (a ,c)R.
Example :
Let R is a relation in A={1,2,3,4}
R = {(1, 1), (1, 2), (2, 3) (1, 4), (3, 4), (1, 3), (2, 4)}
then R satisfy transitive relation.
Graphical representation Transitive Relation
• example:
• a = {1,2,3,4}
• r = {(1,2), (1,3), (1,4),(2,3),(2,4),(3,4)}
• this is the relation "less than"
Q3:PROPERTIES OF RELATION

D:Anti Symmetric Relation

•A relation R in a set A is called Anti Symmetric if and only if for each element if
( a, b )R & ( b, a )  R ⇒ a = b
Then R is said to an Anti symmetric relation.
Example :
Let R is a relation in A={1,2,3,}
R1 = {(1, 1), (3,3)}
R1= Not Reflexive as (2,2) is not there.
It is Symmetric …Yes.. Because ( a, b ) ( b ,a )
It is Transitive…..yes
It is Anti Symmetric….yes
Q3:PROPERTIES OF RELATION

• R2= {(1, 1), (2, 2), (3, 3) (1, 3)}

It is Reflexive….. Yes
It is Symmetric ….No… Because (1, 3) exists and (3,1) is not exists.
It is Transitive….Yes
It is Anti symmetric …..Yes

• R3= {(1, 1), (1, 3) (3, 1)}

It is Symmetric ….yes… Because (1, 3) exists and (3,1) is also exists.

It is Anti symmetric …..Not ….. because 1 ≠ 3
Q4:KINDS OF RELATION
• Single relation:
• A binary relation (or relation, means the same) from a set A to a
set B is any subset R ⊆ A×B. We take any here seriously so in particular,
if A contains some element a, and B contains some element b, then R={(a, b)}, being
a subset of A×B is a relation from A to B. For that matter, given any two
sets A and B, the empty relation ∅ ⊆ A×B is always a relation from A to B. So not
only can relations consists of just one single pair, they can also consists of no pairs
at all.
 Q5:CONJUNCTIONS OF RELATIONS
• A conjunction is a compound statement formed by joining two statements with the
connector AND. The conjunction “p and q" is symbolized by p ∧ q.
• A conjunction is true when both of its combined parts are true; otherwise it is
false.

Given P: Ann is on the softball team

q: Paul is on the football team
Problem What does p ∧ q represents?

• In above example , statement p represents the sentence, "Ann is on the softball

team," and statement q represents the sentence, "Paul is on the football team."
The symbol ∧ is a logical connector which means "and." Therefore, the compound
statement p ∧ q represents the sentence, "Ann is on the softball team and Paul is
on the football team." The statement p ∧ q is a conjunction.
Q6:WHAT IS FUNCTION?

• A function is a correspondence or mapping from a first set of numbers, called

the domain of the function, to a second set of numbers, called the range of the
function, such that for each member of the domain there is exactly one member of
the range, as shown in this picture:
Q6:TYPES OF FUNCTION:
• ONTO/SURJECTIVE FUNCTION:

• A function f from A to B is called onto if for all b in B there is an A in a such

that f (a) = b. All elements in B are used.

Onto/Surjective Not Onto/Surjective

All elements of B are used The 8 & 1 in set B are not used
Q6:TYPES OF FUNCTION:
ONE-TO-ONE/ INJECTIVE FUNCTION:
• A function f from A to B is called one-to-one (or 1-1) if whenever
f (a) = f (b) then a = b. No element of B is the image of more than one element
in A.

One-to-One/injective Not One-to-One/injective

 ASSIGNEMENT

• WHY IN BELOW SLIDE NO 19 CERTAIN FUNCTIONS ARE VALID ONTO AND WHILE OTHERS ARE
INVALID..EXPLAIN EACH.
 Types of relations
One- to - one many –to - one

One- to - many
 SPOT THE DIFFERENCE
FUNCTIONS NOT a FUNCTION/S

many –to - one

One- to - one

One- to - many
TO BE A FUNCTION OR NOT TO BE A FUNCTION

Function Not a Function

(4,12) (4,12)
(5,15) (4,15)
(6,18) (5,18)
(7,21) (5,21)
(8,24) (6,24)
Function Not a Function

10 2 10 2

3 3 3 3

4 4 5 4

7 8 7 7

5 2 5
 Function Not a Function

-3 -6 -3 -6
-2 -1 -2 -1
-1 -0 -1 -0
0 3 0 3
1 15 1 15
Q6:TYPES OF FUNCTION:
• ONE TO ONE CORRESPONDENCE/BIJECTIVE FUNCTION:
• In mathematics, a bijection, bijective function or one-to-one correspondence is
a function between the elements of two sets, where each element of one set is
paired with exactly one element of the other set, and each element of the other
set is paired with exactly one element of the first set.

A bijective function, f: X → Y,
where set X is {1, 2, 3, 4} and
set Y is {A, B, C, D}. For
example, f(1) = D.
First Set: Domain( Second Set:
2nd Semester’s Correspondence: Range(set of positive
students) Each student’s Roll No. integers)

Faheem
101

Ahsan
114

Ahmad
119
Q6:TYPES OF FUNCTION:

• INVERSE FUNCTION :
• An inverse function is a function that "reverses" another function: if the
function f applied to an input x gives a result of y, then applying its inverse
function g to y gives the result x, and vice versa. I.E., F(x) = y if and only if g(y) = x.
EVERY FUNCTION IS A RELATION BUT ALL
RELATION ARE NOT FUNCTION

• Every function is one type of relation because every function creates by

making an one way relation. But relation makes from both side for that
reason all relation are not function.
Q7.DOMAIN, CODOMAIN, RANGE,
IMAGE & PREIMAGE OF A FUNCTION

• Let f: a→ 𝑩 be the function, then set ‘A’

is called the domain of f and set ‘B’ is called the codomain of f. The set of those
elements of B which are related by elements of A is called range of f or image of
set A under f and is denoted by f(a), i.E.

• f ( A ) = f ( a ) |a  A = Range of f.

f ( A )  B.
Q7.DOMAIN, CODOMAIN, RANGE,
IMAGE & PREIMAGE OF A FUNCTION

Dom (R7) = {a, b}, Domain (R8) = {a, b}

Codomain = {1, 2} Codomain (R8) = {1, 2}
Range (R7) = {1} Range (R8) = {1, 2}
= Codomain (R8)
Q7.DOMAIN, CODOMAIN, RANGE,
IMAGE & PREIMAGE OF A FUNCTION
• An image is the subset of a function's codomain which is the output of the
function from a subset of its domain.
• Evaluating a function at each element of a subset X of the domain, produces a set
called the image of X under or through the function. The inverse
image or preimage of a particular subset S of the codomain of a function is the set
of all elements of the domain that map to the members of S.
• Image and inverse image may also be defined for general binary relations, not just
functions.

f is a function from domain X to

codomain Y. The yellow oval inside Y is
the image of f.
Q8.DIFFERENCE BETWEEN RELATION
& FUNCTION
• A relation is a set of numbers that have a relationship through the use of a domain
and a range, while a function is a relation that has a specific set of numbers that
causes there to be only be one range of numbers for each domain of numbers. All
functions are relations, but all relations are not functions.
Q9.A × B AND B × A ; IS IT EQUAL IN TERM
M × N?
• Let A and B be sets.
• The cartesian product a × b is not commutative,
• A×B ≠ B×A
• Because the ordered pairs are reversed except if at least one of the following conditions is satisfied:
• A is equal to B, or
• A or B is the empty set

For example:
A = {1,2}; B = {3,4}
A × B = {1,2} × {3,4} = {(1,3), (1,4), (2,3), (2,4)}
B × A = {3,4} × {1,2} = {(3,1), (3,2), (4,1), (4,2)}
A = B = {1,2}
A × B = B × A = {1,2} × {1,2} = {(1,1), (1,2), (2,1), (2,2)}
A = {1,2}; B = ∅
A × B = {1,2} × ∅ = ∅
B × A = ∅ × {1,2} = ∅
 SELF QUIZ

Q. WHAT IS TRANSITIVE RELATION WITH EXAMPLE.

Q. WHAT IS SYMMETRIC RELATION WITH EXAMPLE.
Q. WHAT IS REFLEXIVE RELATION WITH EXAMPLE.
Q. WHAT IS CARTESIAN PRODUCT AND ITS ADVANTAGES.
IF X={1,-3,5,-1,4} ; Y={6,2,0,-5}
AND THE RELATION IS X → Y THEN THE SETS ARE (4,2) , (5,-5) , (1,6)
Q. TRANSFORM THESE SETS INTO ARROW DIAGRAM.
Q. IF RELATION X → Y ; ARE THESE SETS ARE IN RELATION:
(0,5) , (-3,-5) , (-3,-3) EITHER YES OR NO , PASS THE ARGUMENTS.
Q. IF THE RELATION IS Y → X ; AND THE SETS ARE: (1,6) , (6,1) ARE THESE IN RELATION ?
EITHER YES OR NO , PASS YOUR ARGUMENTS.

Q. WHAT IS DOMAIN AND CO-DOMAIN, RANGE AND IMAGE.

Q. WHAT IS FUNCTION AND ITS TYPES. WHAT IS INVERSE FUNCTION.

Q. EVERY FUNCTION IS A RELATION. EVERY RELATION IS NOT A FUNCTION WHY?