English

If a = {A, B, C, D}, Then a Relation R = {(A, B), (B, A), (A, A)} on a is (A) Symmetric and Transitive Only (B) Reflexive and Transitive Only (C) Symmetric Only (D) Transitive Only

Advertisements
Advertisements

Question

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

Options

  • symmetric and transitive only

  • reflexive and transitive only

  • symmetric only

  • transitive only

MCQ
Advertisements

Solution

symmetric and transitive only

Reflexivity: Since (b, b) R, R is not reflexive on A.

Symmetry: Since (a, b) R and (b, a) R, R is symmetric on A.

Transitivity: Since (a, b) R,  (b, a) R and (a, a) R, R is transitive on A

 

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

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 1 Relations
Exercise 1.4 | Q 20 | Page 32

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 {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.


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


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


Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.


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.


Defines a relation on N:

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

Determine the above relation is reflexive, symmetric and transitive.


Prove that the relation R on Z defined by
(a, b) ∈ R ⇔ a − b is divisible by 5
is an equivalence relation on Z.


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 identity relation on set A = {a, b, c}.


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


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.


Let A = {3, 5, 7}, B = {2, 6, 10} and R be a relation from A to B defined by R = {(x, y) : x and y are relatively prime}. Then, write R and R−1.


Define a symmetric relation ?


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.


Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(ab) : | a2b| < 8}. Write as a set of ordered pairs.


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 = {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 ______________ .


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


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


Let R be the relation on the set A = {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then, _____________________ .


Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.


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


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


Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B


The following defines a relation on N:
x is greater than y, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.


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 and also obtain the equivalent class [(2, 5)]


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 A = { 2, 3, 6 } Which of the following relations on A are reflexive?


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


A relation R in set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an equivalence relation in A?


A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever


Let I be the set of all citizens of India who were eligible to exercise their voting right in the general election held in 2019. A relation ‘R’ is defined on I as follows:

R = {(V1, V2) ∶ V1, V2 ∈ I and both use their voting right in the general election - 2019}

  • The above-defined relation R is ____________.

The number of surjective functions from A to B where A = {1, 2, 3, 4} and B = {a, b} 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


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×