Asm 111830
Asm 111830
CLASS: XII
MATHEMATICS
Activity-1
OBJECTIVE
To verify that the relation 𝑅 in the set L of all lines in a plane, defined by
MATRIEL REQUIRED
A piece of plywood, some pieces of wires, nails, white paper, glue etc.
METHOD OF CONSTRUCTION
Take a piece of plywood and paste a white paper on it. Draw few lines on white paper, such that some of
them are parallel, some are perpendicular to each other and some are inclined as shown in Figure.
DEMONSTRATION
OBSERVATION
1. In Fig. 1, no line is perpendicular to itself, so the relation R = {(𝑙, 𝑚): 𝑙 ⊥ 𝑚} is not reflexive.
2. In Fig. 1, 𝑙1 ⊥ 𝑙2 and 𝑙2 ⊥ 𝑙1
∴ (𝑙1 , 𝑙2 ) ∈ R ⇒ (𝑙2 , 𝑙1 ) ∈ R
Similarly, 𝑙3 ⊥ 𝑙1 . Is 𝑙1 ⊥ 𝑙3 ?
∴ (𝑙3 , 𝑙1 ) ∈ R ⇒ (𝑙1 , 𝑙3 ) ∈ R
Also, 𝑙6 ⊥ 𝑙7. Is 𝑙7 ⊥ 𝑙6 ?
∴ (𝑙6 , 𝑙7 ) ∈ R ⇒ (𝑙7 , 𝑙6 ) ∈ R
∴ The relation R is symmetric.
APPLICATION
This activity can be used to check whether a given relation is an equivalence relation or not.
Activity-2
OBJECTIVE
To demonstrate a function which is not one-one but is onto.
MATRIEL REQUIRED
METHOD OF CONSTRUCTION
1 Paste a plastic strip on the left hand side of the cardboard and fix three nails on it as shown in the
Fig.3.1. Name the nails on the strip as 1, 2 and 3.
2 Paste another strip on the right hand side of the cardboard and fix two nails in the plastic strip as
shown in Fig.3.2. Name the nails on the strip as 𝑎 and 𝑏.
DEMONSTRATION
OBSERVATION
APPLICATION
This activity can be used to demonstrate the concept of one-one and onto function.
Activity-3
OBJECTIVE
To find analytically the limit of a function 𝑓(𝑥) at 𝑥 = 𝑐 and also to check the continuity of the function at
that point.
MATRIEL REQUIRED
METHOD OF CONSTRUCTION
𝑥 2 −16
, 𝑥≠4
1 Consider the function given by 𝑓(𝑥) = { 𝑥−4 }
8, 𝑥=4
2 Take some points on the left and some points on the right side of 𝑐(= 4) which are very near to 𝑐.
3 Find the corresponding values of 𝑓(𝑥) for each of the points considered in step 2 above.
4 Record the values of points on the left and right side of 𝑐 as 𝑥 and the corresponding values of 𝑓(𝑥)
in a form of a table.
DEMONSTRATION
APPLICATION
This activity is useful in understanding the concept of limit and continuity of a function at a point.
ASSIGNMENT
Relation: Let 𝐴 and 𝐵 be two sets. Then a relation 𝑅 from set 𝐴 to set 𝐵 is a subset of 𝐴 × 𝐵.
Types of Relations:
Empty Relation: A relation R on a set A is said to an empty relation iff 𝑅 = 𝜙 i.e. (𝑎, 𝑏) ∉ 𝑅∀𝑎, 𝑏 ∈ 𝐴 i.e.
no element of A will be related to any other element of A.
Universal Relation: A relation R on a set A is said to be a universal relation iff 𝑅 = 𝐴 × 𝐴 i.e. (𝑎, 𝑏) ∈
𝑅, ∀a, b ∈ A i.e. each element of A is related to every other element of A.
Reflexive Relation: A relation R on a set A is said to be reflexive, If (𝑎, 𝑎) ∈ 𝑅 for all 𝑎 ∈ 𝐴
Symmetric Relation: A relation R on a set A is said to be symmetric, If (𝑎, 𝑏) ∈ 𝑅 ⇒ (𝑏, 𝑎) ∈ 𝑅 for all
𝑎, 𝑏 ∈ 𝐴
Transitive Relation: A relation R on a set A is said to be Transitive, If (𝑎, 𝑏) ∈ 𝑅, (𝑏, 𝑐) ∈ 𝑅 ⇒ (𝑎, 𝑐) ∈ 𝑅
for all 𝑎, 𝑏, 𝑐 ∈ 𝐴
Equivalence Relation: A relation R in a set A is said to be an Equivalence Relation if R is reflexive,
symmetric and transitive.
Equivalence Class: Let 𝑅 be an equivalence relation on a set 𝐴 and let 𝑎 ∈ 𝐴. Then, we define the
equivalence class of 𝑎 as [𝑎] = {𝑏 ∈ 𝐴: 𝑏 is related to 𝑎} = {𝑏 ∈ 𝐴: (𝑎, 𝑏) ∈ 𝑅}
Function
Let 𝐴 and 𝐵 be two non-empty sets. Then a function ' 𝑓 ' from set 𝐴 to set 𝐵 is a rule which associates
elements of set 𝐴 to elements of set 𝐵 such that:
Many-One Function: A function in which at least two pre images have same image is called as many-one
function.
Into Function: A Function is said to be an 'into' function if there is at least one element in the co-domain
of the function such that it has no pre-image in domain.
Onto Function (or Surjective Function): A function is said to be onto function if each element of co-
domain has a pre-image in its domain. Alternately,
A function ' 𝑓 ' will be called an onto function iff Range of f = Co-domain (𝑓)
Bijective Function: A function which is one - one and onto both is called as bijective function.
Horizontal Line Test: 𝑓 is one-one function if no line parallel to x-axis meets the graph in more than one
point.
Number of functions
If A and B are finite sets containing 𝑚 and 𝑛 elements, then
Total number of relations from the set A to set 𝐵 is 2𝑚𝑛 .
2
Total number of relations on the set A is 2𝑚 .
Total number of functions from the set A to set B is 𝑛𝑚 .
Total number of one-one functions from the set A to set B is 𝑛 𝑃𝑚 if 𝑛 ≥ 𝑚, otherwise 0 .
Total number of onto functions from set A to set B is ∑𝑛𝑟=1 (−1)𝑛−𝑟 𝑛 𝐶𝑟 𝑟 𝑚 if 𝑚 ≥ 𝑛, otherwise 0.
Worksheet No.-(1)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:
2 Show that the relation 𝑅 in the set 𝐴 = {1,2,3} given by 𝑅 = {(1,2), (2,1)} is symmetric but neither
reflexive nor transitive.
3 Show that the relation 𝑅 in the set 𝐴 = {1,2,3} given by 𝑅 = {(1,1), (2,2), (3,3), (1,2), (2,3)} is reflexive
but neither symmetric nor transitive.
6 Let 𝑇 be the set of all triangles drawn in a plane with 𝑅 as a relation in 𝑇 given by 𝑅 = {(𝑇1 , 𝑇2 ): 𝑇1 ≅ 𝑇2 }.
Show that 𝑅 is an equivalence relation.
8 Let 𝐴 = {2,3,4,5,6,7,8,9}. Let 𝑅 be the relation on 𝐴 defined by {(𝑥, 𝑦): 𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 and 𝑥 divides 𝑦}.
State whether or not 𝑅 is (a) reflexive (b) symmetric (c) transitive.
9 Let 𝐴 = {2,4,6,8} and 𝑅 be the relation 'is greater than' on the set 𝐴. Write 𝑅 as a set of ordered pairs. Is
this relation (i) reflexive (ii) symmetric (iii) equivalence? Justify your answer.
10 Let 𝑆 be the set of all points in a plane and 𝑅 be a relation on the set 𝑆 given by = {(𝑎, 𝑏) : distance
between points 𝑎 and 𝑏 be less than 5 units }. Show that 𝑅 is reflective and symmetric but not transitive.
Worksheet No.-(2)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:
1. Show that the relation 𝑅 = {(𝑎, 𝑏): 𝑎 − 𝑏 = even integer ∀𝑎, 𝑏 ∈ 𝑍} i.e., 𝑎𝑅𝑏 ⇔ 𝑎 − 𝑏 = even integer, is
an equivalence relation.
2. Show that the relation R on the set I of all integers defined by 𝑅 = {(𝑎, 𝑏): 𝑎 − 𝑏 is divisible by 3 , 𝑎, 𝑏 ∈
𝐼} is an equivalence relation.
3. Let 𝐼 be the set of all integers, 𝑚 be a positive integer an 𝑅 be the relation on 𝐼 defined by 𝑅 =
{(𝑥, 𝑦): 𝑥, 𝑦 ∈ 𝐼, 𝑥 − 𝑦 is divisible by 𝑚}, prove that 𝑅 is an equivalence relation.
5. Let a relation 𝑅1 on the set 𝑅 of real numbers be defined by 𝑎𝑅1 𝑏 ⇔ 1 + 𝑎𝑏 > 0 for all 𝑎, 𝑏 ∈ 𝑅. Show
that 𝑅1 is reflexive and symmetric but not transitive.
6. Let 𝑁 be the set of natural numbers and 𝑅 be a relation on 𝑁 × 𝑁 defined by, (𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇒ 𝑎 + 𝑑 =
𝑏 + 𝑐 for all (𝑎, 𝑏) and (𝑐, 𝑑) ∈ 𝑁 × 𝑁. Prove that 𝑅 is an equivalence relation on 𝑁 × 𝑁.
7. Let 𝑁 be the set of natural numbers and 𝑅 be the relation on 𝑁 × 𝑁 defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑) iff 𝑎𝑑 = 𝑏𝑐
for all 𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝑁. Show that 𝑅 is an equivalence relation.
10 Let 𝑁 be the set of all natural numbers and 𝑅 be the relation on 𝑁 × 𝑁 defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑) iff
𝑎𝑑(𝑏 + 𝑐) = 𝑏𝑐(𝑎 + 𝑑). Check whether 𝑅 is an equivalence relation.
1 A relation R on set A = {1,2,3,4,5} is defined as R = {(x, y): |x 2 − y 2 | < 8}. Check whether the relation R
is reflexive, symmetric and transitive.
2 A relation R is defined on N × N (where N is the set of natural numbers) as :
(a, b)R(c, d) ⇔ a − c = b − d Show that 𝑅 is an equivalence relation.
3 Let 𝐴 = {1,2,3}. Find the number of relations of A Containing (1,2) and (1,3) which are reflextive and
symmetric but not transitive
4 Let 𝐴 = {1,2,3}. Find the number of relations on A containing (1,2) and (2,3) which are reflexive and
transitive but not symmetric.
6 If 𝑅1 and 𝑅2 are equivalence relations in a set 𝐴, show that 𝑅1 ∩ 𝑅2 is also an equivalence relation.
Worksheet No.-(4)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:
1. Let 𝐴 = {1,2,3,4} and 𝐵 = {1,4,7,8}. Find which of the following functions from 𝐴 to 𝐵 are one one and
onto :
(i) 𝑓: 𝐴 → 𝐵 defined as 𝑓(1) = 1, 𝑓(2) = 4, 𝑓(3) = 4, 𝑓(4) = 8
(ii) 𝑓: 𝐴 → 𝐵 defined as 𝑓(1) = 4, 𝑓(2) = 7, 𝑓(3) = 1, 𝑓(4) = 8
2. Let 𝐴 = {1,2,3,4} and 𝐵 = {5,6,7,8}. Let 𝑓: 𝐴 → 𝐵 be defined by 𝑓 = {(1,5), (2,6), (3,7), (4,8)}. Show
that 𝑓 is one-one and onto.
7. Classify the following functions as one-one, onto or bijection, Justify your answer.
Worksheet No.-(5)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:
1. A function 𝑓 is defined from 𝑅 → 𝑅 as 𝑓(𝑥) = 𝑎𝑥 + 𝑏, such that 𝑓(1) = 1 and 𝑓(2) = 3. Find function
𝑓(𝑥). Hence, check whether function 𝑓(𝑥) is one-one and onto or not.
𝑥−1
2. Show that function 𝑓: ℝ → {2} → ℝ − {1} given by 𝑓(𝑥) = 𝑥−2 is a bijection
4. Show that the function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = cos(5𝑥 + 2) is neither one-one nor onto?
2𝑥
6. Show that a function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 1+𝑥 2 is neither one-one nor onto. Further, find set 𝐴 so
that the given function 𝑓: 𝑅 → 𝐴 becomes an onto function.
8. Let 𝑓: 𝑁 → 𝑅 be a function defined as 𝑓(𝑥) = 4𝑥 2 + 12𝑥 + 15. Show that 𝑓: 𝑁 → Range (𝑓) is bijective.
𝑥
9. Show that the function 𝑓: ℝ → {𝑥 ∈ ℝ: −1 < 𝑥 < 1} defined by 𝑓(𝑥) = 1+|𝑥| is one-one and onto function
𝑥 + 1, if 𝑥 is odd
10. Show that 𝑓: 𝑁 → 𝑁 defined by 𝑓(𝑥) = { is bijective.
𝑥 − 1, if 𝑥 is even
𝑛−1
, if 𝑛 is odd
2
11. A function 𝑓: 𝑁 → 𝑍 is defined by 𝑓(𝑛) = { 𝑛 Show that this function is a bijection.
− , if 𝑛 is even
2
Worksheet No.-(6)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:
3. Find the number of one-one functions from the set {1,2,3,4} to itself.
4. If 𝐴 = {1,2,3} and 𝐵 = {𝑝, 𝑞}, then find the number of one-one function from 𝐴 to 𝐵.
5. If 𝐴 = {𝑎, 𝑏} and 𝐵 = {1,3,5}, the find the number of one-one functions from 𝐴 to 𝐵.
6. If 𝐴 = {1,2,3} and 𝐵 = {3,4,5,8}, then find the number of one-one functions from 𝐴 to 𝐵.
7. If 𝐴 = {𝑎, 𝑏} and 𝐵 = {1,2,3}, then find the number of onto functions from 𝐴 to 𝐵.
8. If 𝐴 = {𝑎, 𝑏, 𝑐} and 𝐵 = {𝑝, 𝑞}, then find the number of onto function from 𝐴 to 𝐵.
9. If n(A)= 4, n(B)=3, find the number of onto and Into functions fro A to B.
Worksheet No.-(7)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:
MCQ
1 The relation R = {(1,2)} on A = {1,2,3} is
(a) Reflexive only (b) Symmetric only (c) Transitive only (d) Equivalence
2 In the set A = {1,2,3,4,5}, a relation R is defined by R = {(𝑥, 𝑦): 𝑥, 𝑦 ∈ A and 𝑥 < 𝑦}. Then R is
(a) Reflexive (b) Symmetric (c) Transitive (d) None of these
3 Let A = {1,2,3,4} and R = {(1,1), (2,2), (3,3), (4,4), (1,2), (2,1)} be defined on set A Then the
equivalence classes of [1] is
(a) (1,2) (b) [1,2] (c) {1,2} (d) None of these
(c) symmetric, transitive but not reflexive (d) neither transitive nor reflexive but symmetric
6 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = 𝑥 2 is
(a) one-one and onto (b) one-one and into (c) many-one and onto (d) many-one and into
11 Let 𝑓: 𝑅+ → [−5, ∞) be defined as 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5, where 𝑅+ is the set of all non-negative real
numbers. Then, 𝑓 is :
(A) one-one (B) onto (C) bijective (D) neither one-one nor onto
1
(𝑛 + 1), when 𝑛 is odd
12 Let 𝑓: 𝑁 → 𝑁: 𝑓(𝑛) = {2𝑛 Then, 𝑓 is
, when 𝑛 is even
2
(a) one-one and into (b) one-one and onto (c) many-one and into (d) many-one and onto
13 Set A has 3 elements and the set B has 4 elements. Then the number of injective mappings that can be
defined from 𝐴 to 𝐵 is
(A) 144 (B) 12 (C) 24 (D) 64
CASE STUDY 1
Sheetal and Deepak are playing Ludo at home during Covid-19. While rolling the dice, Sheetal's sister
Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let 𝐴
be the set of players while 𝐵 be the set all possible outcomes.
𝐴 = {𝑆, 𝐷}, 𝐵 = {1,2,3,4,5,6}
(i) Let 𝑅: 𝐵 → 𝐵 be defined by R = {(𝑥, 𝑦): 𝑦 is divisible by 𝑥}, Check relation for Reflexive, Syymetric and
Transitive.
(ii) Raji wants to know the number of functions from A to B. How many number of functions are possible?
(iii) Raji wants to know the number of relations possible from A to B. How many numbers of relations are
possible?
CASE STUDY 2:
An organization conducted bike race under 2 different categories-boys and girls. Totally there were 250
participants. Among all of them finally three from Category 1 and two from Category 2 were selected for
the final race. Ravi forms two sets 𝐵 and 𝐺 with these participants for his college project.
Let 𝐵 = {𝑏1 , 𝑏2 , 𝑏3 } 𝐺 = {𝑔1 , 𝑔2 } where 𝐵 represents the set of boys selected and 𝐺 the set of girls who
were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions
(i) Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
(ii) Let R: B → B be defined by R = {(𝑥, 𝑦): 𝑥 and y are students of same sex }, Then Check relation for
Reflexive, Syymetric and Transitive.
(iii) Ravi wants to find the number of injective functions from B to 𝐺. How many numbers of injective
functions are possible?
(i) Let relation R be defined by R = {(𝐿1, 𝐿2): 𝐿1 ∥ 𝐿2 where L1 , L2 ∈ L} then Check relation for Reflexive,
Syymetric and Transitive.
(ii) Let R = {(𝐿1, 𝐿2): 𝐿1 ⊥ 𝐿2 where L1, L2 € L} , then Check relation for Reflexive, Syymetric and
Transitive.
(iii)Let 𝑅 = {(𝐿1 , 𝐿2 ): 𝐿1 is parallel to 𝐿2 and 𝐿1 : 𝑦 = 𝑥 − 4} then write equation of 𝐿2 related to 𝐿1
CASE STUDY 4:
Students of a school are taken to a railway museum to learn about railways heritage and its history.
An exhibit in the museum depicted many rail lines on the track near the railway station. Let 𝐿 be the set of
all rail lines on the railway track and R be the relation on L defined by
R = {(𝑙1 , 𝑙2 ): 𝑙1 is parallel to 𝑙2 }
(iii) If one of the rail lines on the railway track is represented by the equation 𝑦 = 3𝑥 + 2, then find the set
of rail lines in R related to it. OR
(b) Let S be the relation defined by S = {(𝑙1 , 𝑙2 ): 𝑙1 is perpendicular to 𝑙2 } check whether the relation 𝑆 is
symmetric and transitive.