English

Give an example of a relation which is symmetric but neither reflexive nor transitive?

Advertisements
Advertisements

Question

Give an example of a relation which is symmetric but neither reflexive nor transitive?

Sum
Advertisements

Solution

Let A = {5, 6, 7}

⇒ And the relation R = {(5, 6), (6, 5)}

The relation R is not reflexive because (5, 5), (6, 6), and (7, 7) ∉ R.

∴ R is not reflexive.

⇒ Now, since (5, 6) ∈ R and (6, 5) ∈ R.

∴ R is symmetric.

⇒ (5, 6), (6, 5) ∈ R, but (5, 5) ∉ R

∴ R is not transitive. 

Hence, the relation R is symmetric but neither reflexive nor transitive.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Relations - Exercise 1.1 [Page 11]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 1 Relations
Exercise 1.1 | Q 14.4 | Page 11

RELATED QUESTIONS

If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.


Show that the relation R in the set R of real numbers, defined as R = {(a, b) : a ≤ b2} is neither reflexive nor symmetric nor transitive.


Show that the relation R in R defined as R = {(a, b) : a ≤ b}, is reflexive and transitive but not symmetric.


Check whether the relation R in R defined by R = {(a, b) : a ≤ b3} is reflexive, symmetric or transitive.


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


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.


Given a non-empty set X, consider P(X), which is the set of all subsets of X. Define the relation R in P(X) as follows:

For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.


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


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


Defines a relation on N:

x + 4y = 10, x, y ∈ N

Determine the above relation is 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.


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.


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


If A = {a, b, c}, then the relation R = {(b, c)} on A is _______________ .


If R is the largest equivalence relation on a set A and S is any relation on A, then _____________ .


Let R be the relation on the set A = {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then, _____________________ .


In the set Z of all integers, which of the following relation R is not an equivalence relation ?


Mark the correct alternative in the following question:

Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if l is perpendicular to m for all l, m  L. Then, R is ______________ .


Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c   on the A x A  , where A =  {1, 2,3,...,10}  is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.


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 × B.


Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).


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


The following defines a relation on N:

x y is square of an integer x, y ∈ N

Determine which of the above relations are reflexive, symmetric and transitive.


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


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


Given set A = {a, b, c}. An identity relation in set A 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


Which of the following is/are example of symmetric


If f(x + 2a) = f(x – 2a), then f(x) is:


Define the relation R in the set N × N as follows:

For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.


Let R = {(x, y) : x, y ∈ N and x2 – 4xy + 3y2 = 0}, where N is the set of all natural numbers. Then the relation R is ______.


Let A = {3, 5}. Then number of reflexive relations on A is ______.


Read the following passage:

An organization conducted bike race under two different categories – Boys and Girls. There were 28 participants in all. Among all of them, finally three from category 1 and two from category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project.
Let B = {b1, b2, b3} and G = {g1, g2}, where B represents the set of Boys selected and G the set of Girls selected for the final race.

Based on the above information, answer the following questions:

  1. How many relations are possible from B to G? (1)
  2. Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
  3. Let R : B `rightarrow` B be defined by R = {(x, y) : x and y are students of the same sex}. Check if R is an equivalence relation. (2)
    OR
    A function f : B `rightarrow` G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}. Check if f is bijective. Justify your answer. (2)

A relation R on (1, 2, 3) is given by R = {(1, 1), (2, 2), (1, 2), (3, 3), (2, 3)}. Then the relation 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×