Scribd
Upload
18 views

Relations and Functions

The document discusses types of relations and functions. It defines empty and universal relations, and properties of relations such as reflexive, symmetric, and transitive. It then defines functions as a special type of relation where each element of the domain has a single image in the range. Types of functions include one-to-one, onto, and bijective functions. Examples are given to illustrate these concepts.

Uploaded by

sumayyabi pm
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views

Relations and Functions

The document discusses types of relations and functions. It defines empty and universal relations, and properties of relations such as reflexive, symmetric, and transitive. It then defines functions as a special type of relation where each element of the domain has a single image in the range. Types of functions include one-to-one, onto, and bijective functions. Examples are given to illustrate these concepts.

Uploaded by

sumayyabi pm
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Relations and Functions

Types of Relations
Empty Relation
If no element of A is related to any element of A, i.e. R = φ ⊂ A × A, then the relation R in a set A is
called empty relation.
Universal Relation
If each element of A is related to every element of A, i.e. R = A × A, then the relation R in set A is said to
be universal relation.
A relation R in a set A is called-
Reflexive- if (a, a) ∈ R, for every a ∈ A,
Symmetric- if (a1, a2) ∈ R implies that (a2, a1) ∈ R , for all a1, a2∈ A,
Transitive- if (a1, a2) ∈ R and (a2, a3) ∈ R implies that (a1, a3) ∈ R for all a1, a2, a3 ∈ A.
Equivalence Relation- A relation R in a set A is an equivalence relation if R is reflexive, symmetric and
transitive.

Functions
“a relation f from a set A to a set B is said to be a function if every element of set A has one and only one
image in set B”.

Types of Functions
1. One to one Function: A function f : X → Y is defined to be one-one (or injective), if the images of
distinct elements of X under f are distinct, i.e., for every x1 , x2 ∈ X, f(x1 ) = f(x2 ) implies x1 = x2 .
Otherwise, f is called many-one.

2. Onto Function: A function f: X → Y is said to be onto (or surjective), if every element of Y is the
image of some element of X under f, i.e., for every y ∈ Y, there exists an

element x in X such that f(x)=y

3.One-one and Onto Function: A function f: X → Y is said to be one-one and onto (or bijective), if f
is both one-one and onto.

1. Determine whether each of the following relations


are reflexive, symmetric and transitive.Relation R in
the set A = {1, 2, 3...13, 14}A = {1, 2, 3...13, 14}defined
as R = {(x, y): 3x - y = 0}

2. Show that the relation R in the set {1, 2, 3}{1, 2,


3}given by R = {(1, 2), (2, 1)}R = {(1, 2), (2, 1)}is
symmetric but neither reflexive nor transitive.

3.Let f: R → R be defined as f(x) = x4


A.f is one-one onto
B.f is many-one onto
C.f is one-one but not onto
D.f is neither one-one nor onto

4.Let f: {1, 3, 4} → {1, 2, 5}f: {1, 3, 4} → {1, 2, 5}and g: {1, 2, 5} → {1,


3}g: {1, 2, 5} → {1, 3}be given by f = {(1, 2), (3, 5), (4, 1)}f = {(1, 2), (3,
5), (4, 1)}and g ={(1, 3), (2, 3), (5, 1)}g ={(1, 3), (2, 3), (5, 1)}
. Write down gof

5. Find gof and fog, if The functions are f(x)=8x3 and g(x)=x1/3
Consider f: R → R given by f(x)=4x+3. Show that f is invertible. Find
the inverse of f
.

You might also like