Advertisements
Advertisements
Question
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, _____________________ .
Options
R is reflexive and symmetric but not transitive
R is reflexive and transitive but not symmetric
R is symmetric and transitive but not reflexive
R is an equivalence relation
Solution
R is reflexive and transitive but not symmetric.
Reflexivity: Clearly, (a, a) ∈ R ∀ a ∈A
So, R is reflexive on A.
Symmetry : Since (1, 2) ∈ R, but (2, 1) ∉ R,
R is not symmetric on A.
Transitivity : Since, (1, 3), (3, 2) ∈ R and (1, 2) ∈ R,
R is transitive on A.
APPEARS IN
RELATED QUESTIONS
Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.
determination of whether the following relations are reflexive, symmetric, and transitive:
Relation R in the set A = {1, 2, 3...13, 14} defined as R = {(x,y):3x - y = 0}
determination of whether the following relations are 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 the set R of real numbers, defined as R = {(a, b): a ≤ b2} is neither reflexive nor symmetric nor transitive.
Show that each of 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 in each case.
Given an example of a relation. Which is Reflexive and transitive but not symmetric.
Given an example of a relation. Which is Symmetric and transitive but not reflexive.
Let A be the set of all human beings in a town at a particular time. Determine whether of the following relation is reflexive, symmetric and transitive :
R = {(x, y) : x and y live in the same locality}
Let A be the set of all human beings in a town at a particular time. Determine whether of the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x is wife of y}
Three relations R1, R2 and R3 are defined on a set A = {a, b, c} as follows:
R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}
R2 = {(a, a)}
R3 = {(b, c)}
R4 = {(a, b), (b, c), (c, a)}.
Find whether or not each of the relations R1, R2, R3, R4 on A is (i) reflexive (ii) symmetric and (iii) transitive.
Give an example of a relation which is symmetric and transitive but not reflexive?
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 = 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 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.
Show that the relation R on 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.
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.
Let R = {(x, y) : |x2 − y2| <1) be a relation on set A = {1, 2, 3, 4, 5}. Write R as a set of ordered pairs.
Define a reflexive relation ?
If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.
State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?
Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,
The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .
Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c on the A x A , where A = {1, 2,3,...,10} is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.
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
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
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B
Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) 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 ____________.
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 ____________.
A relation in a set 'A' is known as empty relation:-
A relation 'R' in a set 'A' is called reflexive, if
Given a non-empty set X, define the relation R in P(X) as follows:
For A, B ∈ P(X), (4, B) ∈ R iff A ⊂ B. Prove that R is reflexive, transitive and not symmetric.
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?
