RELATION AND FUNCTIONS

GRADE 12
Relation: A relation R from set X to a set Y is defined as a subset of the cartesian
product X × Y. R ⊆ {(x, y) ∈ X × Y : xRy}.
 1) If R = { (a, a³): a is a prime number less than 5 } be a relation. Find the range of R.[Foreign 2014]

2) If R= {(x, y): x + 2y = 8} is a relation on N, then write the range of R. [All India 2014]

3) State the reason for the relation R in the set {1, 2, 3} given by R = {(1, 2), (2,1)} not to be transitive. (Delhi 2011)
Types of Relation:
Empty Relation: A relation R in a set X, is called an empty relation, if no element of X is related to any element of X,
i.e. R = Φ ⊂ X × X
Universal Relation: A relation R in a set X, is called universal relation, if each element of X is related to every
element of X, i.e. R = X × X

R = {(a,a): a ∈ A}
Eg: If set A = {1,2,3,4} and relation R is given by R = {(a,b) : mod (a-b) >= 0}
R = {(a,a): a ∈ A}
Eg: If set A = {1,2,3,4} and relation R is given by R = {(a,b) : mod (a-b) >= 0}
 Identity Relation
Relation R in a set A is called an identity relation if each element of A is related to itself only
and it is denoted by R = {(a,a) : a ∈ A}.
Eg1) If Set A = {1,2} , then the identity relation
R1on A = {(1,1),(2,2)} but
R2 = {(1,1), (1,2), (2,2)} is not identity relation.
Reflexive Relation: A relation R defined on a set A is said to be reflexive, if (x, x) ∈ R, ∀ x ∈ A or xRx, ∀ x ∈ R

A Relation R defined on Set A is said to be reflexive if each element of a set A is mapped to itself.
means, aRa for all a R. Reflexive Relation Example: The relation R = { (0, 0), (1, 2), (1, 1), (2, 2)} defined on A = {0, 1, 2} is a
reflexive relation.

1) Is the relation R = {(0,0), (0,1)} defined on A = {0, 1} reflexive?

For R to be reflexive, we must have (m, m) R for all m A.
0 ∈ A and (0, 0) ∈ R
1 ∈ A but (1, 1) ∈ R
Hence, R is a reflexive relation.

2) If set A = {1,2, ………. 10} as R = {(x,y) : 2x – y = 0, check whether it is reflexive or not.

Reflexive Relation Formula
Number of reflexive relations in a given set N = 2n(n – 1)
where N = Number of reflexive relations and n = the number of elements in the set

Ex: If A = {w, x, y, z}, then find the number of reflexive relations on set A.

A = {w, x, y, z}
Number of elements in set A = n = 4
Number of reflexive relation N = 2n(n – 1)
N = 24(4 – 1)
N = 24 x 3
N = 212
N = 4096
Symmetric Relation: A relation R defined on a set A is said to be symmetric, if (x, y) ∈ R ⇒ (y, x) ∈ R, ∀ x, y ∈ A or
xRy ⇒ yRx, ∀ x, y ∈ R.

NOTE: Total number of symmetric relations is 2n(n+1)/2.

Q) If number of symmetric relations from set X to X is 64, find th number of elements in set X. Ans: 3
Transitive Relation: A relation R defined on a set A is said to be transitive, if (x, y) ∈ R and (y, z) ∈ R ⇒ (x, z) ∈ R, ∀ x,
y, z ∈ A or xRy, yRz ⇒ xRz, ∀ x, y,z ∈ R.
Equivalence Relation: A relation R defined on a set A is said to be an equivalence relation if R is reflexive,
symmetric and transitive.
Equivalence Classes: Given an arbitrary equivalence relation R in an arbitrary set X, R
divides X into mutually disjoint subsets A, called partitions or sub-divisions of X
satisfying.

• all elements of Ai are related to each other, for all i.

• no element of Ai is related to any element of Aj, i ≠ j

• Ai ∪ Aj = X and Ai ∩ Aj = 0, i ≠ j. The subsets Ai and Aj are called equivalence classes.

 Note: If n(A) = p and n(B) = q from set A to set B, then n(A × B) = pq and
number of relations = 2pq.

A relation is not a function if there is more than one output for an input. For
example, in the relation {(1,0); (1,2); (2,3)}, the input of 1 gives two different
outputs.
So the relation is not a function.
1) Let R be the equivalence relation in the set A = {0,1,2,3,4,5} given by R = {(a,b): 2 divides (a - b)}.
Write the equivalence class [0]. [Delhi 2014]

Ans. Given, R = {(a, b):2 divides (a-b)}.

Here, all even integers are related to zero, i.e. (0, 2), (0, 4).
Hence, the equivalence class of [0] = {2,4} .
2) If A={1,2,3,...,9} and R be the relation in AxA defined by (a, b) R (c,d). If a +d=b+c for (a,b), (c,d) in Ax A.
Prove that R is an equivalence relation, Also, obtain the equivalence class [(2, 5)]. [Delhi 2014]
➢ A function is always a relation. A function is a
type of relation in which each input has a
unique output.
➢ If a vertical can pass through the graph of a
relation and only touch the graph once, then
it is a function.
Types of Functions
One-one Function or Injective Function: A function f : X → Y is said to be a one-one function, if the images of distinct
elements of x under f are distinct, i.e. f(x1) = f(x2 ) ⇔ x1 = x2, ∀ x1, x2 ∈ X
A function which is not one-one, is known as many-one function.
Methods to Test One-One
1) Analytically : If x1, x2 ∈ A, then f(x1) = f(x2) => x1 = x2
or equivalently x1 ≠ x2 => f(x1) ≠ f(x2)

2) Graphically: If any line parallel to x-axis cuts the graph of the function atmost at one point, then the
function is one-one.

3) Monotonically: Any function, which is entirely increasing or decreasing in whole domain, then f(x) is
one-one.
Number of One-One Functions Let f : A → B be a function, such that A and B are finite sets having m and n elements
respectively, (where, n > m).
The number of one-one functions = n(n – 1)(n – 2) …(n – m + 1) = { nPm, n ≥ m, 0, n < m
If A={1,2,3}, B = {4, 5, 6, 7} and f = {(1, 4), (2, 5), (3, 6)) is a function from A to B. State whether f is one-one or not.
[All India 2011]
Onto Function or Surjective Function: A function f : X → Y is said to be onto function or a
surjective function, if every element of Y is image of some element of set X under f, i.e. for every y ∈ y, there
exists an element X in x such that f(x) = y.
In other words, a function is called an onto function, if its range is equal to the codomain.
Note: Every polynomial function f: R → R of degree odd is onto.

Number of Onto (surjective) Functions: Let A and B are finite sets having m and n elements
respectively, such that 1 ≤ n ≤ m, then number of onto (surjective) functions from
A to B = nΣr = 1 (- 1)n – r nCr rm

If f : A → B is such that there exists atleast one element in codomain which is not the image of any
element in domain, then f(x) is into.
Thus, f : A → B, such that f(A) ⊂ B means Range ⊂ Codomain
Bijective or One-one and Onto Function: A function f : X → Y is said to be a bijective
function if it is both one-one and onto.
Composition of Functions: Let f : X → Y and g : Y → Z be two functions. Then, composition of functions f and g is a
function from X to Z and is denoted by fog and given by (fog) (x) = f[g(x)], ∀ x ∈ X.
Note
(i) In general, fog(x) ≠ gof(x).
(ii) In general, gof is one-one implies that f is one-one and gof is onto implies that g is onto.
(iii) If f : X → Y, g : Y → Z and h : Z → S are functions, then ho(gof) = (hog)of.

Important Points to be Remembered

(i) If f and g are injective, then fog and gof are injective.
(ii) If f and g are surjective, then fog is surjective.
(iii) Iff and g are bijective, then fog is bijective.
Q1) If f: {1,3, 4} → {1, 2, 5} and g: {1,2, 5} → {1, 3} given by f = {(1,2), (3, 5), (4,1)} and g = {(1,3), (2, 3), (5,1)}.
Write down gof. (All India 2014C)
2) If A = {1, 2, 3}, B = {4, 5,6, 7} and f = {(1, 4), (2, 5), (3, 6)} is a function from A to B.
State whether f is one-one or not. (All India 2011)

3) If f : R → R is defined by f{x) = 3x + 2, then define f[f(x)]. (Foreign 2011; Delhi 2010)

Invertible Function: A function f : X → Y is said to be invertible, if there exists a function g : Y → X such that
gof = Ix and fog = Iy. The function g is called inverse of function f and is denoted by f-1.

Note:
(i) To prove a function invertible, one should prove that, it is both one-one and onto, i.e. bijective.
(ii) If f : X → V and g : Y → Z are two invertible functions, then gof is also invertible with (gof)-1 = f-1og-1
1) If R= {(x, y): x + 2y = 8} is a relation on N, then write the range of R. [All India 2014]
4) Let R be the relation in the set A = {0,1,2, 3,4,5} given by
R=[(a, b) : 2divides (a-b)}. Verify R is reflexive ,symmetric and transitive also Write the equivalence class [0].
(Delhi 2014C) ; (2023-24-PT1-DPS-SHARJAH)
Q) Determine the relation R defined on set of real numbers R
as is reflexive ,symmetric and transtive.
(PT1-DPS,SHARJAH)
Q) Prove that the greatest integer function f: R → R, given by f (x) = [x], is neither one-one nor onto, where
[x] denotes the greatest integer less than or equal to x. (DPS-SHARJAH-PT1)
 n+1
, if n is odd
2
Show that f:N→N defined by f(n) = ቐn is not one -one but an onto function.
, if n is even
2

(DPS-SHARJAH-PT1-2023-24)
Q) Consider the function f:𝑅+ → [−5, ∞) given by f(x)= 9𝑥 2 + 6𝑥 − 5.Show that f is bijective.
(DPS-SHARJAH-PT1-2023-24)
TRY YOURSELF….
1) If Z is the set of all integers and R is the relation on Z defined as R={(a,b): a,b∈Z and a - b is divisible by 5}. Prove that
R is an equivalence relation. [Delhi 2010, HOTS]

2) If R is a relation defined on the set of natural numbers N as follows:

R = {(x, y) : x ∈ N, y ∈ N and 2x + y = 24}, then find the domain and range of the relation R . Also, find whether R
is an equivalence relation or not. (Delhi 2014C)
3) Show that the relation S in the set R of real numbers defined as S – {(a, b): a,b ∈ R and a ≤ b3} is neither
reflexive nor symmetric nor transitive. (Delhi 2010)
4) Let A = {x ∈ Z: 0 ≤ x ≤ 12}. Show that R = {(a, b): a, b ∈ A, |a – b| is divisible by 4} is an equivalence relation.
Find the set of all elements related to 1. Also, write the equivalence class [2]. (CBSE 2018)
5) Show that the relation R on the set Z of all integers defined by (x, y) ∈ R ⇔ (x – y) is divisible by 3 is an
equivalence relation. (CBSE 2018C)