1
Chapter
RELATIONS AND FUNCTIONS
NCERT CRUX
Relations Functions
For any two non-empty sets A and B, every subset of Let A and B are two non empty sets. A function f
A × B defines a relation from A to B and every relation mapping from set A to set B is a rule which associated
from A to B is a subset of A × B. each element of A to a unique element of B, denoted by
(a,b)∈R, then aRb, R ⊆ A × B f:A→B
If (a, b) ∈ R, then a R b is read as 'a is related to bʹ ● Set A is called domain of function 'f '
If (a, b) ∉ R, then a R b is read as 'a is not related to bʹ ● Set B is called co-domain of function 'f '
● Reflexive: If element x of A corresponds to y(∈B) under the
function f, then we say that y is the image of x and write
If (a, a) ∈ R, ∀ a ∈ A. f(x) = y.
i.e., a R a, ∀ a ∈ A
Domain of the Function
“is equal to”, “is a friend of”, “is parallel to”, are
some of reflexive relations. Domain of the function is set of all those real numbers
● Symmetric: (x) for which f (x) exists or f (x) is meaningful, f (x) ≠ ∞
or any imaginary number.)
If a R b ⇒ b R a, ∀ a, b ∈ A
i.e., if (a, b) ∈ R ⇒ (b, a) ∈ R, ∀ a, b ∈ A Range of Function
“is a friend of”, “is parallel to”, “is equal to”, are Set of all the images of elements in domain is called
some of symmetric relations. the range.
● Transitive : Range = {f(x) : x ∈ domain}
If a R b and b R c ⇒ a R c, ∀ a, b, c ∈ A
i.e. If (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R, ∀ a, Types of Mappings or Functions
b, c ∈ A
“is parallel to”, “is equal to”, “is congruent to” are some One-one Function or Injective Function
of the transitive relation. A function is said to be one-one function if different
elements in a domain have different images in co-domain.
Equivalence Relation
Set A Set B
1 a
A relation R on a non-empty set A is called an if f(x1) = f(x2) then x1
2 b if f(x ) = f(x ) then x = x
= x2, f(x)
f(x) is one- -one
onefunction
1 2 1 2
equivalence relation if and only if it is Reflexive, 3 c is one
Symmetric as well as Transitive. d function
“is parallel to”, “is equal to”, “is congruent to”, “Identity (domain) (co-domain)
relation” are some of the equivalence relations.
Many–one Function
Every identity relation is an equivalence relation but
every equivalence relation need not be an identity A function f : A → B is said to be many one if more than
relation. one element in set A have same image in Set B.
2 NTA CUET (UG) - Mathematics PW
A B (addition, subtraction, division, multiplication, etc.)
a can be generallised as a binary operation is performed
1
b on two elements (say a and b) from set X. The result
2 c
3 of the operation on a and b is another element from the
d
4 e same set X.
Thus, the binary operation can be defined as an
operation *which is performed on a set A. The function
Into Function is given by *A * A → A. So the operation * performed
on operands a and b is denoted by a * b.
A function f : A → B is said to be into function if there
exist at least one element in set B having no pre-image Rules of Binary Addition [RC]
in set B. Binary addition is much easier than the decimal addition
A B when you remember the following tricks or rules. Using
a these rules, any binary number can be easily added. The
1 b four rules of binary addition are:
2 c ● 0+0=0
3 d
● 0+1=1
● 1+0=1
In set B (co-domain) there is no pre-image for element ● 1 + 1 = a digit 0 and a carry of 1
d in set A so function is into function.
Onto Function Binary Subtraction [RC]
f : A → B, said to be onto function if every element in
set B has a pre image in set A. Binary subtraction is one of the four binary operations,
Range of f = co-domain of f. where we perform the subtraction method for two
binary numbers (comprising only two digits, 0 and
Composition of Function 1). This operation is similar to the basic arithmetic
Let f : A → B and g : B → C then the composition of g and subtraction performed on decimal numbers in Maths.
f is denoted by gof and is defined as gof : A → C given by Hence, when we subtract 1 from 0, we need to borrow
gof(x) = g(f(x)) 1 from the next higher order digit, to reduce the digit
by 1 and the remainder left here is also 1. Read other
gof binary operations here.
g Binary Subtraction
f
x ● 0–0=0
f(x) g( f( x))
● 1–0=1
A B C
● 1–1=0
Similarly fog is defined. Note that, gof is defined only if
● 0 – 1 = a digit 0 and a borrow of 1
Range f ⊆ dom g and fog is defined if and only if Range
g ⊆ dom f.
dom fog = {x ∈ dom g : g(x) ∈ dom f} Binary Multiplication [RC]
Inverse Function
Binary Multiplication is one of the four binary
Two functions f and g are inverse of each other if arithmetic. The other three fundamental operations are
f(g(x)) = x for x ∈ dom g and g(f(x)) = x for x ∈dom f, addition, subtraction and division. In the case of a binary
i.e., gof = Idom f and fog = Idom g where Idom f is identity operation, we deal with only two digits, i.e. 0 and 1. The
function on dom f and Idom g is identity function on dom operation performed while finding the binary product is
g. We denote g by f –1 or f by g–1. To find the inverse similar to the conventional multiplication method. The
of f, write down the equation y = f(x) and then solve x four major steps in binary digit multiplication are:
as a function of y. The resulting equation is x = f –1 (y). ● 0×0=0
What is Binary Operation? [RC] ● 0×1=0
We take the set of numbers on which the binary ● 1×1=1
operations are performed as X. The operations ● 1×0=0
Relations and Functions 3
Note: ● 1 ÷ 0 = Meaningless
The binary product of the two binary numbers 1 and 1 is ● 1÷1=0
equal to 1 only. And no additional number is borrowed ● 0 ÷ 0 = Meaningless
to carry forward in this operation.
Similar to the decimal number system, the binary
Binary Division Rules [RC] division is similar, which follows the four-stem process:
The binary division is much easier than the decimal ● Divide
division when you remember the following division ● Multiply
rules. ● Bring down
The main rules of the binary division include: Important Note: Binary follows the long division
● 0÷0=1 method to find the resultant in an easy way.
