Advertisements
Advertisements
Question
Identify which of if the following relations are reflexive, symmetric, and transitive.
| Relation | Reflexive | Symmetric | Transitive |
| R = {(a, b) : a, b ∈ Z, a – b is an integer} | |||
| R = {(a, b) : a, b ∈ N, a + b is even} | √ | √ | x |
| R = {(a, b) : a, b ∈ N, a divides b} | |||
| R = {(a, b) : a, b ∈ N, a2 – 4ab + 3b2 = 0} | |||
| R = {(a, b) : a is sister of b and a, b ∈ G = Set of girls} | |||
| R = {(a, b) : Line a is perpendicular to line b in a plane} | |||
| R = {(a, b) : a, b ∈ R, a < b} | |||
| R = {(a, b) : a, b ∈ R, a ≤ b3} |
Advertisements
Solution
i. R = {(a, b)/a, b ∈ Z, a - b is an integer}
Let a, b, c ∈ Z
∵ a − a = 0 ∈ Z
∴ aRa ∀ a ∈ Z
∴ R is reflective
Let aRb ∴ a − b is an integer
∴ −(a − b) = b − a is also an integer
∴ bRa
∴ aRb ⇒ bRa ∀ a, b ∈ Z
∴ R is symmetric
Let aRb, bRc
∴ a − b, b − c are integers
∴ (a − b) + (b − c) = a − c is an integer
∴ aRb, bRc ⇒ aRc ∀ a, b, c ∈ Z
∴ R is transitive.
ii. R = {(a, b) / a, b ∈ N, a + b is even}
Let a, b, c ∈ N
a + a = 2a is even
∴ aRa ∀ a ∈ N
R is reflexive
Let aRb . ·. a + b is even
∴ b + a is even
∴ bRa
∴ aRb ⇒ bRa ∀ a, b ∈ N
∴ R is symmetric
Let aRb, bRc
∴ a + b, b + c are even
Let a + b = 2m, b + c = 2n
∴ (a + b) + (b + c) = 2m + 2n
∴ a + c = 2m + 2n -− 2b = 2 (m + n − b) is even
∴ aRc
∴ aRb, bRc ⇒ aRc ∀ a, b, c ∈ N
∴ R is transitive.
iii. R = {(a, b) / a, b ∈ N, a divides b}
∵ a divides a aRa ∀ a ∈ N
∵ R is reflexive
Let a = 2, b = 4
∴ 2 divides 4 so that aRb
But 4 does not divide 2 ∴ `bcancelRa`
∴ aRb `cancel=> bRc`
∴ R is not symmetric
Let aRb, bRc
∴ a divides b, b divides c
∴ b = am, c = bn, m, n ∈ N
∴ c = bn = (am)n = a(mn)
∴ a divides c ∴ aRc
∴ aRb, bRc ⇒ aRc ∀ a, b, c ∈ N
∴ R is transitive.
iv. R = {(a, b) / a, b ∈ N, a2 − 4ab + 3b2 = 0}
aRb if a2 − 4ab + 3b2 = 0
i.e., if (a − b)(a − 3b) = 0
i.e., if a = b or a = 3b
a = a ∴ aRa ∀ a ∈ N
R is reflexive
Let a = 27, b = 9
∴ a = 3b ∴ aRb
`b cancel=a and b cancel= 3a`
`b cancelRa`
`bRb cancel=> bRa`
R is not symmetric
Let a = 27, b = 9, c = 3
a = 3b ∴ aRb
Also, b = 3c ∴ bRc
But `a cancel= c and a cancel= 3c`
`a cancelR c`
`aRb, bRc cancel=> aRc`
R is not transitive.
v. R = {(a, b) / a is a sister of b,
a, b ∈ G = Set of girls}
No girl is her own sister
`a cancelR a` for any a ∈ G
R is not reflexive
Let aRb
a is a sister of b
b is a sister of a
bRa
aRb ⇒ bRa ∀ a, b ∈ G
R is symmetric
Let aRb, bRc
a is a sister of b and b is a sister of c
aRc
aRb, bRc ⇒ aRc ∀ a, b, c ∈ G
R is transitive.
vi. R = {(a, b) / Line a is perpendicular to line b in a plane}
No line is perpendicular to itself
`a cancelR a` for any line
R is not reflexive
Let aRb
a is perpendicular to b
b is perpendicular to a
bRa
aRb ⇒ bRa ∀ a, b
R is symmetric
If a is perpendicular to b and b is perpendicular to c, then a is parallel to c
aRb, bRc `cancel=>` aRc
R is not transitive.
vii. R = {(a, b) / a, be R, a < b}
a ≮ a ∀ a ∈ R
R is not reflexive
Let a = 2, b = 4
a< b
aRb
But b ≮ a
b `cancelR` a
`aRb cancel=> bRa`
R is not symmetric
Let aRb, bRc
a < b, b < c
a < b < c i.e., a < c
aRc
aRb, bRc ⇒ aRc ∀ a, b, c ∈ R
R is transitive.
viii. R = {(a, b) / a, b ∈ R, a ≤ b3 }
Let a = −2
a3 = −8
But −2 > −8
`a cancel≤ a^3` for all a ∈ R
R is not reflexive
Let a = 1, b = 2 so that a3 = 1, b3 = 8
a < b3 ...aRb
But b > a3 `bcancelRa`
aRb ~ bRa
R is not symmetric
Let a = 8, b = 2, c = 1.5
a = b3 ...aRb
c3 = (1.5)3 = 3.375
b < c3
bRc
But a < c3
aRb, bRc `cancel=>` aRc
R is not transitive.
| Relation | Reflexive | Symmetric | Transitive |
| R = {(a, b) : a, b ∈ Z, a – b is an integer} | √ | √ | √ |
| R = {(a, b) : a, b ∈ N, a + b is even} | √ | √ | √ |
| R = {(a, b) : a, b ∈ N, a divides b} | √ | x | √ |
| R = {(a, b) : a, b ∈ N, a2 – 4ab + 3b2 = 0} | √ | x | x |
| R = {(a, b) : a is sister of b and a, b ∈ G = Set of girls} | x | √ | √ |
| R = {(a, b) : Line a is perpendicular to line b in a plane} | x | √ | x |
| R = {(a, b) : a, b ∈ R, a < b} | x | x | √ |
| R = {(a, b) : a, b ∈ R, a ≤ b3} | x | x | √ |
APPEARS IN
RELATED QUESTIONS
Let A = {1, 2, 3, 4, 6}. Let R be the relation on A defined by {(a, b): a, b ∈ A, b is exactly divisible by a}.
- Write R in roster form
- Find the domain of R
- Find the range of R.
Determine the domain and range of the relation R defined by R = {(x, x + 5): x ∈ {0, 1, 2, 3, 4, 5}}.
Determine the domain and range of the relation R defined by
(i) R = [(x, x + 5): x ∈ (0, 1, 2, 3, 4, 5)]
Determine the domain and range of the relations:
(i) R = {(a, b) : a ∈ N, a < 5, b = 4}
Determine the domain and range of the relations:
(ii) \[S = \left\{ \left( a, b \right) : b = \left| a - 1 \right|, a \in Z \text{ and} \left| a \right| \leq 3 \right\}\]
Let A = [1, 2, 3, ......., 14]. Define a relation on a set A by
R = {(x, y) : 3x − y = 0, where x, y ∈ A}.
Depict this relationship using an arrow diagram. Write down its domain, co-domain and range.
Let A = [1, 2, 3, 4, 5, 6]. Let R be a relation on A defined by {(a, b) : a, b ∈ A, b is exactly divisible by a}
(i) Writer R in roster form
(ii) Find the domain of R
(ii) Find the range of R.
For the relation R1 defined on R by the rule (a, b) ∈ R1 ⇔ 1 + ab > 0. Prove that: (a, b) ∈ R1 and (b , c) ∈ R1 ⇒ (a, c) ∈ R1 is not true for all a, b, c ∈ R.
Let R be a relation on N × N defined by
(a, b) R (c, d) ⇔ a + d = b + c for all (a, b), (c, d) ∈ N × N
Show that:
(i) (a, b) R (a, b) for all (a, b) ∈ N × N
Let R be a relation on N × N defined by
(a, b) R (c, d) ⇔ a + d = b + c for all (a, b), (c, d) ∈ N × N
Show that:
(ii) (a, b) R (c, d) ⇒ (c, d) R (a, b) for all (a, b), (c, d) ∈ N × N
If A = {1, 2, 4}, B = {2, 4, 5} and C = {2, 5}, write (A − C) × (B − C).
A relation ϕ from C to R is defined by x ϕ y ⇔ |x| = y. Which one is correct?
R is a relation from [11, 12, 13] to [8, 10, 12] defined by y = x − 3. Then, R−1 is
If R is a relation on a finite set having n elements, then the number of relations on A is
If P = {1, 2, 3) and Q = {1, 4}, find sets P × Q and Q × P
Express {(x, y) / x2 + y2 = 100, where x, y ∈ W} as a set of ordered pairs
Write the relation in the Roster Form. State its domain and range
R4 = {(x, y)/y > x + 1, x = 1, 2 and y = 2, 4, 6}
Write the relation in the Roster Form. State its domain and range
R6 = {(a, b)/a ∈ N, a < 6 and b = 4}
Select the correct answer from given alternative.
The relation ">" in the set of N (Natural number) is
Answer the following:
If A = {1, 2, 3}, B = {4, 5, 6} check if the following are relations from A to B. Also write its domain and range
R1 = {(1, 4), (1, 5), (1, 6)}
Answer the following:
If A = {1, 2, 3}, B = {4, 5, 6} check if the following are relations from A to B. Also write its domain and range
R2 = {(1, 5), (2, 4), (3, 6)}
Answer the following:
R = {1, 2, 3} → {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} Check if R is reflexive
Answer the following:
R = {1, 2, 3} → {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} Check if R is transitive
Let A = {1, 2, 3, 4, …, 45} and R be the relation defined as “is square of ” on A. Write R as a subset of A × A. Also, find the domain and range of R
Represent the given relation by
(a) an arrow diagram
(b) a graph and
(c) a set in roster form, wherever possible
{(x, y) | x = 2y, x ∈ {2, 3, 4, 5}, y ∈ {1, 2, 3, 4}
Multiple Choice Question :
The range of the relation R = {(x, x2) | x is a prime number less than 13} is ________
Let X = {a, b, c, d} and R = {(a, a), (b, b), (a, c)}. Write down the minimum number of ordered pairs to be included to R to make it transitive
Prove that the relation “friendship” is not an equivalence relation on the set of all people in Chennai
Let A = {a, b, c}. What is the equivalence relation of smallest cardinality on A? What is the equivalence relation of largest cardinality on A?
Choose the correct alternative:
Let X = {1, 2, 3, 4} and R = {(1, 1), (1, 2), (1, 3), (2, 2), (3, 3), (2, 1), (3, 1), (1, 4), (4, 1)}. Then R is
Is the following relation a function? Justify your answer
R1 = `{(2, 3), (1/2, 0), (2, 7), (-4, 6)}`
Given R = {(x, y) : x, y ∈ W, x2 + y2 = 25}. Find the domain and Range of R.
If R1 = {(x, y) | y = 2x + 7, where x ∈ R and – 5 ≤ x ≤ 5} is a relation. Then find the domain and Range of R1.
Let n(A) = m, and n(B) = n. Then the total number of non-empty relations that can be defined from A to B is ______.
Let N denote the set of all natural numbers. Define two binary relations on N as R1 = {(x, y) ∈ N × N : 2x + y = 10} and R2 = {(x, y) ∈ N × N : x + 2y = 10}. Then ______.
Let A = {1, 2, 3, 4}, B = {1, 5, 9, 11, 15, 16} and f = {(1, 5), (2, 9), (3, 1), (4, 5), (2, 11)}. Is the following true?
f is a function from A to B
Justify your answer in case.
Which statement about images in a function is correct?
Let \(A=\{1,2,3\}\), \(B=\{3,4\}\), and \(C=\{4,5,6\}\). What is \((A\times B)\cap(A\times C)\)?
