हिंदी

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 (A) Symmetric (B) Reflexive (C) Transitive (D) an Equivalence Relation - Mathematics

Advertisements
Advertisements

प्रश्न

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 _____________ .

विकल्प

  • Symmetric

  • Reflexive

  • Transitive

  • an equivalence relation

MCQ
Advertisements

उत्तर

Symmetric


A = Set of all straight lines in the plane

R={l1, l2) : l1, l2∈ A : l⊥ l2}

Reflexivity: l1 is not  l1

⇒ (l1,l1∉ R

So, R is not reflexive on A.

Symmetry: Let (l1, l2∈ R

l1l2

l2l1

(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.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 1: Relations - Exercise 1.4 [पृष्ठ ३१]

APPEARS IN

आरडी शर्मा Mathematics [English] Class 12
अध्याय 1 Relations
Exercise 1.4 | Q 5 | पृष्ठ ३१

संबंधित प्रश्न

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 in 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.


Given an example of a relation. Which is Transitive but neither reflexive nor symmetric.


Given an example of a relation. Which is  Reflexive and symmetric but not transitive.


Let L be the set of all lines in the XY plane and R be the relation in L defined as R = {(L1, L2) : L1 is parallel to L2}. Show that R is an equivalence relation. Find the set of all lines related to the line y = 2x + 4.


Test whether the following relation R1 is  (i) reflexive (ii) symmetric and (iii) transitive :

R1 on Q0 defined by (a, b) ∈ R1 ⇔ = 1/b.


The following relation is defined on the set of real numbers.

aRb if 1 + ab > 0

Find whether relation is reflexive, symmetric or transitive.


Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.


If = {1, 2, 3, 4} define relations on A which have properties of being symmetric but neither reflexive nor transitive ?


Is it true that every relation which is symmetric and transitive is also reflexive? Give reasons.


Give an example of a relation which is symmetric and transitive but not reflexive?


Let A = {abc} and the relation R be defined on A as follows: R = {(aa), (bc), (ab)}. Then, write minimum number of ordered pairs to be added in R to make it reflexive 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.


Define an equivalence 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.


Let R be the equivalence relation on the set Z of the integers given by R = { (ab) : 2 divides }.

Write the equivalence class [0].


Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(ab) : | a2b| < 8}. Write as a set of ordered pairs.


R is a relation on the set Z of integers and it is given by
(x, y) ∈ R ⇔ | x − y | ≤ 1. Then, R is ______________ .


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 _______________ .


Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.


Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ________________ .


Mark the correct alternative in the following question:

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 _______________ .


For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.


Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if and only if l is perpendicular to m ∀ l, m ∈ L. Then R is ______.


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from B to A


Give an example of a map which is not one-one but onto


The following defines a relation on N:
x + 4y = 10 x, y ∈ N.
Determine which of the above relations are reflexive, symmetric and transitive.


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 and also obtain the equivalent class [(2, 5)]


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 ______.


R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.


Let A = {1, 2, 3}. Which of the following is not 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 ____________.


Total number of equivalence relations defined in the set S = {a, b, c} 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}

  • Let R: B → B be defined by R = {(1,1),(1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, then R is ____________.

Statement 1: The intersection of two equivalence relations is always an equivalence relation.

Statement 2: The Union of two equivalence relations is always an equivalence relation.

Which one of the following is correct?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×