Advertisements
Advertisements
प्रश्न
Give an example of a map which is one-one but not onto
Advertisements
उत्तर
Let f: N → N, be a mapping defined by f(x) = x2
For f(x1) = f (x2)
Then, `x_1^2 = x_2^2`
x1 = x2 ......(Since x1 + x2 = 0 is not possible)
Further ‘f’ is not onto, as for 1 ∈ N, there does not exist any x in N such that f(x) = 2x + 1.
APPEARS IN
संबंधित प्रश्न
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}.
Given an example of a relation. Which is reflexive and symmetric but not transitive.
Three relations R1, R2 and R3 are defined on a set A = {a, b, c} as follows:
R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}
R2 = {(a, a)}
R3 = {(b, c)}
R4 = {(a, b), (b, c), (c, a)}.
Find whether or not each of the relations R1, R2, R3, R4 on A is (i) reflexive (ii) symmetric and (iii) transitive.
Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:
R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
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?
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.
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 n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.
Let C be the set of all complex numbers and C0 be the set of all no-zero complex numbers. Let a relation R on C0 be defined as
`z_1 R z_2 ⇔ (z_1 -z_2)/(z_1 + z_2)` is real for all z1, z2 ∈ C0.
Show that R is an equivalence relation.
Write the identity relation on set A = {a, b, c}.
Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,
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 _______________ .
A relation ϕ from C to R is defined by x ϕ y ⇔ | x | = y. Which one is correct?
R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .
If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then R 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 _____________ .
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
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.
In the set of natural numbers N, define a relation R as follows: ∀ n, m ∈ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R
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 R be the smallest equivalence relation on A, then R = ______
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, symmetric and transitive
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.
The following defines a relation on N:
x + y = 10, 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 ____________.
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 A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?
Let A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B is ____________.
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
Given set A = {a, b, c}. An identity relation in set A is ____________.
Which one of the following relations on the set of real numbers R is an equivalence relation?
Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.
Let a set A = A1 ∪ A2 ∪ ... ∪ Ak, where Ai ∩ Aj = Φ for i ≠ j, 1 ≤ i, j ≤ k. Define the relation R from A to A by R = {(x, y): y ∈ Ai if and only if x ∈ Ai, 1 ≤ i ≤ k}. Then, R is ______.
Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
