Advertisements
Advertisements
Question
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?
Options
Statement 1 implies Statement 2.
Statement 2 implies Statement 1.
Statement 1 is true only if Statement 2 is true.
Statement 1 and 2 are independent of each other.
Advertisements
Solution
Statement 1 is true only if Statement 2 is true.
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.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R = {(a, b) : b = a + 1} is reflexive, symmetric or transitive.
Given an example of a relation. Which is transitive but neither reflexive nor symmetric.
Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.
A = {1, 2, 3, 4, 5, 6, 7, 8} and if R = {(x, y) : y is one half of x; x, y ∈ A} is a relation on A, then write R as a set of ordered pairs.
Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.
Let the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
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 ______________ .
Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. 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.
For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6} Find (A × B) ∩ (A × C).
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
Consider the 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 ______.
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Every relation which is symmetric and transitive is also reflexive.
Let us define a relation R in R as aRb if a ≥ b. Then R is ____________.
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
If A is a finite set consisting of n elements, then the number of reflexive relations on A is
