हिंदी

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

Advertisements
Advertisements

प्रश्न

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

योग
Advertisements

उत्तर

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
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 1: Relations - Exercise 1.1 [पृष्ठ ११]

APPEARS IN

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

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

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)].


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


Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.


Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a − b| is even}, is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.


Given an example of a relation. Which is Symmetric but neither reflexive nor transitive.


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


Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.


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

(A) 1 (B) 2 (C) 3 (D) 4


The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4


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.


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 a – b > 0

Find whether relation is reflexive, symmetric or transitive.


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


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?


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.


Let S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.


If R and S are relations on a set A, then prove that R and S are symmetric ⇒ R ∩ S and R ∪ S are symmetric ?


If R is a symmetric relation on a set A, then write a relation between R and R−1.


Let A = {3, 5, 7}, B = {2, 6, 10} and R be a relation from A to B defined by R = {(x, y) : x and y are relatively prime}. Then, write R and R−1.


Define a reflexive 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.


A relation ϕ from C to R is defined by x ϕ y ⇔ | x | = y. Which one is correct?


Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.


Mark the correct alternative in the following question:

The maximum number of equivalence relations on the set A = {1, 2, 3} is _______________ .


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


R = {(a, b) / b = a + 1, a ∈ Z, 0 < a < 5}. Find the Range of R.


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?


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


Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation


Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive


Give an example of a map which is neither one-one nor onto


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


The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.


Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.


R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 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 ____________.


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?


Given set A = {a, b, c}. An identity relation in set A is ____________.


An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. 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} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions.

  • Ravi wishes to form all the relations possible from B to G. How many such relations are possible?

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×