Advertisements
Advertisements
प्रश्न
R is a relation on the set Z of integers and it is given by
(x, y) ∈ R ⇔ | x − y | ≤ 1. Then, R is ______________ .
विकल्प
Reflexive and transitive
Reflexive and symmetric
Symmetric and transitive
an equivalence relation
Advertisements
उत्तर
Reflexive and symmetric
Reflexivity: Let x∈R. Then,
x−x=0 < 1
⇒ |x−x | ≤ 1
⇒(x, x) ∈ R for all x ∈ Z
So, R is reflexive on Z.
Symmetry : Let (x, y)∈R. Then,
| x−y | ≤ 0
⇒ |−(y−x) | ≤ 1
⇒ | y−x | ≤ 1 [ Since |x−y|=|y−x| ]
⇒ (y, x) ∈ R for all x, y ∈ Z
So, R is symmetric on Z.
Transitivity : Let (x, y) ∈ R and ( y, z ) ∈ R. Then,
| x−y | ≤ 1 and | y−z | ≤ 1
⇒ It is not always true that |x−y| ≤ 1.
⇒ (x, z) ∉ R
So, R is not transitive on Z.
APPEARS IN
संबंधित प्रश्न
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 is exactly 7 cm taller than y}
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.
Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.
Show that the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12} given by R = {(a, b) : |a – b| is a multiple of 4} is an equivalence relation. Find the set of all elements related to 1.
Given an example of a relation. Which is symmetric and transitive but not reflexive.
Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and P2 have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?
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 live in the same locality}
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 is wife of y}
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
The following relation is defined on the set of real numbers.
aRb if 1 + ab > 0
Find whether relation is reflexive, symmetric or transitive.
The following relation is defined on the set of real numbers. aRb if |a| ≤ b
Find whether relation is reflexive, symmetric or transitive.
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, transitive but not symmetric ?
Give an example of a relation which is symmetric but neither reflexive nor transitive?
Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b}, is an equivalence relation.
If R and S are relations on a set A, then prove that R is reflexive and S is any relation ⇒ R ∪ S is reflexive ?
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.
State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?
If A = {1, 2, 3}, then a relation R = {(2, 3)} on A is _____________ .
The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} 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 _____________ .
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.
If A = {a, b, c}, B = (x , y} find A × B.
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
Every relation which is symmetric and transitive is also reflexive.
A relation R on a non – empty set A is an equivalence relation if it is ____________.
Let A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B 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 ____________.
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let R = `{ ("L"_1, "L"_2) ∶ "L"_1 bot "L"_2 "where" "L"_1, "L"_2 in "L" }` which of the following is true?
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let R = {(L1, L2 ): L1 is parallel to L2 and L1: y = x – 4} then which of the following can be taken as L2?
Define the relation R in the set N × N as follows:
For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.
Let f(x)= ax2 + bx + c be such that f(1) = 3, f(–2) = λ and f(3) = 4. If f(0) + f(1) + f(–2) + f(3) = 14, then λ is equal to ______.
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 A = {3, 5}. Then number of reflexive relations on A 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?
