Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Let (a, b), (c, d) ∈ N × N.
Then we have ab = ba .....(By the commutative property of multiplication of natural numbers)
⇒ (a, b) R (a, b)
Hence, R is reflexive.
Let (a, b), (c, d) ∈ N × N such that (a, b) R (c, d).
Then ad = bc
⇒ cb = da ......(By the commutative property of multiplication of natural numbers)
⇒ (c, d) R (a, b)
Hence, R is symmetric.
Let (a, b), (c, d), (e, f) ∈ N × N such that (a, b) R (c, d) and (c, d) R (e, f).
Then ad = bc, cf = de
⇒ adcf = bcde
⇒ af = be
⇒ (a, b) R (e, f)
Hence, R is transitive.
Since, R is reflexive, symmetric and transitive, R is an equivalence relation on N × N.
APPEARS IN
संबंधित प्रश्न
Given a non-empty set X, consider P(X), which is the set of all subsets of X. Define the relation R in P(X) as follows:
For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.
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
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}
Test whether the following relation R3 is (i) reflexive (ii) symmetric and (iii) transitive:
R3 on R is defined by (a, b) ∈ R3 `⇔` a2 – 4ab + 3b2 = 0.
Defines a relation on N :
x + y = 10, x, y∈ N
Determine the above relation is reflexive, symmetric and transitive.
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 reflexive relation ?
S is a relation over the set R of all real numbers and it is given by (a, b) ∈ S ⇔ ab ≥ 0. Then, S is _______________ .
In the set Z of all integers, which of the following relation R is not an equivalence relation ?
Show that the relation R on R defined as R = {(a, b): a ≤ b}, is reflexive, and transitive but not symmetric.
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.
If A = {a, b, c}, B = (x , y} find B × A.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).
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?
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from B to A
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8. Then R is given by ______.
Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.
R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.
A relation R on a non – empty set A is an equivalence relation if it is ____________.
Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) is ____________.
If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.
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?
Given triangles with sides T1: 3, 4, 5; T2: 5, 12, 13; T3: 6, 8, 10; T4: 4, 7, 9 and a relation R inset of triangles defined as R = `{(Delta_1, Delta_2) : Delta_1 "is similar to" Delta_2}`. Which triangles belong to the same equivalence class?
The value of k for which the system of equations x + ky + 3z = 0, 4x + 3y + kz = 0, 2x + y + 2z = 0 has nontrivial solution is
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 ______.
