English

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

Advertisements
Advertisements

Question

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

Fill in the Blanks
Advertisements

Solution

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

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

APPEARS IN

NCERT Exemplar Mathematics [English] Class 12
Chapter 1 Relations And Functions
Solved Examples | Q 25 | Page 9

RELATED QUESTIONS

If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.


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


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.


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


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 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 and y}


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.


Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.


The following relation is defined on the set of real numbers.
aRb if a – b > 0

Find whether relation is reflexive, symmetric or transitive.


The following relation is defined on the set of real numbers.

aRb if 1 + ab > 0

Find whether relation is reflexive, symmetric or transitive.


An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive and transitive.


Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b},  is an equivalence relation.


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.


Show that the relation R, defined in the set A of all polygons as R = {(P1, P2) : P1 and P2 have the same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right-angled triangle T with sides 3, 4 and 5?


Let R = {(x, y) : |x2 − y2| <1) be a relation on set A = {1, 2, 3, 4, 5}. Write R as a set of ordered pairs.


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.


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 ?


Define a transitive relation ?


Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.


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


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


Show that the relation R on the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.


Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}.
Then, write minimum number of ordered pairs to be added in R to make R reflexive and transitive


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


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 us define a relation R in R as aRb if a ≥ b. Then R is ______.


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


Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A 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 ____________.


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:


A relation S in the set of real numbers is defined as `"xSy" => "x" - "y" + sqrt3`  is an irrational number, then relation S is ____________.


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


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


A relation in a set 'A' is known as empty relation:-


A relation 'R' in a set 'A' is called reflexive, if


Let A = {3, 5}. Then number of reflexive relations on A is ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×