मराठी

Write the Smallest Reflexive Relation on Set a = {1, 2, 3, 4}.

Advertisements
Advertisements

प्रश्न

Write the smallest reflexive relation on set A = {1, 2, 3, 4}.

एका वाक्यात उत्तर
बेरीज
Advertisements

उत्तर

Here,
A = {1, 2, 3, 4}
Also, a relation is reflexive iff every element of the set is related to itself.

So, the smallest reflexive relation on the set A is
R = {(1, 1), (2, 2), (3, 3), (4, 4)}

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations - Exercise 1.3 [पृष्ठ ३०]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 1 Relations
Exercise 1.3 | Q 4 | पृष्ठ ३०

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

Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.


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.


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


Show that the relation R defined in the set A of all triangles as R = {(T1, T2) : T1 is similar to T2}, is an equivalence relation. Consider three right angle triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3 with sides 6, 8, and 10. Which triangles among T1, T2 and T3 are related?


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 is father of y}


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

R1 on Q0 defined by (a, b) ∈ R1 ⇔ = 1/b.


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?


Let Z be the set of all integers and Z0 be the set of all non-zero integers. Let a relation R on Z × Z0be defined as (a, b) R (c, d) ⇔ ad = bc for all (a, b), (c, d) ∈ Z × Z0,
Prove that R is an equivalence relation on Z × Z0.


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.


Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,


R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .


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


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


Mark the correct alternative in the following question:

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 for all a, b  T. Then, R is ____________ .


Mark the correct alternative in the following question:

For real numbers x and y, define xRy if `x-y+sqrt2` is an irrational number. Then the relation R is ___________ .


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?


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


Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets


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


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


Every relation which is symmetric and transitive is also reflexive.


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.


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


Let R be the relation on N defined as by x + 2 y = 8 The domain of R is ____________.


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


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


The relation R is defined on the set of natural numbers as {(a, b) : a = 2b}. Then, R-1 is given by ____________.


Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1,2,3,4,5,6}

  • Let R be a relation on B defined by R = {(1,2), (2,2), (1,3), (3,4), (3,1), (4,3), (5,5)}. Then 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)

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×