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
Advertisements
Solution
an equivalence relation
R={ (a, b) : a = b and a, b ∈ A }
Reflexivity : Let a ∈ A
Here,
a = a
⇒ (a, a) ∈ R for all a ∈ A
So, R is reflexive on A
Symmetry : Let a, b ∈ A such that (a, b) ∈ R. Then,
(a, b) ∈ R
⇒ a = b
⇒ b = a
⇒ (b, a) ∈ R for all a ∈ 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) ∈ R ⇒ a = b and (b, c) ∈ R ⇒ b = c
⇒ a = c
⇒ (a, c) ∈ R for all a ∈ A
So, R is transitive on A.
Hence, R is an equivalence relation on A.
APPEARS IN
RELATED QUESTIONS
Let R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}. Choose the correct answer.
Test whether the following relation R1 is (i) reflexive (ii) symmetric and (iii) transitive :
R1 on Q0 defined by (a, b) ∈ R1 ⇔ a = 1/b.
Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?
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 symmetric and transitive but not reflexive?
Give an example of a relation which is symmetric but neither reflexive nor transitive?
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.
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 it reflexive and transitive.
Defines a relation on N :
x > y, x, y ∈ N
Determine the above relation is reflexive, symmetric 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 identity relation on set A = {a, b, c}.
Define a symmetric relation ?
Let R be the equivalence relation on the set Z of the integers given by R = { (a, b) : 2 divides a - b }.
Write the equivalence class [0].
The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .
If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then 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 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 the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6} Find (A × B) ∩ (A × C).
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.
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
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from A to B which is not injective
Give an example of a map which is neither one-one nor onto
The following defines a relation on N:
x + y = 10, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let A = { 2, 3, 6 } Which of the following relations on A are reflexive?
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 R be the relation “is congruent to” on the set of all triangles in a plane 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 = {(x, y): y is divisible by x} 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}
- Raji wants to know the number of relations possible from A to B. How many numbers of relations are possible?
If A = {1,2,3}, B = {4,6,9} and R is a relation from A to B defined by ‘x is smaller than y’. The range of R is ____________.
Which one of the following relations on the set of real numbers R is an equivalence relation?
A relation in a set 'A' is known as empty relation:-
A relation 'R' in a set 'A' is called reflexive, if
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 ______.
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?
