Relations and Functions
Get insights from 232 questions on Relations and Functions, answered by students, alumni, and experts. You may also ask and answer any question you like about Relations and Functions
- 232
Questions
- 0
Discussions
- 0
Active Users
- 1
Followers
Have a question about Relations and Functions? Ask our experts
Keep it short & simple. Type complete word. Avoid abusive language.
11. Show that the relation R in the set A of points in a plane given by R = {(P, Q): distance of the point P from the origin is same as the distance of the point Q from the origin}, is an equivalence relation. Further, show that the set of all point related to a point P ≠ (0, 0) is the circle passing through P with origin as centre.
11. Show that the relation R in the set A of points in a plane given by R = {(P, Q): distance of the point P from the origin is same as the distance of the point Q from the origin}, is an equivalence relation. Further, show that the set of all point related to a point P ≠ (0, 0) is the circle passing through P with origin as centre.
The given relation in set A of points in a plane is
R= distance of point P from origin=distance of point Q from
If O is the point of origin
R=
Then, for we have PO=PO
So,
i.e., P is reflexive
for, and we have
PO=QO
QO=PO i.e.,
i.e., R is s
10. Given an example of a relation. Which is
(i) Symmetric but neither reflexive nor transitive.
(ii) Transitive but neither reflexive nor symmetric.
(iii) Reflexive and symmetric but not transitive.
(iv) Reflexive and transitive but not symmetric.
(v) Symmetric and transitive but not reflexive.
10. Given an example of a relation. Which is
(i) Symmetric but neither reflexive nor transitive.
(ii) Transitive but neither reflexive nor symmetric.
(iii) Reflexive and symmetric but not transitive.
(iv) Reflexive and transitive but not symmetric.
(v) Symmetric and transitive but not reflexive.
Let A=
(i) R= is a relation in set A
So, and Symmetric
not reflexive
but not transitive
(ii) R= is a relation in set A
So, not reflexive
but not symmetric
and also transitive
(iii) R=
So, &n
9. Show that each of the relation R in the set A = {x ∈ Z: 0 ≤ x ≤ 12} ,given by:
(i) R = { (a,b) : |a - b| is a multiple of 4}
(ii) R = { (a,b) : a= b} is an equivalence relation. Find the set of all elements related to 1 in each case.
9. Show that each of the relation R in the set A = {x ∈ Z: 0 ≤ x ≤ 12} ,given by:
(i) R = { (a,b) : |a - b| is a multiple of 4}
(ii) R = { (a,b) : a= b} is an equivalence relation. Find the set of all elements related to 1 in each case.
We have,
A=
The relation in set A is defined by
R= { is a multiple of 4}
For all ,
is a multiple of 4
So, i.e., R is reflexive
For we have,
is multiple of 4
is multiple of 4
is multiple of 4
So,
i.e., R is symmetric
for
&n
8. Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a,b) : |a-b| is even} is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.
8. Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a,b) : |a-b| is even} is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.
We have,
R= is even is a relation in set A=
For all , is even.
So, . Hence R is reflexive
For and
is even
is even
is even
is even
i.e.,
Hence, R is symmetric.
For and and 
3. If G = {7, 8} and H = {5, 4, 2}, find G × H and H × G.
3. If G = {7, 8} and H = {5, 4, 2}, find G × H and H × G.
3. Given, G = {7, 8} and H = {5, 4, 2}
By the definition of the Cartesian product,
G ×H = { (x, y): x∈G and y = ∈ H}
= { (7, 5), (7, 4), (7, 2), (8, 5), (8,4), (8,2)}
H× G = { (x, y): x∈ H and y ∈G}
= { (5, 7), (5, 8), (4,7), (4, 8), (2, 7), (2,8)}
7. 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 same number of pages} is an equivalence relation.
7. 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 same number of pages} is an equivalence relation.
We have,
R= have same number of pages is a relation in set of A of all books in
For
As x=y=same no. of pages
Then,
Hence, R is reflexive.
For and
Also, ,
Hence, R is symmetric.
For and and
x=y and y=z
x=z
i.e., &
6. Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.
6. Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.
We have,
R= is a relation in set
Then, as and
So, R is not reflective
As and
So, R is symmetric
And as but
So, R is not transitive.
5. Check whether the relation R in R defined as R = {(a, b): a ≤ b3} is reflexive, symmetric or transitive.
5. Check whether the relation R in R defined as R = {(a, b): a ≤ b3} is reflexive, symmetric or transitive.
We have,
R= is a relation in R.
For, and we can write
=> => which is not true.
So, R is not reflexive.
For we have,
=> => is true.
So,
But => is not true
So, and
Hen
4. Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive but not symmetric.
4. Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive but not symmetric.
We have, R= is a relation in R.
For, ,
but is not possible i.e.,
Hence, R is not symmetric.
For and
and
So,
i.e.,
R is transitive.
3. 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.
3. 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.
We have,
R= is a relation in set
So, R=
As, , R is not reflexive
As, but , R is not symmetric
And as & but
Hence, R is not transitive.