Advertisements
Advertisements
प्रश्न
The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is ___________________ .
पर्याय
symmetric only
reflexive only
an equivalence relation
transitive only
Advertisements
उत्तर
an equivalence relation
R={ (a, b) : a = b and a, b ∈ A }
Reflexivity : Let a ∈ A
Here,
a = a
⇒ (a, a) ∈ R for all a ∈ A
So, R is reflexive on A
Symmetry : Let a, b ∈ A such that (a, b) ∈ R. Then,
(a, b) ∈ R
⇒ a = b
⇒ b = a
⇒ (b, a) ∈ R for all a ∈ A
So, R is symmetric on A.
Transitive : Let a, b, c ∈ A such that (a, b) ∈ R and (b, c) ∈ R.
Then, (a, b) ∈ R ⇒ a = b and (b, c) ∈ R ⇒ b = c
⇒ a = c
⇒ (a, c) ∈ R for all a ∈ A
So, R is transitive on A.
Hence, R is an equivalence relation on A.
APPEARS IN
संबंधित प्रश्न
If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.
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 = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(a, b) : a, b ∈ 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
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.
Let R be a relation defined on the set of natural numbers N as
R = {(x, y) : x, y ∈ 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 symmetric and transitive but not reflexive?
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 it reflexive and transitive.
Defines a relation on N:
xy is square of an integer, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.
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 S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.
Write the domain of the relation R defined on the set Z of integers as follows:-
(a, b) ∈ R ⇔ a2 + b2 = 25
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
Let R be the equivalence relation on the set Z of the integers given by R = { (a, b) : 2 divides a - b }.
Write the equivalence class [0].
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 the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : | a2- b2 | < 8}. Write R as a set of ordered pairs.
Let the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs
Let A = {2, 3, 4, 5, ..., 17, 18}. Let '≃' be the equivalence relation on A × A, cartesian product of Awith itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is _______________ .
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .
Show that the relation S in the set A = [x ∈ Z : 0 ≤ x ≤ 12] given by S = [(a, b) : a, b ∈ Z, ∣a − b∣ is divisible by 3] is an equivalence relation.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
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 = {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
Give an example of a map which is neither one-one nor onto
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?
Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?
If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.
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 A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
A market research group conducted a survey of 2000 consumers and reported that 1720 consumers like product P1 and 1450 consumers like product P2. What is the least number that must have liked both the products?
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.
Let f(x)= ax2 + bx + c be such that f(1) = 3, f(–2) = λ and f(3) = 4. If f(0) + f(1) + f(–2) + f(3) = 14, then λ is equal to ______.
lf A = {x ∈ z+ : x < 10 and x is a multiple of 3 or 4}, where z+ is the set of positive integers, then the total number of symmetric relations on A is ______.
A relation \(R\) on \(A\) is reflexive when which condition holds?
