Q. 235.0( 1 Vote )
Let A and B be two sets each with finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.
Answer :
Given A and B are two finite sets. There are injective maps from both A to B and B to A.
Let f be the injective map defined from A to B.
Thus, we have f is one-one.
We also know that there is a one-one mapping from B to A.
This means that each element of B is mapped to a distinct element of A.
But, B is the co-domain of f and A is the domain of f.
So, every element of the co-domain of the function f has a pre-image in the domain of the function f.
Thus, f is also onto.
Therefore, f is a bijection as it is both one-one and onto.
Hence, there exists a bijection defined from A to B.
Rate this question :






















Fill in the blanks in each of the
Let f :R → R be defined by. Then (f o f o f) (x) = _______
Let f : [2, ∞) → R be the function defined by f (x) = x2–4x+5, then the range of f is
Mathematics - ExemplarLet f : N → R be the function defined byand g : Q → R be another function defined by g (x) = x + 2. Then (g o f)3/2 is
Fill in the blanks in each of the
Let f = {(1, 2), (3, 5), (4, 1) and g = {(2, 3), (5, 1), (1, 3)}. Then g o f = ______and f o g = ______.
Mathematics - ExemplarLet f :R → R be defined by
Then f (– 1) + f (2) + f (4) is
Mathematics - ExemplarLet f : [0, 1] → [0, 1] be defined by
Then (f o f) x is
Mathematics - ExemplarWhich of the following functions from Z into Z are bijections?
Mathematics - Exemplar