1

Acknowledgment 1
Table of Relations 2

ConTenTs Types of relations 3

Functions 4
Types of functions 5
Difference between 6
relations and functions
Graphical 7
representations of
functions
Bibliography 8

2
 aCknowledgemenT
I wish to extend my heartfelt appreciation to my respected
mathematics teacher for their unwavering support, expert
guidance, and valuable insights throughout the course of this
project. Their clear explanations, consistent encouragement,
and dedication to teaching have played a pivotal role in
deepening my understanding of the mathematical concepts
explored in this project. The patience and enthusiasm they
showed while addressing my doubts have helped me
improve not only my academic skills but also my confidence
in the subject.
A special note of thanks goes to my parents, who have
always been my pillars of support. Their endless love,
motivation, and belief in my abilities have helped me stay
focused and dedicated to my work. They provided me with
the necessary resources, time, and a peaceful atmosphere at
home, which were essential for the successful completion of
this project.
I would also like to thank my classmates and friends who
provided helpful suggestions, shared ideas, and encouraged
me throughout the duration of this project. The discussions
and collaborative spirit among us greatly enriched my
learning process.

3
The relation is a linear operation that establishes a
relationship between the elements of two sets according to
some definite rule of relationship.
R: {(a, b) | (a, b) ∈ A × B and a R b}

definiTion of RelaTions
A Relation R from set A to set B is established as a subset of
the Cartesian product A x B. In other words, relation R consists
of ordered pairs where the first element belongs to set A and
the second element belongs to set B. Therefore, we can say
that R is a relation from A to B. represented as R ⃀ A x B.
Total number of relations if n(A) = m and n(B) = n is 2mn

domain and Range of a RelaTion

Let R be a relation from a set A to set B. The domain of R
comprises all the first elements of the ordered pairs in R.
The Range of R is the set of all second elements of the ordered
pairs.
Thus, Domain = (a: (a, b) € R) and Range (b: (a, b) € R)
It is clear from the above definition that the domain of a
relation from set A to B is a subset of A. and its Range is a
subset of B.

4
 Types of RelaTions
Different types of relations are:
1. Universal Relations
2. Void Relations
3. Identity Relations
4. Reflexive Relations
5. Symmetric Relations
6. Transitive Relations
7. Equivalence Relations
Let us discuss all types of relations one by one.
1. Universal Relations
A relation R on set A is termed a Universal Relation If every
element of A is related to every other element within set A
i.e. R = A x A
2. Void Relations
A relation R on set A is called Void/Empty Relation if no
element of A is related to any element of A
i.e. R ⃀ A x B
3. Identity Relations
A relation defined on a set A is called an Identity Relation if
each element of A is related to only and only itself.
i.e. I= {(a, a): V a ∈ A).

5
 4. Reflexive Relations
A relation defined on a set A is called Reflexive Relation if
each element of A is related to itself.
i.e. (a, a) € R V a € A.
5. Symmetric Relations
A relation defined on a set A is said to be Symmetric
Relation if
(a, b) € R => (b, a) € R for all a, b € A.
i.e. a R b => b R a V a, b, € A.
6. Transitive Relations
Let A be any set. A relation R on set A is said to be a
Transitive Relation if
(a, b) € R and (b. c) € R => (a. c) € R for all a, b, c € A.
i.e. a R b, b R c => a R c V a, b, c € A.
7. Equivalence Relations
A relation R on a set A is said to be an Equivalence Relation
if:
 It is Reflexive Relation
 It is Symmetric Relation
 It is Transitive Relation

6
 funCTions
A function f from set A to set B is defined as a relation where
each element in A maps to exactly one element in B. This
means that for every input from A, B has a unique output. We
can represent this function as f: A → B. If (a, b) € f, then f(a) =
b, where b represents the image of a under f, while a is
referred to as the preimage of b under f.

Types of funCTion
1. Identity Function
2. Constant Function
3. Polynomial Function
4. Modulus Function
5. Signum Function
6. Greatest Integer Function

Let us discuss these functions in detail

1. Identity Function
Consider the set R of real numbers. Define the real-valued
function f: R → R as y = f(x) = x for all x ∈ R. This type of
function is known as the identity function, denoted by f(x) = x.
Both domain and range of f are R. Its graph is a straight line
that passes through the origin.
7
 2. Constant Function
The function f: R → R can be expressed as y = f(x) = c for all x
∈ R, where c is a constant. In this function, the domain of f
comprises all real numbers, denoted as R, and its range is the
singleton set {c}.
3. Polynomial Function
A polynomial function f: R → R is defined such that for each x
in R, y = f(x) = a0 + a1x + a2x2+ …. + anxn, where n represents
a non-negative integer, while a0, a1, a2, … , an are real
numbers.
4. Modulus Function
The modulus function f: R -> R defined as f(x) = |x| V x € R, is
called the absolute value function. When x is non-negative,
f(x) equals x, but when x is negative, f(x) becomes the negative
of x, i.e.,
f(x)= x, x >= 0
-x, x < 0
5. Signum Function
The function f: R -> R is defined by
f(x)= 1, if x > 0
0, if x = 0
-1, if x < 0
f(x)= 1, if x > 0
0, if x = 0
-1, if x < 0
is called the signum function.

8
 6. Greatest Integer Function
The function f: R -> R defined as f(x) = [x], where x € R,
represents the greatest integer function. Here, the notation
[x] denotes the greatest integer less than or equal to x.
-1 for -1 ≤ x < 0
0 for 0≤x<1
[x] = 1 for 1≤x<2
2 for 2≤x<3

9
 diffeRenCe beTween RelaTion and
funCTion

Differentiating Relation Function

Parameter
Definition A relation is the A function is a
connection relation in
between set of which each
values, often input is
represented as associated with
a subset of the exactly one
Cartesian output
product
Denotation The symbol ‘R’ A function is
is used to represented by
denote relation the symbol’s
“F” or “f”
Example R = {(p,1), (p,2), F = {{(p,1),
(q,1)} (q,2)}
Note Not every Every function
relation is a is a type of
function relation

10
 signum funCTion
f(x) or sig x = y 1, x > 0
0, x = 0
-1, x < 0
Graph :-

11
 ConsTanT funCTion
f(x) = 4
y=4

Graph :-

12
 idenTiTy funCTion
x -1 -2 0 1 2
y -1 -2 0 1 2

Graph :-

13
 modulus funCTion
x 2 -2 -3 3 0
|x| (y) 2 2 3 3 0

Graph :-

14
 eXponenTial funCTion
x 1 2 -1 0
y=2x 2 4 0.5 1

Graph :-

15
16