English

The Following Relations is Defined on the Set of Real Numbers. Arb If |A| ≤ B Find Whether Relations Are Reflexive, Symmetric Or Transitive.

Advertisements
Advertisements

Question

The following relation is defined on the set of real numbers.  aRb if |a| ≤ b

Find whether relation is reflexive, symmetric or transitive.

Sum
Advertisements

Solution

Reflexivity :

Let a be an arbitrary element of R. Then,

 ∈                  [Since, |a|=a]

⇒ |a|≮ a

So, R is not reflexive.

Symmetry :

Let (a, b∈ R

⇒ |a≤ b 

 |b≰ a for all a, ∈ R

⇒ (b, a∉ R 

So, R is not symmetric.

Transitivity :

Let (a, b∈ R and (b, c∈ R

⇒ |a≤ b and |b≤ c

Multiplying the corresponding sides, we get

|a|  |b≤ bc

⇒ |a≤ c

⇒ (a, c∈ R

Thus, R is 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 5.3 | Page 11

RELATED QUESTIONS

Determine whether the following relation is reflexive, symmetric and transitive:

Relation R in the set A = {1, 2, 3, ..., 13, 14} defined as R = {(x, y) : 3x – y = 0}.


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


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 = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.


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


Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(ab) : a∈ 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]


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


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


Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, add a minimum number of ordered pairs so that the enlarged relation is symmeteric, transitive and reflexive.


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 and S are relations on a set A, then prove that R is reflexive and S is any relation ⇒ R ∪ S is reflexive ?


Let C be the set of all complex numbers and Cbe the set of all no-zero complex numbers. Let a relation R on Cbe defined as

`z_1 R  z_2  ⇔ (z_1 -z_2)/(z_1 + z_2)` is real for all z1, z2 ∈ C0.

Show that R is an equivalence relation.


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


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 a reflexive relation ?


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

Write the equivalence class [0].


If a relation R is defined on the set Z of integers as follows:
(a, b) ∈ R ⇔ a2 + b2 = 25. Then, domain (R) is ___________


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


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


A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by : x R y ⇔ x is relatively prime to y. Then, domain of R is ______________ .


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


If A = {1, 2, 3}, then a relation R = {(2, 3)} on A 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 _____________ .


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


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


Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is ______.


Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______


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 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 on N defined as by x + 2 y = 8 The domain of R is ____________.


Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). Then, R is ____________.


Total number of equivalence relations defined in the set S = {a, b, c} is ____________.


If A is a finite set consisting of n elements, then the number of reflexive relations on A is


A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-


Which of the following is/are example of symmetric


Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.


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.


Given a non-empty set X, define the relation R in P(X) as follows:

For A, B ∈ P(X), (4, B) ∈ R iff A ⊂ B. Prove that R is reflexive, transitive and not symmetric.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×