English

Define an Equivalence Relation ?

Advertisements
Advertisements

Question

Define an equivalence relation ?

Definition
Advertisements

Solution

A relation R on set A is said to be an equivalence relation if
(i) it is reflexive,
(ii) it is symmetric and
(iii) it is transitive.

Relation R on set A satisfying all the above three properties is an equivalence relation.

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

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 1 Relations
Exercise 1.3 | Q 13 | Page 30

RELATED QUESTIONS

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


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

Relation R in the set A = {1, 2, 3, ..., 13, 14} defined as R = {(x, y) : 3x – y = 0}.


Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.


Show that the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12} given by R = {(a, b) : a = b} is an equivalence relation. Find the set of all elements related to 1.


Given an example of a relation. Which is transitive but neither reflexive nor symmetric.


Show that the relation R defined in the set A of all triangles as R = {(T1, T2) : T1 is similar to T2}, is an equivalence relation. Consider three right angle triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3 with sides 6, 8, and 10. Which triangles among T1, T2 and T3 are related?


Test whether the following relation R1 is  (i) reflexive (ii) symmetric and (iii) transitive :

R1 on Q0 defined by (a, b) ∈ R1 ⇔ = 1/b.


Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:

R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5


Test whether the following relation R3 is (i) reflexive (ii) symmetric and (iii) transitive:

R3 on R is defined by (a, b) ∈ R3 `⇔` a2 – 4ab + 3b2 = 0.


Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?


Give an example of a relation which is transitive but neither reflexive nor symmetric?


Let A = {1, 2, 3} and R = {(1, 2), (1, 1), (2, 3)} be a relation on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.


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


Let Z be the set of all integers and Z0 be the set of all non-zero integers. Let a relation R on Z × Z0be defined as (a, b) R (c, d) ⇔ ad = bc for all (a, b), (c, d) ∈ Z × Z0,
Prove that R is an equivalence relation on Z × Z0.


Write the domain of the relation R defined on the set Z of integers as follows:-
(a, b) ∈ R ⇔ a2 + b2 = 25


Write the smallest reflexive relation on set A = {1, 2, 3, 4}.


If A = {2, 3, 4}, B = {1, 3, 7} and R = {(x, y) : x ∈ A, y ∈ B and x < y} is a relation from A to B, then write R−1.


A = {1, 2, 3, 4, 5, 6, 7, 8} and if R = {(xy) : y is one half of xxy ∈ A} is a relation on A, then write R as a set of ordered pairs.


Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.


Let R be the equivalence relation on the set Z of the integers given by R = { (ab) : 2 divides }.

Write the equivalence class [0].


Let the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs


Write the smallest equivalence relation on the set A = {1, 2, 3} ?


R is a relation on the set Z of integers and it is given by
(x, y) ∈ R ⇔ | x − y | ≤ 1. Then, R is ______________ .


Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .


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 _______________ .


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


Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive


The following defines a relation on N:

x y is square of an integer x, y ∈ N

Determine which of the above relations are reflexive, symmetric and transitive.


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 ∀ a, b ∈ T. Then R is ______.


If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.


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


Given set A = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be ____________.


Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1,2,3,4,5,6}

  • Let R: B → B be defined by R = {(1,1),(1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, then R is ____________.

The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} is ____________.


The number of surjective functions from A to B where A = {1, 2, 3, 4} and B = {a, b} is


lf A = {x ∈ z+ : x < 10 and x is a multiple of 3 or 4}, where z+ is the set of positive integers, then the total number of symmetric relations on A is ______.


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)].


A relation R on (1, 2, 3) is given by R = {(1, 1), (2, 2), (1, 2), (3, 3), (2, 3)}. Then the relation R is ______.


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×