Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
To prove a relation R is an equivalence relation, it will be sufficient to prove it as a reflexive, symmetric and transitive relation.
i) Reflexivity:
Let (a, b) be an arbitrary element of N × N.
Now,
a, b ∈ N
⇒ab(a+b)=ba(a+b)
⇒(a,b)R(a,b)
∴ (a, b)R(a, b) for all (a, b) ∈ N × N
Hence, R is reflexive.
ii) Symmetry:
Let (a, b), (c, d) be an arbitrary element of N × N such that (a, b)R(c, d).
∴ ad(b+c)=bc(a+d)
⇒cb(d+a)=da(c+b)
⇒(c,d)R(a,b)
∴ (a, b)R(c, d) ⇒ (c, d)R(a, b) for all (a, b), (c, d) ∈ N × N
Hence, R is symmetric.
iii) Transitivity:
Let (a, b), (c, d), (e, f) be an arbitrary element of N × N such that (a, b)R(c, d) and (c, d)R(e, f).
ad(b+c)=bc(a+d)
⇒adb+adc=abc+bcd
⇒cd(a−b)=ab(c−d) .....(1)
Also,cf(d+e)=de(c+f)
⇒cfd+cfe=dec+def
⇒cd(f−e)=ef(d−c) ....(2)
From (1) and (2), we have
`(a−b)/(f−e)=−(ab)/(ef)`
⇒aef−bef=−abf+aeb
⇒aef+abf=aeb+bef
⇒af(b+e)=be(a+f)
⇒(a, b)R(e, f)
∴(a, b)R(c, d) and (c, d)R(e, f) ⇒ (a, b)R(e, f) for all (a, b), (c, d), (e, f) ∈ N × N
Hence, R is transitive.
Thus, R being reflexive, symmetric and transitive, is an equivalence relation on N × N.
APPEARS IN
संबंधित प्रश्न
Given an example of a relation. Which is reflexive and symmetric but not transitive.
Given an example of a relation. Which is reflexive and transitive but not symmetric.
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
Give an example of a relation which is symmetric but neither reflexive nor transitive?
Let A = {1, 2, 3} and R = {(1, 2), (1, 1), (2, 3)} be a relation on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.
Define a reflexive relation ?
For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.
Let A = {2, 3, 4, 5, ..., 17, 18}. Let '≃' be the equivalence relation on A × A, cartesian product of Awith itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is _______________ .
The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .
Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .
The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is ___________________ .
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.
If A = {a, b, c}, B = (x , y} find A × A.
In the set of natural numbers N, define a relation R as follows: ∀ n, m ∈ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R
For real numbers x and y, define xRy if and only if x – y + `sqrt(2)` is an irrational number. Then the relation R is ______.
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
Give an example of a map which is not one-one but onto
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 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.
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 ____________.
A relation S in the set of real numbers is defined as `"xSy" => "x" - "y" + sqrt3` is an irrational number, then relation S is ____________.
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1,2,3,4,5,6}
- Let R: B → B be defined by R = {(1,1),(1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, then R is ____________.
An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
- Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
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?
If A = {1,2,3}, B = {4,6,9} and R is a relation from A to B defined by ‘x is smaller than y’. The range of R is ____________.
Let R1 and R2 be two relations defined as follows :
R1 = {(a, b) ∈ R2 : a2 + b2 ∈ Q} and
R2 = {(a, b) ∈ R2 : a2 + b2 ∉ Q}, where Q is the set of all rational numbers. Then ______
