English

Define an Equivalence Relation ? - Mathematics

Advertisements
Advertisements

Question

Define an equivalence relation ?

Definition

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

RD Sharma Mathematics [English] Class 12
Chapter 1 Relations
Exercise 1.3 | Q 13 | Page 30

RELATED QUESTIONS

Let A = {1, 2, 3,......, 9} and R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].


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


Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive but not symmetric.


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


An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive and transitive.


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


Let L be the set of all lines in XY-plane and R be the relation in L defined as R = {L1, L2) : L1 is parallel to L2}. Show that R is an equivalence relation. Find the set of all lines related to the line y= 2x + 4.


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


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.


If R and S are relations on a set A, then prove that R and S are symmetric ⇒ R ∩ S and R ∪ S are symmetric ?


Define a reflexive relation ?


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


If A = {a, b, c}, then the relation R = {(b, c)} on A is _______________ .


A relation ϕ from C to R is defined by x ϕ y ⇔ | x | = y. Which one is correct?


If R is a relation on the set A = {1, 2, 3, 4, 5, 6, 7, 8, 9} given by x R y ⇔ y = 3 x, then R = _____________ .


Mark the correct alternative in the following question:

The relation S defined on the set R of all real number by the rule aSb if a  b is _______________ .


Mark the correct alternative in the following question:

Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if l is perpendicular to m for all l, m  L. Then, R is ______________ .


Show that the relation R on R defined as R = {(a, b): a ≤ b}, is reflexive, and transitive but not symmetric.


Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∪ C).


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


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?


Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______


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


Give an example of a map which is not one-one but onto


If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is ______.


Let A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B is ____________.


Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. Then, R is ____________.


Total number of equivalence relations defined in the set S = {a, b, c} is ____________.


The relation R is defined on the set of natural numbers as {(a, b) : a = 2b}. Then, R-1 is given by ____________.


Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:


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

If A is a finite set consisting of n elements, then the number of reflexive relations on A is


Define the relation R in the set N × N as follows:

For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.


Let R1 and R2 be two relations defined as follows :

R1 = {(a, b) ∈ R2 : a2 + b2 ∈ Q} and

R2 = {(a, b) ∈ R2 : a2 + b2 ∉ Q}, where Q is the set of all rational numbers. Then ______


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)

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×