English

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

Advertisements
Advertisements

Question

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

Sum
Advertisements

Solution

x + y = 10; x, y ∈ N

Thus,

R = {(x, y); x + y = 10, x, y ∈ N}

R = {(1, 9), (2, 8), (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)}

It’s clear (1, 1) ∉ R

So, R is not reflexive.

(x, y) ∈ R ⇒ (y, x) ∈ R

Therefore, R is symmetric.

Now (1, 9) ∈ R, (9, 1) ∈ R, but (1, 1) ∉ R

Therefore, R is not transitive.

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

APPEARS IN

NCERT Exemplar Mathematics Exemplar [English] Class 12
Chapter 1 Relations And Functions
Exercise | Q 22. (ii) | Page 12

RELATED QUESTIONS

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

Relation R in the set Z of all integers defined as R = {(x, y) : x – y is an integer}.


Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.


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


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]


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

R3 on R is defined by (a, b) ∈ R3 `⇔` a2 – 4ab + 3b2 = 0.


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 reflexive, symmetric and transitive ?


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


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


Let A = {1, 2, 3} and R = {(1, 2), (1, 1), (2, 3)} be a relation on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.


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 ?


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.


Write the identity relation on set A = {a, b, c}.


If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.


Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.


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


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


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


Mark the correct alternative in the following question:

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


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


If A = {a, b, c}, B = (x , y} find B × B.


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


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


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


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


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.


Let A = { 2, 3, 6 } Which of the following relations on A are reflexive?


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


If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.


A relation R in set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an equivalence relation in A?


Given set A = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be ____________.


A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever


Let I be the set of all citizens of India who were eligible to exercise their voting right in the general election held in 2019. A relation ‘R’ is defined on I as follows:

R = {(V1, V2) ∶ V1, V2 ∈ I and both use their voting right in the general election - 2019}

  • The above-defined relation R is ____________.

Find: `int (x + 1)/((x^2 + 1)x) dx`


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


On the set N of all natural numbers, define the relation R by a R b, if GCD of a and b is 2. Then, R is


There are 600 student in a school. If 400 of them can speak Telugu, 300 can speak Hindi, then the number of students who can speak both Telugu and Hindi is:


Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].


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×