English

The Relation R = {(1, 1), (2, 2), (3, 3)} on the Set {1, 2, 3} is (A) Symmetric Only (B) Reflexive Only (C) an Equivalence Relation (D) Transitive Only - Mathematics

Advertisements
Advertisements

Question

The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is ___________________ .

Options

  • symmetric only

  • reflexive only

  • an equivalence relation

  • transitive only

MCQ
Advertisements

Solution

an equivalence relation

R=(a, b) : a = b and a, }

Reflexivity : Let ∈ A 

Here,

⇒ (a, a∈ R for all ∈ A

So, R is reflexive on A

Symmetry Let a, ∈ A such that (a, b∈ R. Then,

(a, b∈ R

⇒ b

⇒ a

⇒ (b, a∈ R for all ∈ A

So, R is symmetric on A.

Transitive Let a, b, c A such that (a, b) R and (b, c) R.

Then(a, b∈ ⇒ b and (b, c∈ ⇒ c

⇒ a

⇒ (a, c∈ R for all ∈ A

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.4 [Page 32]

APPEARS IN

RD Sharma Mathematics [English] Class 12
Chapter 1 Relations
Exercise 1.4 | Q 24 | Page 32

RELATED QUESTIONS

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

Relation R in the set Z of all integers defined as R = {(x, y) : x − y is an integer}.


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


Check whether the relation R in R defined by R = {(a, b) : a ≤ b3} is reflexive, symmetric or transitive.


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.


Show that the relation R in the set A of points in a plane given by R = {(P, Q) : distance of the point P from the origin is the same as the distance of the point Q from the origin} is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with the origin as its centre.


Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:

R = {(x, y) : x and y live in the same locality}


If = {1, 2, 3, 4} define relations on A which have properties of being reflexive, transitive but not symmetric ?


If = {1, 2, 3, 4} define relations on A which have properties of being symmetric but neither reflexive nor transitive ?


Give an example of a relation which is symmetric and transitive but not reflexive?


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.


Defines a relation on N:

x + 4y = 10, x, y ∈ N

Determine the above relation is reflexive, symmetric and transitive.


Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.


Let n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.


Let Z be the set of integers. Show that the relation
 R = {(a, b) : a, b ∈ Z and a + b is even}
is an equivalence relation on Z.


Let S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.


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 ?


Write the identity relation on set A = {a, b, c}.


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.


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.


Mark the correct alternative in the following question:

Consider a non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then, R is _____________ .


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


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


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


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?


In the set of natural numbers N, define a relation R as follows: ∀ n, m ∈ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R


For real numbers x and y, define xRy if and only if x – y + `sqrt(2)` is an irrational number. Then the relation R is ______.


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


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


If A = {1, 2, 3, 4 }, define relations on A which have properties of being: 
symmetric but neither reflexive nor transitive


If A = {1, 2, 3, 4 }, define relations on A which have properties of being: 
reflexive, symmetric and transitive


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


Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is ____________.


Let us define a relation R in R as aRb if a ≥ b. Then R is ____________.


Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). Then, R is ____________.


The relation > (greater than) on the set of real numbers is


A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-


A relation 'R' in a set 'A' is called reflexive, if


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×