Activity 1

OBJECTIVE
To verify that the relation R in the set L of all lines in a plane, defined by R = {(l, m) : l ⊥ m} is symmetric but
neither reflexive nor transitive.
MATERIALS REQUIRED
A piece of white paper, Geometry box, glue etc.
PROCEDURE
Take a piece of a white paper. Mark some dots on the paper. Draw some lines on the paper through these
dots such that some of them are parallel, some are perpendicular to each other and some are inclined as
shown in Fig.1.

DEMONSTRATION
1. Let the lines be l1, l2, ..., l8.
2. l1 is perpendicular to each of the lines l2, l3, l4.
3. l6 is perpendicular to l7.
4. l2 is parallel to l3, l3 is parallel to l4 and l5 is parallel to l8.
5. (l1, l2), (l1, l3), (l1, l4), (l6, l7) R
OBSERVATION
1. In Fig. 1, no line is perpendicular to itself, so the relation
R = {( l, m) : l m} is not reflexive
2. In Fig. 1, l1 l2 . l2 l1
( l1, l2) R ( l2, l1) R)
Similarly, l3 l1 . l1 l3
( l3, l1) R ( l1, l3) R
Also, l6 l7. l7 l6
( l6, l7) R ( l7, l6) R
The relation R .is. symmetric
3. In Fig. 1, l2 l1 and l1l3 . But l2 is not l3
i.e., (l2, l1) R and (l1 , l3) R (l2, l3)  R
The relation R . is not transitive .
Result
It is verified that the relation R in the set L of all lines in a plane, defined by R = {(l, m) : l ⊥ m} is symmetric
but neither reflexive nor transitive.
 Activity 2
OBJECTIVE
To verify that the relation R in the set L of all lines in a plane, defined by R = {( l, m) : l || m} is an
equivalence relation.
MATERIALS REQUIRED
A piece of white paper, Geometry box, glue etc.
PROCEDURE
Take a piece of a white paper. Mark some dots on the paper. Draw some lines on the paper through these
dots such that some of them are parallel, some are perpendicular to each other and some are inclined as
shown in Fig..

DEMONSTRATION
1. Let the lines be l1, l2, ..., l8.
2. l1 is perpendicular to each of the lines l2, l3, l4 (Fig. 2).
3. l6 is perpendicular to l7.
4. l2 is parallel to l3, l3 is parallel to l4 and l5 is parallel to l8.
5. (l2, l3), (l3, l4), (l5, l8), R
OBSERVATION
1. In Fig. 2, every line is parallel to itself. So the relation R = {( l, m) : l || m}
.... reflexive relation (is/is not)
2. In Fig. 2, observe that l2 ||l3 . Also l3 || l2
So, (l2, l3) R (l3, l2)  R
Similarly, l3 || l4. l4 || l3
So, (l3, l4) R (l4, l3) .R
and (l5, l8) R (l8, l5) . R
The relation R is symmetric relation
3. In Fig. 2, observe that l2 || l3 and l3 || l4. Also l2 || l4
So, (l2, l3) R and (l3, l4R (l2, l4) ... R
Similarly, l3 || l4 and l4 || l2. l3 . ||. l2
So, (l3, l4) R, (l4, l2) R (l3, l2) ... R
Thus, the relation R is transitive relation
Hence, the relation R is reflexive, symmetric and transitive. So, R is an equivalence relation.
 Activity 3
Objective: to demonstrate a function which is not one one but onto
Materials required
White chart paper II, sheet of thin colour paper scissor fevicol.
Procedure
a) Cut to oval shapes from the sheet of glaze paper and paste them on the chart paper to represent
two sets named as A and B
b) Put six dots in set A and 5 dots in set B and mark them as A1, A2, A3, A4, A5, A6 and B1, B2 B3 B4
and B5 as shown in figure
c) Join the dots of set A to set B with the help of arrows as shown in figure

Observations:
f: A→
f(a1)=b1, f(a2)=b2, f(a3)=b3,f(a4)=b4,f(a5)=b2,f(a6)=b5
(a) Two elements a1,a2 ∈ A have same image b1∈ B.
Therefore f: A→ is not one one.
(b) Each element of B has pre image in A
Therefore f: A→ is onto.
Result
Thus it is verified from the above activity that a function is not one but onto .
 Activity 4
Objective
To demonstrate a function which is one one but not onto
Materials required
Drawing sheet, glaze papers, pen, pencil, a pair of scissor and glue
Procedure
A) Cut to oval shapes from the glaze paper and paste them on left sheep to represent two sets as A
and B
B) Put 5 dots on set A and 6 dots on set B and mark them as A1, A2, A3, A4 and A5 and B1, B2, B3, B4,
B5, B6
C) Join the dots of set a to the dots of set b with the help of arrows as shown in figure

Observations
f: A→
f(a1)=b1, f(a2)=b2, f(a3)=b3,f(a4)=b4,f(a5)=b5
a) Each element of the set A has a unique image in the set B therefore f is one one
b) Also there exist at least one element B6 in B which has not any preimage in the set A
therefore f is not onto
Result
Through this activity it is verified that the function is one one but not onto