Activity

Objective : To verify that the relation R in the set L of all lines in a plane, defined by R =
is an {(, m) : | |M}
equivalence relation.
Pre-requisite knowledae : Knowledge of relations and their types namely reflexive, symmetric and
transitive,
equivalence relation.
Materials required : A thick board with board pins, some paper pins, white
0ouid hreadS, or yarns (blue, green and red). Note : Geoboard with rubberchart paper, sOme pieces ol
band may be used.
Procedure :
1. Place a chart paper firmly on a thick
the help of board pins as shown in (Fig. board with
2.1).

Fig. 2.1

2. Fix some paper pins randomly on the board as

Fig. 2.2

3. Now take some pieces of threador yarn and tie them securely
around the pins as shown in Fig. 2.3. Note that there
should not be any slack in the threads.
Here, some pieces of thread are parallel to each other,
Some are perpendicular and some are inclined.

Fig. 2.3
 Let the threads or yarns depict the lines /,. I, .... a Then we have the following observations:
Observations
1. 1, is perpendicular to , and I
2. 1, is perpendicular to , and :
3. 1, is perpendicular to , and .
4. I, is perpendicular to I , is perpendicular to l.
5. I, is parallel to I
6. /, is parallel to l,. I, is parallel to I, and l, is parallel to 4.
7. s is parallel to a
8. So. ( ). 14. l,). (U,. 14). (4. l3). (V6. l_) e R.
9. In Fig. 2.3, we see that every line is parallel to itself. Thus, I, || 4, , || l , 8 ll 8
So. (/,. 1,) e R. (,. 1,) eR ... (lg a) e R
Hence. the given relation R is reflexive.
10. In Fig. 2.3. we see that , || thus ; l 4
So. (l4 l) eR g l4) e R.
Similarly. (!,. 1,) e R (,. l,) e R
(lz 1z) eR» (3 l) eR
Also, (Vs ) e R’ (a a) e R.
Hence, the given relation R is symmetric.
11. In Fig. 2.3, we see that 1, || z, l, | 3, S0 l, || 3
So. (14, l,) e R ’ (l,, l3) E R ’ (4, l) e R
Thus, the relation R is transitive.
Hence, the relation R is reflexive, symmetric and transitive. So R is an equivalence relation.
Conclusion
From the above activity it is verified that the relation 'is parallel to' on the set R of all straight lines in a
plane is an equivalence relation.
Application : This activity can be used to identify whether the given relation is an equivalence relation or not.

Follow-up Activity
1. Take some more threads in different positions and repeat this activity.
2. Take some threads and construct triangles (in which some are similar)
and put them in a collection
say S. Define R = (T4, T):T, is similar to T,} in S. Check whether R is an equivalence relation
or not.

Viva-Voce Questions
1. What do you understand by an equivalence relation?
Ans. An equivalence relation, is a relation which is reflexive, symmetric and transitive.
2. Are identity relations equivalence?
Ans. Yes, the most trivial example of an equivalence relation is identity relation.
 3 Is the relation is less than or equal to" on R
an equivalence relaion?
Ans The relation is less than or equal to denoted as "<" is Not an equivalence relation on uie
real numbers For any x, y. z e R. e" is reflexive and transitive but Not necessarily symmeuio
4Consiter the relation R =((a. b) : a and b are real numbers and la - bl < 1) on the set of real
numbers Is R an equivalence relation?
Ans. Although R is reflexive and symmetric. R is not an equivalence relation, since R is not transltve.
(01. 10) and (10, 1.9) are in R but (0.1, 1.9) is not in R.
5. Consider the relation R=((a. b) :aand bare integers and la - bl < 1) on the set of integers. Is R
an equvalence relation?
Ans. In this case R is an equivalence relation as la - b| < 1on Z ’ a- b| = 0
Le.. a - b= 0, i.e., a = b. So R = (a, b) :a = b}.
6. Define a relation R on the set of naturals Nas R =(a, b) : a + b = b2 + a). Is R an equivalance
relation?
Ans. Yes
Reflexive:a + a= a + a, ie., (a, a)eRaeN
Symmetric : (a, b)eR (b, a)eR holds.
Transitive : Let (a, beR and (b, c)eR
a + b = b² + a and b² + c= +b
a + b + b² + c=b² + a + c²+b
a+ c= +a
’ (a, c)eR
7. Let S ={1, 2, 3, 4). Define a relation R on S as R = {(1, 1), (2, 2), (3, 3), (4, 4)). Is R an equivalence
relation on S?
Ans. Yes (i) (a, a)eRYaeS, hence R is reflexive.
(ü) (a, b) Rthen (b, a)eRclearly. Hence, R is symmetric.
() Transitivity hypothesis is not guaranteed, i.e.,da, b, ceS s.t. (a, b)eR and (b, c)eR, therefore
R is trivially transitive.