Advertisements
Advertisements
Question
Let R be the relation over the set of all straight lines in a plane such that l1 R l2 ⇔ l 1⊥ l2. Then, R is _____________ .
Options
Symmetric
Reflexive
Transitive
an equivalence relation
Advertisements
Solution
Symmetric
A = Set of all straight lines in the plane
R={( l1, l2) : l1, l2∈ A : l1 ⊥ l2}
Reflexivity: l1 is not ⊥ l1
⇒ (l1,l1) ∉ R
So, R is not reflexive on A.
Symmetry: Let (l1, l2) ∈ R
⇒l1⊥l2
⇒l2⊥l1
⇒(l2, l1) ∈ R
So, R is symmetric on A.
Transitivity: Let (l1, l2) ∈ R, (l2, l3) ∈ R
⇒ l1⊥ l2 and l2⊥ l3
But l1 is not ⊥ l3
⇒(l1, l3) ∉ R
So, R is not transitive on A.
APPEARS IN
RELATED QUESTIONS
Let A = {1, 2, 3,......, 9} and R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].
Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and P2 have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?
Let R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}. Choose the correct answer.
Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(a, b) : a, b ∈ A, |a – b| is divisible by 4}is an equivalence relation. Find the set of all elements related to 1. Also write the equivalence class [2]
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 is father of y}
Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:
R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, transitive but not symmetric ?
Let R be a relation defined on the set of natural numbers N as
R = {(x, y) : x, y ∈ N, 2x + y = 41}
Find the domain and range of R. Also, verify whether R is (i) reflexive, (ii) symmetric (iii) transitive.
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.
Defines a relation on N :
x > y, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Let R be a relation on the set A of ordered pair of integers defined by (x, y) R (u, v) if xv = yu. Show that R is an equivalence relation.
If A = {2, 3, 4}, B = {1, 3, 7} and R = {(x, y) : x ∈ A, y ∈ B and x < y} is a relation from A to B, then write R−1.
Define an equivalence relation ?
Let the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs
Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,
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 _______________ .
Mark the correct alternative in the following question:
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then, R is _____________ .
If `f(x) = (4x + 3)/(6x - 4), x ≠ 2/3`, show that fof (x) = x for all `x ≠ 2/3`. Also, find the inverse of f.
Show that the relation S in the set A = [x ∈ Z : 0 ≤ x ≤ 12] given by S = [(a, b) : a, b ∈ Z, ∣a − b∣ is divisible by 3] is an equivalence relation.
If A = {a, b, c}, B = (x , y} find A × A.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6} Find (A × B) ∩ (A × C).
Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? transitive?
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is ______.
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 ______.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
The following defines a relation on N:
x is greater than y, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
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 the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?
Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is ____________.
Let R be the relation “is congruent to” on the set of all triangles in a plane is ____________.
Given triangles with sides T1: 3, 4, 5; T2: 5, 12, 13; T3: 6, 8, 10; T4: 4, 7, 9 and a relation R inset of triangles defined as R = `{(Delta_1, Delta_2) : Delta_1 "is similar to" Delta_2}`. Which triangles belong to the same equivalence class?
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 = {(x, y): y is divisible by x} 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}
- Raji wants to know the number of relations possible from A to B. How many numbers of relations are possible?
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 ____________.
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
A relation in a set 'A' is known as empty relation:-
What should be checked to determine whether a relation is reflexive?
