Scribd
Upload
24 views1 page

Your Paragraph Text

Uploaded by

jsudha896
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views1 page

Your Paragraph Text

Uploaded by

jsudha896
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

RELATION AND

FUNCTIONS
TYPES OF RELATIONS
RELATIONS
Reflexive relation : (a , a)∈R for
A relation from a non-empty
every a ∈ A
set A to itself is a subset of
symmetric Relation : (a1 , a2)∈R
cartesian product A x A.
implies that (a2 , a1)∈R for all
Relation from a set A to set B
(a1 , a2)∈ A
1 is a subset of cartesian
Transitive relation : (a1 , a2)∈R & 2
product A x B
(a2 , a3)∈R implies that (a1 , a3)
∈ R for all a1 , a2 , a3 ∈ A
Equivalence Relation : a relation
R is said to be an equivalence TYPES OF FUNCTIONS
relation if R is reflexive , RELATION AND One-One Function: A function f : X → Y is
symmetric, transitive one-one (or injective) if the images of
FUNCTIONS
distinct elements of X under f are distinct
,i.e. , f(x1)=f(x2)⇒ x1 = x2 ∀ x1, x2∈X
otherwise , f is called many-one.
FUNCTIONS Onto Function : A function is onto (or
surjective) if every element of Y is the
for any two non-empty sets X & Y , a
image of some element of X under f , i.e. , for
function f is a rule or mapping which 3 every y ∈ Y , there exists element x in x
associates each elements of set X to a 4 such that f(x) = y
unique element in set Y
Into Function : A function f : X → Y is into if
there exists atleast one element in Y which
has no pre-image in A
One-One & Onto Function : A function f : X
→ Y is said to be one-one & onto (or
bijective) if f is both one-one & onto

You might also like