Advertisements
Advertisements
प्रश्न
Show that 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.
Advertisements
उत्तर
R = {(a, b) : a = b}
(i) Reflexive:
R = {(0, 0), (1, 1), ..., (12, 12)}
A = {0, 1, 2, ..., 12}
For any element a ∈ A, we have (a, a) ∈ R, since a = a.
∴ R is reflexive.
(ii) Symmetric:
Now, let (a, b) ∈ R.
⇒ a = b
⇒ b = a
⇒ (b, a) ∈ R
∴ R is symmetric.
(iii) Transitive:
Now, let (a, b) ∈ R and (b, c) ∈ R.
⇒ a = b and b = c
⇒ a = c
⇒ (a, c) ∈ R
∴ R is transitive.
Hence, R is an equivalence relation.
The elements in R that are related to 1 will be those elements from set A which are equal to 1.
Hence, the set of elements related to 1 is {1}.
APPEARS IN
संबंधित प्रश्न
Given an example of a relation. Which is symmetric but neither reflexive nor transitive.
Given an example of a relation. Which is transitive but neither reflexive nor symmetric.
Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is ______.
The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4
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
If A = {1, 2, 3, 4} define relations on A which have properties of being 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 n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.
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.
m is said to be related to n if m and n are integers and m − n is divisible by 13. Does this define an equivalence relation?
Let O be the origin. We define a relation between two points P and Q in a plane if OP = OQ. Show that the relation, so defined is an equivalence relation.
If R = {(x, y) : x2 + y2 ≤ 4; x, y ∈ Z} is a relation on Z, write the domain of R.
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
Define a transitive relation ?
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.
If a relation R is defined on the set Z of integers as follows:
(a, b) ∈ R ⇔ a2 + b2 = 25. Then, domain (R) is ___________
Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A 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, _____________________ .
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 _____________ .
Show that the relation R on the set Z of integers, given by R = {(a,b):2divides (a - b)} is an equivalence relation.
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.
Show that the relation S in the set A = [x ∈ Z : 0 ≤ x ≤ 12] given by S = [(a, b) : a, b ∈ Z, ∣a − b∣ is divisible by 3] is an equivalence relation.
If A = {a, b, c}, B = (x , y} find A × B.
Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? transitive?
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is ______.
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, transitive but not symmetric
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, symmetric and transitive
Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is ______.
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
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 ____________.
Given set A = {a, b, c}. An identity relation in set A is ____________.
Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then R is ______.
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)].
Let L be a set of all straight lines in a plane. The relation R on L defined as 'perpendicular to' is ______.
