English

Let O Be the Origin. We Define a Relation Between Two Points P and Q in a Plane If Op = Oq. Show that the Relation, So Defined is an Equivalence Relation. - Mathematics

Advertisements
Advertisements

Question

Let O be the origin. We define a relation between two points P and Q in a plane if OP = OQ. Show that the relation, so defined is an equivalence relation.

Sum
Advertisements

Solution

Let A be the set of all points in a plane such that

A={P : P is a point in the plane}

Let R be the relation such that R={(P, Q) : P, QA and OP=OQ, where O is the origin}

We observe the following properties of R.

Reflexivity: Let P be an arbitrary element of R.

The distance of a point P will remain the same from the origin.

So, OP = OP

⇒ (P, P∈ R

So, R is reflexive on A.

Symmetry : Let (P, Q∈ R

⇒ OOQ

⇒ OOP

⇒ (Q, P∈ R

So, R is symmetric on A.

Transitivity: Let (P, Q), (Q, R∈ R

⇒ OPOQ and OOR

⇒ OPOOR

⇒ OOR

⇒ (P, R∈ R

So, R is transitive on A.

Hence, R is an equivalence relation on A.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Relations - Exercise 1.2 [Page 27]

APPEARS IN

RD Sharma Mathematics [English] Class 12
Chapter 1 Relations
Exercise 1.2 | Q 11 | Page 27

RELATED QUESTIONS

Determine whether the following relation is reflexive, symmetric and transitive:

Relation R in the set A of human beings in a town at a particular time given by R = {(x, y) : x is exactly 7 cm taller than y}.


Show that the relation R defined in the set A of all polygons as R = {(P1P2): P1 and P2have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?


Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is

(A) 1 (B) 2 (C) 3 (D) 4


Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, add a minimum number of ordered pairs so that the enlarged relation is symmeteric, transitive and reflexive.


Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b},  is an equivalence relation.


If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.


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


Define a reflexive relation ?


If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.


Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.


For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.


If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by 'x is greater than y'. The range of R is ______________ .


In the set Z of all integers, which of the following relation R is not an equivalence relation ?


Mark the correct alternative in the following question:

Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then, R is _______________ .


Mark the correct alternative in the following question:

Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b for all a, b  T. Then, R is ____________ .


If `f(x) = (4x + 3)/(6x - 4), x ≠ 2/3`, show that fof (x) = x for all `x ≠ 2/3`. Also, find the inverse of f.


If A = {a, b, c}, B = (x , y} find A × A.


Let A = {6, 8} and B = {1, 3, 5}.
Let R = {(a, b)/a∈ A, b∈ B, a – b is an even number}. Show that R is an empty relation from A to B.


Write the relation in the Roster form and hence find its domain and range :
R1 = {(a, a2) / a is prime number less than 15}


R = {(a, b) / b = a + 1, a ∈ Z, 0 < a < 5}. Find the Range of R.


Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? transitive?


Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}.
Then, write minimum number of ordered pairs to be added in R to make R reflexive and transitive


Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation


Give an example of a map which is neither one-one nor onto


The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.


Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}. Then R is ______.


Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.


Every relation which is symmetric and transitive is also reflexive.


The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.


Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.


Which of the following is/are example of symmetric


If f(x + 2a) = f(x – 2a), then f(x) is:


Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then R is ______.


Read the following passage:

An organization conducted bike race under two different categories – Boys and Girls. There were 28 participants in all. Among all of them, finally three from category 1 and two from category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project.
Let B = {b1, b2, b3} and G = {g1, g2}, where B represents the set of Boys selected and G the set of Girls selected for the final race.

Based on the above information, answer the following questions:

  1. How many relations are possible from B to G? (1)
  2. Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
  3. Let R : B `rightarrow` B be defined by R = {(x, y) : x and y are students of the same sex}. Check if R is an equivalence relation. (2)
    OR
    A function f : B `rightarrow` G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}. Check if f is bijective. Justify your answer. (2)

Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].


Statement 1: The intersection of two equivalence relations is always an equivalence relation.

Statement 2: The Union of two equivalence relations is always an equivalence relation.

Which one of the following is correct?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×