Advertisements
Advertisements
प्रश्न
Let R be the relation defined on the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and b are either odd or even}. Show that R is an equivalence relation. Further, show that all the elements of the subset {1, 3, 5, 7} are related to each other and all the elements of the subset {2, 4, 6} are related to each other, but no element of the subset {1, 3, 5, 7} is related to any element of the subset {2, 4, 6}.
Advertisements
उत्तर
We observe the following properties of R.
Reflexivity :
Let a be an arbitrary element of R. Then,
a ∈ R
⇒ (a, a) ∈ R for all a ∈ A
So, R is reflexive on A.
Symmetry : Let (a, b) ∈ R
⇒ Both a and b are either even or odd.
⇒ Both b and a are either even or odd.
⇒ (b, a) ∈ R for all a, b ∈ A
So, R is symmetric on A.
Transitivity : Let (a, b) and (b, c) ∈ R
⇒ Both a and b are either even or odd and both b and c are either even or odd.
⇒ a, b and c are either even or odd.
⇒ a and c both are either even or odd.
⇒ (a, c) ∈ R for all a, c ∈ A
So, R is transitive on A.
Thus, R is an equivalence relation on A.
We observe that all the elements of the subset {1, 3, 5, 7} are odd. Thus, they are related to each other .
This is because the relation R on A is an equivalence relation.
Similarly, the elements of the subset {2, 4, 6} are even. Thus, they are related to each other because every element is even.
Hence proved .
APPEARS IN
संबंधित प्रश्न
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}.
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 = {1, 2, 3, 4, 5} given by R = {(a, b) : |a − b| is even}, is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.
Given an example of a relation. Which is reflexive and transitive but not symmetric.
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 work at the same place}
Give an example of a relation which is symmetric but neither reflexive nor transitive?
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.
Let R be a relation on the set A of ordered pair of integers defined by (x, y) R (u, v) if xv = yu. Show that R is an equivalence relation.
Let L be the set of all lines in XY-plane and R be the relation in L defined as R = {L1, L2) : L1 is parallel to L2}. Show that R is an equivalence relation. Find the set of all lines related to the line y= 2x + 4.
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 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.
Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". 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.
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, 4, 5, 6, 7, 8, 9} given by x R y ⇔ y = 3 x, then R = _____________ .
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .
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 _____________ .
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∪ C).
Write the relation in the Roster form and hence find its domain and range:
R2 = `{("a", 1/"a") "/" 0 < "a" ≤ 5, "a" ∈ "N"}`
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
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 ______.
R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. 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 ____________.
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?
The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} is ____________.
If A is a finite set consisting of n elements, then the number of reflexive relations on A is
Which one of the following relations on the set of real numbers R is an equivalence relation?
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?
Which relation is called an Empty Relation?
A relation \(R\) is transitive if which condition is satisfied?
