Advertisements
Advertisements
प्रश्न
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, transitive but not symmetric ?
उत्तर
The relation on A having properties of being reflexive, transitive, but not symmetric is
R = {(1, 1), (2, 2), (3, 3), (4, 4), (2, 1)}
Relation R satisfies reflexivity and transitivity.
⇒(1, 1), (2, 2), (3, 3) ∈ R
and (1, 1), (2, 1) ∈ R ⇒(1, 1) ∈ R
However, (2, 1) ∈ R, but (1, 2) ∉ R
APPEARS IN
संबंधित प्रश्न
Show that the relation R in the set R of real numbers, defined as R = {(a, b): a ≤ b2} is neither reflexive nor symmetric nor transitive.
Show that each of the relation R in the set A= {x ∈ Z : 0 ≤ x ≤ = 12} given by R = {(a, b) : |a - b| is a multiple of 4} is an equivalence relation. Find the set of all elements related to 1 in each case.
Given an example of a relation. Which is Symmetric and transitive but not reflexive.
Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is
(A) 1
(B) 2
(C) 3
(D) 4
Let A be the set of all human beings in a town at a particular time. Determine whether of the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x is wife of y}
Give an example of a relation which is reflexive and symmetric but not transitive ?
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.
Show that the relation R on 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.
Define a symmetric 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.
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
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 _______________ .
Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is ___________________ .
S is a relation over the set R of all real numbers and it is given by (a, b) ∈ S ⇔ ab ≥ 0. Then, S 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 _______________ .
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 _____________ .
If f (x) = `(4x + 3)/(6x - 4) , x ≠ 2/3`, show that fof (x) = x for all ` x ≠ 2/3` . Also, find the inverse of f.
Let A = {6, 8} and B = {1, 3, 5}.
Let R = {(a, b)/a∈ A, b∈ B, a – b is an even number}. Show that R is an empty relation from A to B.
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 ______.
For real numbers x and y, define xRy if and only if x – y + `sqrt(2)` is an irrational number. Then the relation R is ______.
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive 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
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
Give an example of a map which is neither one-one nor onto
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 R be the relation on N defined as by x + 2 y = 8 The domain of R is ____________.
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?
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: B → B be defined by R = {(1,1),(1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, then R is ____________.
Find: `int (x + 1)/((x^2 + 1)x) dx`
In a group of 52 persons, 16 drink tea but not coffee, while 33 drink tea. How many persons drink coffee but not tea?
A relation 'R' in a set 'A' is called reflexive, if
If f(x + 2a) = f(x – 2a), then f(x) is:
Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.
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 ______.
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. |
Based on the above information, answer the following questions:
- How many relations are possible from B to G? (1)
- Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
- 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?
