Advertisements
Advertisements
प्रश्न
The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .
पर्याय
reflexive but not symmetric
reflexive and transitive but not symmetric
an equivalence relation
none of the these
Advertisements
उत्तर
an equivalence relation
We observe the following properties of relation R.
Reflexivity: Let (a, b) ∈ N × N
⇒ a, b ∈ N
⇒ a+b = b+a
⇒ (a, b) ∈ R
So, R is reflexive on N×N.
Symmetry: Let (a, b), (c, d) ∈ N × N such that (a, b) R (c, d)
⇒ a+d = b+c
⇒ d+a = c +b
⇒ (d, c), (b, a) ∈ R
So, R is symmetric on N×N.
Transitivity : Let (a, b), (c, d), (e, f) ∈ N×N such that (a, b) R (c, d) and (c, d) R (e, f)
⇒ a+d = b+c and c+f = d+e
⇒ a + d +c + f = b + c + d + e
⇒ a + f = b + e
⇒(a, b) R (e, f)
So, R is transitive on N×N.
Hence, R is an equivalence relation on N.
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}.
Show that the relation R in the set R of real numbers, defined as R = {(a, b) : a ≤ b2} is neither reflexive nor symmetric nor transitive.
Given an example of a relation. Which is symmetric but neither reflexive nor transitive.
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
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}
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
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.
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.
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 Z be the set of all integers and Z0 be the set of all non-zero integers. Let a relation R on Z × Z0be defined as (a, b) R (c, d) ⇔ ad = bc for all (a, b), (c, d) ∈ Z × Z0,
Prove that R is an equivalence relation on Z × Z0.
Define a reflexive relation ?
Define a symmetric relation ?
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.
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by : x R y ⇔ x is relatively prime to y. Then, domain of R is ______________ .
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 _______________ .
Mark the correct alternative in the following question:
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 for all a, b T. Then, R 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 _____________ .
R = {(a, b) / b = a + 1, a ∈ Z, 0 < a < 5}. Find the Range of R.
Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
Give an example of a map which is one-one but not onto
An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive.
The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.
Let R be the relation on N defined as by x + 2 y = 8 The domain of R is ____________.
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
Let A = {1, 2, 3}, then the relation R = {(1, 1), (1, 2), (2, 1)} on A is ____________.
Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is ____________.
Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?
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 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 ____________.
A relation S in the set of real numbers is defined as `"xSy" => "x" - "y" + sqrt3` is an irrational number, then relation S is ____________.
The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} is ____________.
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
In a group of 52 persons, 16 drink tea but not coffee, while 33 drink tea. How many persons drink coffee but not tea?
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.
Read the following passage:
|
An organization conducted bike race under two different categories – Boys and Girls. There were 28 participants in all. 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. |
Based on the above information, answer the following questions:
- How many relations are possible from B to G? (1)
- Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
- Let R : B `rightarrow` B be defined by R = {(x, y) : x and y are students of the same sex}. Check if R is an equivalence relation. (2)
OR
A function f : B `rightarrow` G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}. Check if f is bijective. Justify your answer. (2)
