Solution: $\mathrm{R}=\{(\mathrm{a}, \mathrm{b}): \mathrm{a}, \mathrm{b} \in \mathrm{Z}$ and $(\mathrm{a}+\mathrm{b})$ is even $\}$ (As given) If $R$ is Reflexive, Symmetric and Transitive, then $R$...
Let R ={(a, b): a, b ∈ N and a + 3b = 12}. Find the domain and range of R.
Solution: $a + 3b = 12$ (given) $a = 12 – 3b$ Putting $b = 1$ $a = 12 – 3(1) = 9$ Putting $b = 2$ $a = 12 – 3(2) = 6$ Putting $b = 3$ $a = 12 – 3(3) = 3$ Putting $b = 4$ $a = 12 – 3(4) = 0$; which...
Show that the relation R on the set A = {x ∈ Z; 0 ≤ x ≤ 12}, given by R = {(a, b): a = b}, is an equivalence relation. Find the set of all elements related to 1.
Solution: Given set A = {x ∈ Z; 0 ≤ x ≤ 12} Also given that relation R = {(a, b): a = b} is defined on set A Now we have to check whether the given relation is equivalence or not. To prove...
Let R be a relation on the set A of ordered pair of integers defined by (x, y) R (u, v) if xv = y u. Show that R is an equivalence relation.
Solution: First let R be a relation on A It is given that set A of ordered pair of integers defined by (x, y) R (u, v) if xv = y u Now we have to check whether the given relation is equivalence or...
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?
Solution: Given that m is said to be related to n if m and n are integers and m − n is divisible by 13 Now we have to check whether the given relation is equivalence or not. To prove equivalence...
Let Z be the set of integers. Show that the relation R = {(a, b): a, b ∈ Z and a + b is even} is an equivalence relation on Z.
Solution: Given R = {(a, b): a, b ∈ Z and a + b is even} is a relation defined on R. Also given that Z be the set of integers To prove equivalence relation it is necessary that the given relation...
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.
Solution: Given (a, b) ∈ R ⇔ a − b is divisible by n is a relation R defined on Z. To prove equivalence relation it is necessary that the given relation should be reflexive, symmetric and...
Prove that the relation R on Z defined by (a, b) ∈ R ⇔ a − b is divisible by 5 is an equivalence relation on Z.
Solution: Given relation R on Z defined by (a, b) ∈ R ⇔ a − b is divisible by 5 To prove equivalence relation it is necessary that the given relation should be reflexive, symmetric and 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.
Solution: Given R = {(a, b): 2 divides a – b} is a relation defined on Z. To prove equivalence relation it is necessary that the given relation should be reflexive, symmetric and transitive. Let us...
Show that the relation R defined by R = {(a, b): a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.
Solution: Given R = {(a, b): a – b is divisible by 3; a, b ∈ Z} is a relation To prove equivalence relation it is necessary that the given relation should be reflexive, symmetric and transitive. Let...
If A = {1, 2, 3, 4} define relations on A which have properties of being
(i) Reflexive, transitive but not symmetric
(ii) Symmetric but neither reflexive nor transitive.
(iii) Reflexive, symmetric and transitive.
Solution: (i) The relation on A having properties of being reflexive, transitive, but not symmetric is R = {(1, 1), (2, 2), (3, 3), (4, 4), (2, 1)} Relation R satisfies reflexivity and transitivity....
Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.
Solution: Let A be a set. Then, Identity relation IA=IA is reflexive, since (a, a) ∈ A ∀a The converse of it need not be necessarily true. Consider the set A = {1, 2, 3} Here, Relation R = {(1, 1),...
Check whether the relation R on R defined as R = {(a, b): a ≤ b3} is reflexive, symmetric or transitive.
Solution: Given R = {(a, b): a ≤ b3} It is observed that (1/2, 1/2) in R as 1/2 > (1/2)3 = 1/8 ∴ R is not reflexive. Now, (1, 2) ∈ R (as 1 < 23 = 8) But, (2, 1) ∉ R (as 2 > 13 = 1) ∴ R is...
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.
Solution: Given R = {(a, b): b = a + 1} Now for this relation we have to check whether it is reflexive, transitive and symmetric Reflexivity: Let a be an arbitrary element of R. Then,...
The following relation is defined on the set of real numbers.
(i) aRb if a – b > 0
(ii) aRb iff 1 + a b > 0
(iii) aRb if |a| ≤ b. Find whether relation is reflexive, symmetric or transitive.
Solution: (i) Consider aRb if a – b > 0 Now for this relation we have to check whether it is reflexive, transitive and symmetric. Reflexivity: Let a be an arbitrary element of R. Then, a ∈ R...
Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is
(i) reflexive
(ii) symmetric
(iii) transitive.
Solution: Consider R1 Given R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)} Reflexivity: Here, (1, 1), (2, 2), (3, 3) ∈R So, R1 is reflexive. Symmetry: Here, (2, 1) ∈ R1, But (1, 2) ∉ R1...
Test whether the following relation R1, R2, and R3 are
(i) reflexive
(ii) symmetric and
(iii) transitive:
(i) R1 on Q0 defined by (a, b) ∈ R1 ⇔ a = 1/b.
(ii) R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
(iii) R3 on R defined by (a, b) ∈ R3 ⇔ a2 – 4ab + 3b2 = 0.
Solution: (i) Given R1 on Q0 defined by (a, b) ∈ R1 ⇔ a = 1/b. Reflexivity: Let a be an arbitrary element of R1. Then, a ∈ R1 ⇒ a ≠1/a for all a ∈ Q0 So, R1 is not reflexive. Symmetry: Let...
Three relations R1, R2 and R3 are defined on a set A = {a, b, c} as follows: R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}
R2 = {(a, a)}
R3 = {(b, c)}
R4 = {(a, b), (b, c), (c, a)}. Find whether or not each of the relations R1, R2, R3, R4 on A is
(i) reflexive
(ii) symmetric and
(iii) transitive.
Solution: (i) Consider R1 Given R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)} Now we have check R1 is reflexive, symmetric and transitive Reflexive: Given (a, a), (b, b) and...
Let A be the set of all human beings in a town at a particular time. Determine whether of the following relation is reflexive, symmetric and transitive:
(iii) R = {(x, y): x is wife of y}
(iv) R = {(x, y): x is father of y}
Solution; (iii) Given R = {(x, y): x is wife of y} Now we have to check whether the relation R is reflexive, symmetric and transitive. First let us check whether the relation is reflexive:...
Let A be the set of all human beings in a town at a particular time. Determine whether of the following relation is reflexive, symmetric and transitive:
(i) R = {(x, y): x and y work at the same place}
(ii) R = {(x, y): x and y live in the same locality}
Solution: (i) Given R = {(x, y): x and y work at the same place} Now we have to check whether the relation is reflexive: Let x be an arbitrary element of R. Then, x ∈R ⇒...
Describe the following sets in Roster form: (i) {x : x is a letter before e in the English alphabet} (ii) {x ∈ N: x2 < 25}
Answers: (i) If we read the complete sentence it becomes x and the letter x comes before ‘e’ in the English alphabet. Thus, the letters before the letter ‘e’ are a,b,c,d. ∴ Roster form = {a,b,c,d}...