Advertisements
Advertisements
Question
Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ________________ .
Options
neither reflexive nor transitive
neither symmetric nor transitive
transitive
none of these
Advertisements
Solution
transitive
Reflexivity : Since (1, 1) ∉ B, B is not reflexive on A.
Symmetry : Since (1, 2) ∈ B but (2, 1) ∉ B , B is not symmetric on A.
Transitivity : Since (1, 2)∈B, (2, 3)∈B and (1, 3)∈B, B is transitive on A.
APPEARS IN
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 N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.
Given an example of a relation. Which is symmetric but neither reflexive nor transitive.
Given an example of a relation. Which is transitive but neither reflexive nor symmetric.
Given an example of a relation. Which is reflexive and symmetric but not transitive.
Given a non-empty set X, consider P(X), which is the set of all subsets of X. Define the relation R in P(X) as follows:
For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.
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.
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 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.
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.
Let A = {0, 1, 2, 3} and R be a relation on A defined as
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R reflexive? symmetric? transitive?
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.
If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by 'x is greater than y'. The range of R is ______________ .
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .
In the set Z of all integers, which of the following relation R is not an equivalence relation ?
Mark the correct alternative in the following question:
Consider a non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then, R is _____________ .
Show that the relation R on R defined as R = {(a, b): a ≤ b}, is reflexive, and transitive but not symmetric.
If A = {a, b, c}, B = (x , y} find B × A.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).
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
Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive
Give an example of a map which is not one-one but onto
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 A = { 2, 3, 6 } Which of the following relations on A are reflexive?
Let A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B 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?
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 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}
- The above-defined relation R is ____________.
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 = {(x, y): y is divisible by x} is ____________.
A relation in a set 'A' is known as empty relation:-
Define the relation R in the set N × N as follows:
For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.
Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. 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. |
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)
