हिंदी

The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive. - Mathematics

Advertisements
Advertisements

प्रश्न

The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.

विकल्प

  • True

  • False

MCQ
सत्य या असत्य
Advertisements

उत्तर

This statement is False.

Explanation:

Given that, R = {(1, 1), (1, 2), (2, 1), (3, 3)}

(2, 2) ∉ R

So, R is not reflexive

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

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics [English] Class 12
अध्याय 1 Relations And Functions
Exercise | Q 58 | पृष्ठ १७

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

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.


Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:

R = {(x, y) : x and y live in the same locality}


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

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


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


Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.


Prove that the relation R on Z defined by
(a, b) ∈ R ⇔ a − b is divisible by 5
is an equivalence relation on Z.


Let n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.


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.


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 ?


Define a reflexive relation ?


Define a symmetric relation ?


For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.


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


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


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


Mark the correct alternative in the following question:

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


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


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.


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


Write the relation in the Roster form and hence find its domain and range:

R2 = `{("a", 1/"a")  "/"  0 < "a" ≤ 5, "a" ∈ "N"}`


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


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


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 the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, 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?


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}

  • Mr. Shyam exercised his voting right in General Election-2019, then Mr. Shyam is related to which of the following?

The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} 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 :-


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


Let a set A = A1 ∪ A2 ∪ ... ∪ Ak, where Ai ∩ Aj = Φ for i ≠ j, 1 ≤ i, j ≤ k. Define the relation R from A to A by R = {(x, y): y ∈ Ai if and only if x ∈ Ai, 1 ≤ i ≤ k}. Then, R is ______.


Let R1 and R2 be two relations defined as follows :

R1 = {(a, b) ∈ R2 : a2 + b2 ∈ Q} and

R2 = {(a, b) ∈ R2 : a2 + b2 ∉ Q}, where Q is the set of all rational numbers. Then ______


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×